Searcharxiv⌕ Search

arXiv subjects

Guoce Xin

Publications and source records attributed to Guoce Xin.

At least 91 records · Page 5Linked to original sources
arXiv2008

Invariants, Kronecker Products, and Combinatorics of Some Remarkable Diophantine Systems (Extended Version)

This work lies across three areas (in the title) of investigation that are by themselves of independent interest. A problem that arose in quantum computing led us to a link that tied these areas together. This link consists of a single formal power series with a multifaced interpretation. The deeper exploration of this link yielded results as well as methods for solving some numerical problems in each of these separate areas.

math.CO↗
arXiv2008

A Unified Elementary Approach to the Dyson, Morris, Aomoto, and Forrester Constant Term Identities

We introduce an elementary method to give unified proofs of the Dyson, Morris, and Aomoto identities for constant terms of Laurent polynomials. These identities can be expressed as equalities of polynomials and thus can be proved by verifying them for sufficiently many values, usually at negative integers where they vanish. Our method also proves some special cases of the Forrester conjecture.

math.CO↗
arXiv2007

Proof of the Somos-4 Hankel Determinants Conjecture

By considering the fundamental equation $x=y-y^2=z-z^3$, Somos conjectured that the Hankel determinants for the generating series $y(z)$ are the Somos-4 numbers. We prove this conjecture by using the quadratic transformation for Hankel determinants of Sulanke and Xin.

math.CO↗
arXiv2007

Two Coefficients of the Dyson Product

In this paper, the closed-form expressions for the coefficients of $\frac{x_r^2}{x_s^2}$ and $\frac{x_r^2}{x_sx_t}$ in the Dyson product are found by applying an extension of Good's idea. As onsequences, we find several interesting Dyson style constant term identities.

math.CO↗
arXiv2007

Permutations with Extremal number of Fixed Points

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting permutations we study their generating polynomials by number of excedances. Several techniques are used: Desarmenien's desarrangement combinatorics, Gessel's hook-factorization and the analytical properties of two new permutation statistics "DEZ" and "lec". Explicit formulas for the maximal case are derived by using symmetric function tools.

math.CO↗
arXiv2007

A Family of $q$-Dyson Style Constant Term Identities

By generalizing Gessel-Xin's Laurent series method for proving the Zeilberger-Bressoud $q$-Dyson Theorem, we establish a family of $q$-Dyson style constant term identities. These identities give explicit formulas for certain coefficients of the $q$-Dyson product, including three conjectures of Sills' as special cases and generalizing Stembridge's first layer formulas for characters of $SL(n,\mathbb{C})$.

math.AC↗
arXiv2007

Determinant Formulas Relating to Tableaux of Bounded Height

Chen et al. recently established bijections for $(d+1)$-noncrossing/ nonnesting matchings, oscillating tableaux of bounded height $d$, and oscillating lattice walks in the $d$-dimensional Weyl chamber. Stanley asked what is the total number of such tableaux of length $n$ and of any shape. We find a determinant formula for the exponential generating function. The same idea applies to prove Gessel's remarkable determinant formula for permutations with bounded length of increasing subsequences. We also give short algebraic derivations for some results of the reflection principle.

math.CO↗
arXiv2006

Hankel Determinants for Some Common Lattice Paths

For a single value of $\ell$, let $f(n,\ell)$ denote the number of lattice paths that use the steps $(1,1)$, $(1,-1)$, and $(\ell,0)$, that run from $(0,0)$ to $(n,0)$, and that never run below the horizontal axis. Equivalently, $f(n,\ell)$ satisfies the quadratic functional equation $F(x) = \sum_{n\ge 0}f(n,\ell) x^n = 1+x^{\ell}F(x)+x^2F(x)^2.$ Let $H_n$ denote the $n$ by $n$ Hankel matrix, defined so that $[H_n]_{i,j} = f(i+j-2,\ell)$. Here we investigate the values of such determinants where $\ell = 0,1,2,3$. For $\ell = 0,1,2$ we are able to employ the Gessel-Viennot-Lindström method. For the case $\ell=3$, the sequence of determinants forms a sequence of period 14, namely, $$ (\det(H_n))_{n \ge 1} = (1,1,0,0,-1,-1,-1,-1,-1,0,0,1,1,1,1,1,0,0,-1,-1,-1,...)$$ For this case we are able to use the continued fractions method recently introduced by Gessel and Xin. We also apply this technique to evaluate Hankel determinants for other generating functions satisfying a certain type of quadratic functional equation.

math.CO↗
arXiv2006

On partitions avoiding 3-crossings

A partition on $[n]$ has a crossing if there exists $i\_1<i\_2<j\_1<j\_2$ such that $i\_1$ and $j\_1$ are in the same block, $i\_2$ and $j\_2$ are in the same block, but $i\_1$ and $i\_2$ are not in the same block. Recently, Chen et al. refined this classical notion by introducing $k$-crossings, for any integer $k$. In this new terminology, a classical crossing is a 2-crossing. The number of partitions of $[n]$ avoiding 2-crossings is well-known to be the $n$th Catalan number $C\_n={{2n}\choose n}/(n+1)$. This raises the question of counting $k$-noncrossing partitions for $k\ge 3$. We prove that the sequence counting 3-noncrossing partitions is P-recursive, that is, satisfies a linear recurrence relation with polynomial coefficients. We give explicitly such a recursion. However, we conjecture that $k$-noncrossing partitions are not P-recursive, for $k\ge 4$.

math.CO↗
arXiv2005

The Generating Function of Ternary Trees and Continued Fractions

Michael Somos conjectured a relation between Hankel determinants whose entries $\frac 1{2n+1}\binom{3n}n$ count ternary trees and the number of certain plane partitions and alternating sign matrices. Tamm evaluated these determinants by showing that the generating function for these entries has a continued fraction that is a special case of Gauss's continued fraction for a quotient of hypergeometric series. We give a systematic application of the continued fraction method to a number of similar Hankel determinants. We also describe a simple method for transforming determinants using the generating function for their entries. In this way we transform Somos's Hankel determinants to known determinants, and we obtain, up to a power of 3, a Hankel determinant for the number of alternating sign matrices. We obtain a combinatorial proof, in terms of nonintersecting paths, of determinant identities involving the number of ternary trees and more general determinant identities involving the number of $r$-ary trees.

math.CO↗
arXiv2005

A Generalization of Stanley's Monster Reciprocity Theorem

By studying the reciprocity property of linear Diophantine systems in light of Malcev-Neumann series, we present in this paper a new approach to and a generalization of Stanley's monster reciprocity theorem. A formula for the "error term" is given in the case when the system does not have the reciprocity property. We also give a short proof of Stanley's reciprocity theorem for linear homogeneous Diophantine systems.

math.CO↗
arXiv2005

A Residue Theorem for Malcev-Neumann Series

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. Our residue theorem identifies the residues of two formal series that are related by a change of variables. We obtain simple conditions for when a change of variables is possible, and find that the two related formal series in fact belong to two different fields of Malcev-Neumann series. The multivariate Lagrange inversion formula is easily derived and Dyson's conjecture is given a new proof and generalized.

math.CO↗
arXiv2004

Constructing All Magic Squares of Order Three

We find by applying MacMahon's partition analysis that all magic squares of order three, up to rotations and reflections, are of two types, each generated by three basis elements. A combinatorial proof of this fact is given.

math.CO↗
arXiv2004

Counting Lattice Paths By Gessel Pairs

We count a large class of lattice paths by using factorizations of free monoids. Besides the classical lattice paths counting problems related to Catalan numbers, we give a new approach to the problem of counting walks on the slit plane (walks avoid a half line) that was first solved by Bousquet-Mélou and Schaeffer. We also solve a problem about walks in the half plane avoiding a half line by subsequently applying the factorizations of two different Gessel pairs, giving a generalization of a result of Bousquet-Mélou.

math.CO↗
arXiv2004

A Fast Algorithm for MacMahon's Partition Analysis

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 its partial fraction decomposition. We combine the theory of iterated Laurent series and a new algorithm for partial fraction decompositions to obtain a fast algorithm for MacMahon's Omega calculus, which (partially) avoids the "run-time explosion" problem when eliminating several variables. We discuss the efficiency of our algorithm by investigating problems studied by Andrews and his coauthors; our running time is much less than that of their Omega package.

math.CO↗
arXiv2004

A Fast Algorithm for Partial Fraction Decompositions

We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the rational function. The new algorithms use less storage space, and are suitable for parallel programming. We also discuss full partial fraction decompositions.

math.CO↗