相关论文: A generalization of the integer linear infeasibili…
In this article, we study a calibrated version of Reifenberg theorem "with holes". In particular we study sets that are suitably approximable at all points and scales by calibrated planes and show that, without any additional hypotheses on…
Efficient resource allocation is one of the main driving forces of human civilizations. Of the many existing approaches to resource allocation, matrix completion is one that is frequently applied. In this paper, we investigate a special…
Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…
The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy…
Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this…
The linearity inherent in quantum mechanics limits current quantum hardware from directly solving nonlinear systems governed by nonlinear differential equations. One can opt for linearization frameworks such as Carleman linearization, which…
We study the computational complexity of constrained nonnegative Gram feasibility. Given a partially specified symmetric matrix together with affine relations among selected entries, the problem asks whether there exists a nonnegative…
Stationarity is a very general, qualitative assumption, that can be assessed on the basis of application specifics. It is thus a rather attractive assumption to base statistical analysis on, especially for problems for which less general…
A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…
We provide a theory to establish the existence of nonzero solutions of perturbed Hammerstein integral equations with deviated arguments, being our main ingredient the theory of fixed point index. Our approach is fairly general and covers a…
In this paper we consider an initial-boundary value problem related to some network dynamics where the underlying graph has unbounded edges. We show that there exists a C0-semigroup for this problem using a general result from the…
The continuous evolution of a wide variety of systems, including continuous-time Markov chains and linear hybrid automata, can be described in terms of linear differential equations. In this paper we study the decision problem of whether…
We study the finite convergence of iterative methods for solving convex feasibility problems. Our key assumptions are that the interior of the solution set is nonempty and that certain overrelaxation parameters converge to zero, but with a…
We construct examples of contingency tables on $n$ binary random variables where the gap between the linear programming lower/upper bound and the true integer lower/upper bounds on cell entries is exponentially large. These examples provide…
A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry,…
Given a finite family F of linear forms with integer coefficients, and a compact abelian group G, an F-free set in G is a measurable set which does not contain solutions to any equation L(x)=0 for L in F. We denote by d_F(G) the supremum of…
We study the computational complexity of the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets, or equivalently the Termination Problem for affine loops with compact semialgebraic guard sets. Consider…
We characterize the infinitesimal generator of a semigroup of linear fractional self-maps of the unit ball in $\mathbb C^n$, $n\geq 1$. For the case $n=1$ we also completely describe the associated Koenigs function and we solve the…
In the fillable array problem one must maintain an array A[1..n] of $w$-bit entries subject to random access reads and writes, and also a $\texttt{fill}(\Delta)$ operation which sets every entry of to some $\Delta\in\{0,\ldots,2^w-1\}$. We…
The main challenge with the tensor completion problem is a fundamental tension between computation power and the information-theoretic sample complexity rate. Past approaches either achieve the information-theoretic rate but lack practical…