相关论文: Containment problems for polytopes and spectrahedr…
We study the Constraint Satisfaction Problem CSP(A), where A is first-order definable in (Z;+,1) and contains +. We prove such problems are either in P or NP-complete.
Spherical confinement in 3D harmonic, quartic and other higher oscillators of even order is studied. The generalized pseudospectral method is employed for accurate solution of relevant Schr\"odinger equation in an \emph{optimum,…
In this paper, we continue the study of quantum B-algebras with emphasis on filters on integral quantum B-algebras. We then study filters in the setting of pseudo-hoops. First, we establish an embedding of a cartesion product of polars of a…
Polyhedra and spectrahedra over the real numbers, or more generally their images under linear maps, are respectively the feasible sets of linear and semidefinite programming, and form the family of semidefinite-representable sets. This…
Let $S =\{x\in \re^n: g_1(x)\geq 0, ..., g_m(x)\geq 0\}$ be a semialgebraic set defined by multivariate polynomials $g_i(x)$. Assume $S$ is convex, compact and has nonempty interior. Let $S_i =\{x\in \re^n: g_i(x)\geq 0\}$, and $\bdS$…
In this article we develop new methods for exhibiting convex semialgebraic sets that are not spectrahedral shadows. We characterize when the set of nonnegative polynomials with a given support is a spectrahedral shadow in terms of sums of…
The Helton-Nie Conjecture (HNC) is the proposition that every convex semialgebraic set is a spectrahedral shadow. Here we prove that HNC is equivalent to another propo- sition related to quadratically constrained quadratic programming.…
We investigate in a $2$D setting the scattering of time-harmonic electromagnetic waves by a plasmonic device, represented as a non dissipative bounded and penetrable obstacle with a negative permittivity. Using the $\textrm{T}$-coercivity…
We investigate the nature of subsets of spheres which satisfy a tameness condition associated with the Bieri-Groves conjecture on cohomological finiteness conditions for metabelian groups. We find that there is a natural polyhedrality in a…
It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…
A characterization of the structure of a regular matrix pencil obtained by a bounded rank perturbation of another regular matrix pencil has been recently obtained. The result generalizes the solution for the bounded rank perturbation…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
We present a comprehensive study of stationary states in a coherent medium with a quadratic or Kerr nonlinearity in the presence of localized potentials in one dimension (1D) for both positive and negative signs of the nonlinear term, as…
The odd-red bipartite perfect matching problem asks to find a perfect matching containing an odd number of red edges in a given red-blue edge-colored bipartite graph. While this problem lies in $\mathsf{P}$, its polyhedral structure remains…
A fundamental graph problem is to recognize whether the vertex set of a graph $G$ can be bipartitioned into sets $A$ and $B$ such that $G[A]$ and $G[B]$ satisfy properties $\Pi_A$ and $\Pi_B$, respectively. This so-called…
We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…
We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…
Call an $n$-by-$n$ invertible matrix $S$ a \emph{Perron similarity} if there is a real non-scalar diagonal matrix $D$ such that $S D S^{-1}$ is entrywise nonnegative. We give two characterizations of Perron similarities and study the…
We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…