Related papers: Selection principles and the minimal tower problem
Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…
We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…
We investigate structural parameterizations of two identification problems: LOCATING-DOMINATING SET and TEST COVER. In the first problem, an input is a graph $G$ on $n$ vertices and an integer $k$, and one asks if there is a subset $S$ of…
We consider a variant of the set covering problem with uncertain parameters, which we refer to as the chance-constrained set multicover problem (CC-SMCP). In this problem, we assume that there is uncertainty regarding whether a selected set…
We continue to investigate applications of $k$-covers in function spaces with the compact-open topology.
We study the existence of solutions to general measure-minimization problems over topological classes that are stable under localized Lipschitz homotopy, including the standard Plateau problem without the need for restrictive assumptions…
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory,…
Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…
A minimum dominating set in a graph is a minimum set of vertices such that every vertex of the graph either belongs to it, or is adjacent to one vertex of this set. This mathematical object is of high relevance in a number of applications…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
This paper presents a canonical duality approach for solving a general topology optimization problem of nonlinear elastic structures. By using finite element method, this most challenging problem can be formulated as a mixed integer…
We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union…
Obtaining strong linear relaxations of capacitated covering problems constitute a major technical challenge even for simple settings. For one of the most basic cases, the Knapsack-Cover (Min-Knapsack) problem, the relaxation based on…
We show that points in the intersection of the tropicalizations of subvarieties of a torus lift to algebraic intersection points with expected multiplicities, provided that the tropicalizations intersect in the expected dimension. We also…
The support of minimizing measures of the causal variational principle on the sphere is analyzed. It is proven that in the case $\tau>\sqrt{3}$, the support of every minimizing measure is contained in a finite number of real analytic curves…
The theory of coverings of the two-dimensional torus is a standard part of algebraic topology and has applications in several topics in string theory, for example, in topological strings. This paper initiates applications of this theory to…
We construct the minimal resolutions of three classes of monomial ideals: dominant, 1-semidominant, and 2-semidominant ideals. The families of dominant and 1-semidominant ideals extend those of complete and almost complete intersections. We…
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subset of F such that each point p in P is covered by (contained…
Comparison principles are developed for discrete quasilinear elliptic partial differential equations. We consider the analysis of a class of nonmonotone Leray-Lions problems featuring both nonlinear solution and gradient dependence in the…
We introduce a universally applicable method, based on the bond-algebraic theory of dualities, to search for generalized order parameters in disparate systems including non-Landau systems with topological order. A key notion that we advance…