Splitting Kronecker squares, 2-decomposition numbers, Catalan combinatorics, and the Saxl conjecture
نویسندگان
چکیده
This paper concerns the symmetric and anti-symmetric Kronecker products of characters groups. We provide new closed formulas for decomposing these products, unexpected connections with 2-modular decomposition numbers, Catalan combinatorics, a refinement famous Saxl conjecture.
منابع مشابه
Catalan Numbers Modulo 2 k
In this paper, we develop a systematic tool to calculate the congruences of some combinatorial numbers involving n!. Using this tool, we re-prove Kummer’s and Lucas’ theorems in a unique concept, and classify the congruences of the Catalan numbers cn (mod 64). To achieve the second goal, cn (mod 8) and cn (mod 16) are also classified. Through the approach of these three congruence problems, we ...
متن کاملCoxeter-Catalan Combinatorics
In this talk we will introduce the new and active topic “CoxeterCatalan combinatorics”. We will survey three trends, namely the nonnesting partitions, noncrossing partitions and cluster complexes, leading to this topic. Some new results and unsolved problems will be given.
متن کاملRational Catalan Combinatorics: The Associahedron
Each positive rational number x > 0 can be written uniquely as x = a/(b − a) for coprime positive integers 0 < a < b. We will identify x with the pair (a, b). In this extended abstract we use rational Dyck paths to define for each positive rational x > 0 a simplicial complex Ass(x) = Ass(a, b) called the rational associahedron. It is a pure simplicial complex of dimension a− 2, and its maximal ...
متن کاملCoincidences of Catalan and Q-catalan Numbers
Let Cn and Cn(q) be the nth Catalan number and the nth q-Catalan number, respectively. In this paper, we show that the Diophantine equation Cn = Cm(q) has only finitely many integer solutions (m,n, q) with m > 1, n > 1, q > 1. Moreover, they are all effectively computable. – To Professor Carl Pomerance on his 65th birthday
متن کاملThe Catalan numbers
E. Catalan stated in 1874 that the numbers (2m)! (2n)!/m! n! (m+n)! are integers. When m = 0 these numbers are the middle binomial coefficients ( 2n n ) . When m = 1 they are twice the Catalan numbers. In this paper, we give a combinatorial interpretation for these numbers when m = 2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic combinatorics
سال: 2023
ISSN: ['2589-5486']
DOI: https://doi.org/10.5802/alco.294