Related papers: A note on the pyjama problem
We discuss solutions of several questions concerning the geometry of conformal planes.
The ancient Gamow liquid drop model of nuclear energies has had a renewed life as an interesting problem in the calculus of variations: Find a set $\Omega \subset \mathbb R^3$ with given volume A that minimizes the sum of its surface area…
The spatial Kepler problem with a perturbation satisfying the rotational symmetry w.r.t. the $z$-axis and the reflection symmetry w.r.t. the $(x, y)$-plane, can be reduced to an Hamiltonian system with 2 degrees of freedom after fixing the…
Assume you are given a finite configuration $\Gamma$ of disjoint rectifiable Jordan curves in $\mathbb{R}^n$. The Plateau-Douglas problem asks whether there exists a minimizer of area among all compact surfaces of genus at most $p$ which…
We investigate the properties of minimizers of one-dimensional variational problems when the Lagrangian has no higher smoothness than continuity. An elementary approximation result is proved, but it is shown that this cannot be in general…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
The focus of this paper is on a thin obstacle problem where the obstacle is defined on the intersection between a hyper-plane $\Gamma$ in $\mathbb{R}^n$ and a periodic perforation $\mathcal{T}_\varepsilon$ of $\mathbb{R}^n$, depending on a…
First, we consider order-$n$ ribbon tilings of an $M$-by-$N$ rectangle $R_{M,N}$ where $M$ and $N$ are much larger than $n$. We prove the existence of the growth rate $\gamma_n$ of the number of tilings and show that $\gamma_n \leq (n-1)…
For the existence of a branched covering Sigma~ --> Sigma between closed surfaces there are easy necessary conditions in terms of chi(Sigma~), chi(Sigma), orientability, the total degree, and the local degrees at the branching points. A…
Given a finite covering by closed convex sets of $B_X$, the unit ball of an infinite-dimensional Banach space, we investigate whether there is a set of the covering that contains balls of radius close to $1$ and (a) arbitrarily high finite…
We present an illustrative application of the two famous mathematical theorems in differential topology in order to show the existence of periodic orbits with arbitrary given period for a class of hamiltonians .This result point out for a…
Given a configuration of pebbles on the vertices of a graph, a pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex. The cover pebbling number of a graph, gamma(G), is the smallest…
Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…
We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which…
Amorphous packings of non-spherical particles such as ellipsoids and spherocylinders are known to be hypostatic: the number of mechanical contacts between particles is smaller than the number of degrees of freedom, thus violating Maxwell's…
A word contains a \emph{half-flip} if it contains non-empty factors $uv$ and $vu$ where $|u|=|v|$. Fici reports a non-constructive proof of the existence of an infinite word over a finite alphabet avoiding half-flips and asks for the size…
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…
The existence of minimizers in the fractional isoperimetric problem with multiple volume constraints is proved, together with a partial regularity result.
For $\varepsilon\in(0,1/2)$ and a natural number $d\ge 2$, let $N$ be a natural number with \[ N \,\ge\, 2^9\,\log_2(d)\, \left(\frac{\log_2(1/\varepsilon)}{\varepsilon}\right)^2. \] We prove that there is a set of $N$ points in the unit…
In this paper we study the non-existence of solutions to the Dirichlet problem for minimal graphs of codimension $\geq 2$, including certain situations over domain $\Omega$ even with non-$C^1$ boundary $\partial \Omega$.