Related papers: An uncertainty principle for cyclic groups of prim…

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

The fundamental inequality of Guivarc'h relates the entropy and the drift of random walks on groups. It is strict if and only if the random walk does not behave like the uniform measure on balls. We prove that, in any nonelementary…

A matching from a finite subset $A\subset\mathbb{Z}^n$ to another subset $B\subset\mathbb{Z}^n$ is a bijection $f : A \rightarrow B$ with the property that $a+f(a)$ never lies in $A$. A matching is called acyclic if it is uniquely…

A group $G$ is said to be a $C$-group if every subgroup $H$ has a permutable complement, i.e. if there exists a subgroup $K$ of $G$ such that $G=HK$ and $H \cap K=1$. In this paper, we study the profinite counterpart of this concept. We say…

A group $G$ is said to have restricted centralizers if for each $g \in G$ the centralizer $C_G(g)$ either is finite or has finite index in $G$. Shalev showed that a profinite group with restricted centralizers is virtually abelian. We take…

Let $k$ be any positive integer and $G$ a compact (Hausdorff) group. Let $\mf{np}_k(G)$ denote the probability that $k+1$ randomly chosen elements $x_1,\dots,x_{k+1}$ satisfy $[x_1,x_2,\dots,x_{k+1}]=1$. We study the following problem: If…

By a result known as Rieger's theorem (1956), there is a one-to-one correspondence, assigning to each cyclically ordered group $H$ a pair $(G,z)$ where $G$ is a totally ordered group and $z$ is an element in the center of $G$, generating a…

We revisit the uncertainty principle from the point of view suggested by A. Wigderson and Y. Wigderson. This approach is based on a primary uncertainty principle from which one can derive several inequalities expressing the impossibility of…

We prove a strengthening of the "reciprocity conjecture" of Khare and Wintenberger. The input to the original conjecture is an odd prime p, a CM number field F containing the pth roots of unity, and a pair of primes of the maximal totally…

We show that a free-by-cyclic group with a polynomially growing monodromy is subgroup separable exactly when it is virtually $F_n \times \mathbb{Z}$. We also prove that random deficiency 1 groups are not subgroup separable with positive…

In this note, we prove a new uncertainty principle for functions with radial symmetry by differentiating a radial version of the Stein-Weiss inequality. The difficulty is to prove the differentiability in the limit of the best constant…

Given two finite groups G(.), G(*) defined on the same set G, their distance is the number of pairs (x,y) for which x.y and x*y differ. The Cayley stability of a group G(.) is the minimum distance of G(.) from another group defined on G. We…

We show that it is undecidable whether a system of linear equations over the Laurent polynomial ring $\mathbb{Z}[X^{\pm}]$ admit solutions where a specified subset of variables take value in the set of monomials $\{X^z \mid z \in…

In an incoherent dictionary, most signals that admit a sparse representation admit a unique sparse representation. In other words, there is no way to express the signal without using strictly more atoms. This work demonstrates that sparse…

It is shown that a necessary condition for an abstract group G to be the full automorphism group of a Hamiltonian cycle system is that G has odd order or it is either binary, or the affine linear group AGL(1; p) with p prime. We show that…

A countable discrete group is said to be Frobenius stable if every function from the group to unitary matrices that is "almost multiplicative" in the Frobenius norm is "close" to a unitary representation in the Frobenius norm. The purpose…

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

In this paper, we uncover a new uncertainty principle that governs the complexity of Boolean functions. This principle manifests as a fundamental trade-off between two central measures of complexity: a combinatorial complexity of its…

Let $X$ be an affine, simplicial toric variety over a field. Let $G_0$ denote the Grothendieck group of coherent sheaves on a Noetherian scheme and let $F^1G_0$ denote the first step of the filtration on $G_0$ by codimension of support.…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…