Sheng Chen

activity

20072020

most citedGeneralized Ehrhart polynomials

19 citations · 24 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2020

A note on tight cuts in matching-covered graphs

Xiao Zhao, Sheng Chen

Edmonds, Lovász, and Pulleyblank showed that if a matching covered graph has a nontrivial tight cut, then it also has a nontrivial ELP-cut. Carvalho et al. gave a stronger conjectu…

math.CO2018★ 1 cited

On non-feasible edge sets in matching-covered graphs

Xiao Zhao, Fengming Dong, Sheng Chen

Let $G = (V, E)$ be a matching-covered graph and $X$ be an edge set of $G$ . $X$ is said to be feasible if there exist two perfect matchings $M_{1}$ and $M_{2}$ in $G$ such that $|M_1\cap…

math.CO2010★ 19 cited

Generalized Ehrhart polynomials

Sheng Chen, Nan Li, Steven V Sam

Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P (n) = n P$ is a quasi-polynomial in $n$ . We…

math.CO2007★ 1 cited

On a Conjecture about the Number of Solutions to Linear Diophantine Equations with a Positive Integer Parameter

Sheng Chen, Nan Li

Let A(n) be a $k \times s$ matrix and $m (n)$ be a $k$ dimensional vector, where all entries of A(n) and $m (n)$ are integer-valued polynomials in $n$ . Suppose that $$t(m(n)|A(n))=#\{…