Related papers: The Willmore conjecture
This paper presents the best known bounds for a conjecture of Gluck and a conjecture of Navarro.
We note that an argument by Rogers (1958) gives a proof of Vaaler's theorem (1979) about sections of the cube and allows certain generalizations of the theorem.
Multivariate circular observations, i.e. points on a torus are nowadays very common. Multivariate wrapped models are often appropriate to describe data points scattered on p-dimensional torus. However, statistical inference based on this…
We investigate the quantum mechanics of the doubled torus system, introduced by Hull [1] to describe T-folds in a more geometric way. Classically, this system consists of a world-sheet Lagrangian together with some constraints, which reduce…
Sumner's universal tournament conjecture states that any tournament on $2n-2$ vertices contains a copy of any directed tree on $n$ vertices. We prove an asymptotic version of this conjecture, namely that any tournament on $(2+o(1))n$…
Given an ideal I in a polynomial ring, we consider the largest monomial subideal contained in I, denoted mono(I). We study mono as an interesting operation in its own right, guided by questions that arise from comparing the Betti tables of…
In 2004, Karo\'nski, \L uczak and Thomason proposed $1$-$2$-$3$-conjecture: For every nice graph $G$ there is an edge weighting function $ w:E(G)\rightarrow\{1,2,3\} $ such that the induced vertex coloring is proper. After that, the total…
In order to give a unified generalization of the BW inequality and the DDVV inequality, Lu and Wenzel proposed three Conjectures 1, 2, 3 and an open Question 1 in 2016. In this paper we discuss further these conjectures and put forward…
We reconsider the minimization of the compliance of a two dimensional elastic body with traction boundary conditions for a given weight. It is well known how to rewrite this optimal design problem as a nonlinear variational problem. We take…
A well known theorem of Kuratowski in 1932 states that a graph is planar if, and only if, it does not contain a subdivision of $K_5$ or $K_{3,3}$. Wagner proved in 1937 that if a graph other than $K_5$ does not contain any subdivision of…
We give a new proof of the Smale conjecture for $\mathbb{RP}^3$ and all lens spaces using minimal surfaces and min-max theory. For $\mathbb{RP}^3$, the conjecture was first proved in 2019 by Bamler-Kleiner using Ricci flow.
Non-linear Trajectory Optimisation (TO) methods require good initial guesses to converge to a locally optimal solution. A feasible guess can often be obtained by allocating a large amount of time for the trajectory to complete. However for…
Charles L. Dodgson, also known as Lewis Carroll, in his book "Pillow problems" from 1893 asked for the likelihood of a random triangle to be obtuse. Clearly, the answer to Dodgson's question depends strongly on the assumed random…
We improve some upper bounds for minimal dispersion on the cube and torus. /Our new ingredient is an improvement of a probabilistic lemma used to obtain upper bounds for dispersion in several previous works. Our new lemma combines a random…
We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…
Game-theoretic probability uses the structure of gambles to define a concept like probability, but which is more flexible and robust. We show that results in game-theoretic probability can be thought of as minimax theorems for specific…
We discuss some recent results on flexible polyhedra and the bellows conjecture, which claims that the volume of any flexible polyhedron is constant during the flexion. Also, we survey main methods and several open problems in this area.
Tarski's Circle Squaring Problem from 1925 asks whether it is possible to partition a disk in the plane into finitely many pieces and reassemble them via isometries to yield a partition of a square of the same area. It was finally resolved…
The classical PCP theorem is arguably the most important achievement of classical complexity theory in the past quarter century. In recent years, researchers in quantum computational complexity have tried to identify approaches and develop…
We use linear programming bounds to analyze point sets in the torus with respect to their optimality for problems in discrepancy theory and quasi-Monte Carlo methods. These concepts will be unified by introducing tensor product energies. We…