English
Related papers

Related papers: Schroder combinatorics and $\nu$-associahedra

200 papers

We present higher dimensional versions of the classical results of Euler and Fuss, both of which are special cases of the celebrated Poncelet porism. Our results concern polytopes, specifically simplices, parallelotopes and cross polytopes,…

Metric Geometry · Mathematics 2022-11-01 Peter Gibson , Nicolau Saldanha , Carlos Tomei

A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…

Combinatorics · Mathematics 2019-12-03 Cara Monical , Neriman Tokcan , Alexander Yong

The eigenvalues of a self-adjoint nxn matrix A can be put into a decreasing sequence $\lambda=(\lambda_1,...,\lambda_n)$, with repetitions according to multiplicity, and the diagonal of A is a point of $R^n$ that bears some relation to…

Operator Algebras · Mathematics 2007-05-23 William Arveson , Richard V. Kadison

In a companion paper, we introduced raising operator series called Catalanimals. Among them are Schur Catalanimals, which represent Schur functions inside copies $\Lambda (X^{m,n})\subset \mathcal{E} $ of the algebra of symmetric functions…

Combinatorics · Mathematics 2021-12-16 Jonah Blasiak , Mark Haiman , Jennifer Morse , Anna Pun , George Seelinger

We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…

Combinatorics · Mathematics 2022-09-30 Florence Maas-Gariépy , Étienne Tétreault

We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…

Geometric Topology · Mathematics 2018-08-31 Sergey A. Melikhov

Consider a setting where possibly sensitive information sent over a path in a network is visible to every {neighbor} of the path, i.e., every neighbor of some node on the path, thus including the nodes on the path itself. The exposure of a…

Data Structures and Algorithms · Computer Science 2012-12-27 Shiri Chechik , M. P. Johnson , Merav Parter , David Peleg

In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan's "Lost" Notebook, we obtain weighted forms of Euler's theorem on partitions with odd parts and distinct parts. This work is inspired by…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Kathy Q. Ji

We present a combinatorial isomorphism between Stasheff associahedra and an inductive cone construction of those complexes given by Loday. We give an alternate description of certain polytopes, known as multiplihedra, which arise in the…

Combinatorics · Mathematics 2025-11-25 Somnath Basu , Sandip Samanta

This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…

Combinatorics · Mathematics 2022-12-05 Hung Phuc Hoang , Torsten Mütze

Consider nonzero vectors $a_{1},\dots,a_{n}\in\mathbb{C}^{k}$, independent Rademacher random variables $\xi_{1},\dots,\xi_{n}$, and a set $S\subseteq\mathbb{C}^{k}$. What upper bounds can we prove on the probability that the random sum…

Combinatorics · Mathematics 2025-06-02 Alexandr Grebennikov , Matthew Kwan

Classical A-polynomials $A(\ell,m)$ define constraints on coordinates $\ell$ and $m$ in $SL(2,\mathbb{C})$ (a complexification of $SU(2)$) character varieties associated to knot complements $S^3\setminus K$. Quantum A-polynomials $\hat…

High Energy Physics - Theory · Physics 2026-05-22 Dmitry Galakhov , Alexei Morozov

We analyze union-find using potential functions motivated by continuous algorithms, and give alternate proofs of the $O(\log\log{n})$, $O(\log^{*}n)$, $O(\log^{**}n)$, and $O(\alpha(n))$ amortized cost upper bounds. The proof of the…

Data Structures and Algorithms · Computer Science 2023-08-21 Zhiyi Huang , Chris Lambert , Zipei Nie , Richard Peng

We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of…

Combinatorics · Mathematics 2016-04-01 Jean-Christophe Aval , Francois Bergeron

We observe that the process of associating an action to any Schreier extension of monoids with commutative and cancellative kernel is functorial. We show that this functor is a generalisation of the direction functor, used to give a…

Category Theory · Mathematics 2026-02-25 Stefano Ambra , Andrea Montoli , Diana Rodelo

We introduce the notions of Schr\"oder shape and of Schr\"oder tableau, which provide some kind of analogs of the classical notions of Young shape and Young tableau. We investigate some properties of the partial order given by containment…

Combinatorics · Mathematics 2018-07-20 Luca Ferrari

Reading's "shard intersection order" on the symmetric group can be realized as the "lattice of wide subcategories" of the corresponding preprojective algebra. In this paper, we first use Bancroft's combinatorial model for the shard…

Representation Theory · Mathematics 2023-05-11 Eric J. Hanson

Let $\mathcal A\subseteq \mat$ be a unital $*$-subalgebra of the algebra $\mat$ of all $n\times n$ complex matrices and let $B$ be an hermitian matrix. Let $\U_n(B)$ denote the unitary orbit of $B$ in $\mat$ and let $\mathcal E_\mathcal A$…

Operator Algebras · Mathematics 2007-12-17 Pedro Massey

We give a combinatorial expansion of a Schubert homology class in the affine Grassmannian Gr_{SL_k} into Schubert homology classes in Gr_{SL_{k+1}}. This is achieved by studying the combinatorics of a new class of partitions called…

Combinatorics · Mathematics 2010-08-02 Thomas Lam , Luc Lapointe , Jennifer Morse , Mark Shimozono

In this note, by counting some colored plane trees we obtain several binomial identities. These identities can be viewed as specific evaluations of certain generalizations of the Narayana polynomials. As consequences, it provides…

Combinatorics · Mathematics 2015-12-15 Ricky X. F. Chen , Christian M. Reidys