Related papers: On the Complexity of Branching Proofs

The slice-rank method, introduced by Tao as a symmetrized version of the polynomial method of Croot, Lev and Pach and Ellenberg and Gijswijt, has proved to be a useful tool in a variety of combinatorial problems. Explicit tensors have been…

We eliminate a key roadblock to efficient verification of nonlinear integer arithmetic using CDCL SAT solvers, by showing how to construct short resolution proofs for many properties of the most widely used multiplier circuits. Such short…

In this paper, we study a certain type of Hurwitz numbers which count branched covers over the Riemann sphere admitting several branch points with fixed ramification types, one branch point with a fixed number of preimages, and one branch…

We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must…

The type C_n full root polytope is the convex hull in R^n of the origin and the points e_i-e_j, e_i+e_j, 2e_k for 1 <= i < j <= n, k \in [n]. Given a graph G, with edges labeled positive or negative, associate to each edge e of G a vector…

We present a closed formula for the branching coefficients of an embedding p in g of two finite-dimensional semi-simple Lie algebras. The formula is based on the untwisted affine extension of p. It leads to an alternative proof of a simple…

We propose an infinitesimal counterpart to the notion of braided category. The corresponding infinitesimal braidings are natural transformations which are compatible with an underlying braided monoidal structure in the sense that they…

Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the orignial polytope are hereditary to its…

We present a new proof of a theorem of Chen and Jiang: for any integer $n>1$, there is a constant $K_n>0$ such that every smooth projective $n$-fold $X$ with $\operatorname{vol}(X)>K_n$ has either the stable birational $2$-canonical map or…

We discuss two approaches to producing generalized parity proofs of the Kochen-Specker theorem. Such proofs use contexts of observables whose product is $I$ or $-I$; we call them constraints. In the first approach, one starts with a fixed…

It is well known that, as $n$ tends to infinity, the probability of satisfiability for a random 2-SAT formula on $n$ variables, where each clause occurs independently with probability $\alpha/2n$, exhibits a sharp threshold at $\alpha=1$.…

For an $n$-vertex graph $G$, let $z(G;k)$ denote the number of zero forcing sets of size $k$. A conjecture of Boyer et al. asserts that the path $P_n$ maximizes these numbers coefficientwise among all $n$-vertex graphs; equivalently, the…

We investigate the question whether Subset Sum can be solved by a polynomial-time algorithm with access to a certificate of length poly(k) where k is the maximal number of bits in an input number. In other words, can it be solved using only…

Hadwiger and Debrunner showed that for families of convex sets in $\mathbb{R}^d$ with the property that among any $p$ of them some $q$ have a common point, the whole family can be stabbed with $p-q+1$ points if $p \geq q \geq d+1$ and…

Twisting a given knot $K$ about an unknotted circle $c$ a full $n \in \mathbb{N}$ times, we obtain a "twist family" of knots $\{ K_n \}$. Work of Kouno-Motegi-Shibuya implies that for a non-trivial twist family the crossing numbers…

This paper gives infinitely many examples of unknot diagrams that are hard, in the sense that the diagrams need to be made more complicated by Reidemeister moves before they can be simplified. In order to construct these diagrams, we prove…

We study the Short Path Packing problem which asks, given a graph $G$, integers $k$ and $\ell$, and vertices $s$ and $t$, whether there exist $k$ pairwise internally vertex-disjoint $s$-$t$ paths of length at most $\ell$. The problem has…

Let $t\ge 1$ be a given integer. Let ${\cal F}$ be a family of subsets of $[m]=\{1,2,\ldots,m\}$. Assume that for every pair of disjoint sets $S,T\subset [m]$ with $|S|=|T|=k$, there do not exist $2t$ sets in ${\cal F}$ where $t$ subsets of…

We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…

Given a tame knot K presented in the form of a knot diagram, we show that the problem of determining whether K is knotted is in the complexity class NP, assuming the generalized Riemann hypothesis (GRH). In other words, there exists a…