Related papers: Ten Conferences WORDS: Open Problems and Conjectur…
Enumeration of tilings is the mathematical study concerning the total number of coverings of regions by similar pieces without gaps or overlaps. Enumeration of tilings has become a vibrant subfield of combinatorics with connections and…
In this paper, a survey about recent progress on problems solved using graph amalgamations is presented, along with some new results with complete proofs, and some related open problems.
This is a brief survey of some open problems on permutation patterns, with an emphasis on subjects not covered in the recent book by Kitaev, \emph{Patterns in Permutations and words}. I first survey recent developments on the enumeration…
We study decision problems of the form: given a regular or linear context-free language $L$, is there a word of a given fixed form in $L$, where given fixed forms are based on word operations copy, marked copy, shuffle and their…
We continue our study of open and closed languages. We investigate how the properties of being open and closed are preserved under concatenation. We investigate analogues, in formal languages, of the separation axioms in topological spaces;…
In this article we give a survey on open problems and conjectures concerning L^2-invariants. We cover the whole portfolio and not only certain aspects as they are considered in the previous more specialized (and within their scope more…
We collect some open problems about minimal presentations of numerical semigroups and, more generally, about defining ideals and free resolutions of their semigroup rings and associated graded rings. We emphasize both long-standing problems…
This paper contains a survey of recent developments in investigation of word equations in simple matrix groups and polynomial equations in simple (associative and Lie) matrix algebras along with some new results on the image of word maps on…
This volume contains the proceedings of PLACES 2025, the 16th edition of the Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software. The workshop is scheduled to take place in Hamilton, Canada, on May…
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…
During the five days of this conference a very dense scientific program has enlighted our research fields, with the presentation of large number of interesting lectures. I will try to summarize the theoretical aspects of some of these new…
Some general comments are made on the evolution of this series of workshops and on some features of this particular Workshop without attempting to summarize all the talks presented.
This conclusion to the meeting attempts to summarise what we have learnt during the conference (mainly from the review talks) about new observations from Hinode and about theories stimulated by them. Suggestions for future study are also…
The World Wide Web conference is a well-established and mature venue with an already long history. Over the years it has been attracting papers reporting many important research achievements centered around the Web. In this work we aim at…
Patterns embody repeating phenomena, and, as such, they are partly but not fully detachable from their context. 'Design patterns' and 'pattern languages' are established methods for working with patterns. They have been applied in…
Background: The field of software testing is growing and rapidly-evolving. Aims: Based on keywords assigned to publications, we seek to identify predominant research topics and understand how they are connected and have evolved. Method: We…
These notes, connected to a "potpourri" topics class currently underway, discuss some basic topics in analysis and connections with other areas of mathematics.
This volume contains the proceedings of EXPRESS/SOS 2020: the Combined 27th International Workshop on Expressiveness in Concurrency and the 17th Workshop on Structural Operational Semantics, which was held online, as an affiliated workshop…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…