Related papers: Problems from BCC30
This is a list of problems that were collected from participants at the Comparative Prime Number Theory Symposium held at UBC from June 17 to June 21, 2024. Its goal is to stimulate research and future collaborations in this growing field.…
These notes are a summary of the problem session discussions at various CANT (Combinatorial and Additive Number Theory Conferences). Currently they include all years from 2009 through 2019 (inclusive); the goal is to supplement this file…
For positive integers $n$ and $k$ such that $k$ is at most $n$, we find an explicit one-to-one correspondence between the following two sets: the set of words consisting of $k$ $R$s, $k$ $U$s, and $n - k$ $D$s, where the first letter of the…
We review various combinatorial problems with underlying classical or quantum integrable structures. (Plenary talk given at the International Congress of Mathematical Physics, Aalborg, Denmark, August 10, 2012.)
These open problems were presented in the Problem Sessions held during the Tianyuan Workshop on Computability Theory and Descriptive Set Theory, June 16-20, 2025. The problems are organized into sections named after their contributors, in…
This is a survey of open problems in different parts of combinatorial and additive number theory. The paper is based on lectures at the Centre de Recerca Matematica in Barcelona on January 23 and January 25, 2008.
This document is built around a list of thirty-two problems in enumeration of matchings, the first twenty of which were presented in a lecture at MSRI in the fall of 1996. I begin with a capsule history of the topic of enumeration of…
This text contains over three hundred specific open questions on various topics in additive combinatorics, each placed in context by reviewing all relevant results. While the primary purpose is to provide an ample supply of problems for…
In recent years, there has been a growing interest in using learning-based approaches for solving combinatorial problems, either in an end-to-end manner or in conjunction with traditional optimization algorithms. In both scenarios, the…
The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set…
This article contains a collection of problems contributed during the course of the conference.
In May 2015, a conference entitled "Groups, Geometry, and 3-manifolds" was held at the University of California, Berkeley. The organizers asked participants to suggest problems and open questions, related in some way to the subject of the…
Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are listed.
We describe a class of combinatorial design problems which typically occur in professional sailing league competitions. We discuss connections to resolvable block designs and equitable coverings and to scheduling problems in operations…
This volume contains the proceedings of PLACES 2024, the 15th edition of the Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software. The PLACES workshop series offers a forum for researchers from…
Modern society is full of computational challenges that rely on probabilistic reasoning, statistics, and combinatorics. Interestingly, many of these questions can be formulated by encoding them into propositional formulas and then asking…
This document compiles problems proposed and discussed during the problem session at the conference Foliations and Diffeomorphism Groups (CIRM, 2024), organized by H\'el\`ene Eynard-Bontemps, Ga\"el Meigniez, Sam Nariman, and Mehdi Yazdi.…
Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current state of the art and related bibliography) presented by…
The Fourth International Conference on Applied Category Theory took place at the Computer Laboratory of the University of Cambridge on 12--16 July 2021. It was a hybrid event, with physical attendees present in Cambridge and other…
Many computational problems in modern society account to probabilistic reasoning, statistics, and combinatorics. A variety of these real-world questions can be solved by representing the question in (Boolean) formulas and associating the…