We develop a theory of the field of double Laurent series, iterated Laurent series, and
Malcev-Neumann series that applies to most constant term evaluation problems. These include (i) …

Write p 1 p 2 …p m for the permutation matrix [Formula: see text] . Let S n (M) be the set of n×n
permutation matrices which do not contain the m×m permutation matrix M as a submatrix. …

… Guoce Xin … Xin et al. provided an algorithm, called Algorithm CTGTodd, to compute \(\mathop
{\textrm{CT}}\limits _x {\hat{g}}_i \pmod p\) for a suitable prime p with a good complexity …

In 2008, Haglund et al. [ 21 ] formulated a Compositional form of the Shuffle Conjecture of
Haglund et al. [ 20 ]. In very recent work, Gorsky and Negut, by combining their discoveries [ 19 …

This paper deals with evaluating constant terms of a special class of rational functions, the
Elliott-rational functions. The constant term of such a function can be read off immediately from …

We present a new reduction algorithm that simultaneously extends Hermite's reduction for
rational functions and the Hermite-like reduction for hyperexponential functions. It yields a …

In this paper, we establish a residue theorem for Malcev–Neumann series that requires few
constraints, and includes previously known combinatorial residue theorems as special cases…

Morris constant term identity is important due to its equivalence with the well-known Selberg
integral. We find a variation of the Morris constant term, denoted $h_n(t)$, in the study of the …

In this paper, we focus on knapsack cones, a specific type of simplicial cones that arise naturally
in the context of the knapsack problem $x_1 a_1 + \cdots + x_n a_n = a_0$. We present …

The Sylvester's denumerant \( d(t; \boldsymbol{a}) \) is a quantity that counts the number of
nonnegative integer solutions to the equation \( \sum_{i=1}^{N} a_i x_i = t \), where \( \…