Related papers: Another method to solve the grasshopper problem (t…
We discuss a problem initially thought for the Mathematical Olympiad but which has several interpretations. The recurrence sequences involved in this problem may be generalized to recurrence sequences related to a much larger set of…
In the present paper we consider application of overcomplete dictionaries to solution of general ill-posed linear inverse problems. In the context of regression problems, there has been enormous amount of effort to recover an unknown…
We propose an arbitrary-order discontinuous Galerkin method for second-order elliptic problem on general polygonal mesh with only one degree of freedom per element. This is achieved by locally solving a discrete least-squares over a…
Given an integer linear recurrence sequence $\langle X_n \rangle_n$, the Skolem Problem asks to determine whether there is a natural number $n$ such that $X_n = 0$. Recent work by Lipton, Luca, Nieuwveld, Ouaknine, Purser, and Worrell…
We address the numerical solution of second-order Mean Field Game problems through Newton iterations in infinite dimensions, introduced in [14], where quadratic convergence of the method was rigorously established. Building upon this…
The Golomb ruler problem is defined as follows: Given a positive integer n, locate n marks on a ruler such that the distance between any two distinct pair of marks are different from each other and the total length of the ruler is…
Solutions to the complementarity problem constructed in [1], generally, possess non-zero total charge. In natural sciences, bodies possessing non-zero total charge (ions and similar object) are considered as specific objects. Bodies…
We present bounds for the sparseness and for the degrees of the polynomials in the Nullstellensatz. Our bounds depend mainly on the unmixed volume of the input polynomial system. The degree bounds can substantially improve the known ones…
The Oberwolfach Problem $OP(F)$ -- posed by Gerhard Ringel in 1967 -- is a paradigmatic Combinatorial Design problem asking whether the complete graph $K_v$ decomposes into edge-disjoint copies of a $2$-regular graph $F$ of order $v$. In…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
We determine all continuous solutions $g\colon I\to I$ of the polynomial-like iterative equation $g^3(x)=3g(x)-2x$, where $I\subset\mathbb R$ is an interval. In particular, we obtain an answer to a problem posed by Zolt\'{a}n Boros (during…
The foundations of classical Algebraic Geometry and Real Algebraic Geometry are the Nullstellensatz and Positivstellensatz. Over the last two decades the basic analogous theorems for matrix and operator theory (noncommutative variables)…
We consider the monotone inclusion problem with a sum of 3 operators, in which 2 are monotone and 1 is monotone-Lipschitz. The classical Douglas--Rachford and Forward-backward-forward methods respectively solve the monotone inclusion…
We consider a generalization of the classical 100 Prisoner problem and its variant, involving empty boxes, whereby winning probabilities for a team depend on the number of attempts, as well as on the number of winners. We call this the…
In April 2025 GMV announced a competition for finding the best method to solve a particular polynomial system over a finite field. In this paper we provide a method for solving the given equation system significantly faster than what is…
We introduce a new approach to the anisotropic Calder\'on problem, based on a map called Poisson embedding that identifies the points of a Riemannian manifold with distributions on its boundary. We give a new uniqueness result for a large…
The wide applications of higher dimensional gravity and gauge/gravity duality have fuelled the search for new stationary solutions of the Einstein equation (possibly coupled to matter). In this topical review, we explain the mathematical…
We develop an accelerated gradient descent algorithm on the Grassmann manifold to compute the subspace spanned by a number of leading eigenvectors of a symmetric positive semi-definite matrix. This has a constant cost per iteration and a…
The Boltzmann equation has been a driving force behind significant mathematical research over the years. Its challenging theoretical complexity, combined with a wide variety of current scientific and technological problems that require…
This paper presents a study of the isosceles problem resulting by a perturbation of Euler's collinear solution under Newtonian gravitational attraction of three bodies in space. After the Hamiltonian was obtained, a circumference of…