2 papers
math.CO2026
Wild number for spanning trees in complete and complete bipartite graphs
Aleyah Dawkins, Alexander Nappo, Jessie Tong +1
Given an edge-colored graph, the wild number measures how close the graph is to having a spanning tree in every color. We investigate this parameter for complete graphs and complet…
cs.SC2026
Learning Fast Monomial Orders for Gröbner Basis Computations
R. Caleb Bunch, Alperen A. Ergür, Melika Golestani +3
The efficiency of Gröbner basis computation, the standard engine for solving systems of polynomial equations, depends on the choice of monomial ordering. Despite a near-continuum o…