English
Related papers

Related papers: Constructing highly regular expanders from hyperbo…

200 papers

We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the spectral gap bound to study the structure of the…

Combinatorics · Mathematics 2021-07-28 Bohdan Kivva

A family of graphs $\mathcal{F}$ is hereditary if $\mathcal{F}$ is closed under isomorphism and taking induced subgraphs. The speed of $\mathcal{F}$ is the sequence $\{|\mathcal{F}^n|\}_{n \in \mathbb{N}}$, where $\mathcal{F}^n$ denotes the…

Combinatorics · Mathematics 2020-07-03 Sergey Norin , Yelena Yuditsky

This paper studies bounds in a strong form of regularity for $3$-uniform hypergraphs which was developed by Frankl, Gowers, Kohayakawa, Nagle, R\"{o}dl, Skokan, and Schacht. Regular decompositions of this type involve two structural…

Combinatorics · Mathematics 2025-08-05 C. Terry

This paper examines the spectral characterizations of oriented graphs. Let $\Sigma$ be an $n$-vertex oriented graph with skew-adjacency matrix $S$. Previous research mainly focused on self-converse oriented graphs, proposing arithmetic…

Combinatorics · Mathematics 2025-04-28 Limeng Lin , Wei Wang , Hao Zhang

A solution of the isomorphism problem is presented for the class of Coxeter groups W that have a finite set of Coxeter generators S such that the underlying graph of the presentation diagram of the system (W,S) has the property that every…

Group Theory · Mathematics 2007-05-23 John Ratcliffe , Steven Tschantz

For a tuple of square matrices $A_1,...,A_n$ the determinantal hypersurface is defined as \begin{eqnarray*} &\sigma(A_1,...,A_n)= \\ &\Big\{[x_1:\cdots :x_n]\in \C{\mathbb P}^{n-1}: det(x_1A_1+\cdots +x_nA_n)=0\Big \}. \end{eqnarray*} In…

Spectral Theory · Mathematics 2022-03-15 Michael Stessin

We give criteria for deciding whether or not a triangle-free simple graph is the presentation graph of a right-angled Coxeter group that is quasiisometric to some right-angled Artin group, and, if so, producing a presentation graph for such…

Group Theory · Mathematics 2025-06-23 Christopher H. Cashen , Pallavi Dani , Alexandra Edletzberger , Annette Karrer

Let D be a connected graph. The Dynkin complex CD(A) of a D-algebra A was introduced by the second author in [TL2] to control the deformations of quasi-Coxeter algebra structures on A. In the present paper, we study the cohomology of this…

Quantum Algebra · Mathematics 2009-11-17 R. Rouquier , V. Toledano-Laredo

We show that every Coxeter group that is not virtually abelian and for which all labels in the corresponding Coxeter graph are powers of 2 or infinity can be mapped onto uncountably many infinite 2-groups which, in addition, may be chosen…

Group Theory · Mathematics 2009-12-16 R. Grigorchuk

Let $M\circ N$ denote the Schur product of two matrices $M$ and $N$. A graph $X$ with adjacency matrix $A$ is walk regular if $A^k\circ I$ is a constant times $I$ for each $k\ge0$, and $X$ is 1-walk-regular if it is walk regular and…

Combinatorics · Mathematics 2025-01-28 Chris Godsil , Wanting Sun , Xiaohong Zhang

We consider the random right-angled Coxeter group $W_{\Gamma}$ whose presentation graph $\Gamma\sim \mathcal{G}_{n,p}$ is an Erd{\H o}s--R\'enyi random graph on $n$ vertices with edge probability $p=p(n)$. We establish that $p=1/\sqrt{n}$…

Group Theory · Mathematics 2025-09-25 Jason Behrstock , Recep Altar Ciceksiz , Victor Falgas-Ravry

We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…

Combinatorics · Mathematics 2024-11-05 Hugo Akitaya , Jean Cardinal , Stefan Felsner , Linda Kleist , Robert Lauff

We give a sufficient condition under which the fundamental group of a reglued graph of surfaces is hyperbolic. A reglued graph of surfaces is constructed by cutting a fixed graph of surfaces along the edge surfaces, then regluing by…

Group Theory · Mathematics 2014-10-01 Honglin Min

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

Combinatorics · Mathematics 2007-05-23 David Orden , Francisco Santos

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

Discrete Mathematics · Computer Science 2012-10-26 Vadim Levit , David Tankus

A Coxeter $n$-orbifold is an $n$-dimensional orbifold based on a polytope with silvered boundary facets. Each pair of adjacent facets meet on a ridge of some order $m$, whose neighborhood is locally modeled on ${\mathbb R}^n$ modulo the…

Geometric Topology · Mathematics 2015-08-12 Suhyoung Choi , Gye-Seon Lee

In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that,…

Combinatorics · Mathematics 2009-05-06 Kari Ragnarsson , Bridget Eileen Tenner

The present paper constructs unbounded quasimorphisms that are invariant under all automorphisms on free products of more than two factors and on graph products of finitely generated abelian groups. This includes many classes of right…

Group Theory · Mathematics 2021-08-24 Bastien Karlhofer

It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if $G=(V,E)$ is a $\Delta$-regular dense expander then there is an edge-induced subgraph $H=(V,E_H)$ of $G$ of constant maximum degree which is also…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-03-09 Luca Becchetti , Andrea Clementi , Emanuele Natale , Francesco Pasquale , Luca Trevisan

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

Combinatorics · Mathematics 2014-05-29 Jiří Fiala , Pavel Klavík , Jan Kratochvíl , Roman Nedela