English
Related papers

Related papers: A Generalization of the Ramanujan Polynomials and …

200 papers

Recently, Bradley studied partial sums of multiple q-zeta values and proved a duality result. In this paper, we present a generalization of his result.

Number Theory · Mathematics 2009-05-05 Gaku Kawashima

Bergeron--Ceballos--K\"ustner introduced the $q$-Fibonomial coefficients \( \qfibonom{m+n}{n}\), gave a combinatorial interpretation of the $q$-Fibonomial coefficients via a weighted path-domino tiling model, and conjectured that these…

Combinatorics · Mathematics 2026-05-14 Brendan B. Connelly , Ezekiel Ito , Thomas C. Martinez , Olha Shevchenko , Kacey Yang

Let $w_{n,k,m}$ be the number of Dyck paths of semilength $n$ with $k$ occurrences of $UD$ and $m$ occurrences of $UUD$. We establish in two ways a new interpretation of the numbers $w_{n,k,m}$ in terms of plane trees and internal nodes.…

Combinatorics · Mathematics 2024-03-04 Shishuo Fu , Jie Yang

A weighted bicolored plane tree is a bicolored plane tree whose edges are endowed with positive integral weights. The degree of a vertex is defined as the sum of the weights of the edges incident to this vertex. Using the theory of dessins…

Number Theory · Mathematics 2013-06-19 F. Pakovich , A. Zvonkin

The plane partition polynomial $Q_n(x)$ is the polynomial of degree $n$ whose coefficients count the number of plane partitions of $n$ indexed by their trace. Extending classical work of E.M. Wright, we develop the asymptotics of these…

Number Theory · Mathematics 2014-01-10 Robert Boyer , Daniel Parry

Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…

Combinatorics · Mathematics 2026-02-11 Helia Karisani , Mohammadreza Daneshvaramoli

Combinatoric formulas for cluster expansions have been improved many times over the years. Here we develop some new combinatoric proofs and extensions of the tree formulas of Brydges and Kennedy, and test them on a series of pedagogical…

High Energy Physics - Theory · Physics 2009-10-28 A. Abdesselam , V. Rivasseau

C.M. Bender and G. V. Dunne showed that linear combinations of words $q^{k}p^{n}q^{n-k}$, where $p$ and $q$ are subject to the relation $qp - pq = \imath$, may be expressed as a polynomial in the symbol $z = \tfrac{1}{2}(qp+pq)$. Relations…

Mathematical Physics · Physics 2015-06-15 T. Amdeberhan , V. De Angelis , A. Dixit , V. H. Moll , C. Vignat

We obtain a three-parameter $q$-series identity that generalizes two results of Chan and Mao. By specializing our identity, we derive new results of combinatorial significance in connection with $N(r, s, m, n)$, a function counting certain…

Combinatorics · Mathematics 2022-01-19 Atul Dixit , Ankush Goswami

We explore the theory of multiple zeta values (MZVs) and some of their $q$-generalisations. Multiple zeta values are numerical quantities that satisfy several combinatorial relations over the rationals. These relations include two…

Number Theory · Mathematics 2020-07-20 Abel Vleeshouwers

We show that subsets of $\mathbb{R}^n$ of large enough Hausdorff and Fourier dimension contain polynomial patterns of the form \begin{align*} ( x ,\, x + A_1 y ,\, \dots,\, x + A_{k-1} y ,\, x + A_k y + Q(y) e_n ), \quad x \in…

Classical Analysis and ODEs · Mathematics 2016-08-03 Kevin Henriot , Izabella Laba , Malabika Pramanik

Recently, Chapoton found a $q$-analog of Ehrhart polynomials, which are polynomials in $x$ whose coefficients are rational functions in $q$. Chapoton conjectured the shape of the Newton polygon of the numerator of the $q$-Ehrhart polynomial…

Combinatorics · Mathematics 2018-06-05 Jang Soo Kim , U-Keun Song

Pak and Panova recently proved that the $q$-binomial coefficient ${m+n \choose m}_q$ is a strictly unimodal polynomial in $q$ for $m,n \geq 8$, via the representation theory of the symmetric group. We give a direct combinatorial proof of…

Combinatorics · Mathematics 2014-03-11 Vivek Dhand

We discuss two combinatorical ways of generalizing the definition of expander graphs and Ramanujan graphs, to quotients of buildings of higher dimension. The two possible definitions are equivalent for affine buildings, giving the notion of…

Combinatorics · Mathematics 2017-01-03 Amitay Kamber

In 2008 Br\"and\'en proved a $(p,q)$-analogue of the $\gamma$-expansion formula for Eulerian polynomials and conjectured the divisibility of the $\gamma$-coefficient $\gamma_{n,k}(p,q)$ by $(p+q)^k$. As a follow-up, in 2012 Shin and Zeng…

Combinatorics · Mathematics 2020-03-23 Qiong Qiong Pan , Jiang Zeng

In this paper, we give a purely bijective proof that two different partition classes that are both combinatorial interpretations of the partition function $p_\nu(n)$, a partition function related to the third order mock theta function…

Combinatorics · Mathematics 2020-07-21 A. S. Andersen

The coinvariant algebra is a quotient of the polynomial ring $\mathbb{Q}[x_1,\ldots,x_n]$ whose algebraic properties are governed by the combinatorics of permutations of length $n$. A word $w = w_1 \dots w_n$ over the positive integers is…

Combinatorics · Mathematics 2021-04-02 Daniël Kroes , Brendon Rhoades

Gorsky and Negut introduced operators $Q_{m,n}$ on symmetric functions and conjectured that, in the case where $m$ and $n$ are relatively prime, the expression ${Q}_{m,n}(1)$ is given by the Hikita polynomial ${H}_{m,n}[X;q,t]$. Later,…

Combinatorics · Mathematics 2020-04-14 Dun Qiu , Jeffrey Remmel

We investigate the sequence $(P_{n}(z))_{n=0}^{\infty}$ of random polynomials generated by the three-term recurrence relation $P_{n+1}(z)=z P_{n}(z)-a_{n} P_{n-1}(z)$, $n\geq 1$, with initial conditions $P_{\ell}(z)=z^{\ell}$, $\ell=0, 1$,…

Probability · Mathematics 2023-08-30 Abey López García , Vasiliy A. Prokhorov

The ternary betweenness relation of a tree, B(x,y,z) expresses that y is on the unique path between x and z. This notion can be extended to order-theoretic trees defined as partial orders such that the set of nodes larger than any node is…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle