Related papers: On Lifting Lower Bounds for Noncommutative Circuit…

Starting with a unit-preserving normal completely positive map L: M --> M acting on a von Neumann algebra - or more generally a dual operator system - we show that there is a unique reversible system \alpha: N --> N (i.e., a complete order…

We show that the value of the $n$-fold repeated GHZ game is at most $2^{-\Omega(n)}$, improving upon the polynomial bound established by Holmgren and Raz. Our result is established via a reduction to approximate subgroup type questions from…

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

It is well known that the permutahedron Pi_n has 2^n-2 facets. The Birkhoff polytope provides a symmetric extended formulation of Pi_n of size Theta(n^2). Recently, Goemans described a non-symmetric extended formulation of Pi_n of size…

In recent years, a very exciting and promising method for proving lower bounds for arithmetic circuits has been proposed. This method combines the method of {\it depth reduction} developed in the works of Agrawal-Vinay [AV08], Koiran…

We improve the best known lower bounds on the exponential behavior of the maximum of the number of connected sets, $N(G)$, and dominating connected sets, $N_{dom}(G)$, for regular graphs. These lower bounds are improved by constructing a…

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…

The Minimum Circuit Size Problem for Partial Functions ($MCSP^*$) is hard assuming the Exponential Time Hypothesis (ETH) (Ilango, 2020). This breakthrough hardness result leveraged a characterization of the optimal $\{\land, \lor, \neg\}$…

In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.

This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P…

We establish new results on the possible growth rates for the sequence (f_n) counting the number of orbits of a given oligomorphic group on unordered sets of size n. Macpherson showed that for primitive actions, the growth is at least…

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

Given a family $\mathcal{B}$ of axis-parallel boxes in $\mathbb{R}^d$, let $\tau$ denote its piercing number, and $\nu$ its independence number. It is an old question whether $\tau/\nu$ can be arbitrarily large for given $d\geq 2$. Here,…

We give a lower bound on the growth of a subshift based on a simple condition on the set of forbidden patterns defining that subshift. Aubrun et Al. showed a similar result based on the Lov\'asz Local Lemma for subshift over any countable…

For a simple-root $\lambda$-constacyclic code $\mathcal{C}$ over $\mathbb{F}_q$, let $\langle\rho\rangle$ and $\langle\rho,M\rangle$ be the subgroups of the automorphism group of $\mathcal{C}$ generated by the cyclic shift $\rho$, and by…

Let $G$ be the symmetric group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…

Consider a finite sequence of independent random permutations, chosen uniformly either among all permutations or among all matchings on n points. We show that, in probability, as n goes to infinity, these permutations viewed as operators on…

We say $G\to (\mathcal{C}, P_n)$ if $G-E(F)$ contains an $n$-vertex path $P_n$ for any spanning forest $F\subset G$. The size Ramsey number $\hat{R}(\mathcal{C}, P_n)$ is the smallest integer $m$ such that there exists a graph $G$ with $m$…

Let $\Omega$ be a bounded, smooth connected open domain in $\mathbb{R}^n$ with $n\geq 3$. We investigate in this paper compactness properties for the set of sign-changing solutions $v \in H^1_0(\Omega)$ of \begin{equation} \tag{*} -\Delta…

We begin a study of higher-loop corrections to the dilatation generator of N=4 SYM in non-compact sectors. In these sectors, the dilatation generator contains infinitely many interactions, and therefore one expects very complicated…