🤖 AI Summary
This work addresses fundamental challenges in combinatorics and algorithm design by developing efficient random and exhaustive generation methods for combinatorial structures. It proposes a unified generation framework that integrates bijective, enumerative, algebraic, and analytic combinatorics with probabilistic algorithms and rigorous algorithmic analysis. The resulting methodology not only advances theoretical computer science but also yields significant applications in bioinformatics, combinatorics on words, and number theory. Through this interdisciplinary approach, the study demonstrates the effectiveness and broad applicability of novel generation algorithms, highlighting their potential to bridge theoretical insights with practical computational problems across diverse scientific domains.
📝 Abstract
This volume contains the proceedings of GASCom 2026, held on June 8-12 2026, in Malosco (Italy). This series of conferences brings together researchers in combinatorics, algorithms, probabilities, and more generally mathematical computer science, around the theme of random and exhaustive generation of combinatorial structures, mostly considered from a theoretical point of view. In connection with this main theme, contributions in enumerative or analytic combinatorics, and interactions with other areas of mathematics, computer science, physics or biology are wellcome. The topics cover both the methods for random or exhaustive generation, and original results on combinatorial or algorithmic problems, whose solution has been made possible by an approach involving random or exhaustive generation. A (non exhaustive) list of topics of the conference is: random and exhaustive generation of combinatorial objects; tilings and polyominoes; bijective, enumerative, algebraic and analytic combinatorics; algorithmic aspects: analysis of algorithms, probabilistic algorithms; interactions: bio-informatics, combinatorics on words, number theory.