Related papers: Some interesting problems
The debts' clearing problem is about clearing all the debts in a group of n entities (persons, companies etc.) using a minimal number of money transaction operations. The problem is known to be NP-hard in the strong sense. As for many…
This survey article collects a few of my favorite open problems of Branko Gr\"{u}nbaum.
This document describes the detailed reformulation of a power system upgrade planning problem into a more generic quadratically constrained quadratic problem (QCQP). The problem is one of deciding what lines to upgrade in an existing power…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
A number of unsolved problems and open questions about the nature and the properties of supernovae are identified and briefly discussed. Some suggestions and directions toward possible solutions are also considered.
This is a survey on rectifiability. I discuss basic properties of rectifiable sets, measures, currents and varifolds and their role in complex and harmonic analysis, potential theory, calculus of variations, PDEs and some other topics.
This is a problem list in the theory of foliations and laminations of 3-manifolds. The focus is on the relationship of foliations and laminations with other aspects of 3-manifold topology, especially with the Thurston theory of geometric…
The purpose of this bulletin board is to collect problems in higher dimensional complex analysis. We are interested both in basic research questions as well as interactive questions with other fields and sciences. We encourage everybody to…
A new solvable many-body problem of goldfish type is introduced and the behavior of its solutions is tersely discussed.
An essay on Model Theory: Why am I interested in model theory? What are, in my opinion, the most challenging problems in model theory?
In this paper, a new upper bound for the Multiple Knapsack Problem (MKP) is proposed, based on the idea of relaxing MKP to a {\em Bounded Sequential Multiple Knapsack Problem}, i.e., a multiple knapsack problem in which item sizes are…
The Halting Problem is ill-conceived and ill-defined.
The new paper will be submitted.
Certain new inequalities for the sums of factorials are presented.
Although the halting problem is undecidable, imperfect testers that fail on some instances are possible. Such instances are called hard for the tester. One variant of imperfect testers replies "I don't know" on hard instances, another…
In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of…
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.
The interest in $q$-analogs of codes and designs has been increased in the last few years as a consequence of their new application in error-correction for random network coding. There are many interesting theoretical, algebraic, and…
A guaranteed upper bound is proved for the time complexity of the list-coloring problem on graphs.
This paper presents a little reflection about the Sleeping Beauty Problem, maybe contributing to shed light on it and perhaps helping to find a simple and elegant solution that could definitively resolve the controversies about it.