首页/论文/math/9812075

arXiv math/98120751998-12-11math.CO

Packing Ferrers Shapes

Noga Alon, Miklós Bóna, Joel Spencer

备注：: 7 pages, 4 figures

英文摘要：

Answering a question of Wilf, we show that if $n$ is sufficiently large, then one cannot cover an $n \times p(n)$ rectangle using each of the $p(n)$ distinct Ferrers shapes of size $n$ exactly once. Moreover, the maximum number of pairwise distinct, non-overlapping Ferrers shapes that can be packed in such a rectangle is only $Θ(p(n)/ \log n).$

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Finite posets and Ferrers shapes

A survey on the Greene-Kleitman correspondence, with complete proofs, many of which are new.

1999-12-15math.CO

Lonesum and $Γ$-free $0$-$1$ fillings of Ferrers shapes

We show that $Γ$-free fillings and lonesum fillings of Ferrers shapes are equinumerous by applying a previously defined bijection on matrices for this more general case and by constructing a new bijection between Callan sequences and Dumont-like permutations. As an application, we give a new combinatorial interpretation of Genocchi numbers in terms of Callan sequences. Further, we recover some of Hetyei's results on alternating acyclic tournaments. Finally, we present an interesting result in the case of certain other special shapes.

2019-11-23math.CO

Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes

We put recent results by Chen, Deng, Du, Stanley and Yan on crossings and nestings of matchings and set partitions in the larger context of the enumeration of fillings of Ferrers shape on which one imposes restrictions on their increasing and decreasing chains. While Chen et al. work with Robinson-Schensted-like insertion/deletion algorithms, we use the growth diagram construction of Fomin to obtain our results. We extend the results by Chen et al., which, in the language of fillings, are results about $0$-$1$-fillings, to arbitrary fillings. Finally, we point out that, very likely, these resu…

2006-01-13math.CO

Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations

This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension of a rank-metric code with given specified Ferrers diagram shape and rank distance. While the conjecture in its generality is wide open, several cases have been established in the literature. This paper contributes further cases of Ferrers diagrams and ranks for which the conjecture holds true. In addition, the proportion of maximal Ferrers diagram codes wi…

2019-04-26cs.ITmath.COmath.IT

Boolean complexes for Ferrers graphs

In this paper we provide an explicit formula for calculating the boolean number of a Ferrers graph. By previous work of the last two authors, this determines the homotopy type of the boolean complex of the graph. Specializing to staircase shapes, we show that the boolean numbers of the associated Ferrers graphs are the Genocchi numbers of the second kind, and obtain a relation between the Legendre-Stirling numbers and the Genocchi numbers of the second kind. In another application, we compute the boolean number of a complete bipartite graph, corresponding to a rectangular Ferrers shape, which …

2010-08-11math.ATmath.CO

Cauchy 恒等式对于斜 Ferrers 形状：通过 RSK 和 keys

Cauchy identities for skew Ferrers shapes via RSK and keys

Instituto de Matemáticas, Universidad de Talca（塔尔卡大学数学研究所）

本文通过 RSK 对应和 keys 刻画斜 Ferrers 形状的 Cauchy 核展开，给出 Demazure 原子与 key 多项式的恒等式，并推广到无限字母表。

2026-09-15math.CO

更多相关论文收起更多论文

Unimodality of partitions with distinct parts inside Ferrers shapes

We investigate the rank-generating function $F_λ$ of the poset of partitions contained inside a given shifted Ferrers shape $λ$. When $λ$ has four parts, we show that $F_λ$ is unimodal when $λ=\langle n,n-1,n-2,n-3 \rangle$, for any $n\ge 4$, and that unimodality fails for the doubly-indexed, infinite family of partitions of the form $λ=\langle n,n-t,n-2t,n-3t \rangle$, for any given $t\ge 2$ and $n$ large enough with respect to $t$. When $λ$ has $b\le 3$ parts, we show that our rank-generating functions $F_λ$ are all unimodal. However, the situation remains mostly obscure for $b\ge 5$. In gen…

2015-03-21math.ACmath.CO

避免对角模式的斜杨图填充

Fillings of skew shapes avoiding diagonal patterns

研究斜杨图的整数填充，证明 D-free 形状中避免东北链与东南链的填充双射，并构造任意斜杨图避免东南链与避免东北链及特定子填充的 01-填充双射。

2021-06-15cs.DMmath.CO

长度为三的模式集合的匹配与shape-Wilf等价性 II：四元组与五元组

Matchings and shape-Wilf-Equivalence of sets of patterns of length three II: Quadruples and Quintuples

Indian Institute of Technology, Bombay（印度孟买理工学院）；Indian Institute of Science, Bengaluru（印度班加罗尔印度科学学院）

本文完成了长度为三的模式四元组和五元组的shape-Wilf等价分类，引入Dyck路径方法处理Ferrers板，获得新等价关系、计数公式及匹配枚举的双射解释。

2026-10-02math.CO

长度为三的模式集合的匹配与形状-Wilf-等价性 I：三元组

Matchings and shape-Wilf-Equivalence of sets of patterns of length three I: Triples

Indian Institute of Science（印度科学学院）；Indian Institute of Technology, Bombay（孟买印度理工学院）

本文完整分类了长度为三的模式三元组的形状-Wilf-等价类，利用双射编码证明，并枚举了避免这些模式的匹配，扩展了先前结果，发现了与Fuss-Catalan数等序列相关的新组合族。

2026-09-09math.CO