English
Related papers

Related papers: Counting chains in the noncrossing partition latti…

200 papers

Two partial orders on a reflection group, the codimension order and the prefix order, are together called the absolute order when they agree. We show that in this case the absolute order on a complex reflection group has the strong Sperner…

Combinatorics · Mathematics 2020-11-03 Christian Gaetz , Yibo Gao

Let W be a complex reflection group. We prove that there is the maximal finite dimensional quotient of the Hecke algebra H_q(W) of W and that the dimension of this quotient coincides with |W|. This is a weak version of a…

Representation Theory · Mathematics 2016-01-20 Ivan Losev

We study the intersection lattice of the arrangement $\mathcal{A}^G$ of subspaces fixed by subgroups of a finite linear group $G$. When $G$ is a reflection group, this arrangement is precisely the hyperplane reflection arrangement of $G$.…

Combinatorics · Mathematics 2022-03-29 Ivan Martino , Rahul Singh

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…

Combinatorics · Mathematics 2026-03-13 Christophe Hohlweg , Viviane Pons

We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…

Combinatorics · Mathematics 2013-09-23 Victor Batyrev , Johannes Hofscheier

The Tamari lattices have been intensely studied since their introduction by Dov Tamari around 1960. However oddly enough, a formula for the number of maximal chains is still unknown. This is due largely to the fact that maximal chains in…

Combinatorics · Mathematics 2017-09-12 Luke Nelson

The notion of limit roots of a Coxeter group W was recently introduced (see arXiv:1112.5415 and arXiv:1303.6710): they are the accumulation points of directions of roots of a root system for W. In the case where the root system lives in a…

Group Theory · Mathematics 2019-10-25 Christophe Hohlweg , Jean-Philippe Préaux , Vivien Ripoll

We give a combinatorial model for the bounded derived category of graded modules over the dual numbers in terms of arcs on the integer line with a point at infinity. Using this model we describe the lattice of thick subcategories of the…

Representation Theory · Mathematics 2016-11-08 Sira Gratz , Greg Stevenson

Let $\rho\colon G\to \mathrm{GL}_n(K)$ be an continuous irreducible representation of a compact group over a complete discretely valued field $K$. Let $W_i,W_j$ be two irreducible subrepresentations of $\overline{\rho}^{ss}$, the…

Number Theory · Mathematics 2024-01-19 Amit Ophir , Ariel Weiss

Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…

Combinatorics · Mathematics 2020-09-09 Bridget Eileen Tenner

We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…

Number Theory · Mathematics 2007-07-08 Philippe Gaborit , Gilles Zemor

Here, for $W$ the Coxeter group $\mathrm{D}_n$ where $n > 4$, it is proved that the maximal rank of an abstract regular polytope for $W$ is $n - 1$ if $n$ is even and $n$ if $n$ is odd. Further it is shown that $W$ has abstract regular…

Group Theory · Mathematics 2026-02-27 Malcolm Hoong Wai Chen , Peter Rowley

A group of isometries of a hyperbolic $n$-space is called a reflection group if it is generated by reflections in hyperbolic hyperplanes. Vinberg gave a semi-algorithm for finding a maximal reflection sublattice in a given arithmetic…

Geometric Topology · Mathematics 2022-07-15 Mikhail Belolipetsky , Michael Kapovich

We refine the infinitesimal Hecke algebra associated to a 2-reflection group into a $\Z/2\Z$-graded Lie algebra, as a first step towards a global understanding of a natural $\mathbbm{N}$-graded object. We provide an interpretation of this…

Representation Theory · Mathematics 2012-12-07 Ivan Marin

Suppose that W is a finite, unitary, reflection group acting on the complex vector space V and X is a subspace of V. Define N to be the setwise stabilizer of X in W, Z to be the pointwise stabilizer, and C=N/Z. Then restriction defines a…

Representation Theory · Mathematics 2012-03-01 J. Matthew Douglass , Gerhard Roehrle

The classical No-Three-In-Line problem seeks the maximum number of points that may be selected from an $n\times n$ grid while avoiding a collinear triple. The maximum is well known to be linear in $n$. Following a question of Erde, we seek…

Combinatorics · Mathematics 2024-11-07 Dániel T. Nagy , Zoltán Lóránt Nagy , Russ Woodroofe

For $w$ in the symmetric group $S_n$, let $\widetilde C_w$ be the corresponding modified, signless Kazhdan--Lusztig basis element of the type-$A$ Hecke algebra $H_n(q)$. An extension [Ann. Comb. 25, no. 3 (2021) pp. 757--787] of a result of…

Combinatorics · Mathematics 2026-05-22 Tommy Parisi , Ben Spahiu , Mark Skandera , Jiayuan Wang

Chapoton has observed a simple product formula for the number of reflections in a finite Coxeter group that have full support. We give a uniform proof of his formula for Weyl groups. We furthermore refine his formula by the length of the…

Combinatorics · Mathematics 2017-01-31 Marko Thiel

Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…

Combinatorics · Mathematics 2007-05-23 Claus Mokler

Given a finite irreducible Coxeter group $W$ with a fixed Coxeter element $c$, we define the Coxeter pop-tsack torsing operator $\mathsf{Pop}_T:W\to W$ by $\mathsf{Pop}_T(w)=w\cdot\pi_T(w)^{-1}$, where $\pi_T(w)$ is the join in the…

Combinatorics · Mathematics 2021-06-11 Colin Defant , Nathan Williams
‹ Prev 1 4 5 6 7 8 10 Next ›