3 papers
math.CO2026
A Chvátal-type codegree condition for Hamiltonian cycles in -uniform hypergraphs
Lu-Ming Zhang
We prove an asymptotic Chvátal-type codegree criterion for tight Hamiltonian cycles in -uniform hypergraphs for every fixed . The criterion allows small degrees to be com…
quant-ph2024
Operator solutions of linear systems and small cancellation
William Slofstra, Lu-Ming Zhang
We show that if a graph has minimum vertex degree at least d and girth at least g, where (d, g) is (3, 6) or (4, 4), then the incidence system of the graph has a (possibly infinite…
cs.CC2023
Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness
Iddo Tzameret, Lu-Ming Zhang
We develop the theory of cryptographic nondeterministic-secure pseudorandomness beyond the point reached by Rudich's original work (Rudich 1997), and apply it to draw new consequen…