English
Related papers

Related papers: The immersion poset on partitions

200 papers

In 2010, G.-N. Han obtained the generating function for the number of size $t$ hooks among integer partitions. Here we obtain these generating functions for self-conjugate partitions, which are particularly elegant for even $t$. If…

Combinatorics · Mathematics 2024-02-09 Tewodros Amdeberhan , George E. Andrews , Ken Ono , Ajit Singh

We prove a simple formula for arbitrary cluster variables in the marked surfaces model. As part of the formula, we associate a labeled poset to each tagged arc, such that the associated $F$-polynomial is a weighted sum of order ideals. Each…

Combinatorics · Mathematics 2024-04-19 Vincent Pilaud , Nathan Reading , Sibylle Schroll

For polynomial representations of $GL_n$ of a fixed degree, H. Krause defined a new internal tensor product using the language of strict polynomial functors. We show that over an arbitrary commutative base ring $k$, the Schur functor…

Representation Theory · Mathematics 2016-05-06 Upendra Kulkarni , Shraddha Srivastava , K V Subrahmanyam

We present a general framework for constructing polynomial integrable systems on linearizations of Poisson varieties that admit log-canonical systems. Our construction is in particular applicable to Poisson varieties with compatible cluster…

Symplectic Geometry · Mathematics 2026-03-30 Yanpeng Li , Yu Li , Jiang-Hua Lu

We review and present new studies on the relation between the partition functions of integrable lattice models and symmetric polynomials, and its combinatorial representation theory based on the correspondence, including our work. In…

Mathematical Physics · Physics 2015-12-29 Kohei Motegi , Kazumitsu Sakai , Satoshi Watanabe

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

Let $\lambda$ be a symplectic partition, denote Jord^{bp}($\lambda$) the set of even positive integers i which appear in $\lambda$, and let a map $\epsilon:Jord^{bp}(\lambda) \to {\pm 1}$. The generalized Springer's correspondence…

Representation Theory · Mathematics 2017-08-31 Jean-Loup Waldspurger

Set representation has become ubiquitous in deep learning for modeling the inductive bias of neural networks that are insensitive to the input order. DeepSets is the most widely used neural network architecture for set representation. It…

Machine Learning · Computer Science 2024-03-08 Peihao Wang , Shenghao Yang , Shu Li , Zhangyang Wang , Pan Li

This is an introduction to the group algebras of the symmetric groups, written for a quarter-long graduate course. After recalling the definition of group algebras (and monoid algebras) in general, as well as basic properties of…

Combinatorics · Mathematics 2025-07-29 Darij Grinberg

We give a new interpretation of the shifted Littlewood-Richardson coefficients $f_{\lambda\mu}^\nu$ ($\lambda,\mu,\nu$ are strict partitions). The coefficients $g_{\lambda\mu}$ which appear in the decomposition of Schur $Q$-function…

Representation Theory · Mathematics 2024-05-08 Khanh Nguyen Duc

Let e_k(x_1,...,x_l) be an elementary symmetric polynomial and let mu = (mu_1,...,mu_l) be an integer partition. Define pre_k(mu) to be the partition whose parts are the summands in the evaluation e_k(mu_1,...,mu_l). The study of such…

Combinatorics · Mathematics 2024-10-28 Cristina Ballantine , George Beck , Mircea Merca , Bruce Sagan

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

Combinatorics · Mathematics 2016-11-01 Franck Gabriel

The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…

Combinatorics · Mathematics 2024-12-31 Graham Hawkes

Our results revolve around a new operation on partitions, which we call overlap. We prove two overlap identities for so-called Littlewood-Schur functions. Littlewood-Schur functions are a generalization of Schur functions, whose study was…

Combinatorics · Mathematics 2018-05-21 Helen Riedtmann

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

Combinatorics · Mathematics 2017-05-08 Thomas Chappell , Tobias Friedl , Raman Sanyal

The study of permutation and partition statistics is a classical topic in enumerative combinatorics. The major index statistic on permutations was introduced a century ago by Percy MacMahon in his seminal works. In this extended abstract,…

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

In statistical physics, the multivariate hard-core model describes a system of particles, each of which receives its own fugacity. In graph-theoretic language, the partition function of the model translates to the multivariate independence…

Combinatorics · Mathematics 2026-02-03 Joonkyung Lee , Jaehyeon Seo

Polysymmetric functions, introduced by Asvin G and Andrew O'Desky as a generalization of symmetric functions, have natural connections to algebraic geometry and provide a foundation for further developments. In this paper, we study…

Combinatorics · Mathematics 2026-01-14 David Martinez

For a partition $\nu$, let $\lambda,\mu\subseteq \nu$ be two distinct partitions such that $|\nu/\lambda|=|\nu/\mu|=1$. Butler conjectured that the divided difference…

Combinatorics · Mathematics 2026-02-09 Donghyun Kim , Seung Jin Lee , Jaeseong Oh

For a fixed poset $P$, a family $\mathcal F$ of subsets of $[n]$ is induced $P$-saturated if $\mathcal F$ does not contain an induced copy of $P$, but for every subset $S$ of $[n]$ such that $ S\not \in \mathcal F$, $P$ is an induced…

Combinatorics · Mathematics 2023-12-05 Andrea Freschi , Simón Piga , Maryam Sharifzadeh , Andrew Treglown