相关论文: A Combination Theorem for Strong Relative Hyperbol…
We construct a strongly bolic metric for a certain class of relatively hyperbolic groups, which includes those with CAT(0) parabolics and virtually abelian parabolics. If we further assume that the parabolics satisfy (RD), applying a…
Flexible grid topology has become a key enabler of flexibility in modern power grids, particularly for congestion management. Studying the effects of combinatorial topological changes is therefore of significant interest, though it remains…
We algebraically characterize free by cyclic groups that have coarse medians, and prove that this is equivalent to the a priori stronger properties of being colourable hierarchically hyperbolic groups and being quasi-isometric to CAT(0)…
Baker and Bowler defined a category of algebraic objects called tracts which generalize both partial fields and hyperfields. They also defined a notion of weak and strong matroids over a tract $F$, and proved that if $F$ is perfect, meaning…
We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…
In this paper we prove that whenever $G$ is hyperbolic relative to a family of exact, ressidually finite subgroups $\{H_1, \ldots, H_n\}$, the corresponding von Neumann algebra $\mathcal L(G)$ is solid relative to the family of subalgebras…
We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…
We present a new proof of the Joints Theorem without taking derivatives. Then we generalize the proof to prove the Multijoints Conjecture and Carbery's generalization. All results are in any dimension over an arbitrary field.
We show that in general for a given group the structure of a maximal hyperbolic tower over a free group is not canonical: We construct examples of groups having hyperbolic tower structures over free subgroups which have arbitrarily large…
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…
We examine a graph $\Gamma$ encoding the intersection of hyperplane carriers in a CAT(0) cube complex $\widetilde X$. The main result is that $\Gamma$ is quasi-isometric to a tree. This implies that a group $G$ acting properly and…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
Konig's theorem states that the covering number and the matching number of a bipartite graph are equal. We prove a generalisation of this result, in which each point in one side of the graph is replaced by a subtree of a given tree. The…
Motivated by work of Dolgopyat and N\'andori, we establish a general method for upgrading limit theorems for Birkhoff sums and cocycles over dynamical systems to mixing limit theorems under mild ergodicity and hyperbolicity assumptions.…
Trees fill many extremal roles in graph theory, being minimally connected and serving a critical role in the definition of $n$-good graphs. In this article, we consider the generalization of trees to the setting of $r$-uniform hypergraphs…
We study the hyperbolicity of singular quotients of bounded symmetric domains. We give effective criteria for such quotients to satisfy Green-Griffiths-Lang's conjectures in both analytic and algebraic settings. As an application, we show…
In this paper, we give an explicit construction of simultaneously hyperbolic elements in a group acting on finitely many Gromov-hyperbolic spaces under the weakest conditions. This essentially generalizes results of Clay-Uyanik in…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…