English
Related papers

Related papers: Decomposition numbers for finite Coxeter groups an…

200 papers

This paper contains the decomposition matrices for blocks of defect at most $2$ in Category $\mathcal{O}_c(W)$ of the rational Cherednik algebra when $W=E_8$ or $F_4$ with equal parameters $c=1/d$, $d>2$ a regular number of $W$. A corollary…

Representation Theory · Mathematics 2016-12-26 Emily Norton

One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…

Computer Vision and Pattern Recognition · Computer Science 2023-09-15 Claudio Turchetti

We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by…

Combinatorics · Mathematics 2015-03-03 Thomas Gobet , Nathan Williams

Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let $\mathbf{v} \in \mathbb{Q}^d$ be a rational vector, $(T_{1},…

Computational Complexity · Computer Science 2023-10-05 Cornelius Brand , Viktoriia Korchemna , Michael Skotnica , Kirill Simonov

In this paper we extend the computations in parts I and II of this series of papers and complete the proof of a conjecture of Lehrer and Solomon expressing the character of a finite Coxeter group W acting on the pth graded component of its…

Representation Theory · Mathematics 2014-11-18 Marcus Bishop , J. Matthew Douglass , Goetz Pfeiffer , Gerhard Roehrle

We study the decomposition matrices for the unipotent $\ell$-blocks of finite special unitary groups SU$_n(q)$ for unitary primes $\ell$ larger than $n$. Up to very few unknown entries, we give a complete solution for $n=2,\ldots,10$. We…

Representation Theory · Mathematics 2015-06-12 Olivier Dudas , Gunter Malle

Given a Coxeter group $W$ with Coxeter system $(W,S)$, where $S$ is finite. We provide a complete characterization of Boolean intervals in the weak order of $W$ uniformly for all Coxeter groups in terms of independent sets of the Coxeter…

Combinatorics · Mathematics 2024-03-14 Ben Adenbaum , Jennifer Elder , Pamela E. Harris , J. Carlos Martínez Mori

Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the…

Combinatorics · Mathematics 2013-06-18 T. Kyle Petersen

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…

Rings and Algebras · Mathematics 2023-08-04 Martin Kreuzer , Alexei Miasnikov , Florian Walsh

We consider the problem of low-rank decomposition of incomplete multiway tensors. Since many real-world data lie on an intrinsically low dimensional subspace, tensor low-rank decomposition with missing entries has applications in many data…

Numerical Analysis · Computer Science 2016-08-24 Linxiao Yang , Jun Fang , Hongbin Li , Bing Zeng

Given convex polytopes $P_1,...,P_r$ in $R^n$ and finite subsets $W_I$ of the Minkowsky sums $P_I=\sum_{i \in I} P_i$, we consider the quantity $N(W)=\sum_{I \subset {\bf [}r {\bf ]}} {(-1)}^{r-|I|} \big| W_I \big|$. We develop a technique…

Algebraic Geometry · Mathematics 2014-11-13 Frédéric Bihan

This thesis takes Brady's construction of $K(\pi,1)$s for the braid groups as a starting point. It is widely known that this construction can - with the right ingredients - be generalized to Artin groups of finite type. Results of Bessis as…

Group Theory · Mathematics 2018-10-08 Valentin Braun

Let W be a Coxeter group with Coxeter generators S. The rank of the Coxeter system (W,S) is the cardinality |S| of S. The Coxeter system (W,S) has finite rank if and only if W is finitely generated. If (W,S) has infinite rank, then |S| =…

Group Theory · Mathematics 2007-06-28 Michael L. Mihalik , John G. Ratcliffe

We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…

Combinatorics · Mathematics 2026-05-14 Nathan Reading

In a recent paper we claimed that both the group algebra of a finite Coxeter group $W$ as well as the Orlik-Solomon algebra of $W$ can be decomposed into a sum of induced one-dimensional representations of centralizers, one for each…

Representation Theory · Mathematics 2011-06-14 J. Matthew Douglass , Goetz Pfeiffer , Gerhard Roehrle

Let W be an infinite irreducible Coxeter group with (s_1, ..., s_n) the simple generators. We give a simple proof that the word s_1 s_2 ... s_n s_1 s_2 >... s_n ... s_1 s_2 ... s_n is reduced for any number of repetitions of s_1 s_2 >...…

Combinatorics · Mathematics 2007-10-18 David E Speyer

In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing…

Combinatorics · Mathematics 2026-05-13 Nathan Reading , David E Speyer

In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…

Combinatorics · Mathematics 2018-08-14 Victor Reiner , Bridget Eileen Tenner , Alexander Yong

We develop a framework to analyse invariant decompositions of elements of tensor product spaces. Namely, we define an invariant decomposition with indices arranged on a simplicial complex, and which is explicitly invariant under a group…

Combinatorics · Mathematics 2024-03-05 Gemma De las Cuevas , Matt Hoogsteder Riera , Tim Netzer

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…

Group Theory · Mathematics 2008-07-09 Cédric Bonnafé , Matthew J. Dyer