Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Guoce Xin"'
Autor:
Guoce Xin, Terence Y. J. Zhang
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AJ,..., Iss Proceedings (2008)
Schützenberger's theorem for the ordinary RSK correspondence naturally extends to Chen et. al's correspondence for matchings and partitions. Thus the counting of bilaterally symmetric $k$-noncrossing partitions naturally arises as an analogue for in
Externí odkaz:
https://doaj.org/article/1ef74a3379db4eb6ae29b8c465826b1d
Autor:
Guoce Xin, Yueming Zhong
Publikováno v:
Advances in Applied Mathematics. 145:102479
Autor:
Guoce Xin, Yingrui Zhang
Publikováno v:
Advances in Applied Mathematics. 143:102455
A magic labelling of a graph $G$ with magic sum $s$ is a labelling of the edges of $G$ by nonnegative integers such that for each vertex $v\in V$, the sum of labels of all edges incident to $v$ is equal to the same number $s$. Stanley gave remarkable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3e688313a630e3c4bb53bcaf1e24792
http://arxiv.org/abs/2107.03161
http://arxiv.org/abs/2107.03161
Publikováno v:
Advances in Applied Mathematics. 102:83-112
Sulanke and Xin developed a continued fraction method that applies to evaluate Hankel determinants corresponding to quadratic generating functions. We use their method to give short proofs of Cigler's Hankel determinant conjectures, which were proved
Autor:
Guoce Xin
Publikováno v:
Journal of Combinatorics. 8:704-726
Autor:
Yueming Zhong, Guoce Xin
A polynomial $A(q)=\sum_{i=0}^n a_iq^i$ is said to be unimodal if $a_0\le a_1\le \cdots \le a_k\ge a_{k+1} \ge \cdots \ge a_n$. We investigate the unimodality of rational $q$-Catalan polynomials, which is defined to be $C_{m,n}(q)= \frac{1}{[n+m]} \l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eafeb3e536c6339e8e769a45fbb5d313
Autor:
Guoce Xin, Weigen Yan
Publikováno v:
Advances in Applied Mathematics. 121:102082
It is well known that the monomer-dimer problem is very interesting but difficult in statistical physics, which is equivalent to the enumerative problem of matchings of a graph in combinatorics. In this paper, using the generating function of edge su
Autor:
Adriano M. Garsia, Guoce Xin
Publikováno v:
Advances in Applied Mathematics. 116:101998
Our main contribution here is the discovery of a new family of standard Young tableaux $ {\cal T}^k_n$ which are in bijection with the family ${\cal D}_{m,n}$ of Rational Dyck paths for $m=k\times n\pm 1$ (the so called "Fuss" case). Using this famil
Publikováno v:
The Electronic Journal of Combinatorics. 25
Let $\mathbb{N}$ denote the set of non-negative integers. Haglund, Wilson, and the second author have conjectured that the coefficient of any Schur function $s_\lambda[X]$ in $\Delta_{e_k} e_n[X]$ is a polynomial in $\mathbb{N}[q,t]$. We present four