Related papers: Another method to solve the grasshopper problem (t…
A fundamental relation in celestial mechanics is Kepler's equation, linking an orbit's mean anomaly to its eccentric anomaly and eccentricity. Being transcendental, the equation cannot be directly solved for eccentric anomaly by…
Absolute pose estimation is a fundamental problem in computer vision, and it is a typical parameter estimation problem, meaning that efforts to solve it will always suffer from outlier-contaminated data. Conventionally, for a fixed…
Understanding bounds for the effective differential Nullstellensatz is a central problem in differential algebraic geometry. Recently, several bounds have been obtained using Dicksonian and antichains sequences (with a given growth rate).…
We study a combinatorial game derived from a problem in the German National Mathematics Competition. In this game, two players take turns removing numbers from a finite set of natural numbers, aiming to satisfy a certain divisibility…
In this article, we studied the inverse Erd\H{o}s-Heilbronn problem with the restricted sumset from two components $A$ and $B$ that are not necessarily the same. We give a completely elementary proof for the problem in $\mathbb{Z}$ and some…
The main purpose of this paper is to give a survey of recent development on a classification of soliton solutions of the KP equation. The paper is self-contained, and we give a complete proof for the theorems needed for the classification.…
Since Isaac Newton first studied the Kissing Number Problem in 1694, determining the maximal number of non-overlapping spheres around a central sphere has remained a fundamental challenge. This problem is the local analogue of Hilbert's…
Grasping in cluttered environments is a fundamental but challenging robotic skill. It requires both reasoning about unseen object parts and potential collisions with the manipulator. Most existing data-driven approaches avoid this problem…
Non-Stop University CRYPTO is the International Olympiad in Cryptography that was held for the eight time in 2021. Hundreds of university and school students, professionals from 33 countries worked on mathematical problems in cryptography…
Alon's combinatorial Nullstellensatz (Theorem 1.1 from \cite{Alon1}) is one of the most powerful algebraic tools in combinatorics, with a diverse array of applications. Let $\F$ be a field, $S_1,S_2,..., S_n$ be finite nonempty subsets of…
Variational inequalities can in general support distinct solutions. In this paper we study an algorithm for computing distinct solutions of a variational inequality, without varying the initial guess supplied to the solver. The central idea…
Alt's problem, formulated in 1923, is to count the number of four-bar linkages whose coupler curve interpolates nine general points in the plane. This problem can be phrased as counting the number of solutions to a system of polynomial…
A Green's function based solver for the modified Bessel equation has been developed with the primary motivation of solving the Poisson equation in cylindrical geometries. The method is implemented using a Discrete Hankel Transform and a…
The aim of this paper is to justify in dimensions two and three the ansatz of Caracciolo et al. stating that the displacement in the optimal matching problem is essentially given by the solution to the linearized equation i.e. the Poisson…
We give an infinite number of exact solutions to the 5-dimensional static Einstein equation with axial symmetry by using the inverse scattering method. The solutions are characterized by two integers representing the soliton numbers. The…
We study increasing subsequences (IS) for an ensemble of sequences given by permutation of numbers {1,2,...,n}. We consider a Boltzmann ensemble at temperature T. Thus each IS appears with the corresponding Boltzmann probability where the…
We concern the problem of modifying the edge lengths of a tree in minimum total cost so that the prespecified $p$ vertices become the $p$-maxian with respect to the new edge lengths. This problem is called the inverse $p$-maxian problem on…
We establish the existence of free energy limits for several combinatorial models on Erd\"{o}s-R\'{e}nyi graph $\mathbb {G}(N,\lfloor cN\rfloor)$ and random $r$-regular graph $\mathbb {G}(N,r)$. For a variety of models, including…
The solution of the Ornstein-Zernike equation with various closure approximations is studied. This problem is rewritten as an integral equation that can be solved iteratively on a grid. The convergence of the fixed point iterations is…
The 3SUM problem asks if an input $n$-set of real numbers contains a triple whose sum is zero. We consider the 3POL problem, a natural generalization of 3SUM where we replace the sum function by a constant-degree polynomial in three…