We derive a cut-and-paste surgery formula of Seiberg-Witten invariants for negative definite plumbed rational homology 3-spheres. It is similar to (and motivated by) Okuma's recursion formula [27, 4.5] targeting analytic invariants of splice-quotient singularities. Combining the two formulas automatically provides a proof of the equivariant version [11, 5.2(b)] of the Seiberg-Witten invariant conjecture [18] for these singularities.
We develop a framework for proving approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any linear program as opposed to only programs generated by hierarchies. Using our framework, we prove that O(n 1/2−ǫ )-approximations for CLIQUE require linear programs of size 2 n Ω(ǫ) . This lower bound applies to linear programs using a certain encoding of CLIQUE as a linear optimization problem. Moreover, we establish a similar result for approximations of semidefinite programs by linear programs.Our main technical ingredient is a quantitative improvement of Razborov's rectangle corruption lemma (1992) for the high error regime, which gives strong lower bounds on the nonnegative rank of shifts of the unique disjointness matrix.
Motivated by [12], we provide a framework for studying the size of linear programming formulations as well as semidefinite programming formulations of combinatorial optimization problems without encoding them first as linear programs. This is done via a factorization theorem for the optimization problem itself (and not a specific encoding of such). As a result we define a consistent reduction mechanism that degrades approximation factors in a controlled fashion and which, at the same time, is compatible with approximate linear and semidefinite programming formulations. Moreover, our reduction mechanism is a minor restriction of classical reductions establishing inapproximability in the context of PCP theorems. As a consequence we establish strong linear programming inapproximability (for LPs with a polynomial number of constraints) for several problems that are not 0/1-CSPs: we obtain a 3 2 − ε inapproximability for VertexCover (which is not of the CSP type) answering an open question in [12], we answer a weak version of our sparse graph conjecture posed in [6] showing an inapproximability factor of 1 2 +ε for bounded degree IndependentSet, and we establish inapproximability of Max-MULTI-k-CUT (a non-binary CSP). In the case of SDPs, we obtain relative inapproximability results for these problems.
We recover the Newton diagram (modulo a natural ambiguity) from the link for any surface hypersurface singularity with nondegenerate Newton principal part whose link is a rational homology sphere. As a corollary, we show that the link determines the embedded topological type, the Milnor fibration, and the multiplicity of such a germ. This proves (even a stronger version of) Zariski's Conjecture about the multiplicity for such a singularity.
We study the minimum number of constraints needed to formulate random
instances of the maximum stable set problem via linear programs (LPs), in two
distinct models. In the uniform model, the constraints of the LP are not
allowed to depend on the input graph, which should be encoded solely in the
objective function. There we prove a $2^{\Omega(n/ \log n)}$ lower bound with
probability at least $1 - 2^{-2^n}$ for every LP that is exact for a randomly
selected set of instances; each graph on at most n vertices being selected
independently with probability $p \geq 2^{-\binom{n/4}{2}+n}$. In the
non-uniform model, the constraints of the LP may depend on the input graph, but
we allow weights on the vertices. The input graph is sampled according to the
G(n, p) model. There we obtain upper and lower bounds holding with high
probability for various ranges of p. We obtain a super-polynomial lower bound
all the way from $p = \Omega(\log^{6+\varepsilon} / n)$ to $p = o (1 / \log
n)$. Our upper bound is close to this as there is only an essentially quadratic
gap in the exponent, which currently also exists in the worst-case model.
Finally, we state a conjecture that would close this gap, both in the
average-case and worst-case models
We present an information-theoretic approach to lower bound the oracle complexity of nonsmooth black box convex optimization, unifying previous lower bounding techniques by identifying a combinatorial problem, namely string guessing, as a single source of hardness. As a measure of complexity we use distributional oracle complexity, which subsumes randomized oracle complexity as well as worst-case oracle complexity. We obtain strong lower bounds on distributional oracle complexity for the box [−1, 1] n , as well as for the L p -ball for p ≥ 1 (for both low-scale and large-scale regimes), matching worst-case upper bounds, and hence we close the gap between distributional complexity, and in particular, randomized complexity, and worstcase complexity. Furthermore, the bounds remain essentially the same for high-probability and bounded-error oracle complexity, and even for combination of the two, i.e., bounded-error highprobability oracle complexity. This considerably extends the applicability of known bounds.Index Terms-Convex optimization, oracle complexity, lower complexity bounds; randomized algorithms; distributional and high-probability lower bounds.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.