相关论文: A generalization of extension complexity that capt…

The Analyst's Traveling Salesman Problem asks for conditions under which a (finite or infinite) subset of $\mathbb{R}^N$ is contained on a curve of finite length. We show that for finite sets, the algorithm constructed by Schul (2007)and…

We introduce the Suggest-and-Improve framework for general nonconvex quadratically constrained quadratic programs (QCQPs). Using this framework, we generalize a number of known methods and provide heuristics to get approximate solutions to…

For graphs $G$ and $H$, a \emph{homomorphism} from $G$ to $H$ is an edge-preserving mapping from the vertex set of $G$ to the vertex set of $H$. For a fixed graph $H$, by \textsc{Hom($H$)} we denote the computational problem which asks…

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

We prove a complexity dichotomy theorem for counting planar graph homomorphisms of domain size 3. Given any 3 by 3 real valued symmetric matrix $H$ defining a graph homomorphism from all planar graphs $G \mapsto Z_H(G)$, we completely…

Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…

We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…

It is shown that the compressed word problem for an HNN-extension with base group H and finite associated subgroups is polynomial time Turing-reducible to the compressed word problem for H. An analogous result for amalgamated free products…

We give two general transformations that allows certain quite general basic hypergeometric multi-sums of arbitrary depth (sums that involve an arbitrary sequence $\{g(k)\}$), to be reduced to an infinite $q$-product times a single basic…

We consider the extension problem for Lie algebroids over schemes over a field. Given a locally free Lie algebroid Q over a scheme (X,O), and a sheaf of finitely generated Lie O-algebras L, we determine the obstruction to the existence of…

A new representation of Quantum Gravity is developed. This formulation is based on an extension of the group of loops. The enlarged group, that we call the Extended Loop Group, behaves locally as an infinite dimensional Lie group. Quantum…

In the Maximum Independent Set problem we are asked to find a set of pairwise nonadjacent vertices in a given graph with the maximum possible cardinality. In general graphs, this classical problem is known to be NP-hard and hard to…

We present infinitely many solutions of the general Heun equation in terms of generalized hypergeometric functions. Each solution assumes that two restrictions are imposed on the involved parameters: a characteristic exponent of one of the…

We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…

The polynomial-time hierarchy ($\mathrm{PH}$) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as $\mathrm{PH}$ does not collapse). Here, we study whether two…

For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…

The question of whether all problems in NP class are also in P class is generally considered one of the most important open questions in mathematics and theoretical computer science as it has far-reaching consequences to other problems in…

In this note, we introduce a class of cell decompositions of PL manifolds and polyhedra which are more general than triangulations yet not as general as CW complexes; we propose calling them PLCW complexes. The main result is an analog of…

We consider several ways to measure the `geometric complexity' of an embedding from a simplicial complex into Euclidean space. One of these is a version of `thickness', based on a paper of Kolmogorov and Barzdin. We prove inequalities…

We consider extending the visibility polygon of a given point $q$, inside a simple polygon $P$ by converting some edges of $P$ to mirrors. We will show that several variations of the problem of finding mirror-edges to add precisely $k$…