Related papers: On the Frame-Stewart Conjecture
We introduce two new metrics of "simplicity" for knight's tours: the number of turns and the number of crossings. We give a novel algorithm that produces tours with $9.25n+O(1)$ turns and $12n+O(1)$ crossings on an $n\times n$ board, and we…
The Manin-Peyre conjecture is established for smooth spherical Fano threefolds of semisimple rank one and type N. Together with the previously solved case T and the toric cases, this covers all types of smooth spherical Fano threefolds. The…
One of the oldest outstanding problems in dynamical algebraic combinatorics is the following conjecture of P. Cameron and D. Fon-Der-Flaass (1995). Consider a plane partition $P$ in an $a \times b \times c$ box ${\sf B}$. Let $\Psi(P)$…
This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…
This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…
We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…
If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of…
In a recent paper in Appl. Comput. Harmon. Anal. 38(2), 196--221 (2014) we have introduced and studied the notion of weak Hamiltonian deformation of a Gabor (=Weyl-Heisenberg) frame. In this Note we use these results to prove that one can…
In this note we give a shorter proof of recent regularity results by Riviere and Riviere-Struwe. We differ from the mentioned articles only in using the direct method of Helein's moving frame to construct a suitable gauge transformation.…
We modify the rules of the classical Tower of Hanoi puzzle in a quite natural way to get the Fibonacci sequence involved in the optimal algorithm of resolution, and show some nice properties of such a variant. In particular, we deduce from…
In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is quite different than the known approaches and it rely on the…
In this paper we first extend the diminishing stepsize method for nonconvex constrained problems presented in [4] to deal with equality constraints and a nonsmooth objective function of composite type. We then consider the particular case…
The 15 puzzle is a classic reconfiguration puzzle with fifteen uniquely labeled unit squares within a $4 \times 4$ board in which the goal is to slide the squares (without ever overlapping) into a target configuration. By generalizing the…
A polyhedron $\textbf{P} \subset \mathbb{R}^3$ has Rupert's property if a hole can be cut into it, such that a copy of $\textbf{P}$ can pass through this hole. There are several works investigating this property for some specific polyhedra:…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…
A mean-convex set can be regarded as a barrier for the construction of minimal surfaces. Namely, if we are given a mean-convex set and a null-homotopic Jordan curve on its boundary, then there exists an embedded minimal disk with boundary…
We propose a PnP algorithm for a camera constrained to two-dimensional motion (applicable, for instance, to many wheeled robotics platforms). Leveraging this assumption allows accuracy and performance improvements over 3D PnP algorithms due…
FAST problem is finding minimum feedback arc set problem in tournaments. In this paper we present some algorithms that are similar to sorting algorithms for FAST problem and we analyze them. We present Pseudo_InsertionSort algorithm for…
In this paper, we consider minimizing the action functional as a method for numerically discovering periodic solutions to the $n$-body problem. With this method, we can find a large number of choreographies and other more general solutions.…
We prove the Strengthened Hanna Neumann Conjecture. We give a more direct cohomological interpretation of the conjecture in terms of "typical" covering maps, and use graph Galois theory to "symmetrize" the conjecture. The conjecture is then…