Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings

TL;DR

This conference proceedings covers recent advances in the random and exhaustive generation of combinatorial structures, with a focus on polyominoes and tilings, highlighting theoretical methods and new results across mathematics and computer science.

Contribution

The paper presents new theoretical approaches and results related to the random generation and enumeration of polyominoes and tilings within combinatorics.

Findings

New algorithms for generating polyominoes and tilings

Analytic combinatorics methods applied to structure enumeration

Enhanced understanding of combinatorial object properties

Abstract

The conference GASCom 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, the conference is also interested in contributions in enumerative or analytic combinatorics, and interactions with other areas of mathematics, computer science, physics or biology. The conference is both interested in methods for random or exhaustive generation and in original results on combinatorial or algorithmic questions, whose solution has been made possible by an approach involving random or exhaustive generation. The present edition of the conference includes a specific bunch of talks dedicated to polyominoes and tilings. A (not 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.