Danielle Y Wang

Journal Article Discrete Mathematics · January 1, 2020 The Wiener polynomial of a connected graph G is the polynomial W(G;x)=∑i=1D(G)di(G)xi where D(G) is the diameter of G, and di(G) is the number of pairs of vertices of G at distance i from each other. ... Full text Cite

The Eulerian distribution on involutions is indeed γ-positive

Journal Article Journal of Combinatorial Theory Series A · July 1, 2019 Let I n and J n denote the set of involutions and fixed-point free involutions of {1,…,n}, respectively, and let des(π) denote the number of descents of the permutation π. We prove a conjecture of Guo and Zeng which states that I Full text Cite

Modified Erdös–Ginzburg–Ziv constants for Z∕nZ and (Z∕nZ)2

Journal Article Discrete Mathematics · April 1, 2019 For an abelian group G and an integer t>0, the modified Erdös–Ginzburg–Ziv constant st′(G) is the smallest integer ℓ such that any zero-sum sequence of length at least ℓ with elements in G contains a zero-sum subsequence (not necessa ... Full text Cite