Related papers: A strong direct product theorem for two-way public…
We study a one-dimensional cross-diffusion system for two interacting populations on the torus, with a linear pressure law and different mobilities. For arbitrary bounded non-negative initial data, we show that any good approximation…
We study the Second Price Matching problem, introduced by Azar, Birnbaum, Karlin, and Nguyen in 2009. In this problem, a bipartite graph (bidders and goods) is given, and the profit of a matching is the number of matches containing a second…
We prove upper bounds on deterministic communication complexity in terms of log of the rank and simple versions of the corruption bound. Our bounds are a simplified version of the results of Gavinsky and Lovett, using the same set of tools.…
The density of the transmission eigenvalues of Pb nano-contacts has been estimated recently in mechanically controllable break-junction experiments. Motivated by these experimental analyses, here we study the evolution of the density of the…
The achievement of this paper is a confutation of the inequality addressed by the Nicolas criterion for the Riemann Hypothesis, carried out after establishing properties of two related sequences. One of them is the product…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
We propose a fast and scalable algorithm to project a given density on a set of structured measures defined over a compact 2D domain. The measures can be discrete or supported on curves for instance. The proposed principle and algorithm are…
This paper establishes the exact strong converse exponent of the soft covering problem in the classical setting. This exponent characterizes the slowest achievable convergence speed of the total variation to one when a code of rate below…
We give a purely algebraic treatment of reduction theory for connections over the formal punctured disc. Our proofs apply to arbitrary connected linear algebraic groups over an algebraically closed field of characteristic 0. We also state…
Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that…
We prove the tightness of radially-symmetric solutions to 2D aggregation-diffusion equations, where the pairwise attraction force is possibly degenerate at large distance. We first reduce the problem into the finiteness of a time integral…
The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin saying that $\limsup_n C(x|n)$ equals $C^{0'}(x)$. Then we use the…
The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…
In a recent paper, Aldous, Blanc and Curien asked which distributions can be expressed as the distance between two independent random variables on some separable measured metric space. We show that every nonnegative discrete distribution…
Two previous papers, arXiv:1803.00284 and arXiv:1803.00281, introduced and studied strong subgraph $k$-connectivity of digraphs obtaining characterizations, lower and upper bounds and computational complexity results for the new digraph…
This work studies distributed learning in the spirit of Yao's model of communication complexity: consider a two-party setting, where each of the players gets a list of labelled examples and they communicate in order to jointly perform some…
We reduce the problem of proving deterministic and nondeterministic Boolean circuit size lower bounds to the analysis of certain two-dimensional combinatorial cover problems. This is obtained by combining results of Razborov (1989),…
Motivated by applications to monotonicity testing, Lehman and Ron (JCTA, 2001) proved the existence of a collection of vertex disjoint paths between comparable sub-level sets in the directed hypercube. The main technical contribution of…
A key measure that has been used extensively in analyzing complex networks is the degree of a node (the number of the node's neighbors). Because of its discrete nature, when the degree measure was used in analyzing weighted networks,…
Motivated by the increasing need to understand the distributed algorithmic foundations of large-scale graph computations, we study some fundamental graph problems in a message-passing model for distributed computing where $k \geq 2$…