Related papers: Proof Complexity and the Kneser-Lov\'asz Theorem
The Lov\'asz Local Lemma is a seminal result in probabilistic combinatorics. It gives a sufficient condition on a probability space and a collection of events for the existence of an outcome that simultaneously avoids all of those events.…
Let $\mathsf{TT}^1$ be the combinatorial principle stating that every finite coloring of the infinite full binary tree has a homogeneous isomorphic subtree. Let $\mathsf{RT}^2_2$ and $\mathsf{WKL}_0$ denote respectively the principles of…
We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…
Chari and Greenstein [Adv. Math. 2009] introduced combinatorial subsets of the roots of a finite-dimensional simple Lie algebra $\mathfrak{g}$ which were important in studying Kirillov-Reshetikhin modules over $U_q(\widehat{\mathfrak{g}})$…
We prove the so-called inverse conjecture for the Gowers U^{s+1}-norm in the case s = 3 (the cases s < 3 being established in previous literature). That is, we establish that if f : [N] -> C is a function with |f(n)| <= 1 for all n and || f…
Arnold Beckmann defined the uniform reduct of a propositional proof system f to be the set of those bounded arithmetical formulas whose propositional translations have polynomial size f-proofs. We prove that the uniform reduct of f +…
In this article, we give a complex-geometric proof of the Alexandrov-Fenchel inequality without using toric compactifications. The idea is to use the Legendre transform and develop the Brascamp-Lieb proof of the Pr\'ekopa theorem. New…
The infinite pigeonhole principle for $k$ colors ($\mathsf{RT}_k$) states, for every $k$-partition $A_0 \sqcup \dots \sqcup A_{k-1} = \mathbb{N}$, the existence of an infinite subset~$H \subseteq A_i$ for some~$i < k$. This seemingly…
A theorem of Kushnirenko and Bernstein shows that the number of isolated roots of a system of polynomials in a torus is bounded above by the mixed volume of the Newton polytopes of the given polynomials, and this upper bound is generically…
The complexity of the simple and the Kac modules over the general linear Lie superalgebra $\mathfrak{gl}(m|n)$ of type $A$ was computed by Boe, Kujawa, and Nakano in 2012. A natural continuation to their work is computing the complexity of…
It has been shown by Soprunov that the normalized mixed volume (minus one) of an $n$-tuple of $n$-dimensional lattice polytopes is a lower bound for the number of interior lattice points in the Minkowski sum of the polytopes. He defined…
The Multiplicity conjecture of Herzog, Huneke, and Srinivasan states an upper bound for the multiplicity of any graded $k$-algebra as well as a lower bound for Cohen-Macaulay algebras. In this note we extend this conjecture in several…
We use ku-cohomology to determine lower bounds for the topological complexity of 2-torsion lens spaces. In the process, we give an almost-complete description of the tensor product of two copies of the ku-homology of infinite mod 2^e lens…
We give a short proof of the log-concavity of the coefficients of the reduced characteristic polynomial of a matroid. The proof uses an extension of the theory of Lorentzian polynomials to convex cones, and reproves the Hodge-Riemann…
A strong direct product theorem states that, in order to solve k instances of a problem, if we provide less than k times the resource required to compute one instance, then the probability of overall success is exponentially small in k. In…
The main result of this paper is a combinatorial description of a basis of standard level 1 module for the twisted affine Lie algebra $A_2^{(2)}.$ This description also gives two new combinatorial identities of G\"ollnitz (or…
Prototypical rational vertex operator algebras are associated to affine Lie algebras at positive integer level k. They correspond physically to the Wess-Zumino-Witten theories, and their representation theory can be captured by quantum…
We prove new combinatorial results about polynomial configurations in large subsets of finite fields. Bergelson--Leibman--McCutcheon (2005) showed that for any polynomial $P(x) \in \mathbb{Z}[x]$ with $P(0) = 0$, if $A \subseteq…
We introduce families of two-parameter multivariate polynomials indexed by pairs of partitions $v,w$ -- biaxial double $(\beta,q)$-Grothendieck polynomials -- which specialize at $q=0$ and $v=1$ to double $\beta$-Grothendieck polynomials…
We study the q-deformed Knizhnik-Zamolodchikov equation in path representations of the Temperley-Lieb algebras. We consider two types of open boundary conditions, and in both cases we derive factorised expressions for the solutions of the…