English
Related papers

Related papers: Two $t$-analogues of the tree inversion enumerator

200 papers

$U(N)^{\otimes r} \otimes O(N)^{\otimes q}$ invariants are constructed by contractions of complex tensors of order $r+q$, also denoted $(r,q)$. These tensors transform under $r$ fundamental representations of the unitary group $U(N)$ and…

High Energy Physics - Theory · Physics 2024-04-26 Remi Cocou Avohou , Joseph Ben Geloun , Reiko Toriumi

A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a signed enumeration of derangements. We show that both…

Combinatorics · Mathematics 2017-09-13 Matthieu Josuat-Vergès

In the space of bounded real-valued functions on the interval $(0,1)$, we study the convergent sequences of $q$-analogues of multiple zeta values which do not converge to $0$. And we obtain the derived sets of the set of some $q$-analogue…

Number Theory · Mathematics 2019-10-04 Zhonghua Li , Ende Pan

The equitable presentation of $U_q(\mathfrak{sl}_2)$ was introduced in 2006 by Ito, Terwilliger, and Weng. This presentation involves some generators $x, y, y^{-1}, z$. It is known that $\{x^r y^s z^t : r, t \in \mathbb{N}, s \in…

Quantum Algebra · Mathematics 2015-06-09 Alison Gordon Lynch

Applying the $q$-Zeilberger algorithm, we establish a unified $q$-analogue of the (C.2) and (G.2) supercongruences of Van Hamme, which can be viewed as a refinement of several previously known results. As consequences, we obtain a…

Number Theory · Mathematics 2026-03-30 Song-Xiao Li , Su-Dan Wang

This note is dedicated to presenting a polynomial analogue of $(n+1)!C_n=2^n(2n-1)!!$ (with $C_n$ as the $n$-th Catalan number) in the context of labeled plane trees and increasing plane trees, based on the definition of improper edges in…

Combinatorics · Mathematics 2025-10-06 Lora R. Du , Kathy Q. Ji , Dax T. X. Zhang

We study inhomogeneous $q$-Whittaker polynomials which extend both $q$-Whittaker and stable Grothendieck polynomials. We prove that inhomogeneous $q$-Whittaker polynomials (in countably many variables) form a basis of certain commutative…

Combinatorics · Mathematics 2026-05-14 Ajeeth Gunna , Damir Yeliussizov

We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

Generalising the work of Dey, we define the notion of ultra-synchronicity of sequences of real numbers. Let $B_{n,k},C_{n,k},P_{n,k},Q_{n,k}$ be the number of even permutations with $k$ descents, odd permutations with $k$ descents, even…

Combinatorics · Mathematics 2024-04-03 Umesh Shankar

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

Combinatorics · Mathematics 2025-03-05 David Serena , William J Buchanan

The alternating (zigzag) numbers $A_n$, counting the ascending alternating permutations of $\left\{1,\cdots,n\right\}$ and defined by the exponential generating function $\tan x+\sec x$, admit several classical combinatorial and analytic…

Combinatorics · Mathematics 2026-02-18 Jean-Christophe Pain

We give an algorithm for computing the Teichm\"uller polynomial for a certain class of fibered alternating links associated to trees. Furthermore, we exhibit a mutant pair of such links distinguished by the Teichm\"uller polynomial.

Geometric Topology · Mathematics 2020-03-27 Robert Billet , Livio Liechti

We show the classical $q$-Stirling numbers of the second kind can be expressed compactly as a pair of statistics on a subset of restricted growth words. The resulting expressions are polynomials in $q$ and $1+q$. We extend this enumerative…

Combinatorics · Mathematics 2017-05-30 Yue Cai , Margaret A. Readdy

Necessary and sufficient conditions are given for the similarity between two perturbations of the (backward) shift by rank one operators, under certain assumptions on the perturbations. The proof of similarity is based on an explicit…

Functional Analysis · Mathematics 2012-07-17 Leonel Robert

Let $T$ be a tree on $n$ vertices. We can regard the edges of $T$ as transpositions of the vertex set; their product (in any order) is a cyclic permutation. All possible cyclic permutations arise (each exactly once) if and only if the tree…

Combinatorics · Mathematics 2020-10-29 Peter J. Cameron , Liam Stott

We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for the two types of objects as well as some new results. We also…

Combinatorics · Mathematics 2008-03-10 Svante Janson

We study a class of representations of the Cuntz algebras O_N, N=2,3,..., acting on L^2(T) where T=R/2\pi Z. The representations arise in wavelet theory, but are of independent interest. We find and describe the decomposition into…

funct-an · Mathematics 2008-02-03 Ola Bratteli , Palle E. T. Jorgensen

We express the weight enumerators of self-dual and doubly even (Type II for short) codes of length $24$ with a specified basis. As a consequence, we present some congruence relations among the weight enumerators.

Combinatorics · Mathematics 2023-03-15 Shoyu Nagaoka , Manabu Oura

We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…

Combinatorics · Mathematics 2019-10-30 Olivier Bodini , Antoine Genitrini , Bernhard Gittenberger , Stephan Wagner

Let $p(m)$ (respectively, $q(m)$) be the maximum number $k$ such that any tree with $m$ edges can be transformed by contracting edges (respectively, by removing vertices) into a caterpillar with $k$ edges. We derive closed-form expressions…

Combinatorics · Mathematics 2021-09-14 Rain Jiang , Kai Jiang , Minghui Jiang