Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAre Scattering Properties of Graphs Uniquely Connected to Their Shapes?
297
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The famous question of Mark Kac Can one hear the shape of a drum? addressing the unique connection between the shape of a planar region and the spectrum of the corresponding Laplace operator can be legitimately extended to scattering systems. In the modified version one asks whether the geometry of a vibrating system can be determined by scattering experiments. We present the first experimental approach to this problem in the case of microwave graphs (networks) simulating quantum graphs. Our experimental results strongly indicate a negative answer. To demonstrate this we consider scattering from a pair of isospectral microwave networks consisting of vertices connected by microwave coaxial cables and extended to scattering systems by connecting leads to infinity to form isoscattering networks. We show that the amplitudes and phases of the determinants of the scattering matrices of such networks are the same within the experimental uncertainties. Furthermore, we demonstrate that the scattering matrices of the networks are conjugated by the, so called, transplantation relation.
rate research
Read More
A cycle $C$ of length $k$ in graph $G$ is extendable if there is another cycle $C$ in $G$ with $V(C) subset V(C)$ and length $k+1$. A graph is cycle extendable if every non-Hamiltonian cycle is extendable. In 1990 Hendry conjectured that any Hamiltonian chordal graph (a Hamiltonian graph with no induced cycle of length greater than three) is cycle extendable, and this conjecture has been verified for Hamiltonian chordal graphs which are interval graphs, planar graphs, and split graphs. We prove that any 2-connected claw-free chordal graph is cycle extendable.
A matching $M$ in a graph $G$ is said to be uniquely restricted if there is no other matching in $G$ that matches the same set of vertices as $M$. We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted matching in an interval graph, thereby answering a question of Golumbic et al. (Uniquely restricted matchings, M. C. Golumbic, T. Hirst and M. Lewenstein, Algorithmica, 31:139--154, 2001). Our algorithm actually solves the more general problem of computing a maximum cardinality strong independent set in an interval nest digraph, which may be of independent interest. Further, we give linear-time algorithms for computing maximum cardinality uniquely restricted matchings in proper interval graphs and bipartite permutation graphs.
We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested.
We discuss the properties of eigenphases of S--matrices in random models simulating classically chaotic scattering. The energy dependence of the eigenphases is investigated and the corresponding velocity and curvature distributions are obtained both theoretically and numerically. A simple formula describing the velocity distribution (and hence the distribution of the Wigner time delay) is derived, which is capable to explain the algebraic tail of the time delay distribution observed recently in microwave experiments. A dependence of the eigenphases on other external parameters is also discussed. We show that in the semiclassical limit (large number of channels) the curvature distribution of $S$--matrix eigenphases is the same as that corresponding to the curvature distribution of the underlying Hamiltonian and is given by the generalized Cauchy distribution.
Using high resolution DM simulations we study the shape of dark matter halos. Halos become more spherical with decreasing mass. This trend is even more pronounced for the inner part of the halo. Angular momentum and shape are correlated. The angular momenta of neighboring halos are correlated.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
