Related papers: Some interesting problems
We propose a list of open problems in pluripotential theory partially motivated by their applications to complex differential geometry. The list includes both local questions as well as issues related to the compact complex manifold…
Hoping to stimulate new research in individual animal identification from images, we propose to formulate the problem as the human-machine Continual Curation of images and animal identities. This is an open world recognition problem, where…
This paper presents fifteen problems about mapping class groups. It is an expanded and updated version of the author's preprint "Ten problems on the mapping class groups". The paper will appear in the book "Problems on Mapping Class Groups…
We present several results, including some remarks on the Hopf Lemma.
Today's QCD problems, prospects and achievements are reviewed.
Upgradeability problems are a critical issue in modern operating systems. The problem consists in finding the "best" solution according to some criteria, to install, remove or upgrade packages in a given installation. This is a difficult…
The list coloring problem is a variant of vertex coloring where a vertex may be colored only a color from a prescribed set. Several applications of vertex coloring are more appropriately modelled as instances of list coloring and thus we…
This is a short historical note concerning the evolution of Wetzel's problem and Erdos' solution.
We consider a variant of socially stable marriage problem where preference lists may be incomplete, may contain ties and may have bounded length. In real world application like NRMP and Scottish medical matching scheme such restrictions…
The unfolding problem formulation for correcting experimental data distortions due to finite resolution and limited detector acceptance is discussed. A novel validation of the problem solution is proposed. Attention is drawn to fact that…
Many problems in science and engineering can be formulated as optimization problems, subject to complex nonlinear constraints. The solutions of highly nonlinear problems usually require sophisticated optimization algorithms, and traditional…
In this pedestrian approach I give my personal point of view on the various problems posed by dark matter in the universe. After a brief historical overview I discuss the various solutions stemming from high energy particle physics, and the…
An introductory paper to the graph k-colorability problem.
Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algorithms for a range of different online problems. The…
Emerging networked systems become increasingly flexible and reconfigurable. This introduces an opportunity to adjust networked systems in a demand-aware manner, leveraging spatial and temporal locality in the workload for online…
Recommending playlists to users in the context of a digital music service is a difficult task because a playlist is often more than the mere sum of its parts. We present a novel method for generating playlist embeddings that are invariant…
This note is the written version of conversations with young colleagues on unofficial history, general ideas, unexpected facts and open problems concerning tilting theory.
This paper contains a selection, dictated by personal taste and by no means complete, of open problems in local discrete holomorphic dynamics.
In this paper we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention…
We describe a list of open problems in random matrix theory and the theory of integrable systems that was presented at the conference Asymptotics in Integrable Systems, Random Matrices and Random Processes and Universality, Centre de…