Mathematics of discrete structures, including graph theory, combinatorial optimization, coding theory, discrete geometry, and applications to computer science and operations research
4 papersThis paper proves an almost constant lower bound for the isoperimetric coefficient in the KLS conjecture, improving upon previous bounds with better dimension dependency. This has implications for other related conjectures like Bourgain's slicing conjecture and the thin-shell conjecture, plus potential impacts on concentration inequalities and mixing time bounds for log-concave measures.
The paper introduces a Hopf algebraic structure on generalized permutahedra, proving they are the universal family of polytopes with this structure. It presents a cancellation-free antipode formula and demonstrates how this framework unifies classical results in combinatorics related to graphs, matroids, posets, and inversion of power series, offering potential for new discoveries.
The paper classifies factorizations of almost simple groups where at least one factor is solvable. It then applies this classification to characterize s-arc-transitive Cayley graphs of solvable groups, discovering that, except for cycles, all non-bipartite connected 3-arc-transitive Cayley graphs are covers of the Petersen or Hoffman-Singleton graphs.
This paper adapts Tutte's invariant method to analyze quadrant walks, proving algebraicity for several models, including Gessel's. It introduces a weaker invariant notion, demonstrating D-algebraicity for nine non-D-finite models with decoupling functions, using a novel integral-free expression for their generating function.