Related papers: Fourier transform on high-dimensional unitary grou…
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…
The theory of supercharacters, which generalizes classical character theory, was recently introduced by P. Diaconis and I.M. Isaacs, building upon earlier work of C. Andre. We study supercharacter theories on $(Z/nZ)^d$ induced by the…
The Eulerian number A(n,k) counts permutations of n symbols with exactly k descents. Motivated by problems in cryptography, several authors have studied the proportion of permutations whose number of descents lies in a fixed congruence…
Based on Beurling's theory of balayage, we develop the theory of non-uniform sampling in the context of the theory of frames for the settings of the Short Time Fourier Transform and pseudo-differential operators. There is sufficient…
We introduce twisted unitary $t$-groups, a generalization of unitary $t$-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that…
We define a nonlinear Fourier transform which maps sequences of contractive $n \times n$ matrices to $SU(2n)$-valued functions on the circle $\mathbb{T}$. We characterize the image of finitely supported sequences and square-summable…
Let $X_N$ be a random trigonometric polynomial of degree $N$ with iid coefficients and let $Z_N(I)$ denote the (random) number of its zeros lying in the compact interval $I\subset\mathbb{R}$. Recently, a number of important advances were…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…
The Replica Fourier Transform is the generalization of the discrete Fourier Transform to quantities defined on an ultrametric tree. It finds use in con- junction of the replica method used to study thermodynamics properties of disordered…
We prove that for a finite collection of real-valued functions $f_{1},...,f_{n}$ on the group of complex numbers of modulus 1 which are derivable with Lipschitz continuous derivative, the distribution of $(\tr f_{1},...,\tr f_{n})$ under…
We develop a novel sampling theorem for functions defined on the three-dimensional rotation group SO(3) by connecting the rotation group to the three-torus through a periodic extension. Our sampling theorem requires $4L^3$ samples to…
We introduce and analyse a general class of not necessarily bounded multiplicative functions, examples of which include the function $n \mapsto \delta^{\omega (n)}$, where $\delta \neq 0$ and where $\omega$ counts the number of distinct…
We continue the study of the Hrushovski-Kazhdan integration theory and consider exponential integrals. The Grothendieck ring is enlarged via a tautological additive character and hence can receive such integrals. We then define the Fourier…
Previous work by Rubinstein and Gao computed the n-level densities for families of quadratic Dirichlet L-functions for test functions where the sum of the supports of the Fourier transforms is at most 2, and showed agreement with random…
The term "strong approximation" is used to describe phenomena where an arithmetic group as well as all of its Zariski dense subgroups have a large image in the congruence quotients. We exhibit analogues of such phenomena in a probabilistic,…
In this paper we derive formulas for the N-point discrete Fourier transform and the R1 x R2 finite Zak transform of multiplicative characters on Z/N, where N is an odd integer, and R1 and R2 are co-prime factors of N. In one special case…
A classical result of Littlewood gives a factorisation for the Schur function at a set of variables "twisted" by a primitive $t$-th root of unity, characterised by the core and quotient of the indexing partition. While somewhat neglected,…
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks…
We analyze the fluctuations of incomplete $U$-statistics over a triangular array of independent random variables. We give criteria for a Central Limit Theorem (CLT, for short) to hold in the sense that we prove that an appropriately scaled…