output
20062025
most citedDistance-IoU Loss: Faster and Better Learning for Bounding Box Regression

961 citations

Showing math.COShow all

17 papers · 1 filter

math.CO2021

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

James J. Y. Zhao

The generalized Narayana polynomials arose from the study of infinite log-concavity of the Boros-Moll polynomials. The real-rootedness of had been proved…

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.CO20191 cited

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

Yuanrui Feng, Douglas B. West, Yan Yang

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

math.CO2019

The thickness of the Kronecker product of graphs

Xia Guo, Yan Yang

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

math.CO20181 cited

Several -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 -series expansions. In this paper, we further study the signs of c…

math.CO201711 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…