A fundamental fact about bounded-degree graph expanders is that three no...
We give an efficient algorithm that transforms any bounded degree expand...
We study the probability of Boolean functions with small max influence t...
Given a bipartite graph G, the graphical matrix space 𝒮_G
consists of ma...
A graph G is called self-ordered (a.k.a asymmetric) if the identity
perm...
An action of a group on a vector space partitions the latter into a set ...
The Stabbing Planes proof system was introduced to model the reasoning
c...
We show how a number of well-known uncertainty principles for the Fourie...
This paper initiates a systematic development of a theory of non-commuta...
We consider the problem of outputting succinct encodings of lists of
gen...
The following multi-determinantal algebraic variety plays a central role...
We prove new barrier results in arithmetic complexity theory, showing se...
This paper presents a deterministic, strongly polynomial time algorithm ...
We introduce a simple logical inference structure we call a
spanoid (gen...
We present a polynomial time algorithm to approximately scale tensors of...
We propose a new second-order method for geodesically convex optimizatio...
Alternating minimization heuristics seek to solve a (difficult) global
o...
[This paper is a (self contained) chapter in a new book, Mathematics an...
Arithmetic complexity is considered simpler to understand than Boolean
c...