Related papers: SPM Bulletin 5 (Special issue)
In this survey paper we discuss some recent results and related open questions in additive combinatorics, in particular, questions about sumsets in finite abelian groups.
In many applications including integer-forcing linear multiple-input and multiple-output (MIMO) receiver design, one needs to solve a successive minima problem (SMP) on an $n$-dimensional lattice to get an optimal integer coefficient matrix…
We define a class of algebras, the semilattices of Mal'cev blocks (for short, SMB algebras). In a nutshell, these algebras are semilattices in which each element gets blown up into a Mal'cev algebra. We publish for the first time our old…
This paper identifies a new class of shape invariant models. These models are based on extensions of conventional quantum mechanics that satisfy a string-motivated minimal length uncertainty relation. An important feature of our…
The Stable Marriage problem (SM), solved by the famous deferred acceptance algorithm of Gale and Shapley (GS), has many natural generalizations. If we allow ties in preferences, then the problem of finding a maximum stable matching becomes…
The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite…
We study diagonalizations of covers using various selection principles, where the covers are related to linear quasiorderings (tau-covers). This includes: equivalences and nonequivalences, combinatorial characterizations, critical…
By supplementing minimal supersymmetric SU(5) (MSSU(5)) with a flavor ${\cal U}(1)$ symmetry and two pairs of $\bar{15}+15$ `matter' supermultiplets, we present an improved model which explains the charged fermion mass hierarchies and the…
During the last few years progress has been made on several fronts making it possible to revisit Cauchy-perturbative matching (CPM) in numerical relativity in a more robust and accurate way. This paper is the first in a series where we plan…
After quick survey of some key results and open questions about the structure of singularities of minimal surfaces, we discuss recent work~\cite{Sim23} on singularities of stable minimal hypersurfaces, including some simplifications of the…
Distributing points on a (possibly high-dimensional) sphere with minimal energy is a long-standing problem in and outside the field of mathematics. This paper considers a novel energy function that arises naturally from statistics and…
We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on an iterated application of the Pigeonhole Principle. This…
An introduction to the minimal supersymmetric Standard Model (MSSM) is given. The motivation for ``low-energy'' supersymmetry is reviewed, and the structure of the MSSM is outlined. In its most general form, the MSSM can be viewed as a…
We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$ in $\mathbb R^{d+1}$ of the total potential of a point configuration $\omega_N\subset S^{d}$ which is a spherical $(2m-1)$-design contained…
We revisit J. Shallit's minimization problem from 1994 SIAM Review concerning a two-term asymptotics of the minimum of a certain rational sum involving variables and products of their reciprocals, the number of variables being the large…
The field of fine-grained complexity aims at proving conditional lower bounds on the time complexity of computational problems. One of the most popular assumptions, Strong Exponential Time Hypothesis (SETH), implies that SAT cannot be…
Positive linear programs (LP), also known as packing and covering linear programs, are an important class of problems that bridges computer science, operations research, and optimization. Despite the consistent efforts on this problem, all…
This paper explores the finiteness of the solution set of the polynomial complementarity problem (PCP). To achieve this goal, we introduce two new classes of structured tensor tuples, namely the nondegenerate tensor tuple and the strong…
Subspace segmentation or subspace learning is a challenging and complicated task in machine learning. This paper builds a primary frame and solid theoretical bases for the minimal subspace segmentation (MSS) of finite samples. Existence and…
We thoroughly study a novel but basic combinatorial matrix completion problem: Given a binary incomplete matrix, fill in the missing entries so that every pair of rows in the resulting matrix has a Hamming distance within a specified range.…