English
Related papers

Related papers: Visual boundaries of Diestel-Leader graphs

200 papers

Linear and projective boundaries of Cayley graphs were introduced in~\cite{kst} as quasi-isometry invariant boundaries of finitely generated groups. They consist of forward orbits $g^\infty=\{g^i: i\in \mathbb N\}$, or orbits…

Group Theory · Mathematics 2014-08-27 Bernhard Krön , Jörg Lehnert , Maya Stein

We show that the asymptotic dimension of a hyperbolic relatively hyperbolic graph is finite provided that this holds true uniformly for the peripheral subgraphs and for the electrifiation. We use this to show that the asymptotic dimension…

Geometric Topology · Mathematics 2019-03-20 Ursula Hamenstaedt

Roughly speaking, lamplighter graphs encode the possible configurations of a lamplighter that moves along a given graph and that modifies the colours of lamps at vertices. This article is dedicated to the following delicate question: when…

Group Theory · Mathematics 2025-09-24 Anthony Genevois

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

Differential Geometry · Mathematics 2016-03-22 Roberto Frigerio , Jean-Francois Lafont , Alessandro Sisto

We prove the existence of an unbounded connected branch of nontrivial homoclinic trajectories of a family of discrete nonautonomous asymptotically hyperbolic systems parametrized by a circle under assumptions involving the topological…

Dynamical Systems · Mathematics 2012-09-10 Jacobo Pejsachowicz , Robert Skiba

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

Combinatorics · Mathematics 2012-03-06 Soumya Bhoumik , Edward Dobson , Joy Morris

We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In…

Combinatorics · Mathematics 2013-06-10 Mikhail Isaev

The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…

Combinatorics · Mathematics 2022-03-25 Xueyi Huang , Kinkar Chandra Das , Lu Lu

We show that any group that is hyperbolic relative to virtually nilpotent subgroups, and does not admit peripheral splittings, contains a quasi-isometrically embedded copy of the hyperbolic plane. In natural situations, the specific…

Group Theory · Mathematics 2020-11-09 John M. Mackay , Alessandro Sisto

We explore positivity properties of the semigroup generated by the negative of the Dirichlet-to-Neumann operator with real potential $\lambda$, defined on a subset of the vertices of a quantum graph. We show that for rationally independent…

Spectral Theory · Mathematics 2025-02-25 Daniel Daners , Jochen Glück , James B. Kennedy

On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…

Spectral Theory · Mathematics 2021-04-02 Amru Hussein

We continue to study Cayley configuration spaces of 1-dof linkages in 2D begun in Part I of this paper, i.e. the set of attainable lengths for a non-edge. In Part II, we focus on the algebraic complexity of describing endpoints of the…

Computational Geometry · Computer Science 2015-03-19 Meera Sitharam , Menghan Wang , Heping Gao

In this paper the asymptotic behavior of trajectories of discontinuous vector fields is studied. The vector fields are defined on a two-dimensional Riemannian manifold $M$ and the confinement of trajectories on some suitable compact set $K$…

Dynamical Systems · Mathematics 2020-12-29 Rodrigo D. Euzébio , Joaby S. Jucá

We investigate the high-energy eigenvalue asymptotics quantum graphs consisting of the vertices and edges of the five Platonic solids considering two different types of the vertex coupling. One is the standard $\delta$-condition, the other…

Spectral Theory · Mathematics 2020-01-29 Pavel Exner , Jiri Lipovsky

A seminal result in geometric group theory is that a 1-ended hyperbolic group has a locally connected visual boundary. As a consequence, a 1-ended hyperbolic group also has a path connected visual boundary. In this paper, we study when this…

Group Theory · Mathematics 2019-10-18 Michael Ben-Zvi

We build an example of a non-transitive, dynamically coherent partially hyperbolic diffeomorphism $f$ on a closed $3$-manifold with exponential growth in its fundamental group such that $f^n$ is not isotopic to the identity for all $n\neq…

Dynamical Systems · Mathematics 2015-11-25 Christian Bonatti , Kamlesh Parwani , Rafael Potrie

We define and develop the notion of a discretisable quasi-action. It is shown that a cobounded quasi-action on a proper non-elementary hyperbolic space $X$ not fixing a point of $\partial X$ is quasi-conjugate to an isometric action on…

Group Theory · Mathematics 2022-07-18 Alex Margolis

We show that nontrivial homoclinic trajectories of a family of discrete, nonautonomous, asymptotically hyperbolic systems parametrized by a circle bifurcate from a stationary solution if the asymptotic stable bundles Es(+{\infty}) and…

Dynamical Systems · Mathematics 2012-01-31 Jacobo Pejsachowicz , Robert Skiba

Croke and Kleiner constructed two homeomorphic locally CAT(0) complexes whose universal covers have visual boundaries that are not homeomorphic. We construct two homeomorphic locally CAT(0) complexes so that the visual boundary of one…

Geometric Topology · Mathematics 2018-07-09 Kevin Schreve , Emily Stark

The simple graphs $G=(V,E)$ that satisfy $|E'|\leq 2|V'|-l$ for any subgraph (and for $l=1,2,3$) are the $(2,l)$-sparse graphs. Those that also satisfy $|E|=2|V|-l$ are the $(2,l)$-tight graphs. These can be characterised by their…

Combinatorics · Mathematics 2012-10-17 Anthony Nixon , John Owen