15 research outputs found
Combinatorics and geometry of finite and infinite squaregraphs
Squaregraphs were originally defined as finite plane graphs in which all
inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e.,
the vertices not incident with the outer face) have degrees larger than three.
The planar dual of a finite squaregraph is determined by a triangle-free chord
diagram of the unit disk, which could alternatively be viewed as a
triangle-free line arrangement in the hyperbolic plane. This representation
carries over to infinite plane graphs with finite vertex degrees in which the
balls are finite squaregraphs. Algebraically, finite squaregraphs are median
graphs for which the duals are finite circular split systems. Hence
squaregraphs are at the crosspoint of two dualities, an algebraic and a
geometric one, and thus lend themselves to several combinatorial
interpretations and structural characterizations. With these and the
5-colorability theorem for circle graphs at hand, we prove that every
squaregraph can be isometrically embedded into the Cartesian product of five
trees. This embedding result can also be extended to the infinite case without
reference to an embedding in the plane and without any cardinality restriction
when formulated for median graphs free of cubes and further finite
obstructions. Further, we exhibit a class of squaregraphs that can be embedded
into the product of three trees and we characterize those squaregraphs that are
embeddable into the product of just two trees. Finally, finite squaregraphs
enjoy a number of algorithmic features that do not extend to arbitrary median
graphs. For instance, we show that median-generating sets of finite
squaregraphs can be computed in polynomial time, whereas, not unexpectedly, the
corresponding problem for median graphs turns out to be NP-hard.Comment: 46 pages, 14 figure
The galaxy of Coxeter groups
In this paper we introduce the galaxy of Coxeter groups -- an infinite
dimensional, locally finite, ranked simplicial complex which captures
isomorphisms between Coxeter systems. In doing so, we would like to suggest a
new framework to study the isomorphism problem for Coxeter groups. We prove
some structural results about this space, provide a full characterization in
small ranks and propose many questions. In addition we survey known tools,
results and conjectures. Along the way we show profinite rigidity of triangle
Coxeter groups -- a result which is possibly of independent interest.Comment: 30 pages, 6 figures. v2: Incorporated referee's suggestions;
Corrected a mistake in the proof of Theorem 4.25 (formerly 4.24), improved
other proofs and text; Final version, to appear in the Journal of Algebr
International Congress of Mathematicians: 2022 July 6–14: Proceedings of the ICM 2022
Following the long and illustrious tradition of the International Congress of Mathematicians, these proceedings include contributions based on the invited talks that were presented at the Congress in 2022.
Published with the support of the International Mathematical Union and edited by Dmitry Beliaev and Stanislav Smirnov, these seven volumes present the most important developments in all fields of mathematics and its applications in the past four years. In particular, they include laudations and presentations of the 2022 Fields Medal winners and of the other prestigious prizes awarded at the Congress.
The proceedings of the International Congress of Mathematicians provide an authoritative documentation of contemporary research in all branches of mathematics, and are an indispensable part of every mathematical library