Related papers: A Reduction theorem for the $W$-graph decompositio…

A diagram obtained from the Carter diagram $\Gamma$ by adding one root together with its bonds such that the resulting subset of roots is linearly independent is said to be the {\it linkage diagram}. Given a linkage diagram, we associate…

Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph $G$ into node-disjoint subgraphs, where each subgraph has sufficiently large…

A famous conjecture of Chowla on the least primes in arithmetic progressions implies that the abscissa of convergence of the Weil representation zeta function for a procyclic group $G$ only depends on the set $S$ of primes dividing the…

We obtain the equivariant K-homology of the classifying space \underline{E}W for W a right-angled or, more generally, an even Coxeter group. The key result is a formula for the relative Bredon homology of \underline{E}W in terms of Coxeter…

The Gamma-Theta Conjecture states that if the domination number of a graph is equal to its eternal domination number, then it is also equal to its clique covering number. This conjecture is known to be true for several graph classes, such…

If $A$ is a subset of the set of reflections of a finite Coxeter group $W$, we define a sub-${\mathbb{Z}}$-module ${\mathcal{D}}_A(W)$ of the group algebra ${\mathbb{Z}} W$. We provide examples where this submodule is a subalgebra. This…

Let W be an associative PI-affine algebra over a field F of characteristic zero. Suppose W is G-graded where G is a finite group. Let exp(W) and exp(W_e) denote the codimension growth of W and of the identity component W_e, respectively. We…

A graph $G$ is $(a,b)$-sparse if every nonempty subgraph $H$ satisfies $e(H) \leq a v(H) - b$. We are interested in the conditions under which an $(a,b)$-sparse graph can be partitioned $E(G) = E(G_1) \cup E(G_2)$ such that for $i \in…

The Galois Alperin weight (GAW) conjecture has been reduced to the inductive GAW condition for simple groups. We proceed in two steps to refine this reduction. First, we propose the blockwise Galois Alperin weight (BGAW) conjecture and…

We prove a decomposition theorem for graphs that do not contain a subdivision of $K_4$ as an induced subgraph where $K_4$ is the complete graph on four vertices. We obtain also a structure theorem for the class $\cal C$ of graphs that…

In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let $\Gamma$ and $\Gamma'$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\Gamma) \rightarrow V(\Gamma')$ and…

The purpose of this paper is to discuss the validity of the assumptions (W) and (S) stated in a previous work, about the torsion in the modular l-adic cohomology of Deligne-Lusztig varieties associated to Coxeter elements. We prove that…

In this paper we formulate and prove a combinatorial version of the section conjecture for finite groups acting on finite graphs. We apply this result to the study of rational points and show that finite descent is the only obstruction to…

Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…

We prove that even Coxeter groups, whose Coxeter diagrams contain no (4,4,2) triangles, are conjugacy separable. In particular, this applies to all right-angled Coxeter groups or word hyperbolic even Coxeter groups. For an arbitrary Coxeter…

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…

In this paper, we study the twist-conjecture for Coxeter systems and rigidity of Coxeter systems up to finite twists. For Coxeter systems $(W,R)$ and $(W,S)$, under the untangle-condition for conjugate subsets, we investigate separations…

Let $(W,S)$ be a Coxeter system, let $S=I \dot{\cup} J$ be a partition of $S$ such that no element of $I$ is conjugate to an element of $J$, let $\widetilde{J}$ be the set of $W_I$-conjugates of elements of $J$ and let $\widetilde{W}$ be…

Let W be a Coxeter group. In this paper, we establish that, up to going to some finite index normal subgroup W_0 of W, any two cyclically reduced expressions of conjugate elements of W_0 only differ by a sequence of braid relations and…

A copy of a graph $F$ is called an $F$-copy. For any graph $G$, the $F$-isolation number of $G$, denoted by $\iota(G,F)$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbourhood $N[D]$ of $D$ in $G$…