Related papers: Cubulation of Bruhat graphs

Let $A$ be an Artin group. A partition $\mathcal{P}$ of the set of standard generators of $A$ is called admissible if, for all $X,Y \in \mathcal{P}$, $X \neq Y$, there is at most one pair $(s,t) \in X \times Y$ which has a relation. An…

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)=2$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a…

We study gaps in the spectra of the adjacency matrices of large finite cubic graphs. It is known that the gap intervals $(2 \sqrt{2},3)$ and $[-3,-2)$ achieved in cubic Ramanujan graphs and line graphs are maximal. We give constraints on…

We discuss a practical algorithm to compute parabolic Kazhdan-Lusztig polynomials. As an application we compute Kazhdan-Lusztig polynomials which are needed to evaluate a character formula for reductive groups due to Lusztig. Some…

We consider the algebraization problem for principal bundles with reductive structure group, defined on the complement of a closed subset Z in a proper formal scheme. We show that, when Z is of codimension at least 3, an algebraization…

Blundell, Buesing, Davies, Veli\v{c}kovi\'c, and Williamson (BBDVW) introduced the notion of a hypercube decomposition of an interval in Bruhat order. They conjectured a recursive formula in terms of this structure which, if shown for all…

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)\in\{2\}\cup 4\N$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd,…

In this article, we discuss the notion of partition of elements in an arbitrary Coxeter system $(W,S)$: a partition of an element $w$ is a subset $\mathcal P\subseteq W$ such that the left inversion set of $w$ is the disjoint union of the…

An element w of a Coxeter group W is said to be fully commutative, if any reduced expression of w can be obtained from any other by transposing adjacent pairs of generators. These elements were described in 1996 by Stembridge in the case of…

This paper considers the planar figure of a combinatorial polytope or tessellation identified by the Coxeter symbol $k_{i,j}$ , inscribed in a conic, satisfying the geometric constraint that each octahedral cell has a centre. This…

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…

We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…

We prove the conjecture of A. Postnikov that (A) the number of regions in the inversion hyperplane arrangement associated with a permutation $w\in \Sn$ is at most the number of elements below $w$ in the Bruhat order, and (B) that equality…

In 2011, Dyer published a series of conjectures on the weak order of Coxeter groups. One of these conjectures stated that the inversion set of the join of two elements in a Coxeter group is equal to some "closure" of the union of their…

For any finite Coxeter system $(W,S)$ we construct a certain noncommutative algebra, so-called {\it bracket algebra}, together with a familiy of commuting elements, so-called {\it Dunkl elements.} Dunkl elements conjecturally generate an…

We classify cocovers and covers of a given element of the double affine Weyl semigroup W with respect to the Bruhat order, specifically when W is associated to a finite root system that is irreducible and simply laced. We show two…

A hole in a graph is an induced cycle of length at least $4$. Let $s\ge2$ and $t\ge2$ be integers. A graph $G$ is $(s,t)$-splittable if $V(G)$ can be partitioned into two sets $S$ and $T$ such that $\chi(G[S ]) \ge s$ and $\chi(G[T ]) \ge…

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

A partially embedded graph (or PEG) is a triple (G,H,\H), where G is a graph, H is a subgraph of G, and \H is a planar embedding of H. We say that a PEG (G,H,\H) is planar if the graph G has a planar embedding that extends the embedding \H.…

For $W$ a Coxeter group, let $\mathcal{W} = \{ w \in W \;| \; w = xy \; \mbox{where} \; x, y \in W \; \mbox{and} \; x^2 = 1 = y^2 \}$. If $W$ is finite, then it is well known that $W = \mathcal{W}$. Suppose that $w \in \mathcal{W}$. Then…