Related papers: Containment problems for polytopes and spectrahedr…
In this article we prove that a semialgebraic map is a branched covering if and only if its associated spectral map is a branched covering. In addition, such spectral map has a neat behavior with respect to the branching locus, the…
We find the S-matrix which describes the scattering of two-particle bound states of the light-cone string sigma model on AdS5xS5. We realize the M-particle bound state representation of the centrally extended su(2|2) algebra on the space of…
We consider a complex Plateau problem for strongly pseudoconvex contours in non K\"ahler manifolds. A positive solution in the case of manifolds carrying a pluriclosed Hermitian metric forms is given. For the general case we propose a…
A new approach to solving a class of rankconstrained semi-definite programming (SDP) problems, which appear in many signal processing applications such as transmit beamspace design in multiple-input multiple-output (MIMO) radar, downlink…
Given an integer matrix A satisfying certain regularity assumptions, we consider for a positive integer s the set F_s(A) of all integer vectors b such that the associated knapsack polytope P(A,b)={x: Ax=b, x non-negative} contains at least…
Seeking tighter relaxations of combinatorial optimization problems, semidefinite programming is a generalization of linear programming that offers better bounds and is still polynomially solvable. Yet, in practice, a semidefinite program is…
In this paper, by refining approximation theorems for holomorphic sections of adjoint line bundles, it is proved that the regular locus of a weakly pseudoconvex complex space admitting a positive line bundle can be holomorphically embedded…
The question of the existence of a polynomial kernelization of the Vertex Cover Above LP problem has been a longstanding, notorious open problem in Parameterized Complexity. Five years ago, the breakthrough work by Kratsch and Wahlstrom on…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…
A class of optimal control problems governed by semilinear parabolic equations with mixed pointwise constraints is considered. We give some criteria under which the first and second-order optimality conditions are of KKT-type. We then prove…
In this paper, we discuss a class of spectral partition problems with a measure constraint, for partitions of a given bounded connected open set. We establish the existence of an optimal open partition, showing that the corresponding…
The famous de Boor conjecture states that the condition of the polynomial B-spline collocation matrix at the knot averages is bounded independently of the knot sequence, i.e., depends only on the spline degree. For highly nonuniform knot…
Given an integral $d \times n$ matrix $A$, the well-studied affine semigroup $\mbox{ Sg} (A)=\{ b : Ax=b, \ x \in {\mathbb Z}^n, x \geq 0\}$ can be stratified by the number of lattice points inside the parametric polyhedra $P_A(b)=\{x:…
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate…
A mixed boundary value problem for the Stokes system in a polyhedral domain is considered. Here different boundary conditions (in particular, Dirichlet, Neumann, free surface conditions) are prescribed on the sides of the polyhedron. The…
We investigate structural properties of the completely positive semidefinite cone $\mathcal{CS}_+^n$, consisting of all the $n \times n$ symmetric matrices that admit a Gram representation by positive semidefinite matrices of any size. This…
For a fixed set ${\cal H}$ of graphs, a graph $G$ is ${\cal H}$-subgraph-free if $G$ does not contain any $H \in {\cal H}$ as a (not necessarily induced) subgraph. A recently proposed framework gives a complete classification on ${\cal…
A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most…
We analyze static properties of a strongly confined semiflexible polymer, i.e. either trapped in a closed space or compressed by external forces, in an athermal solvent. Like a flexible polymer case, we can resort to an analogy with the…