Related papers: Constructing highly regular expanders from hyperbo…

This paper provides an iterative procedure for constructing hyperbolic Coxeter groups that virtually fiber over $\mathbb{Z}$ that is flexible enough to yield infinitely many isomorphism classes in each virtual cohomological dimension (vcd)…

Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…

Much is known about random right-angled Coxeter groups (i.e., right-angled Coxeter groups whose defining graphs are random graphs under the Erd\"os-R\'enyi model). In this paper, we extend this model to study random general Coxeter groups…

Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…

We prove that the mapping class group of a sphere with five punctures admits uncountably many coarsely equivariant coarse median structures. The same is shown for right-angled Artin groups whose defining graphs are connected, triangle- and…

We introduce a concept of a W-graph ideal in a Coxeter group. The main goal of this paper is to describe how to construct a W-graph from a given W-graph ideal. The principal application of this idea is in type A, where it provides an…

Huang proved that every set of more than half the vertices of the $d$-dimensional hypercube $Q_d$ induces a subgraph of maximum degree at least $\sqrt{d}$, which is tight by a result of Chung, F\"uredi, Graham, and Seymour. Huang asked…

The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…

For a Coxeter group $W$ with length function $\ell$, the excess zero graph $\mathcal{E}_0(W)$ has vertex set the non-identity involutions of $W$, with two involutions $x$ and $y$ adjacent whenever $\ell(xy)=\ell(x)+\ell(y)$. Properties of…

Let $Q^+(2n+1,q)$ be a hyperbolic quadric of $\PG(2n+1,q)$. Fix a generator $\Pi$ of the quadric. Define $\cG_n$ as the graph with vertex set the points of $Q^+(2n+1,q)\setminus \Pi$ and two vertices adjacent if they either span a secant to…

We develop combinatorics of parabolic double cosets in finite Coxeter groups as a follow-up of recent articles by Billey-Konvalinka-Petersen-Slofstra-Tenner and Petersen. (1) We construct a double coset system as a generalization of a…

We present a new construction of high dimensional expanders based on covering spaces of simplicial complexes. High dimensional expanders (HDXs) are hypergraph analogues of expander graphs. They have many uses in theoretical computer…

The principal objects studied in this note are Coxeter groups $W$ that are neither finite nor affine. A well known result of de la Harpe asserts that such groups have exponential growth. We consider quotients of $W$ by its parabolic…

We introduce the concept of hyperreflection groups, which are a generalization of Coxeter groups. We prove the Deletion and Exchange Conditions for hyperreflection groups, and we discuss special subgroups and fundamental sectors of…

The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, $\mathbb{F}_2$. In this paper, we study Cheeger-type…

As an application of Szemeredi's regularity lemma, Erdos-Frankl-Rodl (1986) showed that the number of graphs on vertex set {1,2,...n} with a monotone class P is $2^{(1+o(1))ex(n,P)n^2/2}$ where $ex(n,P)$ is the maximum number of edges of an…

Let $\Gamma$ be a connected, triangle-free, planar graph with at least five vertices that has no separating vertices or edges. If the graph $\Gamma$ is $\mathcal{CFS}$, we prove that the right-angled Coxeter group $G_\Gamma$ is virtually a…

We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…

We attach to every Coxeter system (W,S) an extension C_W of the corresponding Iwahori-Hecke algebra. We construct a 1-parameter family of (generically surjective) morphisms from the group algebra of the corresponding Artin group onto C_W.…

The hyper-star graph $HS(n,k)$ is defined as follows : its vertex-set is the set of $ {0,1} $-sequences of length $n$ with weight $k$, where the weight of a sequence $v$ is the number of $1^,s$ in $v$, and two vertices are adjacent if and…