English
Related papers

Related papers: Promotion digraphs

200 papers

Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link…

Combinatorics · Mathematics 2020-06-18 Heather M. Russell , Julianna Tymoczko

We introduce inversions tableaux, a new combinatorial model for Schubert polynomials and Stanley symmetric functions that directly specializes to semi-standard Young tableaux in the Grassmannian case. They are a modification of the balanced…

Combinatorics · Mathematics 2025-07-17 Ilani Axelrod-Freed

Extending the notion of geometric bijections for regular matroids, introduced by the first and third author with Matthew Baker, we describe a family of bijections between bases of an oriented matroid and special orientations. These…

Combinatorics · Mathematics 2026-04-07 Spencer Backman , Francisco Santos , Chi Ho Yuen

We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…

Combinatorics · Mathematics 2007-09-05 Yuliy Baryshnikov , Dan Romik

In 2020, Cameron et al. introduced the restricted numerical range of a digraph (directed graph) as a tool for characterizing digraphs and studying their algebraic connectivity. In particular, digraphs with a restricted numerical range of a…

Combinatorics · Mathematics 2021-06-03 Thomas R. Cameron , H. Tracy Hall , Ben Small , Alexander Wiedemann

In this paper, we firstly extend a result of Bonin, Shapiro and Simion by giving the distribution of the major index over generalized Schr\"{o}der paths. Then by providing a bijection between generalized Schr\"{o}der paths and…

Combinatorics · Mathematics 2020-12-23 Xiaomei Chen

(Dual-)promotion and (dual-)evacuation are bijections on SYT(\lambda) for any partition \lambda. Let c^r denote the rectangular partition (c,...,c) of height r, and let sc_k (k > 2) denote the staircase partition (k,k-1,...,1). B. Rhoades…

Combinatorics · Mathematics 2015-03-13 Steven Pon , Qiang Wang

Gross, Mansour, and Tucker introduced the partial-duality polynomial of a ribbon graph [Distributions, European J. Combin. 86, 1--20, 2020], the generating function enumerating partial duals by the Euler genus. Chmutov and Vignes-Tourneret…

Combinatorics · Mathematics 2024-04-23 Remi Cocou Avohou

Edelman and Greene constructed a bijection between the set of standard Young tableaux and the set of balanced Young tableaux of the same shape. Fomin, Greene, Reiner and Shimozono introduced the notion of balanced Rothe tableaux of a…

Combinatorics · Mathematics 2016-07-14 Neil J. Y. Fan

C. Ingalls and H. Thomas defined support tilting modules for path algebras. From tau-tilting theory introduced by T. Adachi, O. Iyama and I. Reiten, a partial order on the set of basic tilting modules defined by D. Happel and L. Unger is…

Combinatorics · Mathematics 2014-06-18 Ryoichi Kase

We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…

Combinatorics · Mathematics 2020-05-19 Sara C. Billey , Matjaž Konvalinka , Joshua P. Swanson

Motivated by the M-diagrams defined by Tymoczko, we show that these locally non-crossing $\mathfrak{sl}_3$-webs form a basis of the Specht module for the partition $(n,n,n)$. They further admit a unitriangular base change to both the…

Representation Theory · Mathematics 2023-05-09 Jieru Zhu

We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…

Combinatorics · Mathematics 2020-09-15 Melody Chan , Nathan Pflueger

The generators of the classical Specht module satisfy intricate relations. We introduce the Specht matroid, which keeps track of these relations, and the Specht polytope, which also keeps track of convexity relations. We establish basic…

Combinatorics · Mathematics 2017-01-20 John D. Wiltshire-Gordon , Alexander Woo , Magdalena Zajaczkowska

Promotion and evacuation are bijections on the set of linear extensions of a finite poset first defined by Schutzenberger. This paper surveys the basic properties of these two operations and discusses some generalizations.

Combinatorics · Mathematics 2008-07-21 Richard P. Stanley

In 2023, Defant introduced toric promotion as a cyclic analogue of Sch\"utzenberger's well known promotion operator. Toric promotion is defined by a choice of simple graph $G$ and acts on the labeling of $G$ by a series of involutions.…

Combinatorics · Mathematics 2025-12-02 Kerry Seekamp

Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. This paper studies combinatorial properties and structures on these permutations. First, both sets are characterized by pattern…

Combinatorics · Mathematics 2013-05-01 Sergi Elizalde , Yuval Roichman

Promotion and rowmotion are intriguing actions in dynamical algebraic combinatorics which have inspired much work in recent years. In this paper, we study $P$-strict labelings of a finite, graded poset $P$ of rank $n$ and labels at most…

Combinatorics · Mathematics 2024-06-07 Joseph Bernstein , Jessica Striker , Corey Vorland

Recently, Naruse discovered a hook length formula for the number of standard Young tableaux of a skew shape. Morales, Pak and Panova found two $q$-analogs of Naruse's hook length formula over semistandard Young tableaux (SSYTs) and reverse…

Combinatorics · Mathematics 2017-11-08 Byung-Hak Hwang , Jang Soo Kim , Meesue Yoo , Sun-mi Yun

A tuple (Z_1,...,Z_p) of matrices of size r is said to be a commuting extension of a tuple (A_1,...,A_p) of matrices of size n <r if the Z_i pairwise commute and each A_i sits in the upper left corner of a block decomposition of Z_i. This…

Data Structures and Algorithms · Computer Science 2024-01-03 Pascal Koiran