English
Related papers

Related papers: Short $\mathsf{Res}^*(\mathsf{polylog})$ refutatio…

200 papers

We observe that Kirchberg's QWEP conjecture is equivalent to the statement that $C^*(\mathbb{F})$ is elementarily equivalent to a QWEP C$^*$ algebra. We also make a few other model-theoretic remarks about WEP and LLP C$^*$ algebras.

Operator Algebras · Mathematics 2015-11-03 Isaac Goldbring

We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…

Computational Complexity · Computer Science 2025-02-11 Tejas Nareddy , Abhishek Mishra

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…

Optimization and Control · Mathematics 2011-05-13 Jean B. Lasserre

We propose an algorithm for answering conjunctive queries with negation, where the negated relations have bounded degree. Its data complexity matches that of the best known algorithms for the positive subquery of the input query and is…

Databases · Computer Science 2019-01-29 Mahmoud Abo Khamis , Hung Q. Ngo , Dan Olteanu , Dan Suciu

The 1-in-3 and Not-All-Equal satisfiability problems for Boolean CNF formulas are two well-known NP-hard problems. In contrast, the promise 1-in-3 vs. Not-All-Equal problem can be solved in polynomial time. In the present work, we…

Computational Complexity · Computer Science 2025-05-09 Lorenzo Ciardo , Marcin Kozik , Andrei Krokhin , Tamio-Vesa Nakajima , Stanislav Živný

We establish cancellation in short sums of certain special trace functions over $\mathbb{F}_q[u]$ below the P\'{o}lya-Vinogradov range, with savings approaching square-root cancellation as $q$ grows. This is used to resolve the…

Number Theory · Mathematics 2020-08-25 Will Sawin , Mark Shusterman

Let $D$ be the set of $n\times n$ positive semidefinite matrices of trace equal to one, also known as the set of density matrices. We prove two results on the hardness of approximating $D$ with polytopes. First, we show that if $0 <…

Optimization and Control · Mathematics 2022-06-14 Hamza Fawzi

Recently, E.Feigin introduced a very interesting contraction $\mathfrak q$ of a semisimple Lie algebra $\mathfrak g$ (see arXiv:1007.0646 and arXiv:1101.1898). We prove that these non-reductive Lie algebras retain good invariant-theoretic…

Algebraic Geometry · Mathematics 2011-07-05 Dmitri Panyushev , Oksana Yakimova

The Aristotelian syllogistic cannot account for the validity of many inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a)…

Logic in Computer Science · Computer Science 2024-04-24 Ian Pratt-Hartmann , Lawrence S. Moss

In this work, we consider a finitely determined, quasihomogeneous, corank 1 map germ $f$ from $(\mathbb{C}^2,0)$ to $(\mathbb{C}^3,0)$. We introduce the concept of the $\mu_{\mathbf{m},\mathbf{k}}$-minimal transverse slice of $f$}. Since…

Algebraic Geometry · Mathematics 2025-10-14 Otoniel Nogueira da Silva , Manoel Messias da Silva Júnior

We present a proof of the conjecture $\mathcal{NP}$ = $\mathcal{PSPACE}$ by showing that arbitrary tautologies of Johansson's minimal propositional logic admit "small" polynomial-size dag-like natural deductions in Prawitz's system for…

Computational Complexity · Computer Science 2016-10-03 Lew Gordeev , Edward Hermann Haeusler

The inverse conjecture for the Gowers norms $U^d(V)$ for finite-dimensional vector spaces $V$ over a finite field $\F$ asserts, roughly speaking, that a bounded function $f$ has large Gowers norm $\|f\|_{U^d(V)}$ if and only if it…

Combinatorics · Mathematics 2012-01-04 Terence Tao , Tamar Ziegler

In this short note, we will show the following weak evidence of S. Lang conjecture over function fields. Let f : X ---> Y be a projective and surjective morphism of algebraic varieties over an algebraically closed field k of characteristic…

alg-geom · Mathematics 2008-02-03 Atsushi Moriwaki

We show that every real polynomial $f$ nonnegative on $[-1,1]^{n}$ can be approximated in the $l_{1}$-norm of coefficients, by a sequence of polynomials $\{f_{\ep r}\}$ that are sums of squares. This complements the existence of s.o.s.…

Algebraic Geometry · Mathematics 2007-05-23 Jean B. Lasserre , Tim Netzer

We present a short proof of Reisner's Theorem, characterizing which simplicial complexes have a Cohen-Macaulay face ring. In some cases, we can also express some homological invariants of the face ring in terms of the reduced homology of…

Commutative Algebra · Mathematics 2016-09-07 Silvano Baggio

We show that for every integer $k \geq 2$, the Res($k$) propositional proof system does not have the weak feasible disjunction property. Next, we generalize a recent result of Atserias and M\"uller [FOCS, 2019] to Res($k$). We show that if…

Computational Complexity · Computer Science 2020-03-24 Michal Garlík

We introduce a new algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent…

Computational Complexity · Computer Science 2014-04-16 Joshua A. Grochow , Toniann Pitassi

In this paper we show that the reducibility structure of several covers of sofic shifts is a flow invariant. In addition, we prove that for an irreducible subshift of almost finite type the left Krieger cover and the past set cover are…

Dynamical Systems · Mathematics 2013-01-08 Teresa Bates , Soren Eilers , David Pask

In this paper we study the nuclearity and weak containment property of reduced cross-sectional C*-algebras of Fell bundles over inverse semigroups. In order to develop the theory, we first prove an analogue of Fell's absorption trick in the…

Operator Algebras · Mathematics 2023-08-10 Alcides Buss , Diego Martínez

Denote by $\Delta_M$ the $M$-dimensional simplex. A map $f\colon \Delta_M\to\mathbb R^d$ is an almost $r$-embedding if $f\sigma_1\cap\ldots\cap f\sigma_r=\emptyset$ whenever $\sigma_1,\ldots,\sigma_r$ are pairwise disjoint faces. A…

Geometric Topology · Mathematics 2026-01-08 S. Avvakumov , R. Karasev , A. Skopenkov
‹ Prev 1 8 9 10 Next ›