English
Related papers

Related papers: Stack-Sorting for Coxeter Groups

200 papers

Staple-shaped Wilson line operators are necessary for the study of transverse momentum-dependent parton distribution functions (TMDPDFs) in lattice QCD and beyond. In this work, we study the renormalization of such operators in the general…

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…

Representation Theory · Mathematics 2011-08-08 Rafael Stekolshchik

Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…

Data Structures and Algorithms · Computer Science 2007-07-12 Constantinos Daskalakis , Richard M. Karp , Elchanan Mossel , Samantha Riesenfeld , Elad Verbin

In this paper, we compute the posets of wide subcategories and ICE-closed subcategories from the lattice of torsion classes in an abelian length category in a purely lattice-theoretical way, by using the kappa map in a completely…

Representation Theory · Mathematics 2022-01-04 Haruhisa Enomoto

We investigate the asymptotic behavior of a stochastic version of the forward-backward splitting algorithm for finding a zero of the sum of a maximally monotone set-valued operator and a cocoercive operator in Hilbert spaces. Our general…

Optimization and Control · Mathematics 2015-07-28 Patrick L. Combettes , Jean-Christophe Pesquet

We prove universal (case-free) formulas for the weighted enumeration of factorizations of Coxeter elements into products of reflections valid in any well-generated reflection group $W$, in terms of the spectrum of an associated operator,…

Combinatorics · Mathematics 2023-06-14 Guillaume Chapuy , Theo Douvropoulos

We provide a complete description of the presentations of the interval groups related to quasi-Coxeter elements in finite Coxeter groups. In the simply laced cases, we show that each interval group is the quotient of the Artin group…

Group Theory · Mathematics 2022-11-28 Barbara Baumeister , Derek F. Holt , Georges Neaime , Sarah Rees

For a given $w$ in a Coxeter group $W$ the elements $u$ smaller than $w$ in Bruhat order can be seen as the end-alcoves of stammering galleries of type $w$ in the Coxeter complex $\Sigma$. We generalize this notion and consider sets of…

Combinatorics · Mathematics 2020-03-23 Marius Graeber , Petra Schwer

We show that the congruence lattice of a semilattice satsifies a form of distributivity relative to principal congruences of the form $ \Theta_{t \odot s, s}$. Particularly, we establish that semilattice congruences obey the ``pairwise…

Rings and Algebras · Mathematics 2025-11-04 Fernando Martin-Maroto , Antonio Ricciardo , Gonzalo G. de Polavieja

Given a finite irreducible Coxeter group $W$, a positive integer $d$, and types $T_1,T_2,...,T_d$ (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions $c=\si_1\si_2 cdots\si_d$ of a Coxeter…

Combinatorics · Mathematics 2010-01-18 Christian Krattenthaler , Thomas Müller

Using the relative de Rham stack for a family $X \to S$ in characteristic $p,$ we reprove the (local and global) Ogus-Vologodsky equivalence. Moreover, we observe that a lift of $S$ is not necessary. Instead, we use a lift of $X$ to the…

Algebraic Geometry · Mathematics 2026-04-07 Gleb Terentiuk

When $W$ is a finite Coxeter group acting by its reflection representation on $E$, we describe the category ${\mathsf{Perv}}_W(E_{\mathbb C}, {\mathcal{H}}_{\mathbb C})$ of $W$-equivariant perverse sheaves on $E_{\mathbb C}$, smooth with…

Representation Theory · Mathematics 2023-06-22 Martin H. Weissman

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

Data Structures and Algorithms · Computer Science 2023-04-11 Prateek Bhakta , Ben Cousins , Matthew Fahrbach , Dana Randall

If $(W,S)$ is a right-angled Coxeter system and $W$ has no $\mathbb Z^3$ subgroups, then it is shown that the absence of an elementary separation property in the presentation diagram for $(W,S)$ implies all CAT(0) spaces acted on…

Group Theory · Mathematics 2012-06-25 Wes Camp , Michael Mihalik

For a Coxeter system $(W,S)$ let $a_n^{(W,S)}$ be the cardinality of the sphere of radius $n$ in the Cayley graph of $W$ with respect to the standard generating set $S$. It is shown that, if $(W,S)\preceq(W',S')$ then $a_n^{(W,S)}\leq…

Group Theory · Mathematics 2018-11-28 T. Terragni

For a Coxeter group $W$ we have an associating bi-linear form $B$ on a real vector space. We assume that $B$ has the signature $(n-1,1)$. In this case we have the Cannon-Thurston map for $W$, that is, a $W$-equivariant continuous surjection…

Geometric Topology · Mathematics 2014-04-04 Ryosuke Mineyama

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

For an $n$-tuple $s$ of non-negative integers, the $s$-weak order is a lattice structure on $s$-trees, generalizing the weak order on permutations. We first describe the join irreducible elements, the canonical join representations, and the…

Combinatorics · Mathematics 2025-12-08 Eva Philippe , Vincent Pilaud

The classical fiber product in algebraic geometry provides a powerful tool for studying loci where two morphisms to a base scheme, $\phi: X \to S$ and $\psi: Y \to S$, coincide exactly. This condition of strict equality, however, is…

Algebraic Geometry · Mathematics 2025-11-03 Dongfang Zhao

For a Coxeter group (W,S), a permutation of the set S is called a Coxeter word and the group element represented by the product is called a Coxeter element. Moving the first letter to the end of the word is called a rotation and two Coxeter…

Combinatorics · Mathematics 2013-02-13 Henrik Eriksson , Kimmo Eriksson
‹ Prev 1 8 9 10 Next ›