Related papers: Strong Fourier Sampling Fails over $G^n$

A base of a permutation group (X,G) is a subset B of X such that its pointwise stabilizer is the trivial group. A list (x1,x2, ... ,xk) of elements of X is irredundant if each element is not in the pointwise stabilizer of its predecessors.…

Given a finite group $G$ and a prime $p$, let $\mathcal{A}_p(G)$ be the poset of nontrivial elementary abelian $p$-subgroups of $G$. The group $G$ satisfies the Quillen dimension property at $p$ if $\mathcal{A}_p(G)$ has non-zero homology…

Brauer and Fowler noted restrictions on the structure of a finite group G in terms of the order of the centralizer of an involution t in G. We consider variants of these themes. We first note that for an arbitrary finite group G of even…

It is well known that a dense subgroup $G$ of the complex unitary group $U(d)$ cannot be amenable as a discrete group when $d>1$. When $d$ is large enough we give quantitative versions of this phenomenon in connection with certain estimates…

Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conjectures. We prove the weak Additive Basis conjecture proposed…

Recently, an approach to graph signal processing based on graphons was proposed. Here we show how such a graphon-driven approach to the Fourier transform can be used on graphs sampled from a stochastic block model (SBM). In particular, we…

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

We study embeddings of groups of Lie type $H$ in characteristic $p$ into exceptional algebraic groups $\mathbf G$ of the same characteristic. We exclude the case where $H$ is of type $\mathrm{PSL}_2$. A subgroup of $\mathbf G$ is \emph{Lie…

We consider the problem of testing whether the points in a complex or real variety with non-zero coordinates form a multiplicative group or, more generally, a coset of a multiplicative group. For the coset case, we study the notion of…

We investigate finite torsors over big opens of spectra of strongly $F$-regular germs that do not extend to torsors over the whole spectrum. Let $(R,\mathfrak{m},k)$ be a strongly $F$-regular $k$-germ where $k$ is an algebraically closed…

We show that two related classes of algorithms, stable algorithms and Boolean circuits with bounded depth, cannot produce an approximate sample from the uniform measure over the set of solutions to the symmetric binary perceptron model at…

The discrete cocompact subgroups of the five-dimensional connected, simply connected nilpotent Lie groups are determined up to isomorphism. Moreover, we prove if $G=N\times A$ is a connected, simply connected, nilpotent Lie group with an…

We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…

We establish new strong factorization properties for the smooth vectors of representations of exponential solvable Lie groups on Fr\'{e}chet spaces. In particular, our results improve upon the Dixmier-Malliavin factorization theorem for…

We provide evidence for this conclusion: given a finite Galois cover $f: X \rightarrow \mathbb{P}^1_\mathbb{Q}$ of group $G$, almost all (in a density sense) realizations of $G$ over $\mathbb{Q}$ do not occur as specializations of $f$. We…

A line of work initiated by Terhal and DiVincenzo and Bremner, Jozsa, and Shepherd, shows that quantum computers can efficiently sample from probability distributions that cannot be exactly sampled efficiently on a classical computer,…

Let $G$ be a transitive permutation group on a finite set with solvable point stabiliser and assume that the solvable radical of $G$ is trivial. In 2010, Vdovin conjectured that the base size of $G$ is at most 5. Burness proved this…

The fundamental task of group testing is to recover a small distinguished subset of items from a large population while efficiently reducing the total number of tests (measurements). The key contribution of this paper is in adopting a new…

We isolate and generalize a technique implicit in many quantum algorithms, including Shor's algorithms for factoring and discrete log. In particular, we show that the distribution sampled after a Fourier transform over ${\mathbb Z}_p$ can…

The generalised Fitting subgroup of a finite group is the group generated by all subnormal subgroups that are either nilpotent or quasisimple. The importance of this subgroup in finite group theory stems from the fact that it always…