Related papers: On the Closed-Form Solution to the Interior Goat P…
The inhomogeneous Muskat problem models the dynamics of an interface between two fluids of differing characteristics inside a non-uniform porous medium. We consider the case of a porous media with a permeability jump across a horizontal…
The power of symbolic computation, as opposed to mere numerical computation, is illustrated with efficient algorithms for studying the generalized gambler's ruin problem in one and two dimensions. We also consider a new generalization of…
We collect a number of open questions concerning Diophantine equations, Diophantine Approximation and transcendental numbers. Revised version: corrected typos and added references.
In this paper, we study closed-form optimal solutions to two-view triangulation with known internal calibration and pose. By formulating the triangulation problem as $L_1$ and $L_\infty$ minimization of angular reprojection errors, we…
The Sine-Gordon equation is integrable in (1+1)-dimensional Minkowski and in 2-dimensional Euclidean spaces. In each case, it has a Lax pair, and a Hirota algorithm generates its N soliton solutions for all N greater than or equal to 1. The…
The regular-geometric-figure solution to the $N$-body problem is presented in a very simple way. The Newtonian formalism is used without resorting to a more involved rotating coordinate system. Those configurations occur for other kinds of…
In this survey we present the history and recent progress on several fundamental (quasi)conformal uniformization problems in the complex plane. Uniformization refers to the process of mapping a space to a canonical model by means of a…
Recently, saddle point problems have received much attention due to their powerful modeling capability for a lot of problems from diverse domains. Applications of these problems occur in many applied areas, such as robust optimization,…
We study the two-dimensional geometric knapsack problem for convex polygons. Given a set of weighted convex polygons and a square knapsack, the goal is to select the most profitable subset of the given polygons that fits non-overlappingly…
Motivated by a recent Diophantine transport problem about how to transport profitably a group of persons or objects, we survey classical facts about solving systems of linear Diophantine equations and inequalities in nonnegative integers.…
The subset sum problem is known to be an NP-hard problem in the field of computer science with the fastest known approach having a run-time complexity of $O(2^{0.3113n})$. A modified version of this problem is known as the perfect sum…
We investigate the growth of a crystal that is built by depositing cubes onto the inside of a corner. The interface of this crystal evolves into a limiting shape in the long-time limit. Building on known results for the corresponding…
Shape optimization problems for interior eigenvalues is a very challenging task since already the computation of interior eigenvalues for a given shape is far from trivial. For example, a concrete maximizer with respect to shapes of fixed…
An exact, number-conserving solution to the generalized, orbit-dependent pairing problem is derived by introducing an infinite-dimensional algebra. A method for obtaining eigenvalues and eigenvectors of the corresponding Hamiltonian is also…
Consider the following toy problem. There are $m$ rectangles and $n$ points on the plane. Each rectangle $R$ is a consumer with budget $B_R$, who is interested in purchasing the cheapest item (point) inside R, given that she has enough…
The truncated multidimensional moment problem is studied in terms of the Stieltjes transform as the interpolation problem. A step-by-step algorithm is constructed for the multidimensional moment problem and the set of solutions is found in…
For a large number of random constraint satisfaction problems, such as random k-SAT and random graph and hypergraph coloring, there are very good estimates of the largest constraint density for which solutions exist. Yet, all known…
100 prisoners and a light bulb is a long standing mathematical puzzle. The problem was studied mostly in 2002 [5], 2003 [1], and 2004 [3]. Solutions in published articles had average number of visits above 3850, but best solutions on forums…
The Rubik's Cube is perhaps the world's most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the Rubik's Cube also has a rich underlying algorithmic…
Closure problems are omnipresent when simulating multiscale systems, where some quantities and processes cannot be fully prescribed despite their effects on the simulation's accuracy. Recently, scientific machine learning approaches have…