中文
相关论文

相关论文: Counting linear extensions of posets with determin…

200 篇论文

A proper vertex of a rooted tree with totally ordered vertices is a vertex that is less than all its proper descendants. We count several kinds of labeled rooted trees and forests by the number of proper vertices. Our results are all…

组合数学 · 数学 2013-04-02 Ira M. Gessel , Seunghyun Seo

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

环与代数 · 数学 2023-04-27 Luis Verde-Star

We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…

数学物理 · 物理学 2015-06-26 Saugata Ghosh

We develop a powerful tool for embedding any tree poset $P$ of height $k$ in the Boolean lattice which allows us to solve several open problems in the area. We show that: * If $H$ is a family in $B_n$ with $|H|\ge (q-1+\varepsilon){n\choose…

组合数学 · 数学 2025-10-15 Tao Jiang , Sean Longbrake , Sam Spiro , Liana Yepremyan

We prove a conjecture by Diaz-Lopez et al. that bounds the roots of descent polynomials. To do so, we prove an algebraic inequality, which we refer to as the "Slice and Push Inequality." This inequality compares expressions that come from…

组合数学 · 数学 2021-09-21 Pakawut Jiradilok , Thomas McConville

We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…

组合数学 · 数学 2017-12-12 Lutz Warnke

The P-Eulerian polynomial counts the linear extensions of a labeled partially ordered set, P, by their number of descents. It is known that the P-Eulerian polynomials are real-rooted for various classes of posets P. The purpose of this…

组合数学 · 数学 2016-04-15 Petter Brändén , Madeleine Leander

We study the gaps $\Delta p_n$ between consecutive rank sizes in $r$-differential posets by introducing a projection operator whose matrix entries can be expressed in terms of the number of certain paths in the Hasse diagram. We strengthen…

组合数学 · 数学 2020-01-06 Christian Gaetz , Praveen Venkataramana

Recently, Naruse presented a beautiful cancellation-free hook-length formula for skew shapes. The formula involves a sum over objects called excited diagrams, and the term corresponding to each excited diagram has hook lengths in the…

组合数学 · 数学 2018-09-05 Matjaz Konvalinka

In this paper, we take interest in finding applications for a hook-length formula recently proved in (Morales Pak Panova 2016). This formula can be applied to give a non trivial relation between alternating permutations and weighted Dyck…

组合数学 · 数学 2019-04-18 Lucas Randazzo

We establish a conjecture of Defant, Hopkins, Poznanovi\'{c}, and Propp concerning the dimensions of toggleability spaces for products of chains, shifted staircases, type-A root posets, and type-B posets. Generalizing this result, we show…

组合数学 · 数学 2025-08-22 Ben Adenbaum , Spencer Daugherty , Nicholas Mayers

In this short note we discuss recent results on hook length formulas of trees unifying some earlier results, and explain hook length formulas naturally associated to families of increasingly labelled trees.

组合数学 · 数学 2010-04-13 Markus Kuba

Recently, Han discovered two formulas involving binary trees which have the interestig property that hooklengths appear as exponents. The purpose of this note is to give a probabilistic proof of one of Han's formulas. Yang has generalized…

组合数学 · 数学 2008-06-12 Bruce E. Sagan

We first present a determinant inequality related to partial traces for positive semidefinite block matrices. Our result extends a result of Lin [Czech. Math. J. 66 (2016)] and improves a result of Kuai [Linear Multilinear Algebra 66…

泛函分析 · 数学 2022-01-20 Yongtao Li

Building from the work of von Bell et al.~(2022), we study the Ehrhart theory of order polytopes arising from a special class of distributive lattices, known as generalized snake posets. We present arithmetic properties satisfied by the…

组合数学 · 数学 2026-03-02 Eon Lee , Andrés R. Vindas-Meléndez , Zhi Wang

Sign imbalance is a statistic on posets which counts the difference between the number of even and odd linear extensions. We prove complexity results about the sign imbalance and parity of linear extensions, focusing on the representative…

组合数学 · 数学 2023-11-07 David Soukup

The class of poset metrics is very large and contains some interesting families of metrics. A family of metrics, based on posets which are formed from disjoint chains which have the same size, is examined. A necessary and sufficient…

信息论 · 计算机科学 2015-03-19 Tuvi Etzion

Inspired by the infinite families of finite and affine root systems, we consider a "stretching" operation on general crystallographic root systems which, on the level of Coxeter diagrams, replaces a vertex with a path of unlabeled edges. We…

组合数学 · 数学 2020-10-22 Will Dana

Motivated by a conjecture concerning Igusa local zeta functions for intersection posets of hyperplane arrangements, we introduce and study the Poincar\'e-extended ab-index, which generalizes both the ab-index and the Poincar\'e polynomial.…

组合数学 · 数学 2024-12-10 Galen Dorpalen-Barry , Joshua Maglione , Christian Stump

The classical hook length formula counts the number of standard tableaux of straight shapes. In 1996, Okounkov and Olshanski found a positive formula for the number of standard Young tableaux of a skew shape. We prove various properties of…

组合数学 · 数学 2023-09-19 Alejandro H. Morales , Daniel G. Zhu