Related papers: The Willmore conjecture
We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…
The topic of this survey is the phenomenon of fibring over the circle for manifolds, and its group-theoretic twin, algebraic fibring. We will discuss the state of the art, and explain briefly some of the ideas behind the more recent…
We measure whether there are numerous pairs of twin primes (hereafter referred to as twin prime pairs) according to the prime number inferred by sieve of Eratosthenes. In this study, we reveal at least three additional twin prime pairs…
For a numerical semigroup S $\subseteq$ N with embedding dimension e, conductor c and left part L = S $\cap$ [0, c -- 1], set W (S) = e|L| -- c. In 1978 Wilf asked, in equivalent terms, whether W (S) $\ge$ 0 always holds, a question known…
The problem of finding a best approximation pair of two sets, which in turn generalizes the well known convex feasibility problem, has a long history that dates back to work by Cheney and Goldstein in 1959. In 2018, Aharoni, Censor, and…
We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with…
The objective here is to find the maximum polygon, in area, which can be enclosed in a given triangle, for the polygons: parallelograms, rectangles and squares. It will initially be assumed that the choices are inscribed polygons, that is…
We observe that the strong slope conjecture implies that the degree of the colored Jones polynomial detects all torus knots. As an application we obtain that an adequate knot that has the same colored Jones polynomial degrees as a torus…
Extending a proposal of Defant and Kravitz [Discrete Mathematics, \textbf{1}, 347 (2024)], we define Hitomezashi patterns and loops on a torus and provide several structural results for such loops. For a given pattern, our main theorems…
We introduce a general scheme that permits to generate successive min-max problems for producing critical points of higher and higher indices to Palais-Smale Functionals in normal Banach manifolds equipped with complete Finsler structures.…
The Merino-Welsh conjecture states that for a graph $G$ without loops and bridges the Tutte polynomial $T_G(x,y)$ satisfies the inequality $$\max(T_G(2,0),T_G(0,2))\geqslant T_G(1,1).$$ Later Jackson proved that for any matroid $M$ without…
Eugene Wigner famously argued for the "unreasonable effectiveness of mathematics" for describing physics and other natural sciences in his 1960 essay. That essay has now led to some 55 years of (sometimes anguished) soul searching ---…
The article attempts to demonstrate the rich history of one truly remarkable problem situated at the confluence of probability theory and theory of numbers - finding the probability of co-primality of two randomly selected natural numbers.…
Seymour's celebrated second neighborhood conjecture, now more than thirty years old, states that in every oriented digraph, there is a vertex $u$ such that the size of its second out-neighborhood $N^{++}(u)$ is at least as large as that of…
Our aim is to do a come back on Schiffer's and Pompeiu's conjectures with shape optimization tools, maximum principles and Serrin's symmetry method. We propose a way to get affirmative answers in some cases. We propose also sufficient…
We establish a Zador like theorem for $L^r$-optimal vector quantization when the similarity measure is a twice differentiable Bregman divergence of a strictly convex function. On our way we also prove a similar result when the Bregman…
The aim of Part II is to explore the technique of invariance of tautological equations in the realm of Gromov--Witten theory. The main result is a proof of Invariance Theorem (Invariance Conjecture~1 in [14]), via the techniques from…
The Jacobian conjecture is thought to have been proposed by O. H. Keller in 1939. However, we have found that the statement of the conjecture is precisely the main result of a paper published by L. Kraus in 1884. Although the final step of…
A classic conjecture of F\"{u}redi, Kahn and Seymour (1993) states that given any hypergraph with non-negative edge weights $w(e)$, there exists a matching $M$ such that $\sum_{e \in M} (|e|-1+1/|e|)\, w(e) \geq w^*$, where $w^*$ is the…
In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…