Related papers: Boosting uniformity in quasirandom groups: fast an…

Let $\chi$ be a non-real Dirichlet character modulo a prime $q$. In this paper we prove that the distribution of the short character sum $S_{\chi,H}(x)=\sum_{x< n\leq x+H} \chi(n)$, as $x$ runs over the positive integers below $q$,…

One of the central issues in the hidden subgroup problem is to bound the sample complexity, i.e., the number of identical samples of coset states sufficient and necessary to solve the problem. In this paper, we present general bounds for…

We study the direct-sum problem for $k$-party ``Number On the Forehead'' (NOF) deterministic communication complexity. We prove several positive results, showing that the complexity of computing a function $f$ in this model, on $\ell$…

We give improved separations for the query complexity analogue of the log-approximate-rank conjecture i.e. we show that there are a plethora of total Boolean functions on $n$ input bits, each of which has approximate Fourier sparsity at…

Let C be an arbitrary smooth algebraic curve of genus g over a large finite field K. We revisit fast addition algorithms in the Jacobian of C due to Khuri-Makdisi (math.NT/0409209, to appear in Math. Comp.). The algorithms, which reduce to…

We prove a criterion for the existence of harmonic metrics on Higgs bundles that are defined on smooth loci of klt varieties. As one application, we resolve the quasi-etale uniformisation problem for minimal varieties of general type to…

De Loera, O'Neill and Wilburne introduced a general model for random numerical semigroups in which each positive integer is chosen independently with some probability p to be a generator, and proved upper and lower bounds on the expected…

In this article we establish new bounds on the quantum communication complexity of distributed problems. Specifically, we consider the amount of communication that is required to transform a bipartite state into another, typically more…

For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $\textrm{ex}(n,F)$ is a classical and central problem…

In this paper we apply the hyper-K\"ahler quotient construction to Lie groups with a left invariant hyper-K\"ahler structure under the action of a closed abelian subgroup by left multiplication. This is motivated by the fact that some known…

We give a polynomial-time approximation algorithm for the (not necessarily metric) $k$-Median problem. The algorithm is an $\alpha$-size-approximation algorithm for $\alpha < 1 + 2 \ln(n/k)$. That is, it guarantees a solution having size at…

Let $G$ be a group such that any non-trivial representation has dimension at least $d$. Let $X=(X_{1},X_{2},\ldots,X_{t})$ and $Y=(Y_{1},Y_{2},\ldots,Y_{t})$ be distributions over $G^{t}$. Suppose that $X$ is independent from $Y$. We show…

Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…

This paper contains a thorough investigation of invariant distributions supported on limit sets of discrete groups acting convex cocompactly on symmetric spaces of negative curvature. It can be considered as a continuation of…

We study space-bounded communication complexity for unitary implementation in distributed quantum processors, where we restrict the number of qubits per processor to ensure practical relevance and technical non-triviality. We model…

We construct a splitting of the cohomology of configuration spaces of points on a smooth proper variety with a multiplicative Chow--K\"unneth decomposition. Applied to hyperelliptic curves, this shows that the hyperelliptic Torelli group…

We note a characterization of the amenability of unitary representations (in the sense of Bekka) via the existence of an orthonormal basis supporting an invariant probability charge. Based on this, we explore several natural notions of…

Let $I=[0,1)$ and $\mathcal{PC}(I)$ [resp. $\mathcal{PC}^+(I)$] be the quotient group of the group of all piecewise continuous [resp. piecewise continuous and orientation preserving] bijections of $I$ by its normal subgroup consisting in…

We study the short-time Fourier transform on the space $\mathcal{K}_{1}'(\mathbb{R}^n)$ of distributions of exponential type. We give characterizations of $\mathcal{K}_{1}'(\mathbb{R}^n)$ and some of its subspaces in terms of modulation…