Related papers: Minimal determining sets for certain $W$-graph ide…

The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory and machine learning. In fact, the algorithms form a…

Let $G$ be a simple algebraic group of adjoint type over the field $\mathbb{C}$ of complex numbers, $B$ be a Borel subgroup of $G$ containing a maximal torus $T$ of $G.$ Let $w$ be an element of the Weyl group $W$ and $X(w)$ be the Schubert…

The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. A basic property of the critical ideals of graphs asserts that the graphs with at most k trivial critical ideals,…

We give a short proof of the following theorem of Sang-hyun Kim: if $A(\Gamma)$ is a right-angled Artin group with defining graph $\Gamma$, then $A(\Gamma)$ contains a hyperbolic surface subgroup if $\Gamma$ contains an induced subgraph…

For the flag variety G/B of a reductive algebraic group G we define a certain (set-theoretical) cross-section phi from G/B to G, which depends on a choice of reduced expression for the longest element in the Weyl group. This cross-section…

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…

A k-uniform linear cycle of length s is a cyclic list of k-sets A_1,..., A_s such that consecutive sets intersect in exactly one element and nonconsecutive sets are disjoint. For all k at least 5 and s at least 3 and sufficiently large n we…

We offer the following explanation of the statement of the Kuratowski graph planarity criterion and of 6/7 of the statement of the Robertson-Seymour-Thomas intrinsic linking criterion. Let us call a cell complex 'dichotomial' if to every…

In this article, we give a short algebraic proof that all closed intervals in a $\gamma$-Cambrian semilattice $\mathcal{C}_{\gamma}$ are trim for any Coxeter group $W$ and any Coxeter element $\gamma\in W$. This means that if such an…

We give an easy diagrammatical description of the parabolic Kazhdan-Lusztig polynomials for the Weyl group $W_n$ of type $D_n$ with parabolic subgroup of type $A_n$ and consequently an explicit counting formula for the dimension of the…

We introduce the notion of 321-avoiding permutations in the affine Weyl group $W$ of type $A_{n-1}$ by considering the group as a George group (in the sense of Eriksson and Eriksson). This enables us to generalize a result of Billey,…

We consider sufficient conditions for the existence of $k$-th powers of Hamiltonian cycles in $n$-vertex graphs $G$ with minimum degree $\mu n$ for arbitrarily small $\mu>0$. About 20 years ago Koml\'os, Sark\"ozy, and Szemer\'edi resolved…

Kazhdan-Lusztig ideals, a family of generalized determinantal ideals investigated in [Woo-Yong '08], provide an explicit choice of coordinates and equations encoding a neighbourhood of a torus-fixed point of a Schubert variety on a type A…

Let $S$ be a finite non-commutative semigroup. The commuting graph of $S$, denoted $\cg(S)$, is the graph whose vertices are the non-central elements of $S$ and whose edges are the sets $\{a,b\}$ of vertices such that $a\ne b$ and $ab=ba$.…

Let $\bH$ be the generic Iwahori--Hecke algebra associated with a finite Coxeter group $W$. Recently, we have shown that $\bH$ admits a natural cellular basis in the sense of Graham--Lehrer, provided that $W$ is a Weyl group and all…

We study divergence and thickness for general Coxeter groups $W$. We first characterise linear divergence, and show that if $W$ has superlinear divergence then its divergence is at least quadratic. We then formulate a computable…

We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…

Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. Then every non-unit $a \in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L (a)$ of…

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…

For all Artin groups, we characterise the girth (i.e. the length of a shortest cycle) of the defining graph algebraically, showing that it is an isomorphism invariant. Using this result, we prove that the Artin groups based on a cycle graph…