相关论文: Some interesting problems

We give a brief overview of the black hole information problem emphasizing fundamental issues and recent proposals for its resolution. The focus is on broad perspective and providing a guide to current literature rather than presenting full…

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

See hep-th/9903228.

This paper serves as the announcement of my program---a joke version of the Langlands Program. In connection with this program, I discuss an old hat puzzle, introduce a new hat puzzle, and offer a puzzle for the reader.

In this paper, we study the "sum composition problem" between two lists $A$ and $B$ of positive integers. We start by saying that $B$ is "sum composition" of $A$ when there exists an ordered $m$-partition $[A_1,\ldots,A_m]$ of $A$ where $m$…

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.

Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors…

We present an improved library for the ranking problem called RPLIB. RPLIB includes the following data and features. (1) Real and artificial datasets of both pairwise data (i.e., information about the ranking of pairs of items) and feature…

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…

We give an historical account, including recent progress, on some problems of Erd\H os in number theory.

We consider the problem of List Update, one of the most fundamental problems in online algorithms. We are given a list of elements and requests for these elements that arrive over time. Our goal is to serve these requests, at a cost…

We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction. In comparison with these problems,…

The invariant subspace problem is solved correcting my earlier attempts [6]-[12].

In the process of testing improvements to the Linux DCTCP code in various scenarios, we found different performance problems kept surfacing with no apparent pattern. This report records a systematic sequence of experiments designed to track…

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

Stimulated by a recent preprint of Bricmont and Goldstein.

This chapter is divided into two parts. The first part is a survey of some recent results on nests and the orderability problem. The second part consists of results, partial results and open questions, all viewed in the light of nests. From…

We present a list of open questions in the theory of holomorphic foliations, possibly with singularities. Some problems have been around for a while, others are very accessible.

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…

Rescheduling problems arise in a variety of situations where a previously planned schedule needs to be adjusted to deal with unforeseen events. A common problem is the arrival of new orders, i.e. jobs, which have to be integrated into the…