Related papers: Relative train tracks and generalized endperiodic …
We give a local treatment of finite alignment by identifying the finitely aligned part of any (not necessarily finitely aligned) higher-rank graph. We show the finitely aligned part is itself a constellation and forms a finitely aligned…
This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…
We introduce the notion of an interpolating path on the set of probability measures on finite graphs. Using this notion, we first prove a displacement convexity property of entropy along such a path and derive Prekopa-Leindler type…
A complete characterization of parabolic self-maps of finite shift is given in terms of their Herglotz's representation. This improves a previous result due to Contreras, D\'iaz-Madrigal, and Pommerenke. We also derive some consequences for…
Pedigree polytopes are extensions of the classical Symmetric Traveling Salesman Problem polytopes whose graphs (1-skeletons) contain the TSP polytope graphs as spanning subgraphs. While deciding adjacency of vertices in TSP polytopes is…
The Gelfand-Tsetlin graph is an infinite graded graph that encodes branching of irreducible characters of the unitary groups. The boundary of the Gelfand-Tsetlin graph has at least three incarnations --- as a discrete potential theory…
We propose an inverse approach for dealing with interval maps based on the manner whereby their branches are related (folding property), instead of addressing the map equations as a whole. As a main result, we provide a symmetry-breaking…
We show that any infinite ring has an infinite nonunital compressed commuting graph. We classify all infinite unital rings with finite unital compressed commuting graph, using semidirect product of rings as our main tool. As a consequence…
We study the notions of continuous orbit equivalence and eventual one-sided conjugacy of finitely-aligned higher-rank graphs and two-sided conjugacy of row-finite higher-rank graphs with finitely many vertices and no sinks or sources. We…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the…
In this paper we develop the metric theory for the outer space of a free product of groups. This generalizes the theory of the outer space of a free group, and includes its relative versions. The outer space of a free product is made of…
We prove that the group of homotopy classes of relative homotopy automorphisms of a simply connected finite CW-complex is finitely presented and that the rationalization map from this group to its rational analogue has a finite kernel.
One of the central results in the representation theory of distance-regular graphs classifies distance-regular graphs with $\mu\geq 2$ and second largest eigenvalue $\theta_1= b_1-1$. In this paper we give a classification under the…
Bestvina-Feighn-Handel show that for finitely many generic and independent hyperbolic automorphisms $\phi_1, \cdots, \phi_r$ of $F_n$, the resulting extension $F_n \rtimes F_r$ is hyperbolic. This paper generalizes the above statement to…
After Fossas-Parlier, we consider two graphs $\mathcal{G}_{0}(S)$ and $\mathcal{G}_{\infty}(S)$, constructed from multicurves on connected, orientable surfaces of infinite-type. Our first result asserts that $\mathcal{G}_{\infty}(S)$ has…
A finite graph $\G$ is said to be {\em $(G,3)$-$($connected$)$ homogeneous} if every isomorphism between any two isomorphic (connected) subgraphs of order at most $3$ extends to an automorphism $g\in G$ of the graph, where $G$ is a group of…
Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…
In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…
In this paper we give a new sufficient condition for asymptotic periodicity of Frobenius-Perron operator corresponding to two--dimensional maps. The result of the asymptotic periodicity for strictly expanding systems, that is, all…