4 papers
math.AC2026
The Separating Noether Number of Finite Abelian Groups
Jing Huang
For a finite abelian group , let denote its separating Noether number. We determine exactly for every finite abelian group $ G \con…
math.CO2026
A Proof of a Conjecture of Móricz and Nagy on Rational-Value Sums
Jing Huang
Móricz and Nagy introduced the problem of maximizing the number of -element subsets with rational sums in an -element set of irrational numbers, and showed that it is equiva…
math.CO2025
Sharp lower bounds and extremal graphs for the generalized -independence number
Jing Huang, Jiaxin Tang
A vertex set is a generalized -independent set if the induced subgraph contains no tree on vertices. The generalized -independence number is the maxi…
math.CO2025
A sharp lower bound on the generalized 4-independence number
Jing Huang
For a graph , a vertex subset is called a maximum generalized -independent set if the induced subgraph does not contain a -tree as its subgraph, and the subset…