3 citations · 3 across the 4 of their papers we have counts for
6 papers · 1 filter
Real-rooted integer polynomial enumeration algorithms and interlacing polynomials via linear programming
Gary R. W. Greaves, Jeven Syatriadi
We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coeff…
Chromatic polynomials of signed graphs and dominating-vertex deletion formulae
Gary R. W. Greaves, Jeven Syatriadi, Charissa I. Utomo
We exhibit non-switching-isomorphic signed graphs that share a common underlying graph and common chromatic polynomials, thereby answering a question posed by Zaslavsky. For variou…
Real equiangular lines in dimension 18 and the Jacobi identity for complementary subgraphs
Gary R. W. Greaves, Jeven Syatriadi
We show that the maximum cardinality of an equiangular line system in is at most . Our proof includes a novel application of the Jacobi identity for complement…
Equiangular lines in Euclidean spaces: dimensions 17 and 18
Gary R. W. Greaves, Jeven Syatriadi, Pavlo Yatsyna
We show that the maximum cardinality of an equiangular line system in 17 dimensions is 48, thereby solving a longstanding open problem. Furthermore, by giving an explicit construct…
Equiangular lines in low dimensional Euclidean spaces
Gary R. W. Greaves, Jeven Syatriadi, Pavlo Yatsyna
We show that the maximum cardinality of an equiangular line system in 14 and 16 dimensions is 28 and 40, respectively, thereby solving a longstanding open problem. We also improve…
Reed-Solomon codes over small fields with constrained generator matrices
Gary Greaves, Jeven Syatriadi
We give constructions of some special cases of Reed-Solomon codes over finite fields of size at least and whose generator matrices have constrained support. Furth…