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

Information-theoretic methods have proven to be a very powerful tool in communication complexity, in particular giving an elegant proof of the linear lower bound for the two-party disjointness function, and tight lower bounds on…

We introduce a new technique for the study of the distribution of modular symbols, which we apply to congruence subgroups of Bianchi groups. We prove that if $K$ is a quadratic imaginary number field of class number one and $\mathcal{O}_K$…

A probability distribution over {-1, 1}^n is (eps, k)-wise uniform if, roughly, it is eps-close to the uniform distribution when restricted to any k coordinates. We consider the problem of how far an (eps, k)-wise uniform distribution can…

A concrete lower-bound for the Hochschild cohomological dimension of a commutative $k$-algebra, in terms of three other homological invariants is obtained. This result is then used to show that most $k$-algebras fail to be quasi-free, even…

We establish new strong lower bounds on the (subnormal) subgroup growth of a large class of groups. This includes the fundamental groups of all finite-volume hyperbolic 3-manifolds and all (free non-abelian)-by-cyclic groups. The lower…

Let G be a semisimple linear algebraic group defined over rational numbers, K be a maximal compact subgroup of its real points and {\Gamma} be an arithmetic lattice. One can associate a probability measure {\mu}(H) on {\Gamma}\G for each…

Hilberg's conjecture about natural language states that the mutual information between two adjacent long blocks of text grows like a power of the block length. The exponent in this statement can be upper bounded using the pointwise mutual…

In this article we establish the arithmetic purity of strong approximation for certain semi-simple simply connected $k$-simple linear algebraic groups and their homogeneous spaces over a number field $k$. For instance, for any such group…

Complex contagions describe diffusion of behaviors in a social network in settings where spreading requires the influence by two or more neighbors. In a $k$-complex contagion, a cluster of nodes are initially infected, and additional nodes…

In adjoint reductive groups $H$ of type $\mathsf{D}$ we show that for every semisimple element $s$, its centralizer splits over its connected component, i.e., $C_H(s) = C_H(s)^\circ \rtimes \check A$ for some complement $\check A$ with…

Given $s \ge k\ge 3$, let $h^{(k)}(s)$ be the minimum $t$ such that there exist arbitrarily large $k$-uniform hypergraphs $H$ whose independence number is at most polylogarithmic in the number of vertices and in which every $s$ vertices…

There has been considerable recent interest in distribution-tests whose run-time and sample requirements are sublinear in the domain-size $k$. We study two of the most important tests under the conditional-sampling model where each query…

We present a flexible random construction which, for certain graphs $H$, is able to produce $H$-free graphs with edge density strictly larger than that of the $H$-free process, while simultaneously preserving pseudorandom properties and…

We discuss the possibility of deriving an H-theorem for the nonlinear discrete time evolution known as Ulam's redistribution of energy problem. In this model particles are paired at random and then their total energy is redistributed…

We prove tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGEST model in distributed computing,…

We study the problem of partitioning a small sample of $n$ individuals from a mixture of $k$ product distributions over a Boolean cube $\{0, 1\}^K$ according to their distributions. Each distribution is described by a vector of allele…

We study the time complexity of the discrete $k$-center problem and related (exact) geometric set cover problems when $k$ or the size of the cover is small. We obtain a plethora of new results: - We give the first subquadratic algorithm for…

We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…

In this paper, we investigate the learning-augmented $k$-median clustering problem, which aims to improve the performance of traditional clustering algorithms by preprocessing the point set with a predictor of error rate $\alpha \in [0,1)$.…

In this m\'emoire we study quasiperiodic cocycles in semi-simple compact Lie groups. For the greatest part of our study, we will focus ourselves to one-frequency cocyles. We will prove that $C^{\infty}$ reducible cocycles are dense in the…