arXiv 0809.34692008-09-19math.COmath.RT

Expressions for Catalan Kronecker Products

Andrew Brown, Stephanie van Willigenburg, Mike Zabrocki

备注：: 19 pages
发表信息：: Pacific J. Math. 248:31--48 (2010)

英文摘要：

We give some elementary manifestly positive formulae for the Kronecker products s_(d,d) * s_(d+k,d-k) and s_(d,d) * s_(2d-k,1^k). These formulae demonstrate some fundamental properties of the Kronecker coefficients, and we use them to deduce a number of enumerative and combinatorial results.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Splitting Kronecker squares, 2-decomposition numbers, Catalan Combinatorics, and the Saxl conjecture

While there has been some progress on the decomposition of Kronecker products of characters of the symmetric groups in recent times, results on the symmetric and alternating part of Kronecker squares are still scarce. Here, new results (and conjectures) are presented on this splitting of the squares that contribute to a refined understanding of the Kronecker squares. Furthermore, connections to 2-modular decomposition numbers, Catalan combinatorics, and to the Saxl conjecture are discussed which further motivate the study of these splittings.

2023-01-18math.COmath.RT

Kronecker Coefficients For Some Near-Rectangular Partitions

We give formulae for computing Kronecker coefficients occurring in the expansion of $s_μ*s_ν$, where both $μ$ and $ν$ are nearly rectangular, and have smallest parts equal to either 1 or 2. In particular, we study $s_{(n,n-1,1)}*s_{(n,n)}$, $s_{(n-1,n-1,1)}*s_{(n,n-1)}$, $s_{(n-1,n-1,2)}*s_{(n,n)}$, $s_{(n-1,n-1,1,1)}*s_{(n,n)}$ and $s_{(n,n,1)}*s_{(n,n,1)}$. Our approach relies on the interplay between manipulation of symmetric functions and the representation theory of the symmetric group, mainly employing the Pieri rule and a useful identity of Littlewood. As a consequence of these formulae…

2014-03-21math.CO

Some identities and formulas involving generalized Catalan numbers

A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.

2006-09-21math.CO

(k,m)-Catalan Numbers and Hook Length Polynomials for Plane Trees

Motivated by a formula of A. Postnikov relating binary trees, we define the hook length polynomials for m-ary trees and plane forests, and show that these polynomials have a simple binomial expression. An integer value of this expression is C_{k,m}(n)=\frac{1}{mn+1}{(mn+1)k \choose n}, which we call the (k,m)-Catalan number. For proving the hook length formulas, we also introduce a combinatorial family, (k,m)-ary trees, which are counted by the (k,m)-Catalan numbers.

2005-09-14math.CO

使用Malmstén公式表示Catalan数的积分表示

An integral representation of Catalan numbers using Malmstén's formula

本文基于Malmstén对Gamma函数对数的定积分表示，提出了Catalan数的积分表达式，该表达式有望产生涉及Catalan数或中心二项式系数的新求和。

2024-10-11math.COmath.NT

利用Féaux公式的Catalan数积分表示

An integral representation of Catalan numbers using the Féaux formula

本研究利用Féaux的Gamma函数对数积分表示，推导出Catalan数的一种新积分表达式，该式可为中心二项式系数、Catalan数相关新恒等式的推导提供基础。

2024-10-31math.CO

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

Automatic Proofs of Asymptotic ABNORMALITY (and much more!) of Natural Statistics Defined on Catalan-Counted Combinatorial Families

In this case-study in computer-human collaboration, we develop, implement, and execute symbolic-computational algorithms for the automatic discovery and proof of explicit expressions for the expectation, variance, and higher moments of a large class of natural combinatorial statistics defined on Catalan-counted objects, enabling, inter-alia, to prove that they are not asymptotically normal. In particular, we reproduce in 0.12 seconds results of Miklos Bona, and derive far deeper results, way beyond the scope of humans, concerning higher moments of the random variable "number of occurrences of …

2014-03-22math.CO

利用Fuss-Catalan数求解k-广义斐波那契数

Solutions for $k$-generalized Fibonacci numbers using Fuss-Catalan numbers

该研究提出k-广义斐波那契数Fₖ(n)的新表达式，利用Fuss-Catalan数给出其特征多项式根的显式形式，量化渐近近似精度，提供任意初始条件下的递推基，扩展前人结果并发现多变量Dickson多项式关联及伴随矩阵新恒等式。

2025-08-26math.COmath.NT

Kronecker问题中的代数障碍与初等结构的崩溃

Algebraic Obstructions and the Collapse of Elementary Structure in the Kronecker Problem

本文首次给出Kronecker系数的显式公式，揭示了参数值5处初等结构崩溃的普遍边界，通过整数强制技术证明了首个三行Kronecker系数的显式公式，并验证了Saxl猜想。

2025-12-20cs.CCmath.COmath.RT

Binomial Determinants for Tiling Problems Yield to the Holonomic Ansatz

We present and prove closed form expressions for some families of binomial determinants with signed Kronecker deltas that are located along an arbitrary diagonal in the corresponding matrix. They count cyclically symmetric rhombus tilings of hexagonal regions with triangular holes. We extend a previous systematic study of these families, where the locations of the Kronecker deltas depended on an additional parameter, to families with negative Kronecker deltas. By adapting Zeilberger's holonomic ansatz to make it work for our problems, we can take full advantage of computer algebra tools for sy…

2021-09-21cs.SCmath.CO

On Cartesian product of matrices

Recently, Bapat and Kurata [\textit{Linear Algebra Appl.}, 562(2019), 135-153] defined the Cartesian product of two square matrices $A$ and $B$ as $A\oslash B=A\otimes \J+\J\otimes B$, where $\J$ is the all one matrix of appropriate order and $\otimes$ is the Kronecker product. In this article, we find the expression for the trace of the Cartesian product of any finite number of square matrices in terms of traces of the individual matrices. Also, we establish some identities involving the Cartesian product of matrices. Finally, we apply the Cartesian product to study some graph-theoretic prope…

2019-01-07math.CO