Related papers: SPM Bulletin 5 (Special issue)
The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications. In the last few years several approaches,…
Randomized subspace embedding methods have had a great impact on the solution of a linear least squares (LS) problem by reducing its row dimension, leading to a randomized or sketched LS (sLS) problem, and use the solution of the sLS…
In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…
The minimum sum-of-squares clustering problem (MSSC) consists of partitioning $n$ observations into $k$ clusters in order to minimize the sum of squared distances from the points to the centroid of their cluster. In this paper, we propose…
This paper introduces the 2019 version of \us{}, a novel Constraint Programming framework for floating point verification problems expressed with the SMT language of SMTLIB. SMT solvers decompose their task by delegating to specific…
A method is suggested for treating those complicated physical problems for which exact solutions are not known but a few approximation terms of a calculational algorithm can be derived. The method permits one to answer the following rather…
The purpose of this bulletin board is to collect problems in higher dimensional complex analysis. We are interested both in basic research questions as well as interactive questions with other fields and sciences. We encourage everybody to…
Finding a low-weight multiple (LWPM) of a given polynomial is very useful in the cryptanalysis of stream ciphers and arithmetic in finite fields. There is no known deterministic polynomial time complexity algorithm for solving this problem,…
Motivated by a question of Defant and Propp (2020) regarding the connection between the degrees of noninvertibility of functions and those of their iterates, we address the combinatorial optimization problem of minimizing the sum of squares…
The investigation of gravity in higher-dimensional spacetime has transitioned from a mathematical curiosity to a fundamental framework in theoretical physics, catalyzed by the dimensional requirements of String theory and M-theory. In this…
This special issue is dedicated to starshades: science, engineering, technology and programmatics. Our reasons for organizing this special issue are several fold. First as a new technology and with research accomplished in many…
Recently developed supersymmetric perturbation theory has been successfully employed to make a complete mathematical analysis the reason behind exact solvability of some non-central potentials. This investigation clarifies once more the…
We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…
We give a light introduction to selection principles in topology, a young subfield of infinite-combinatorial topology. Emphasis is put on the modern approach to the problems it deals with. Recent results are described, and open problems are…
Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint…
Extremal Combinatorics is among the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science and Information Theory. This paper contains a…
Gives the most precise available description of the p-Frattini module for any p-perfect finite group G=G_0 (Thm. 2.8), and therefore of the groups G_{k,ab}, k \ge 0, from which we form the abelianized M(odular) T(ower). \S 4 includes a…
CONTENTS: New reals: Can live with them, can live without them; Uniform almost everywhere domination; Heredity of tau-pseudocompactness; Understanding preservation theorems: omega^omega-bounding; Classification problems in continuum theory;…
The indefinite least squares (ILS) problem is a generalization of the famous linear least squares problem. It minimizes an indefinite quadratic form with respect to a signature matrix. For this problem, we first propose an impressively…
The present paper is devoted to studying of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by methods of Linear Programming. The estimate on the multiplicity of multi-tours appearing in the…