Searcharxiv⌕ Search

arXiv subjects

Tewodros Amdeberhan

Publications and source records attributed to Tewodros Amdeberhan.

At least 19 recordsLinked to original sources

Bergeron's conjecture & a tale of two binomial coefficients

Bergeron's conjecture states that, if $1\leq a<b<c<d$ are integers with $ad=bc$, then one has the coefficient-wise inequality ${\binom{b+c}b}_q \ge {\binom{a+d}a}_q$ among two Gaussian polynomials. It originated in algebraic combinatorics and is wide open. The corresponding inequality for binomial coefficients (i.e., the case $q=1$) must be known to experts, but we could not find it in the literature. We give two proofs, each generalizing the statement in a separate direction. Binomial coefficients (and Gaussian polynomials) are fundamental combinatorial objects, and so one naturally hopes to see a combinatorial proof of this inequality. However, this seems hard to come by. We nevertheless give a combinatorial proof of a special case.

math.CO↗

Sprout Symmetric Functions: Part 1

A \emph{sprout sequence} is a sequence $\frakr=(R_0=1,R_1,R_2,\dots)$ of symmetric functions in the variables $\bmx=(x_1,x_2,\dots)$ over a field $K$ generated from a power series $F(t)=1+a_1t+a_2t^2+\cdots$ by the rule $\sum_{n\geq 0}R_nt^n = \prod_{i\geq 1} F(x_it)$. The power series $F(t)$ is called the \emph{seed} of $\frakr$. This concept originated in the work of Littlewood and Richardson (though not with the name ``sprout sequence''), and numerous examples of sprout sequences have appeared in the literature. They are related to chromatic Tutte polynomials of complete graphs and complete hypergraphs, binomial posets, upper homogeneous (upho) posets, topological genera, etc. We first develop the basic theory of sprout sequences and then look at the special case $F(t)=\sec(\sqrt{t})$. We give five characterizations of sprout sequences and consider the expansion of sprout symmetric functions in terms of well-known symmetric function bases. The Schur positivity, elementary symmetric function positivity, and complete homogeneous symmetric function positivity of $R_n$ for all $n$ are completely characterized using the Edrei-Thoma theorem from the theory of total positivity. The seed $F(t)=\sec(\sqrt{t})$ is especially interesting. The expansion of $R_n$ in the power sum or monomial basis is related to alternating permutations. The Schur function expansion is related to standard Young skew tableaux. The expansion in terms of the complete symmetric functions has nonnegative integer coefficients, but we don't know a combinatorial interpretation. Finally we give a formula for $R_n$ as a sum of chromatic symmetric functions of interval orders.

math.CO↗

Quasimodular forms arising from Jacobi's theta function and special symmetric polynomials

Ramanujan derived a sequence of even weight $2n$ quasimodular forms $U_{2n}(q)$ from derivatives of Jacobi's weight $3/2$ theta function. Using the generating function for this sequence, one can construct sequences of quasimodular forms of all nonnegative integer weights with minimal input: a weight 1 modular form and a power series $F(X)$. Using the weight 1 form $θ(q)^2$ and $F(X)=\exp(X/2)$, we obtain a sequence $\{Y_n(q)\}$ of weight $n$ quasimodular forms on $Γ_0(4)$ whose symmetric function avatars $\widetilde{Y}_n(\pmb{x}^k)$ are the symmetric polynomials $T_n(\pmb{x}^k)$ that arise naturally in the study of syzygies of numerical semigroups. With this information, we settle two conjectures about the $T_n(\pmb{x}^k).$ Finally, we note that these polynomials are systematically given in terms of the Borel-Hirzebruch $\widehat{A}$-genus for spin manifolds, where one identifies power sum symmetric functions $p_i$ with Pontryagin classes.

math.NT↗

The Challenge of Computing Geode Numbers

In a fascinating recent American Mathematical Monthly article, Norman Wildberger and Dean Rubine introduced a new kind of combinatorial numbers, that they aptly named the ``Geode numbers''. While their definition is simple, these numbers are surprisingly hard to compute, in general. While the two-dimensional case has a nice closed-form expression, that make them easy to compute, already the three-dimensional case poses major computational challenges that we do meet, combining experimental mathematics and the holonomic ansatz. Alas, things get really complicated in four and higher dimensions, and we are unable to efficiently compute, for example, the $1000$-th term of the four-dimensional diagonal Geode sequence. A donation of $100$ US dollars to the OEIS, in honor of the first person to compute this number, is offered.

math.CO↗

Some topological genera and Jacobi forms

We revisit and elucidate the $\widehat{A}$-genus, Hirzebruch's $L$-genus and Witten's $W$-genus, cobordism invariants of special classes of manifolds. After slight modification, involving Hecke's trick, we find that the $\widehat{A}$-genus and $L$-genus arise directly from Jacobi's theta function. For every $k\geq 0,$ we obtain exact formulas for the quasimodular expressions of $\widehat{A}_k$ and $L_k$ as ``traces'' of partition Eisenstein series \[ \widehat{\mathcal{A}}_k(τ)= \operatorname{Tr}_k(ϕ_{\widehat{A}};τ)\ \ \ \ \ \ {\text {and}}\ \ \ \ \ \ \mathcal{L}_k(τ)= \operatorname{Tr}_k(ϕ_L;τ), \] which are easily converted to the original topological expressions. Surprisingly, Ramanujan defined twists of the $\widehat{\mathcal{A}}_k(τ)$ in his ``lost notebook'' in his study of derivatives of theta functions, decades before Borel and Hirzebruch rediscovered them in the context of spin manifolds. In addition, we show that the nonholomorphic $G_2^{\star}$-completion of the characteristic series of the Witten genus is the Jacobi theta function avatar of the $\widehat{A}$-genus.

math.NT↗

Lambert series and double Lambert series

We consider relationships between classical Lambert series, multiple Lambert series and classical $q$-series of the Rogers-Ramanujan type. We conclude with a contemplation on the Andrews-Dixit-Schultz-Yee conjecture.

math.NT↗

Proofs Of Three Geode Conjectures

In the May 2025 issue of the Amer. Math. Monthly, Norman J. Wildberger and Dean Rubine intoduced a new kind of multi-indexed numbers, that they call `Geode numbers', obtained from the Hyper-Catalan numbers. They posed three intriguing conjectures about them, that are proved in this note.

math.CO↗

From crank to congruences

In this paper, we investigate the arithmetic properties of the difference between the number of partitions of a positive integer $n$ with even crank and those with odd crank, denoted $C(n)=c_e(n)-c_o(n)$. Inspired by Ramanujan's classical congruences for the partition function $p(n)$, we establish a Ramanujan-type congruence for $C(n)$, proving that $C(5n+4) \equiv 0 \pmod{5}$. Further, we study the generating function $\sum\limits_{n=0}^\infty a(n)\, q^n = \frac{(-q; q)^2_\infty}{(q; q)_\infty}$, which arises naturally in this context, and provide multiple combinatorial interpretations for the sequence $a(n)$. We then offer a complete characterization of the values $a(n) \mod 2^m$ for $m = 1, 2, 3, 4$, highlighting their connection to generalized pentagonal numbers. Using computational methods and modular forms, we also derive new identities and congruences, including $a(7n+2) \equiv 0 \pmod{7}$, expanding the scope of partition congruences in arithmetic progressions. These results build upon classical techniques and recent computational advances, revealing deep combinatorial and modular structure within partition functions.

math.NT↗

Traces of partition Eisenstein series

We study "partition Eisenstein series", extensions of the Eisenstein series $G_{2k}(τ),$ defined by $$λ=(1^{m_1}, 2^{m_2},\dots, k^{m_k}) \vdash k \ \ \ \ \ \longmapsto \ \ \ \ \ G_λ(τ):= G_2(τ)^{m_1} G_4(τ)^{m_2}\cdots G_{2k}(τ)^{m_k}. $$ For functions $ϕ: \mathcal{P}\rightarrow \mathbb{C}$ on partitions, the weight $2k$ "partition Eisenstein trace" is the quasimodular form $$ {\mathrm{Tr}}_k(ϕ;τ):=\sum_{λ\vdash k} ϕ(λ)G_λ(τ). $$ These traces give explicit formulas for some well-known generating functions, such as the $k$th elementary symmetric functions of the inverse points of 2-dimensional complex lattices $\mathbb{Z}\oplus \mathbb{Z}τ,$ as well as the $2k$th power moments of the Andrews-Garvan crank function. To underscore the ubiquity of such traces, we show that their generalizations give the Taylor coefficients of generic Jacobi forms with torsional divisor.

math.NT↗

Recursive Formulas for MacMahon and Ramanujan $q$-series

In the present work, we extend current research in a nearly-forgotten but newly revived topic, initiated by P. A. MacMahon, on a generalized notion which relates the divisor sums to the theory of integer partitions and two infinite families of $q$-series by Ramanujan. Our main emphasis will be on explicit representations for a variety of $q$-series, studied primarily by MacMahon and Ramanujan, with an eye towards their modular properties and their proper place in the ring of quasimodular forms of level one and level two.

math.NT↗

Further study on MacMahon-type sums of divisors

This paper is devoted to the study of $$ U_t(a,q):=\sum_{1\leq n_1<n_2<\cdots<n_t}\frac{q^{n_1+n_2+\cdots+n_t}}{(1+aq^{n_1}+q^{2n_1})(1+aq^{n_2}+q^{2n_2})\cdots(1+aq^{n_t}+q^{2n_t})} $$ when $a$ is one of $0, \pm 1, \pm2$. The idea builds on our previous treatment of the case $a=-2$. It is shown that all these functions lie in the ring of quasi-modular forms. Among the more surprising findings is $$U_2(1,q)=\sum_{n\geq1} \frac{q^{3n}}{(1-q^{3n})^2}.$$

math.NT↗

Derivatives of theta functions as Traces of Partition Eisenstein series

In his "lost notebook'', Ramanujan used iterated derivatives of two theta functions to define sequences of $q$-series $\{U_{2t}(q)\}$ and $\{V_{2t}(q)\}$ that he claimed to be quasimodular. We give the first explicit proof of this claim by expressing them in terms of "partition Eisenstein series'', extensions of the classical Eisenstein series $E_{2k}(q)$ defined by $$λ=(1^{m_1}, 2^{m_2},\dots, n^{m_n}) \vdash n \ \ \ \ \ \longmapsto \ \ \ \ \ E_λ(q):= E_2(q)^{m_1} E_4(q)^{m_2}\cdots E_{2n}(q)^{m_n}. $$ For functions $ϕ: \mathcal{P}\mapsto \mathbb{C}$ on partitions, the weight $2n$ partition Eisenstein trace is $$ \text{Tr}_n(ϕ;q):=\sum_{λ\vdash n} ϕ(λ)E_λ(q). $$ For all $t$, we prove that $U_{2t}(q)=\text{Tr}_t(ϕ_U;q)$ and $V_{2t}(q)=\text{Tr}_t(ϕ_V;q),$ where $ϕ_U$ and $ϕ_V$ are natural partition weights, giving the first explicit quasimodular formulas for these series.

math.NT↗

Congruences for sums of MacMahon's $q$-Catalan polynomials

One variant of the $q$-Catalan polynomials is defined in terms of Gaussian polynomials by $\mathcal{C}_k(q)=\genfrac{[}{]}{0pt}{}{2k}{k}_q-q\genfrac{[}{]}{0pt}{}{2k}{k+1}_q$. Liu studied congruences of the form $\sum_{k=0}^{n-1} q^k\mathcal{C}_k$ modulo the cyclotomic polynomial $Φ_n(q)^2$, provided that $n\equiv\pm 1\pmod3$. Apparently the case $n\equiv 0\pmod3$ has been missing from the literature. It is our primary purpose to fill this gap by the current work. In addition, we discuss certain fascinating link to Dirichlet character sum identities.

math.NT↗

Arithmetic properties for generalized cubic partitions and overpartitions modulo a prime

A cubic partition is an integer partition wherein the even parts can appear in two colors. In this paper, we introduce the notion of generalized cubic partitions and prove a number of new congruences akin to the classical Ramanujan-type. We emphasize two methods of proofs, one elementary (relying significantly on functional equations) and the other based on modular forms. We close by proving analogous results for generalized overcubic partitions.

math.NT↗

Generalized cubic partitions

A cubic partition consists of partition pairs $(λ,μ)$ such that $\vertλ\vert+\vertμ\vert=n$ where $μ$ involves only even integers but no restriction is placed on $λ$. This paper initiates the notion of generalized cubic partitions and will prove a number of new congruences akin to the classical Ramanujan-type. The tools emphasize three methods of proofs. The paper concludes with a conjecture on the rarity of the aforementioned Ramanujan-type congruences.

math.NT↗

Hook lengths in self-conjugate partitions

In 2010, G.-N. Han obtained the generating function for the number of size $t$ hooks among integer partitions. Here we obtain these generating functions for self-conjugate partitions, which are particularly elegant for even $t$. If $n_t(λ)$ is the number of size $t$ hooks in a partition $λ,$ then for even $t$ we have $$\sum_{λ\in \mathcal{SC}} x^{n_t(λ)} q^{\vertλ\vert} = (-q;q^2)_{\infty} \cdot ((1-x^2)q^{2t};q^{2t})_{\infty}^{\frac{t}2}. $$ As a consequence, if $a_t^*(n)$ is the number of such hooks among the self-conjugate partitions of $n,$ then for even $t$ we obtain the simple formula $$ a_t^*(n)=t\sum_{j\geq 1} q^*(n-2tj), $$ where $q^*(m)$ is the number of partitions of $m$ into distinct odd parts. As a corollary, we find that $t\mid a_t^*(n),$ which confirms a conjecture of Ballantine, Burson, Craig, Folsom, and Wen.

math.CO↗

MacMahon's sums-of-divisors and allied $q$-series

Here we investigate the $q$-series \begin{align*} \mathcal{U}_a(q)&=\sum_{n=0}^{\infty} MO(a;n)q^n&:=\sum_{0< k_1<k_2<\cdots<k_a} \frac{q^{k_1+k_2+\cdots+k_a}}{(1-q^{k_1})^2(1-q^{k_2})^2\cdots(1-q^{k_a})^2},\\ \mathcal{U}_a^{\star}(q)&=\sum_{n=0}^{\infty}M(a;n)q^n&:=\sum_{1\leq k_1\leq k_2\leq\cdots\leq k_a} \frac{q^{k_1+k_2+\cdots+k_a}}{(1-q^{k_1})^2(1-q^{k_2})^2\cdots(1-q^{k_a})^2}. \end{align*} MacMahon introduced the $\mathcal{U}_a(q)$ in his seminal work on partitions and divisor functions. Recent works show that these series are sums of quasimodular forms with weights $\leq 2a.$ We make this explicit by describing them in terms of Eisenstein series. We use these formulas to obtain explicit and general congruences for the coefficients $MO(a;n)$ and $M(a;n).$ Notably, we prove the conjecture of Amdeberhan-Andrews-Tauraso as the $m=0$ special case of the infinite family of congruences $$ MO(11m+10; 11n+7)\equiv 0\pmod{11}, $$ and we prove that $$ MO(17m+16; 17n+15)\equiv 0\pmod{17}. $$ We obtain further formulae using the limiting behavior of these series. For $n\leq a+\binom{a+1}2,$ we obtain a ``hook length'' formulae for $MO(a;n)$, and for $n\leq 2a$, we find that $M(a;n)=\binom{a+n-1}{n-a}+\binom{a+n-2}{n-a-1}.$

math.NT↗