相关论文: Some interesting problems

The problems and solutions contained here, all associated with nonlinear recurrences and long-term trends, are new (as far as is known).

This paper gives a brief description of the author's database of integer sequences, now over 35 years old, together with a selection of a few of the most interesting sequences in the table. Many unsolved problems are mentioned.

The main objective of this survey is to present the important theoretical and experimental results contributed till date in the area of online algorithms for the self organizing sequential search problem, also popularly known as the List…

This is a survey of old and new problems and results in additive number theory.

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…

We propose a set of questions on the dynamics of H\'enon maps from the real, complex, algebraic and arithmetic points of view.

We discuss some old common knowledge puzzles and introduce a lot of new common knowledge puzzles.

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…

A collection of open problems in Costas arrays is presented, classified into several categories, along with the context in which they arise.

The paper contains a discussion on a number of open problems in queueing theory. Some of them are known for decades, some are more recent. They relate to stability and to rare events. There is an idea to prepare a special issue of QUESTA on…

A brief report on recent work on the sphere-packing problem.

This paper concerns the number of lattice points in a circle.

This habilitation thesis is intended to be a good introduction to enumeration, the problem of listing solutions. It focuses on the different ways of measuring complexity in enumeration, with a particular emphasis on my contributions to the…

A variant of the well-known Set Covering Problem is studied in this paper, where subsets of a collection have to be selected, and pairwise conflicts among subsets of items exist. The selection of each subset has a cost, and the inclusion of…

Some old peg solitaire boards are brought down from the literature, dusted off, and re-examined, and some remarkable problems are displayed on them.

We attempt to survey recent results and open problems connected to Lieb-Thirring inequalities.

In this short note we prove a result that is an extension of an old Olympiad problem and is a very simple variant of the question of finding an approximation for $k$, where it is a nonzero constant and it satisfies the equation $a^k+b^k=c$,…

Conway's 99-graph problem is the second problem amongst the five 1000\$ 2017 open problems set. Four out of the five remain unsolved to this day, including the 99-graph problem. In this paper we quote Conway's definition of the problem and…

We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Which items should be improved to which degree such that the…

The Art Gallery Problem is one of the most well-known problems in Computational Geometry, with a rich history in the study of algorithms, complexity, and variants. Recently there has been a surge in experimental work on the problem. In this…