Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929392416980992 |
|---|---|
| author | Brlek, Srečko Ferrari, Luca |
| author_facet | Brlek, Srečko Ferrari, Luca |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_14588 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings Brlek, Srečko Ferrari, Luca Discrete Mathematics Data Structures and Algorithms 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. |
| title | Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings |
| topic | Discrete Mathematics Data Structures and Algorithms |
| url | https://arxiv.org/abs/2406.14588 |