English
Related papers

Related papers: Permuted composition tableaux, 0-Hecke algebra and…

200 papers

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou , Anders Claesson , Mark Dukes , Sergey Kitaev

Let $\mathfrak{g}$ be a vector space and $[,],[,]'$ be a pair of Lie brackets on $\mathfrak{g}$. By definition they are compatible if $[,]+[,]'$ is again a Lie bracket. Such pairs play important role in bihamiltonian and $r$-matrix…

Differential Geometry · Mathematics 2012-08-09 Andriy Panasyuk

The Menichetti-Kaplansky theorem states that a finite semifield that is three-dimensional over its center is either a field or a twisted field of Albert. This implies that a quadratic homogeneous bijection of $\mathbb{P}^2(\mathbb{F}_q)$ is…

Combinatorics · Mathematics 2026-05-15 Faruk Göloğlu , Lukas Kölsch

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

Combinatorics · Mathematics 2018-10-08 Mark Dukes , Thomas Selig , Jason P. Smith , Einar Steingrimsson

A 0-Hecke algebra is a deformation of the group algebra of a Coxeter group. Based on work of Norton and Krob--Thibon, we introduce a tableau approach to the representation theory of 0-Hecke algebras of type A, which resembles the classic…

Representation Theory · Mathematics 2016-03-03 Jia Huang

We show that combinatorial objects called row-strict composition tableaux, introduced by Mason and Remmel in 2014 and closely related to the quasi-symmetric Schur functions of Haglund-Luoto-Mason-van Willigenburg, form a basis for Schur…

Combinatorics · Mathematics 2021-01-13 Shubhankar Sahai

Let $W$ be an affine Weyl group, and let $\Bbbk$ be a field of characteristic $p>0$. The diagrammatic Hecke category $\mathcal{D}$ for $W$ over $\Bbbk$ is a categorification of the Hecke algebra for $W$ with rich connections to modular…

Representation Theory · Mathematics 2025-02-10 Amit Hazi

Standard tableaux of skew shape are fundamental objects in enumerative and algebraic combinatorics and no product formula for the number is known. In 2014, Naruse gave a formula (NHLF) as a positive sum over excited diagrams of products of…

Combinatorics · Mathematics 2023-11-16 Alejandro H. Morales , Greta Panova , GaYee Park

We define and study the Plancherel-Hecke probability measure on Young diagrams; the Hecke algorithm of [Buch-Kresch-Shimozono-Tamvakis-Yong '06] is interpreted as a polynomial-time exact sampling algorithm for this measure. Using the…

Combinatorics · Mathematics 2011-10-19 Hugh Thomas , Alexander Yong

Let W be a finite Coxeter group. We define its Hecke-group algebra by gluing together appropriately its group algebra and its 0-Hecke algebra. We describe in detail this algebra (dimension, several bases, conjectural presentation,…

Representation Theory · Mathematics 2008-11-20 Florent Hivert , Nicolas M. Thiéry

Hemi-implicative semilattices (lattices), originally defined under the name of weak implicative semilattices (lattices), were introduced by the second author of the present paper. A hemi-implicative semilattice is an algebra…

Logic · Mathematics 2017-09-01 Ramon Jansana , Hernán Javier San Martín

We introduce a general method for constructing modules for $0$-Hecke algebras and supermodules for $0$-Hecke-Clifford algebras from diagrams of boxes in the plane, and give formulas for the images of these modules in the algebras of…

Representation Theory · Mathematics 2022-02-25 Dominic Searles

Bergeron, Bousquet-Melou and Dulucq enumerated paths in the Hasse diagram of the following poset: the underlying set is that of all compositions, and a composition \mu covers another composition \lambda if \mu can be obtained from \lambda…

Combinatorics · Mathematics 2007-05-23 Jan Snellman

We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym$(n)$. In particular, we compute orbits of ordered pairs on Sym$(n)$ acted upon by conjugation…

Combinatorics · Mathematics 2013-11-08 Mathieu Bogaerts , Peter Dukes

We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…

Combinatorics · Mathematics 2023-09-26 Peter M. Higgins

We study orbifolds by permutations of two identical N=2 minimal models within the Gepner construction of four dimensional heterotic strings. This is done using the new N=2 supersymmetric permutation orbifold building blocks we have recently…

High Energy Physics - Theory · Physics 2011-08-03 M. Maio , A. N. Schellekens

We recast the classical notion of standard tableaux in an alcove-geometric setting and extend these classical ideas to all reduced paths in our geometry. This broader path-perspective is essential for implementing the higher categorical…

Representation Theory · Mathematics 2021-05-28 C. Bowman , A. Cox , A. Hazi , D. Michailidis

In the previous paper, we defined a new category which categorifies the Hecke algebra. This is a generalization of the theory of Soergel bimodules. To prove theorems, the existences of certain homomorphisms between Bott-Samelson bimodules…

Representation Theory · Mathematics 2021-07-28 Noriyuki Abe

In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…

Combinatorics · Mathematics 2016-05-11 Pawel Hitczenko , Amanda Lohss

Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…

Combinatorics · Mathematics 2018-07-12 Michael Wallner