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

67 papers · 1 filter

math.CO2024

Zero-one dual characters of flagged Weyl modules

Peter L. Guo, Zhuowei Lin, Simon C. Y. Peng

We prove a criterion of when the dual character $χ_{D} (x)$ of the flagged Weyl module associated to a diagram $D$ in the grid $[n] \times [n]$ is zero-one, that is, the coefficients…

math.CO2023

The Simultaneous Lattice Packing-Covering Constant of Octahedra

Yiming Li, Chuanming Zong

This paper proves that the simultaneous lattice packing-covering constant of an octahedron is $7/6$ . In other words, $7/6$ is the smallest positive number $r$ such that for every o…

math.CO2021

Algorithm for monochromatic vertex-disconnection of graphs

Miao Fu, Yuqin Zhang

Let G be a vertex-colored graph. We call a vertex cut S of G a monochromatic vertex cut if the vertices of S are colored with the same color. The graph G is monochromatically verte…

math.CO2021

On the positive zeros of generalized Narayana polynomials related to the Boros-Moll polynomials

James J. Y. Zhao

The generalized Narayana polynomials $N_{n, m} (x)$ arose from the study of infinite log-concavity of the Boros-Moll polynomials. The real-rootedness of $N_{n, m} (x)$ had been proved…

math.CO2020

Log-concavity of $P$ -recursive sequences

Q. H. Hou, G. J. Li

We consider the higher order Turán inequality and higher order log-concavity for sequences ${a_{n}}_{n \geq 0}$ such that \[ \frac{a_{n-1}a_{n+1}}{a_n^2} = 1 + \sum_{i=1}^m \frac{r_…

math.CO2020★ 1 cited

The Maximum Number of Cliques in Hypergraphs without Large Matchings

Erica L. L. Liu, Jian Wang

Let $[n]$ denote the set ${1, 2, \dots, n}$ and $F_{n, k, a}^{(r)}$ be an $r$ -uniform hypergraph on the vertex set $[n]$ with edge set consisting of all the $r$ -element…

math.CO2020

5-Dissections and sign patterns of Ramanujan's parameter and its companion

Shane Chern, Dazhao Tang

In 1998, Michael Hirschhorn discovered 5-dissections of the Rogers--Ramanujan continued fraction $R (q)$ and its reciprocal. In this paper, we obtain the 5-dissections for functions…

math.CO2020★ 3 cited

Upper bounds on the signed edge domination number of a graph

Fengming Dong, Jun Ge, Yan Yang

A signed edge domination function (or SEDF) of a simple graph $G = (V, E)$ is a function $f : E \to {1, - 1}$ such that $\sum_{e^{'} \in N [e]} f (e^{'}) \geq 1$ holds for each edge $e\in E…

math.CO2019

Polynomial Reduction and Super Congruences

Qing-Hu Hou, Yan-Ping Mu, Doron Zeilberger

Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in shor…

math.CO2019★ 1 cited

Upper bounds for bar visibility of subgraphs and n-vertex graphs

Yuanrui Feng, Douglas B. West, Yan Yang

A $t$ -bar visibility representation of a graph assigns each vertex up to $t$ horizontal bars in the plane so that two vertices are adjacent if and only if some bar for one vertex c…

math.CO2019

Exact bipartite Turán numbers of large even cycles

Binlong Li, Bo Ning

Let the bipartite Turán number $e x (m, n, H)$ of a graph $H$ be the maximum number of edges in an $H$ -free bipartite graph with two parts of sizes $m$ and $n$ , respectively. In this p…

math.CO2019

The thickness of the Kronecker product of graphs

Xia Guo, Yan Yang

The thickness of a graph $G$ is the minimum number of planar subgraphs whose union is $G$ . In this paper, we present sharp lower and upper bounds for the thickness of the Kronecker…

math.CO2018★ 1 cited

Several $q$ -series related to Ramanujan's theta functions

Dazhao Tang, Ernest. X. W. Xia

Quite recently, the first author investigated vanishing coefficients of the arithmetic progressions in several $q$ -series expansions. In this paper, we further study the signs of c…

math.CO2018★ 18 cited

The formula for Turán number of spanning linear forests

Bo Ning, Jian Wang

Let $F$ be a family of graphs. The Turán number $e x (n; F)$ is defined to be the maximum number of edges in a graph of order $n$ that is $F$ -free. In 19…

math.CO2018★ 7 cited

Unimodality of the Andrews-Garvan-Dyson cranks of partitions

Kathy Q. Ji, Wenston J. T. Zang

The main objective of this paper is to investigate the distribution of the Andrews-Garvan-Dyson crank of a partition. Let $M (m, n)$ denote the number of partitions of $n$ with the A…

math.CO2018

The Thickness of K_1,n,n and K_2,n,n

Xia Guo, Yan Yang

The thickness of a graph G is the minimum number of planar subgraphs whose union is G. In this paper, we obtain the thickness of complete 3-partite graph K_1,n,n, K_2,n,n and compl…

math.CO2018

On certain unimodal sequences and strict partitions

Shishuo Fu, Dazhao Tang

Building on a bijection of Vandervelde, we enumerate certain unimodal sequences whose alternating sum equals zero. This enables us to refine the enumeration of strict partitions wi…

math.CO2018★ 29 cited

Extensions of Erdős-Gallai Theorem and Luo's Theorem with Applications

Bo Ning, Xing Peng

The famous Erdős-Gallai Theorem on the Turán number of paths states that every graph with $n$ vertices and $m$ edges contains a path with at least $\frac{2 m}{n}$ edges. In this not…

math.CO2017★ 11 cited

Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree

Yawen Li, Yao liu, Xing Peng

In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characteri…

math.CO2017

A note on the 4-girth-thickness of K_{n,n,n}

Xia Guo, Yan Yang

The $4$ -girth-thickness $θ (4, G)$ of a graph $G$ is the minimum number of planar subgraphs of girth at least four whose union is $G$ . In this paper, we obtain that the 4-girth-thick…

math.CO2017★ 1 cited

An Ore-type Condition for Large $k$ -factor and Disjoint Perfect Matchings

Hongliang Lu, Bo Ning

Win [\emph{J. Graph Theory} {\bf 6}(1982), 489--492] conjectured that a graph $G$ on $n$ vertices contains $k$ disjoint perfect matchings, if the degree sum of any two nonadjacent…

math.CO2017★ 17 cited

Stability results on the circumference of a graph

Jie Ma, Bo Ning

In this paper, we extend and refine previous Turán-type results on graphs with a given circumference. Let $W_{n, k, c}$ be the graph obtained from a clique $K_{c - k + 1}$ by adding $n-(…

math.CO2017

The edit distance function of some graphs

Yumei Hu, Yongtang Shi, Yarong Wei

The edit distance function of a hereditary property $H$ is the asymptotically largest edit distance between a graph of density $p \in [0, 1]$ and $H$ . Denote by $P…

math.CO2017★ 19 cited

On sufficient conditions for rainbow cycles in edge-colored graphs

Shinya Fujita, Bo Ning, Chuandong Xu +1

Let $G$ be an edge-colored graph. We use $e (G)$ and $c (G)$ to denote the number of edges of $G$ and the number of colors appearing on $E (G)$ , respectively. For a vertex $v \in V (G)$ …

Zero-one dual characters of flagged Weyl modules

The Simultaneous Lattice Packing-Covering Constant of Octahedra

Algorithm for monochromatic vertex-disconnection of graphs

On the positive zeros of generalized Narayana polynomials related to the Boros-Moll polynomials

Log-concavity of P-recursive sequences

The Maximum Number of Cliques in Hypergraphs without Large Matchings

5-Dissections and sign patterns of Ramanujan's parameter and its companion

Upper bounds on the signed edge domination number of a graph

Polynomial Reduction and Super Congruences

Upper bounds for bar visibility of subgraphs and n-vertex graphs

Exact bipartite Turán numbers of large even cycles

The thickness of the Kronecker product of graphs

Several q-series related to Ramanujan's theta functions

The formula for Turán number of spanning linear forests

Unimodality of the Andrews-Garvan-Dyson cranks of partitions

The Thickness of K_1,n,n and K_2,n,n

On certain unimodal sequences and strict partitions

Extensions of Erdős-Gallai Theorem and Luo's Theorem with Applications

Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree

A note on the 4-girth-thickness of K_{n,n,n}

An Ore-type Condition for Large k-factor and Disjoint Perfect Matchings

Stability results on the circumference of a graph

The edit distance function of some graphs

On sufficient conditions for rainbow cycles in edge-colored graphs

Log-concavity of $P$ -recursive sequences

Several $q$ -series related to Ramanujan's theta functions

An Ore-type Condition for Large $k$ -factor and Disjoint Perfect Matchings