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 2014 · math.COShow all

7 papers · 2 filters

math.CO2014

The Method of Multiple Combinatorial Telescoping

Daniel K. Du, Qing-Hu Hou, Charles B. Mei

We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrew…

math.CO2014★ 4 cited

Abel's Lemma and Identities on Harmonic Numbers

Hai-Tao Jin, Daniel K. Du

Recently, Chen, Hou and Jin used both Abel's lemma on summation by parts and Zeilberger's algorithm to generate recurrence relations for definite summations. Meanwhile, they propos…

math.CO2014★ 7 cited

Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs

Roman Čada, Binlong Li, Bo Ning +1

A graph is called \emph{claw-free} if it contains no induced subgraph isomorphic to $K_{1, 3}$ . Matthews and Sumner proved that a 2-connected claw-free graph $G$ is hamiltonian if e…

math.CO2014★ 1 cited

Solution to a problem on hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions

Bo Ning, Shenggui Zhang, Binlong Li

A graph $G$ is called \emph{claw-o-heavy} if every induced claw ( $K_{1, 3}$ ) of $G$ has two end-vertices with degree sum at least $∣ V (G) ∣$ in $G$ . For a given graph $R$ , $G$ is call…

math.CO2014

The Bailey transform and Hecke-Rogers identities for the universal mock theta functions

Kathy Q. Ji, Aviva X. H. Zhao

Recently, Garvan obtained two-variable Hecke-Rogers identities for three universal mock theta functions $g_{2} (z; q), g_{3} (z; q), K (z; q)$ by using basic hypergeometric functions, and…

math.CO2014

Vacillating Hecke Tableaux and Linked Partitions

William Y. C. Chen, Peter L. Guo, Sabrina X. M. Pang

We introduce the structure of vacillating Hecke tableaux, and establish a one-to-one correspondence between vacillating Hecke tableaux and linked partitions by using the Hecke inse…

math.CO2014★ 2 cited

Decomposition of random graphs into complete bipartite graphs

Fan Chung, Xing Peng

We consider the problem of partitioning the edge set of a graph $G$ into the minimum number $τ (G)$ of edge-disjoint complete bipartite subgraphs. We show that for a random graph $G…