Height of random Tamari intervals scales as n^3/4 with an explicit limit law.
The connection between the container method and property testing is explored, providing new insights and bounds for various graph properties.
The authors investigate the number of distinct quartics in 2D strings, providing optimal bounds and algorithms for computation.
The authors explore log-concave inequalities in various combinatorial set systems, proving matching equality conditions for earlier results and their extensions using linear algebra.