Related papers: Containment problems for polytopes and spectrahedr…
Associated to any supermanifold is a filtration by spaces, referred to as thickenings. It is the objective of this article to study them up to a certain equivalence and then up to isomorphism in the complex-analytic setting. We study them…
An \emph{s-graph} is a graph with two kinds of edges: \emph{subdivisible} edges and \emph{real} edges. A \emph{realisation} of an s-graph $B$ is any graph obtained by subdividing subdivisible edges of $B$ into paths of arbitrary length (at…
Given a pure, full-dimensional, locally strongly connected polyhedral complex C with convex support, we characterize, by a local codimension-2 condition, polyhedral complexes that coarsen C. The proof of the characterization draws upon a…
We study the power of the bounded-width consistency algorithm in the context of the fixed-template Promise Constraint Satisfaction Problem (PCSP). Our main technical finding is that the template of every PCSP that is solvable in bounded…
Physical transformations are described by linear maps that are completely positive and trace preserving (CPTP). However, maps that are positive (P) but not completely positive (CP) are instrumental to derive separability/entanglement…
We deal with Calder\'on's problem in a layered anisotropic medium $\Omega\subset\mathbb{R}^n$, $n\geq 3$, with complex anisotropic admittivity $\sigma=\gamma A$, where $A$ is a known Lipschitz matrix-valued function. We assume that the…
The constraint satisfaction problem asks to decide if a set of constraints over a relational structure $\mathcal{A}$ is satisfiable (CSP$(\mathcal{A})$). We consider CSP$(\mathcal{A} \cup \mathcal{B})$ where $\mathcal{A}$ is a structure and…
Let $A$ be a polytope in $\mathbb{R}^d$ (not necessarily convex or connected). We say that $A$ is spectral if the space $L^2(A)$ has an orthogonal basis consisting of exponential functions. A result due to Kolountzakis and Papadimitrakis…
In this thesis, we settle the computational complexity of some fundamental questions in polynomial optimization. These include the questions of (i) finding a local minimum, (ii) testing local minimality of a point, and (iii) deciding…
By a polygonization of a finite point set $S$ in the plane we understand a simple polygon having $S$ as the set of its vertices. Let $B$ and $R$ be sets of blue and red points, respectively, in the plane such that $B\cup R$ is in general…
The subalgebra membership problem is the problem of deciding if a given element belongs to an algebra given by a set of generators. This is one of the best established computational problems in algebra. We consider a variant of this…
Let $K\subset R^n$ be a compact basic semi-algebraic set. We provide a necessary and sufficient condition (with no a priori bounding parameter) for a real sequence $y=(y_\alpha)$, $\alpha\in N^n$, to have a finite representing Borel measure…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
We show that a class of semidefinite programs (SDP) admits a solution that is a positive semidefinite matrix of rank at most $r$, where $r$ is the rank of the matrix involved in the objective function of the SDP. The optimization problems…
The metrics of S. Y. Cheng and S.-T. Yau are considered on a strictly pseudoconvex domains in a complex manifold. Such a manifold carries a complete K\"{a}hler-Einstein metric if and only if its canonical bundle is positive. We consider the…
We consider a class of $0$-$1$ polynomial programming termed multiple choice polynomial programming (MCPP) where the constraint requires exact one component per subset of the partition to be $1$ after all the entries are partitioned.…
We consider the problem of deciding, given a sequence of regions, if there is a choice of points, one for each region, such that the induced polyline is simple or weakly simple, meaning that it can touch but not cross itself. Specifically,…
This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.
In hep-th/0211011 we started a systematic investigation of open strings in the plane wave background. In this paper we continue the analysis by discussing the superalgebras of conserved charges, the spectra of open strings, and the spectra…
Several signal recovery tasks can be relaxed into semidefinite programs with rank-one minimizers. A common technique for proving these programs succeed is to construct a dual certificate. Unfortunately, dual certificates may not exist under…