中文
相关论文

相关论文: The Pop-stack-sorting Operator on Tamari Lattices

200 篇论文

The pop-stack-sorting process is a variation of the stack-sort process. We consider a deterministic version of this process, and provide a new lower bound of $\frac{3}{5}n$ for the number of sorts to fully sort a uniformly randomly chosen…

组合数学 · 数学 2024-08-26 Morgan Bauer , Keith Copenhaver

The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the…

组合数学 · 数学 2020-03-23 J. -C. Novelli , J. -Y. Thibon

Pop-Stack Sorting is an algorithm that takes a permutation as an input and sorts its elements. It consists of several steps. At one step, the algorithm reads the permutation it has to process from left to right and reverses each of its…

概率论 · 数学 2022-12-20 Lyuben Lichev

A natural first step in the classification of all `physical' modular invariant partition functions $\sum N_{LR}\,\c_L\,\C_R$ lies in understanding the commutant of the modular matrices $S$ and $T$. We begin this paper extending the work of…

高能物理 - 理论 · 物理学 2009-10-22 Terry Gannon

We study Defant and Kravitz's generalization of Sch\"utzenberger's promotion operator to arbitrary labelings of finite posets in two directions. Defant and Kravitz showed that applying the promotion operator $n-1$ times to a labeling of a…

组合数学 · 数学 2026-04-28 Margaret Bayer , Herman Chau , Mark Denker , Owen Goff , Jamie Kimble , Yi-Lin Lee , Jinting Liang

We study combinatorial and order theoretic structures arising from the fragment of combinatory logic spanned by the basic combinator ${\bf M}$. This basic combinator, named as the Mockingbird by Smullyan, is defined by the rewrite rule…

组合数学 · 数学 2022-09-26 Samuele Giraudo

Motivated by the behavior of the trace pairing over tame cyclic number fields, we introduce the notion of tame lattices. Given an arbitrary non-trivial lattice $\mathcal{L}$ we construct a parametric family of full-rank sub-lattices…

数论 · 数学 2022-04-14 Mohamed Taoufiq Damir , Guillermo Mantilla-Soler

We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of a semidistrim lattice correspond to the independent sets in…

组合数学 · 数学 2021-11-17 Colin Defant , Nathan Williams

We introduce the extra slow Tamari lattices, a new family of lattices defined on faithfully balanced tableaux. These tableaux arise naturally from the representation theory of type \( A \) quivers, and our construction extends the classical…

组合数学 · 数学 2026-05-21 Sylvie Corteel , Jihyeug Jang , Baptiste Rognerud

The $m$-Tamari lattices $\mathcal{T}_{n}^{(m)}$, introduced by Bergeron and Pr{\'e}ville-Ratelle, are defined as a poset of $m$-Dyck paths equipped with the generalized rotation order, and constitute a Fuss-Catalan generalization of the…

组合数学 · 数学 2014-02-06 Henri Mühle

The finite Young lattice $L(m, n)$ is rank-symmetric, rank-unimodal, and has the strong Sperner property. R. Stanley further conjectured that $L(m, n)$ admits a symmetric chain order. We show that the order structure on $L(m, n)$ is…

组合数学 · 数学 2024-07-30 Terrance Coggins , Robert W. Donley , Ammara Gondal , Arnav Krishna

We consider polynomial optimization problems (POP) on a semialgebraic set contained in the nonnegative orthant (every POP on a compact set can be put in this format by a simple translation of the origin). Such a POP can be converted to an…

最优化与控制 · 数学 2025-06-12 Ngoc Hoang Anh Mai , Victor Magron , Jean-Bernard Lasserre , Kim-Chuan Toh

The main purpose of this paper is the study of a~new class of summing multilinear operators acting from the product of Banach lattices with some nontrivial lattice convexity. A~mixed Pietsch-Maurey-Rosenthal type factorization theorem for…

泛函分析 · 数学 2017-06-20 Mieczysław Mastyło , Enrique A. Sánchez-Pérez

The Tamari order is a central object in algebraic combinatorics and many other areas. Defined as the transitive closure of an associativity law, the Tamari order possesses a surprisingly rich structure: it is a congruence-uniform lattice.…

组合数学 · 数学 2017-09-28 Thomas McConville

In casual discussion, a stack is often described as a variety (the coarse space) together with stabilizer groups attached to some of its subvarieties. However, this description does not uniquely specify the stack. Our main result shows that…

代数几何 · 数学 2015-03-19 Anton Geraschenko , Matthew Satriano

The lattice of monotone triangles $(\mathfrak{M}_n,\le)$ ordered by entry-wise comparisons is studied. Let $\tau_{\min}$ denote the unique minimal element in this lattice, and $\tau_{\max}$ the unique maximum. The number of $r$-tuples of…

组合数学 · 数学 2014-07-23 John Engbers , Adam Hammett

We define the supermodular rank of a function on a lattice. This is the smallest number of terms needed to decompose it into a sum of supermodular functions. The supermodular summands are defined with respect to different partial orders. We…

组合数学 · 数学 2023-05-25 Rishi Sonthalia , Anna Seigal , Guido Montufar

Let $P:\mathbb{C}^n\rightarrow \mathbb{C}$ be an $m$-homogeneous polynomial given by \[P(x)= \sum_{1\leq j_1\leq \ldots \leq j_m \leq n} c_{j_1 \ldots j_m} x_{j_1}\ldots x_{j_m}.\] Defant and Schl\"uters defined a non-symmetric associated…

泛函分析 · 数学 2018-07-20 Felipe Marceca

A connection relating Tamari lattices on symmetric groups regarded as lattices under the weak Bruhat order to the positive monoid P of Thompson group F is presented. Tamari congruence classes correspond to classes of equivalent elements in…

组合数学 · 数学 2007-05-23 Zoran Sunic

We consider two sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ and $(Q_n)_{n\geq 0}$ with respect regular functionals ${\bf u}$ and ${\bf v}$, respectively. We assume that $$\sum_{j=1} ^{M} a_{j,n}\mathrm{D}_x ^k P_{k+n-j}…

经典分析与常微分方程 · 数学 2023-01-10 D. Mbouna