3 papers
cs.FL2026
The triple rendezvous time of a synchronizing automaton can be floor(4n/3)
Enkai Zhang
For every , we construct a strongly connected synchronizing automaton with two input letters and states whose shortest word merging some three distinct states has length…
math.CO2026
Density regions, integer certificates and packing colorings of distance graphs
Enkai Zhang
We study simultaneous color densities in packing colorings of integer distance graphs. For , we determine several exact density regions and prove that colors through $7…
math.NT2026
Sharp order-preserving integer models for short additive equalities
Enkai Zhang
We ask how small an increasing integer model of a finite real set can be while preserving all equalities between equal-length sums of at most elements, with repetitions allowed…