2 papers
math.CO2026
Goodman-type lower bounds for odd cycles I: The dense regime
Seonghyuk Im, Taeyoung Kim, Hongseok Yang
Goodman proved a lower bound on triangle counts which, in graphon language, states that every graphon of edge density has triangle density at least . Bennett, Dudek, Li…
math.CO2026
A Computational Obstruction to Swapping Area and Dinv: An Automata-Theoretic View of the -Catalan Symmetry
Jineon Baek, Byung-Hak Hwang, Joonhyun La +1
Algebraic combinatorics often seeks bijections that explain identities between distributions object by object. Encoding combinatorial objects as words lets automata theory study su…