Related papers: Twenty Open Problems in Enumeration of Matchings: …
This paper presents an overview of the current state of knowledge in the field of equivariant map algebras and discusses some open problems in this area.
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…
For a graph $G=(V,E),$ a matching $M$ is a set of independent edges. The topic of matchings is well studied in graph theory. In this paper many varieties of matchings are discussed.
This is a survey of the exciting recent progress made in understanding the complexity of distributed subgraph finding problems. It overviews the results and techniques for assorted variants of subgraph finding problems in various models of…
In this paper, we will continue the investigation of Waring's problem, and give further improvements.
This very preliminary text is related to ``Algorithms on Texts'', also called ``Algorithmic Stringology''. It is an extension of the book ``125 Problems in Text Algorithms'' providing, in the same compact style, more problems with…
We attempt to survey recent results and open problems connected to Lieb-Thirring inequalities.
We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too) and prove that this problem is NP-complete
A compendium of thirty previously published open problems in computational geometry is presented.
We provide a list of (mainly unsolved) problems in ordered and orderable groups. These were originally compiled 10 years ago by the last two authors. New problems have been added to the list. Progress on some of these is noted and…
This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…
Compared with constraint satisfaction problems, counting problems have received less attention. In this paper, we survey research works on the problems of counting the number of solutions to constraints. The constraints may take various…
In this paper some open problems for Painlev\'e equations are discussed. In particular the following open problems are described: (i) the Painlev\'e equivalence problem; (ii) notation for solutions of the Painlev\'e equations; (iii)…
We provide a detailed overview of the various approaches that were proposed to date to solve the task of Open Information Extraction. We present the major challenges that such systems face, show the evolution of the suggested approaches…
This article offers different proofs of ten inequalities from those already published. So that the readers can see for themselves, the tasks specified in the condition of the source and classical inequalities which used in previously…
The paper proposes open problems in classical Kolmogorov complexity. Each problem is presented with background information and thus the article also surveys some recent studies in the area.
The report is devoted to the current state of the MathPartner computer algebra web project. We discuss the main directions of development of the project and give several examples of using it to solve selected problems.
We introduce a task consisting in matching a proof to a given mathematical statement. The task fits well within current research on Mathematical Information Retrieval and, more generally, mathematical article analysis (Mathematical…
We discuss various problems in frame theory that have been open for some years. A short discussion of frame theory is also provided, but it only contains the information that is necessary in order to understand the open problems and their…
This is an update of my problem list.