
Explore Vafa-Witten invariants, focusing on vertical components. Examine moduli space fixpoint loci, generating functions, and conjectural formulas for both vertical and horizontal invariants.

Explore Hochschild homology in motivic spectra, uncovering torsion classes and connections to Steenrod algebra. Gain insights into algebraic geometry and homotopy theory applications.

Explore map enumeration techniques, from Tutte's work to KP hierarchy, deriving recurrence formulas for oriented and non-oriented maps using integrability methods in mathematics and physics.

Explore open/closed correspondence in Gromov-Witten theory, examining numerical invariants, generating functions, and compatibility with mirror symmetry in toric Calabi-Yau manifolds.

Explore Laguerre polynomials through generating functions and three-term recurrence relations, enhancing your understanding of these important mathematical tools.

Explore Hausdorff moment problems for combinatorial sequences, focusing on integral ratios of factorials. Learn techniques to solve these problems and discover patterns in Meijer G-function encodings.

Explore phase transitions in composition schemes, analyzing critical cases and their impact on asymptotic behavior. Uncover rich limit laws and universal properties in combinatorial structures.

Explore advanced techniques for solving discrete differential equations in combinatorics using computer algebra, focusing on efficient methods for n=2 cases and recent developments in systems of equations.

Explore set partition counting by genus, focusing on primitive partitions and functional equations to reconstruct all partitions, with emphasis on genus 0-2 cases.

Explore advanced set partition counting using hypergeometric functions and generalized Hermite polynomials. Gain insights into restricted Bell numbers and their closed-form expressions.

Explore the intersection of elliptic cohomology and enumerative geometry, focusing on stable envelopes and their role in understanding q-difference equations.

Explore measure-preserving maps between dimer models on hexagon lattices, connecting single and double-dimer models for insights into partition functions and plane partition enumeration.

Explore a technique for finding guaranteed bounds on posterior distributions in probabilistic programs with loops using probability generating functions and inductive invariants.