Related papers: Problems and memories
The concept of a covering system was first introduced by Erd\H{o}s in 1950. Since their introduction, a lot of the research regarding covering systems has focused on the existence of covering systems with certain restrictions on the moduli.…
Since it first emerged in Wijsman's seminal work [29], the Wijsman topology has been intensively studied in the past 50 years. In particular, topological properties of Wijsman hyperspaces, relationships between the Wijsman topology and…
We propose a minimal yet intriguing model for a relationship between two individuals. The feeling of an individual is modeled by a complex variable and hence has two degrees of freedom. The effect of memory of other individual's behavior in…
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 is a broad reviw of some of the fundamental results of research on the Bechgaard salts.To a lesser extent Q2D salts will also be discussed.Apart from known results,based on the author's work and the literature,some open problems will…
This is a non-standard paper, containing some problems, mainly in model theory, which I have, in various degrees, been interested in. Sometimes with a discussion on what I have to say; sometimes, of what makes them interesting to me,…
Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem…
See hep-th/9903228.
We discuss several open problems in Diophantine approximation. Among them there are famous Littlewood's and Zaremba's conjectures as well as some new and not so famous problems.
These lecture notes are based on a set of six lectures that I gave in Edinburgh in 2008/2009 and they cover some topics in the interface between Geometry and Physics. They involve some unsolved problems and conjectures and I hope they may…
This is a collection of questions that I am considering submitting to the next edition of the Kourovka Notebook of open questions in group theory. Most are questions I raised in papers between 1981 and the present; a few are new. I welcome…
Paul Erd\H{o}s posed a problem on the asymptotic estimation of decomposing 1 into a sum of infinitely many unit fractions in \cite{Erd80}. We point out that this problem can be solved in the same way as the finite case, as shown in…
This is a collection of open problems in geometry that I think of as puzzles: they stick to my brain -- I see many grips, but no spare hands. Puzzle-charm is the only criterion for including a problem here; importance is ignored.
Since their introduction by Erd\H{o}s in 1950, covering systems (that is, finite collections of arithmetic progressions that cover the integers) have been extensively studied, and numerous questions and conjectures have been posed regarding…
This work is a continuation of what was done in a previous paper and strongly connected to the recent work of U. Abel and I. Rasa [arXiv:1707.00127]
This collection of problems and conjectures is based on a subset of the open problems from the seminar series and the problem sessions of the Institut Mitag-Leffler programme Graphs, Hypergraphs, and Computing. Each problem contributor has…
In this arxiv-post I present my solutions (published or not) to Problems that appeared in Amer. Math. Monthly, Math. Magazine, Elemente der Mathematik and CRUX, that were mostly done in collaboration with Rudolf Rupp. Some of them…
Working memory, or the ability to hold and manipulate information in the mind, is a critical component of human intelligence and executive functioning. It is correlated with performance on various cognitive tasks, including measures of…
Several min-max relations in graph theory can be expressed in the framework of the Erd\H{o}s-P\'osa property. Typically, this property reveals a connection between packing and covering problems on graphs. We describe some recent techniques…
This is a review of topics which haunted me for the last 40 years, starting with spontaneous symmetry breaking and ending with gauge/string/space-time correspondence. While the first part of this article is mostly historical, the second…