Related papers: Selection principles and the minimal tower problem
The weighted set multi-cover problem is a fundamental generalization of set cover that arises in data-driven applications where one must select a small, low-cost subset from a large collection of candidates under coverage constraints. In…
This paper mainly investigates the circular open dimension problem (CODP), which consists of packing a set of circles of known radii into a strip of fixed width and unlimited length without overlapping. The objective is to minimize the…
Results of Sierpinski and others have shown that certain finite-dimensional product sets can be written as unions of subsets, each of which is "narrow" in a corresponding direction; that is, each line in that direction intersects the subset…
We study positive definite kernels pulled back along a finite family of self-maps under a subinvariance inequality for the associated branching operator. Iteration produces an increasing kernel tower with defect kernels. Under diagonal…
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and…
We use the method of higher order linearization to study an inverse boundary value problem for the minimal surface equation on a Riemannian manifold $(\mathbb{R}^n,g)$, where the metric $g$ is conformally Euclidean. In particular we show…
With powerful ability to exploit latent structure of self-representation information, different tensor decompositions have been employed into low rank multi-view clustering (LRMVC) models for achieving significant performance. However,…
It is a celebrated result in early combinatorics that, in bipartite graphs, the size of maximum matching is equal to the size of a minimum vertex cover. K\H{o}nig's proof of this fact gave an algorithm for finding a minimum vertex cover…
In this paper we study the (equivariant) topological types of a class of 3-dimensional closed manifolds (i.e., 3-dimensional small covers), each of which admits a locally standard $(\mathbb{Z}_2)^3$-action such that its orbit space is a…
These notes contain a brief introduction to the construction of toric Calabi--Yau hypersurfaces and complete intersections with a focus on issues relevant for string duality calculations. The last two sections can be read independently and…
We continue to investigate various diagonalization properties for sequences of open covers of separable metrizable spaces introduced in Part I. These properties generalize classical ones of Rothberger, Menger, Hurewicz, and Gerlits-Nagy. In…
Submodular optimization is a fundamental problem with many applications in machine learning, often involving decision-making over datasets with sensitive attributes such as gender or age. In such settings, it is often desirable to produce a…
We prove a rigidity property for mapping tori associated to minimal topological dynamical systems using tools from noncommutative geometry. More precisely, we show that under mild geometric assumptions, an orientation-preserving leafwise…
Let $(X,\tau)$ be a Hausdorff space, where $X$ is an infinite set. The compact complement topology $\tau^{\star}$ on $X$ is defined by: $\tau^{\star}=\{\emptyset\} \cup \{X\setminus M, \text{where $M$ is compact in $(X,\tau)$}\}$. In this…
We consider a decision-making problem to evaluate absolute ratings of alternatives from the results of their pairwise comparisons according to two criteria, subject to constraints on the ratings. We formulate the problem as a bi-objective…
We prove that for any tau-symmetric bihamiltonian deformation of the tau-cover of the Principal Hierarchy associated with a semisimple Frobenius manifold, the deformed tau-cover admits an infinite set of Virasoro symmetries.
A topological space is called self-covering if it is a nontrivial cover of itself. We prove that, under mild assumptions, a closed self-covering manifold with an abelian fundamental group fibers over a torus in various senses. As a…
We analyze integer linear programs which we obtain after discretizing two-dimensional subproblems arising from a trust-region algorithm for mixed integer optimal control problems with total variation regularization. We discuss NP-hardness…
A number of problems in communication systems demand the distributed allocation of network resources in order to provide better services, sampling and distribution methods. The solution to these issues is becoming more challenging due to…
For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation…