Related papers: A strong direct product theorem for two-way public…
In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a directed, unweighted graph~$G$ with adjacency matrix…
This is an expository survey on recent sum-product results in finite fields. We present a number of sum-product or "expander" results that say that if $|A| > p^{2/3}$ then some set determined by sums and product of elements of $A$ is nearly…
We prove that computing the deterministic communication complexity of a Boolean function, given its truth table, is \textsf{NP}-complete in the standard protocol-tree-depth model, addressing a meta-complexity question raised by Yao in 1979.…
A result of Baumslag and Roseblade states that a finitely presented subgroup of the direct product of two free groups is virtually a direct product of free groups. In this paper we generalise this result to the class of cyclic subgroup…
Optimizing parameters of Two-Prover-One-Round Game (2P1R) is an important task in PCPs literature as it would imply a smaller PCP with the same or stronger soundness. While this is a basic question in PCPs community, the connection between…
We consider the hidden subgroup problem on the semi-direct product of cyclic groups $\Z_{N}\rtimes\Z_{p}$ with some restriction on $N$ and $p$. By using the homomorphic properties, we present a class of semi-direct product groups in which…
We consider a distributed quantum hypothesis testing problem with communication constraints, in which the two hypotheses correspond to two different states of a bipartite quantum system, multiple identical copies of which are shared between…
The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…
I prove two variants of the $ABC$ sum-product theorem for $\delta$-separated sets $A,B,C \subset [0,1]$ satisfying Katz-Tao spacing conditions. The main novelty is that the cardinality of the sets $B,C$ need not match their…
In this paper we obtain improved dimensional thresholds for dot product sets corresponding to compact subsets of a paraboloid. As a direct application of these estimates, we obtain significant improvements to the best known dimensional…
Variational inequalities are an important tool, which includes minimization, saddles, games, fixed-point problems. Modern large-scale and computationally expensive practical applications make distributed methods for solving these problems…
We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…
We find empirically a characteristic sharp peak-flat trough pattern in a large set of commodity prices. We argue that the sharp peak structure reflects an endogenous inter-market organization, and that peaks may be seen as local…
This work introduces a complexity measure which addresses some conflicting issues between existing ones by using a new principle - measuring the average amount of symmetry broken by an object. It attributes low (although different)…
We study the problem of constructing positive representations of complex measures. In this paper we consider complex densities on a direct product of $U(1)$ groups and look for representations by probability distributions on the…
The efficient computation of large matchings with desirable guarantees is a crucial objective in market design. However, even in simple two-sided matching markets with weak ordinal preferences, finding a maximum-size stable matching is…
This document collects the lecture notes from my course "Communication Complexity (for Algorithm Designers),'' taught at Stanford in the winter quarter of 2015. The two primary goals of the course are: 1. Learn several canonical problems…
We study the inapproximability of the induced disjoint paths problem on an arbitrary $n$-node $m$-edge undirected graph, which is to connect the maximum number of the $k$ source-sink pairs given in the graph via induced disjoint paths. It…
We prove that every infinite minimal subshift with word complexity $p(q)$ satisfying $\limsup p(q)/q < 3/2$ is measure-theoretically isomorphic to its maximal equicontinuous factor; in particular, it has measurably discrete spectrum. Among…
We introduce partial secondary invariants associated to complete Riemannian metrics which have uniformly positive scalar curvature outside a prescribed subset on a spin manifold. These can be used to distinguish such Riemannian metrics up…