Related papers: How close can we come to a parity function when th…
We design a nonadaptive algorithm that, given oracle access to a function $f: \{0,1\}^n \to \{0,1\}$ which is $\alpha$-far from monotone, makes poly$(n, 1/\alpha)$ queries and returns an estimate that, with high probability, is an…
Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros…
We show that for a locally compact group $G$, amongst a class which contains amenable and small invariant neighbourhood groups, that its Fourier algebra $A(G)$ satisfies a completely bounded version Pisier's similarity property with…
Let $G$ be a finite group, and let $\kappa(G)$ be the probability that elements $g$, $h\in G$ are conjugate, when $g$ and $h$ are chosen independently and uniformly at random. The paper classifies those groups $G$ such that $\kappa(G) \geq…
We study the problem of approximate social welfare maximization (without money) in one-sided matching problems when agents have unrestricted cardinal preferences over a finite set of items. Random priority is a very well-known…
Consider a graph on $n$ uniform random points in the unit square, each pair being connected by an edge with probability $p$ if the inter-point distance is at most $r$. We show that as $n\to\infty$ the probability of full connectivity is…
Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…
An example is presented of a subset $A$ of $\mathbb Z_N$ of density $\alpha$ such that the largest non-trivial Fourier coefficient of the characteristic function of $A$ is very small, but the probability that a random arithmetic progression…
We show that the automorphism group of every zero entropy infinite shift admits a "drift" homomorphism to $(\mathbb{R},+)$ that maps the shift map to 1. This homomorphism arises as the expectation, under an invariant measure, of a cocycle…
Let F_{n+m} be the free group of rank n+m, with generators x_1,...,x_{n+m}. An automorphism \phi of F_{n+m} is called partially symmetric if for each 1 \le i \le m, \phi(x_i) is conjugate to x_j or x_j^{-1} for some 1 \le j \le m. Let…
If $f(p, n)$ is the number of pairwise nonisomorphic groups of order $p^n$, and $g(p,n)$ is the number of groups of order $p^n$ whose automorphism group is a $p$-group, then, for $n \leq 7$, we prove that the ratio $g(p,n)/f (p,n)$ is…
In this paper we consider a random entire function of the form $f(z,\omega )=\sum\nolimits_{n=0}^{+\infty}\xi_n(\omega )a_nz^n,$ where $\xi_n(\omega )$ are independent standard\break complex gaussian random variables and $a_n\in\mathbb{C}$…
Let $\al$ be an irrational and $\varphi: \N \rightarrow \R^+$ be a function decreasing to zero. For any $\al$ with a given Diophantine type, we show some sharp estimations for the Hausdorff dimension of the set [E_{\varphi}(\al):={y\in \R:…
For a homogeneous random walk in the quarter plane with nearest-neighbor transitions, starting from some state $(i_0,j_0)$, we study the event that the walk reaches the vertical axis, before reaching the horizontal axis. We derive an exact…
It is well known that the entropy $H(X)$ of a finite random variable is always greater or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tights bounds on…
Shor's factoring algorithm guarantees a success probability of at least one half for any fixed modulus N = pq with distinct primes p and q. We show that this guarantee does not extend to the asymptotic regime. As N -> infinity, the…
The present paper is a sequel to [Monatsh.~Math.\ {\bf 194} (2021), 523--554] in which results of that paper are generalized so that they hold in the setting of inhomogeneous Diophantine approximation. Given any integers $n \geq 2$ and…
We explore the probability that a permutation sampled from the symmetric group of order n uniformly at random has cycles of lengths not exceeding r. Asymptotic formulas valid in specified regions for the ratio n/r are obtained using the…
Consider systems of equations $q_i(x)=0$, where $q_i: {\Bbb R}^n \longrightarrow {\Bbb R}$, $i=1, \ldots, m$, are quadratic forms. Our goal is to tell efficiently systems with many non-trivial solutions or near-solutions $x \ne 0$ from…
We study the rate of convergence to a normal random variable of the real and imaginary parts of Tr(AU), where U is an N x N random unitary matrix and A is a deterministic complex matrix. We show that the rate of convergence is O(N^{-2 +…