Related papers: Braid graphs in simply-laced triangle-free Coxeter…
This paper introduces a new class of right-angled Coxeter groups with totally disconnected Morse boundaries. We construct this class recursively by examining how the Morse boundary of a right-angled Coxeter group changes if we glue a graph…
The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater…
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…
An even hole is an induced chordless cycle of even length at least four. A diamond is an induced subgraph isomorphic to K_4-e. We show that graphs without even holes and without diamonds can be decomposed via clique-separators into graphs…
For each finite Coxeter group $W$ and each standard Coxeter element of $W$, we construct a triangulation of the $W$-permutahedron. For particular realizations of the $W$-permutahedron, we show that this is a regular triangulation induced by…
We study the connectivity of Morse boundaries of Coxeter groups. We define two conditions on the defining graph of a Coxeter group: wide-avoidant and wide-spherical-avoidant. We show that wide-spherical-avoidant, one-ended, affine-free…
Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…
We develop a sparse graph regularity method that applies to graphs with few 4-cycles, including new counting and removal lemmas for 5-cycles in such graphs. Some applications include: * Every $n$-vertex graph with no 5-cycle can be made…
Let $G$ be a graph, and $v\in V(G)$ and $S\subseteq V(G)\backslash v$ of size at least $k$. An important result on graph connectivity due to Perfect states that, if $v$ and $S$ are $k$-linked, then a $(k-1)$-link between a vertex $v$ and…
Let g be a symmetrizable Kac-Moody algebra and U_h(g) its quantized enveloping algebra. The quantum Weyl group operators of U_h(g) and the universal R-matrices of its Levi subalgebras endow U_h(g) with a natural quasi-Coxeter…
Quasi-isometry is a measure of how similar two graphs are at `large-scale'. Nguyen, Scott, and Seymour [arXiv:2501.09839] and Hickingbotham [arXiv:2501.10840] independently gave a characterisation of graphs quasi-isometric to graphs of…
Braided algebras are associative algebras endowed with a Yang-Baxter operator that satisfies certain compatibility conditions involving the multiplication. Along with Hochschild cohomology of algebras, there is also a notion of Yang-Baxter…
We present a construction called layered wheel. Layered wheels are graphs of arbitrarily large treewidth and girth. They might be an outcome for a possible theorem characterizing graphs with large treewidth in terms of their induced…
We investigate a novel diagrammatic approach to examining strict actions of a Coxeter group or a braid group on a category. This diagrammatic language, which was developed in a series of papers by Elias, Khovanov and Williamson, provides…
We present a way to associate an algebra $B_G (\Upsilon) $ with every pseudo reflection group $G$. When $G$ is a Coxeter group of simply-laced type we show $B_G (\Upsilon)$ is isomorphic to the generalized Brauer algebra of simply-laced…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
In Artin-Tits groups attached to Coxeter groups of spherical type, we give a combinatorial formula to express the simple elements of the dual braid monoids in the classical Artin generators. Every simple dual braid is obtained by lifting an…
An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…
An odd Coxeter group $W$ is one which admits a Coxeter system $(W,S)$ for which all the exponents $m_{ij}$ are either odd or infinity. The paper investigates the family of odd Coxeter groups whose associated labeled graphs…
We define new deformations of group algebras of Coxeter groups W and of subgroups of even elements in them, by deforming the braid relations. We show that these deformations are algebraically flat iff they are formally flat, and that this…