Related papers: On the Frame-Stewart Conjecture

Deciding whether a diagram of a knot can be untangled with a given number of moves (as a part of the input) is known to be NP-complete. In this paper we determine the parameterized complexity of this problem with respect to a natural…

Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean d-space that guarantees any such point set admits a…

Upon the introduction of the Metropolis algorithm, the question of how many steps in the Markov chain were needed to achieve convergence to stationarity became apparent. The convergence was rather slow, i.e. for a process on $n$ states the…

The paper extends a stabilized fictitious domain finite element method initially developed for the Stokes problem to the incompressible Navier-Stokes equations coupled with a moving solid. This method presents the advantage to predict an…

The convex rope problem is to find a counterclockwise or clockwise convex rope starting at the vertex a and ending at the vertex b of a simple polygon P, where a is a vertex of the convex hull of P and b is visible from infinity. The convex…

We identify a one-parameter family of inequalities for the Fourier transform whose limiting case is the restriction conjecture for the sphere. Using Stein's method of complex interpolation we prove the conjectured inequalities when the…

The frame set conjecture for Hermite functions formulated in [Gr\"ochenig, J. Fourier Anal. Appl., 20(4):865-895, 2014] states that the Gabor frame set for these generators is the largest possible, that is, the time-frequency shifts of the…

We make a zig-zag conjecture describing the reductions of irreducible crystalline two-dimensional representations of $G_{{\mathbb{Q}}_p}$ of half-integral slopes and exceptional weights. Such weights are two more than twice the slope mod…

The aim of this paper is to describe an approach to a a strengthened form of J. Tits' Centre Conjecture for spherical buildings. This is accomplished by generalizing a fundamental result of G. R. Kempf from Geometric Invariant Theory and…

We prove an effective restriction theorem for stable vector bundles $E$ on a smooth projective variety: $E|_D$ is (semi)stable for all irreducible divisors $D \in |kH|$ for all $k$ greater than an explicit constant. As an application, we…

Since the transformative workshop by the American Institute of Mathematics on the minimum rank of a graph, two longstanding open problems have captivated the community interested in the minimum rank of graphs: the graph complement…

In this note we discuss the Stein restriction problem on arbitrary $n$-torus, $n\geq 2$. In contrast with the usual cases of the sphere, the parabola and the cone, we provide necessary and sufficient conditions on the Lebesgue indices, by…

The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, systems biology, sociology and finance. As the problem is known…

This paper considers a natural fault-tolerant shortest paths problem: for some constant integer $f$, given a directed weighted graph with no negative cycles and two fixed vertices $s$ and $t$, compute (either explicitly or implicitly) for…

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

We study the Steiner Tree problem on unit disk graphs. Given a $n$ vertex unit disk graph $G$, a subset $R\subseteq V(G)$ of $t$ vertices and a positive integer $k$, the objective is to decide if there exists a tree $T$ in $G$ that spans…

Let X be a complex Fano manifold of dimension n. Let s(X) be the sum of l(R)-1 for all the extremal rays of X, the edges of the cone NE(X) of curves of X, where l(R) denotes the minimum of (-K_X \cdot C) for all rational curves C whose…

The APSP Hypothesis states that the All-Pairs Shortest Paths (APSP) problem requires time $n^{3-o(1)}$ on graphs with polynomially bounded integer edge weights. Two increasingly stronger assumptions are the Strong APSP Hypothesis and the…

The "n! conjecture" of Garsia and Haiman has inspired mathematicians for nearly two decades, even after Haiman published a proof in 2001. Kumar and Funch Thomsen proved in 2003 that in order to prove the conjecture for all partitions, it…

The union-closed sets conjecture, also known as Frankl's conjecture, is a well-studied problem with various formulations. In terms of lattices, the conjecture states that every finite lattice $L$ with more than one element contains a…