SearcharxivSearch

arXiv subjects

Christian Krattenthaler

Publications and source records attributed to Christian Krattenthaler.

At least 19 recordsLinked to original sources

An Orthogonal View of Gaußian Polynomials

We establish an alternative, ``perpendicular" collection of generating functions for the coefficients of Gaussian polynomials, $\begin{bmatrix}N+m\\m\end{bmatrix}_q$. We provide a general characterization of these perpendicular generating functions. For small values of $m$, unimodality of the coefficients of Gaussian polynomials is easily proved from these generating functions. Additionally, we uncover new and surprising identities for the differences of Gaussian polynomial coefficients, including a very unexpected infinite family of congruences for coefficients of $\begin{bmatrix}N+4\\4\end{bmatrix}_q$.

math.NT

Cyclic sieving phenomena for trees and tree-rooted maps

We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees with a given degree distribution of the nodes. Moreover, we consider four different cyclic group actions: (1) the root is moved to the next corner along a tour of the tree; (2) only trees in which the root is at a leaf are considered, and the action moves the root to the next leaf; (3) only trees in which the root is at a non-leaf are considered, and the action moves the root to the next non-leaf corner; (4) only trees in which the root is at a node of degree $δ$ are considered, for a fixed $δ$, and the action moves the root to the next corner of this type. We prove a cyclic sieving phenomenon for each meaningful combination of these sets and actions. As a bonus, we also establish corresponding cyclic sieving phenomena for tree-rooted planar maps.

math.CO

Bounded Littlewood identities with fixed number of odd rows or odd columns

A Littlewood identity is an identity equating a sum of Schur functions with an infinite product. A bounded Littlewood identity is one where the sum is taken over the partitions with a bounded number of rows or columns. The price to pay is that the infinite product has to be replaced by a determinant. The focus of this article is on refinements of such bounded Littlewood identities where one also prescribes the number of odd-length rows or columns of the partitions. Goulden [{\it Discrete Math.} {\bf99} (1992), 69--77] had given such a refinement in which the number of columns is bounded and the number of odd-length rows is prescribed. We provide refinements where the number of columns is bounded and the number of odd-length columns is prescribed. Furthermore, we present new formulations of such bounded Littlewood identities involving skewing operators. As corollaries we obtain non-standard formulas for numbers of standard Young tableaux with restricted shapes as above. In the last part of the article we discuss combinatorial interpretations of such identities in terms of up-down tableaux. As corollaries, we obtain identities between numbers of standard Young tableaux and numbers of (marked) vacillating tableaux.

math.CO

More minor summation formulae

We prove determinantal-Pfaffian formulae that simultaneously generalise the Pfaffian minor summation formula of Ishikawa and Wakayama and Byun's recent minor summation formula. These formulae are based on factorisation formulae for the determinant of the sum of a skew-symmetric matrix and a rank-1 matrix. Applications include a Cauchy-type identity for skew Schur functions.

math.CO

A positivity conjecture for a quotient of $q$-binomial coefficients

We conjecture that, if the quotient of two $q$-binomial coefficients with the same top argument is a polynomial, then it has non-negative coefficients. We summarise what is known about the conjecture and prove it in two non-trivial cases. Moreover, we move ahead to extend our conjecture to D. Stanton's fake Gaussian sequences. As a corollary we obtain that a polynomial that is conjectured to be a cyclic sieving polynomial for Kreweras words [S. Hopkins and M. Rubey, Selecta Math. (N.S.) 28 (2022), Paper No. 10] is indeed a polynomial with non-negative integer coefficients.

math.CO

Schur log-concavity and the quantum Pascal triangle

We say a sequence $f_0, f_1, f_2, \ldots$ of symmetric functions is Schur log-concave if $f_n^2 - f_{n-1}f_{n+1}$ is Schur positive for all $n\ge1$. We conjecture that a very general class of sequences of Schur functions satisfies this property, and show it for sequences of Schur functions indexed by partitions with growing first part and column. Our findings are related to work of Lam, Postnikov and Pylyavskyy on Schur positivity, and of Butler, Sagan, and the second author on $q$-log-concavity.

math.CO

On the Hilbert depth of monomial ideals

Let $S=K[x_1,\ldots,x_n]$ be the ring of polynomials over a field $K$. Given two monomial ideals $0\subset I\subsetneq J \subset S$, we present a new method to compute the Hilbert depth of $J/I$. As an application, we show that if $u\in S$ is a monomial regular of $S/I$, then $\operatorname{hdepth}(S/I)\geq \operatorname{hdepth}(S/(I,u))\geq \operatorname{hdepth}(S/I)-1.$ Also, we reprove the formula of the Hilbert depth of a squarefree Veronese ideal.

math.AC

A method for determining the mod-$p^k$ behaviour of recursive sequences

We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors [Electron. J. Combin. 8(2) (2012), Art. P37; arXiv:1107.2015] from $p=2$ to arbitrary primes. Our applications include congruences for numbers of non-crossing graphs and numbers of Kreweras walks modulo powers of~$3$, as well as congruences for Fuß-Catalan numbers and blossom tree numbers modulo powers of arbitrary primes.

math.CO

Bounded Littlewood identities for cylindric Schur functions

The identities which are in the literature often called ``bounded Littlewood identities" are determinantal formulas for the sum of Schur functions indexed by partitions with bounded height. They have interesting combinatorial consequences such as connections between standard Young tableaux of bounded height, lattice walks in a Weyl chamber, and noncrossing matchings. In this paper we prove affine analogs of the bounded Littlewood identities. These are determinantal formulas for sums of cylindric Schur functions. We also study combinatorial aspects of these identities. As a consequence we obtain an unexpected connection between cylindric standard Young tableaux and \( r \)-noncrossing and \( s \)-nonnesting matchings.

math.CO

Positive $m$-divisible non-crossing partitions and their Kreweras maps

We study positive $m$-divisible non-crossing partitions and their positive Kreweras maps. In classical types, we describe their combinatorial realisations as certain non-crossing set partitions. We also realise these positive Kreweras maps as pseudo-rotations on a circle, respectively on an annulus. We enumerate positive $m$-divisible non-crossing partitions in classical types that are invariant under powers of the positive Kreweras maps with respect to several parameters. In order to cope with the exceptional types, we develop a different combinatorial model in general type describing positive $m$-divisible non-crossing partitions that are invariant under powers of the positive Kreweras maps. We finally show that altogether these results establish several cyclic sieving phenomena.

math.CO

A generalization of conjugation of integer partitions

We exhibit, for any positive integer parameter $s$, an involution on the set of integer partitions of $n$. These involutions show the joint symmetry of the distributions of the following two statistics. The first counts the number of parts of a partition divisible by $s$, whereas the second counts the number of cells in the Ferrers diagram of a partition whose leg length is zero and whose arm length has remainder $s-1$ when dividing by $s$. In particular, for $s=1$ this involution is just conjugation. Additionally, we provide explicit expressions for the bivariate generating functions. Our primary motivation to construct these involutions is that we know only of two other "natural" bijections on integer partitions of a given size, one of which is the Glaisher-Franklin bijection sending the set of parts divisible by $s$, each divided by $s$, to the set of parts occurring at least $s$ times.

math.CO

Arithmetic properties of the Taylor coefficients of differentially algebraic power series

Let $f=\sum_{n=0}^\infty f_n x^n \in \overline{\mathbb Q}[[x]$ be a solution of an algebraic differential equation $Q(x,y(x), \ldots, y^{(k)}(x))=0$, where $Q$ is a multivariate polynomial with coefficients in $\overline{\mathbb Q}$. The sequence $(f_n)_{n\ge 0}$ satisfies a non-linear recurrence, whose expression involves a polynomial $M$ of degree $s$. When the equation is linear, $M$ is its indicial polynomial at the origin. We show that when $M$ is split over $\mathbb Q$, there exist two positive integers $δ$ and $ν$ such that the denominator of $f_n$ divides $δ^{n+1}(νn+ν)!^{2s}$ for all $n\ge 0\ $, generalizing a well-known property when the equation is linear. This proves in this case a strong form of a conjecture of Mahler that Pólya--Popken's upper bound $n^{\mathcal{O}(n\log(n))}$ for the denominator of $f_n$ is not optimal. This also enables us to make Sibuya and Sperber's bound $\vert f_n\vert_v\le e^{\mathcal{O}(n)}$, for all finite places $v$ of $\overline{\mathbb Q}$, explicit in this case. Our method is completely effective and rests upon a detailed $p$-adic analysis of the above mentioned non-linear recurrences. Finally, we present various examples of differentially algebraic functions for which the associated polynomial $M$ is split over $\mathbb Q$, among which are Weierstraß' elliptic $\wp$ function, solutions of Painlevé equations, and Lagrange's solution to Kepler's equation.

math.NT

Refined enumeration of two-rowed set-valued standard tableaux via two-coloured Motzkin paths

We derive formulae for the number of set-valued standard tableaux of two-rowed shapes, keeping track of the total number of entries, the number of entries in the first row, and the number of entries in the second row. Key in the proofs is a bijection with two-coloured Motzkin paths followed by generating function computations and coefficient extraction helped by the Lagrange inversion formula.

math.CO

The congruence properties of Romik's sequence of Taylor coefficients of Jacobi's theta function $θ_3$

In [Ramanujan J. 52 (2020), 275-290], Romik considered the Taylor expansion of Jacobi's theta function $θ_3(q)$ at $q=e^{-π}$ and encoded it in an integer sequence $(d(n))_{n\ge0}$ for which he provided a recursive procedure to compute the terms of the sequence. He observed intriguing behaviour of $d(n)$ modulo primes and prime powers. Here we prove (1) that $d(n)$ eventually vanishes modulo any prime power $p^e$ with $p\equiv3$ (mod 4), (2) that $d(n)$ is eventually periodic modulo any prime power $p^e$ with $p\equiv1$ (mod 4), and (3) that $d(n)$ is purely periodic modulo any 2-power $2^e$. Our results also provide more detailed information on period length, respectively from when on the sequence vanishes or becomes periodic. The corresponding bounds may not be optimal though, as computer data suggest. Our approach shows that the above congruence properties hold at a much finer, polynomial level.

math.NT

Proof of Two Multivariate $q$-Binomial Sums Arising in Gromov-Witten Theory

We prove two multivariate $q$-binomial identities conjectured by Bousseau, Brini and van Garrel [Geom. Topol. 28 (2024), 393-496, arXiv:2011.08830] which give generating series for Gromov-Witten invariants of two specific log Calabi-Yau surfaces. The key identity in all the proofs is Jackson's $q$-analogue of the Pfaff-Saalschütz summation formula from the theory of basic hypergeometric series.

math.CA

Determinant evaluations inspired by Di Francesco's determinant for twenty-vertex configurations

In his work on the twenty vertex model, Di Francesco [Electron. J. Combin. 28(4) (2021), Paper No. 4.38] found a determinant formula for the number of configurations in a specific such model, and he conjectured a closed form product formula for the evaluation of this determinant. We prove this conjecture here. Moreover, we actually generalize this determinant evaluation to a one-parameter family of determinant evaluations, and we present many more determinant evaluations of similar type - some proved, some left open as conjectures.

math.CO