English
Related papers

Related papers: The Absolute Orders on the Coxeter Groups $A_n$ an…

200 papers

An $(n,k)$-Sperner partition system is a collection of partitions of some $n$-set, each into $k$ nonempty classes, such that no class of any partition is a subset of a class of any other. The maximum number of partitions in an…

Combinatorics · Mathematics 2020-11-13 Yanxun Chang , Charles J. Colbourn , Adam Gowty , Daniel Horsley , Junling Zhou

In the combinatorial study of the coefficients of a bivariate polynomial that generalizes both the length and the reflection length generating functions for finite Coxeter groups, Petersen introduced a new Mahonian statistic $sor$, called…

Combinatorics · Mathematics 2012-06-05 William Y. C. Chen , George Z. Gong , Jeremy J. F. Guo

A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…

Combinatorics · Mathematics 2018-02-19 Ian T. Johnson

We consider the Izergin-Korepin determinant [1] together with another determinant which was invented by Kuperberg [2]. He used these determinants to prove a formula for the total number of half-turn symmetric alternating sign matrices of…

Mathematical Physics · Physics 2007-05-23 Yu. G. Stroganov

A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…

Number Theory · Mathematics 2025-10-27 Ken Ono

Let $G$ be a finite group and $N$ a proper, nontrivial, normal subgroup of $G$. If, for every element $x$ of $G$ not lying in $N$, the elements in the coset $xN$ all have the same order as $x$, then we say that $(G,N)$ is an {\it{equal…

Group Theory · Mathematics 2025-04-16 Alan R. Camina , Rachel D. Camina , Mark L. Lewis , Emanuele Pacifici , Lucia Sanus , Marco Vergani

The Coxeter groups that act geometrically on euclidean space have long been classified and presentations for the irreducible ones are encoded in the well-known extended Dynkin diagrams. The corresponding Artin groups are called euclidean…

Group Theory · Mathematics 2013-12-31 Jon McCammond

Various partial orders related to the structures of dual canonical monoids are investigated. It is shown that the nilpotent variety of a dual canonical monoid is equidimensional; its dimension is found. It is shown in type A that certain…

Combinatorics · Mathematics 2022-07-22 Mahir Bilen Can

Building upon the previous Renner-Coxeter system of work by Eddy Godelle we introduce the familiar Renner monoid structure of the Adherence order. The Green's relations of the system are then considered in relation to the Adherence order…

Algebraic Geometry · Mathematics 2016-10-18 Allen O'Hara

Coxeter polynomials are important homological invariants that are defined for a large class of finite-dimensional algebras. It is of particular interest to develop methods to compute these polynomials. We define the notion of insertion of a…

Representation Theory · Mathematics 2024-12-10 Sefi Ladkani

Let $L(m,n)$ denote Young's lattice, consisting of all partitions whose Young diagrams are contained within an $m\times n$ rectangle. It is a classical result that the partially ordered set $L(m,n)$ is rank-symmetric, rank-unimodal, and…

Combinatorics · Mathematics 2026-05-12 Guoce Xin , Yueming Zhong

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

Combinatorics · Mathematics 2026-02-24 Simone Costa , Stefano Della Fiore

Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any…

Discrete Mathematics · Computer Science 2012-01-05 Mathilde Bouvel , Cedric Chauve , Marni Mishna , Dominique Rossin

We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its M\"obius function. We show that the weak order on Coxeter groups of type A, B, affine A, and the flag weak order…

Combinatorics · Mathematics 2015-10-23 François Viard

The limit weak order on an affine Weyl group was introduced by Lam and Pylyavskyy in their study of total positivity for loop groups. They showed that in the case of the affine symmetric group the minimal elements of this poset coincide…

Combinatorics · Mathematics 2022-11-02 Christian Gaetz , Yibo Gao

An element of a Coxeter group $W$ is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. These elements were extensively studied by Stembridge, in particular…

Combinatorics · Mathematics 2014-02-11 Riccardo Biagioli , Frédéric Jouhet , Philippe Nadeau

Reiner-Stanton-White defined the cyclic sieving phenomenon (CSP) associated to a finite cyclic group action and a polynomial. A key example arises from the length generating function for minimal length coset representatives of a parabolic…

Combinatorics · Mathematics 2018-06-26 Connor Ahlbach , Joshua Swanson

The star operation, originally introduced by Kazhdan and Lusztig, was later specialized by Ernst to the so-called weak star reduction on the set of fully commutative elements of a Coxeter group. In this paper, we classify the star and weak…

Combinatorics · Mathematics 2025-08-13 Riccardo Biagioli , Luca Costantini , Elisa Sasso

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…

Combinatorics · Mathematics 2025-12-02 Christos A. Athanasiadis , Theo Douvropoulos , Katerina Kalampogia-Evangelinou

Let ${\mathcal A}$ be a finite real linear hyperplane arrangement in three dimensions. Suppose further that all the regions of ${\mathcal A}$ are isometric. We prove that ${\mathcal A}$ is necessarily a Coxeter arrangement. As it is well…

Combinatorics · Mathematics 2026-05-13 Richard Ehrenborg , Caroline Klivans , Nathan Reading
‹ Prev 1 4 5 6 7 8 10 Next ›