Related papers: SPM Bulletin 5 (Special issue)
This doctoral thesis covers several topics related to the construction and study of maximal determinant matrices with complex entries. The first three chapters are devoted to number-theoretic tools to prove the non-solvability of Gram…
The Partitioning Min-Max Weighted Matching (PMMWM) problem is an NP-hard problem that combines the problem of partitioning a group of vertices of a bipartite graph into disjoint subsets with limited size and the classical Min-Max Weighted…
1. A Wikipedia entry on topological games 2. On a fragment of the universal Baire property for sigma^1_2 sets 3. The coarse classification of homogeneous ultra-metric spaces 4. Ramsey-like embeddings 5. Proper and piecewise proper families…
Termination analysis of linear loops plays a key r\^{o}le in several areas of computer science, including program verification and abstract interpretation. Already for the simplest variants of linear loops the question of termination…
We present a new problem called the incomplete Traveling Tournament problem, which introduces the well known Traveling Tournament Problem into the realm of incomplete round-robin tournaments. We focus on the case where teams can face each…
To support large-scale model training, split learning (SL) enables multiple edge devices/servers to share the intensive training workload. However, most existing works on SL focus solely on two-tier model splitting. Moreover, while some…
We introduce and study the Minimum Feasible Tileset problem: Given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (tiles) such that each scenario can be formed by selecting at…
This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP). We unify, simplify, and extend parts of the three approaches that have been developed to…
In Terminal Monitoring Set (TMS), the input is an undirected graph $G=(V,E)$, together with a collection $T$ of terminal pairs and the goal is to find a subset $S$ of minimum size that hits a shortest path between every pair of terminals.…
On August 20, 2025, GPT-5 was reported to have solved an open problem in convex optimization. Motivated by this episode, we conducted a controlled experiment in the Malliavin--Stein framework for central limit theorems. Our objective was to…
The six Higgs doublet model is a minimal extension of the Standard Model that addresses dark matter and gauge coupling unification. Another Higgs doublet in a 5 representation of a discrete symmetry group, such as S_6, is added to the SM.…
We consider the semilinear Lane-Emden problem in a smooth bounded domain of the plane. The aim of the paper is to analyze the asymptotic behavior of sign changing solutions as the exponent p of the nonlinearity goes to infinity. Among other…
In this paper we present and evaluate a parallel algorithm for solving a minimum spanning tree (MST) problem for supercomputers with distributed memory. The algorithm relies on the relaxation of the message processing order requirement for…
In this talk, I will summarize recent developments in 5-dimensional supergravity. Apart from black ring solutions, we will discuss the way of obtaining regular (bubbling) solutions with the same charges as black holes. We outline the…
Because observations of galaxies and clusters have been found inconsistent with General Relativity (GR), the focus of effort in developing a Scalar Potential Model (SPM) has been on the examination of galaxies and clusters. The SPM has been…
We discuss recent progress many problems in random matrix theory of a combinatorial nature, including several breakthroughs that solve long standing famous conjectures.
In this paper, which corresponds to an updated version of the author's Habilitation lecture in Mathematics, we do an overview of several topics in elliptic problems. We review some old and new results regarding the Lane-Emden equation, both…
The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros of a linear recurrence sequence is the union of a finite set and finitely many arithmetic progressions. The corresponding computational question, the Skolem Problem,…
In this sequel to Resolution except for minimal singularities I, we find the smallest class of singularities in four variables with which we necessarily end up if we resolve singularities except for normal crossings. The main new feature is…
In this paper, we address the minimum-area rectangular and square annulus problem, which asks a rectangular or square annulus of minimum area, either in a fixed orientation or over all orientations, that encloses a set $P$ of $n$ input…