Tianjin University

output

19982026

most citedConvergence of Edge Computing and Deep Learning: A Comprehensive Survey

1.5k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2013 · math.COShow all

11 papers · 2 filters

math.CO2013

A determinant representation for generalized ballot and Fuss-Catalan numbers

James J. Y. Zhao

In this note we introduce a determinant and then give its evaluating formula. The determinant turns out to be a generalization of the well-known ballot and Fuss-Catalan numbers, wh…

math.CO2013★ 1 cited

k-Marked Dyson Symbols and Congruences for Moments of Cranks

William Y. C. Chen, Kathy Q. Ji, Erin Y. Y. Shen

By introducing $k$ -marked Durfee symbols, Andrews found a combinatorial interpretation of $2 k$ -th symmetrized moment $η_{2 k} (n)$ of ranks of partitions of $n$ . Recently, Garvan int…

math.CO2013

On the Positive Moments of Ranks of Partitions

William Y. C. Chen, Kathy Q. Ji, Erin Y. Y. Shen

By introducing $k$ -marked Durfee symbols, Andrews found a combinatorial interpretation of $2 k$ -th symmetrized moment $η_{2 k} (n)$ of ranks of partitions of $n$ in terms of $(k + 1)$ -m…

math.CO2013★ 9 cited

Some upper bounds for 3-rainbow index of graphs

Tingting Liu, Yumei Hu

A tree $T$ , in an edge-colored graph $G$ , is called {\em a rainbow tree} if no two edges of $T$ are assigned the same color. A {\em $k$ -rainbow coloring}of $G$ is an edge coloring…

math.CO2013★ 1 cited

A note on the 3-rainbow index of $K_{2, t}$

Tingting Liu, Yumei Hu

A tree $T$ , in an edge-colored graph $G$ , is called {\em a rainbow tree} if no two edges of $T$ are assigned the same color. For a vertex subset $S \in V (G)$ , a tree that connects $…

math.CO2013★ 1 cited

Koroljuk's formula for counting lattice paths revisited

James J. Y. Zhao

Koroljuk gave a summation formula for counting the number of lattice paths from $(0, 0)$ to $(m, n)$ with $(1, 0), (0, 1)$ -steps in the plane that stay strictly above the line $y=k(x-d…

math.CO2013

On Permutations with Bounded Drop Size

Joanna N. Chen, William Y. C. Chen

The maximum drop size of a permutation $π$ of $[n] = {1, 2, \dots, n}$ is defined to be the maximum value of $i - π (i)$ . Chung, Claesson, Dukes and Graham obtained polynomials $P_k(x)…

math.CO2013

Hamilton cycles in almost distance-hereditary graphs

Bing Chen, Bo Ning

Let $G$ be a graph on $n \geq 3$ vertices. A graph $G$ is almost distance-hereditary if each connected induced subgraph $H$ of $G$ has the property $d_{H} (x, y) \leq d_{G} (x, y) + 1$ for…

math.CO2013

Linked Partitions and Permutation Tableaux

William Y. C. Chen, Lewis H. Liu, Carol J. Wang

Linked partitions are introduced by Dykema in the study of transforms in free probability theory, whereas permutation tableaux are introduced by Steingrímsson and Williams in the s…

math.CO2013

Proof of the Andrews-Dyson-Rhoades Conjecture on the spt-Crank

William Y. C. Chen, Kathy Q. Ji, Wenston J. T. Zang

The notion of the spt-crank of a vector partition, or an $S$ -partition, was introduced by Andrews, Garvan and Liang. Let $N_{S} (m, n)$ denote the number of $S$ -partitions of $n$ with…

math.CO2013★ 6 cited

Ramanujan-type Congruences for Broken 2-Diamond Partitions Modulo 3

William Y. C. Chen, Anna R. B. Fan, Rebecca T. Yu

The notion of broken $k$ -diamond partitions was introduced by Andrews and Paule. Let $Δ_{k} (n)$ denote the number of broken k-diamond partitions of $n$ . They also posed three conject…

A determinant representation for generalized ballot and Fuss-Catalan numbers

k-Marked Dyson Symbols and Congruences for Moments of Cranks

On the Positive Moments of Ranks of Partitions

Some upper bounds for 3-rainbow index of graphs

A note on the 3-rainbow index of K2,t​

Koroljuk's formula for counting lattice paths revisited

On Permutations with Bounded Drop Size

Hamilton cycles in almost distance-hereditary graphs

Linked Partitions and Permutation Tableaux

Proof of the Andrews-Dyson-Rhoades Conjecture on the spt-Crank

Ramanujan-type Congruences for Broken 2-Diamond Partitions Modulo 3

A note on the 3-rainbow index of $K_{2, t}$