Related papers: Fourier transform on high-dimensional unitary grou…
A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We…
We prove an effective version of the inverse theorem for the Gowers $U^3$-norm for functions supported on high-rank quadratic level sets in finite vector spaces. For configurations controlled by the $U^3$-norm (complexity-two…
Suppose X is a random vector, that is distributed uniformly in some n-dimensional convex set. It was conjectured that when the dimension n is very large, there exists a non-zero vector u, such that the distribution of the real random…
In this paper we study height fluctuations of random lozenge tilings of polygonal domains on the triangular lattice through nonintersecting Bernoulli random walks. For a large class of polygons which have exactly one horizontal upper…
The Fourier transform is typically seen as closely related to the additive group of real numbers, its characters and its Haar measure. In this paper, we propose an alternative viewpoint; the Fourier transform can be uniquely characterized…
In a recent paper, we defined twisted unitary $1$-groups and showed that they automatically induced error-detecting quantum codes. We also showed that twisted unitary $1$-groups correspond to irreducible products of characters thereby…
Fractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration and complex numbers. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has…
We use a restriction theorem for Fourier transforms of fractal measures to study projections onto families of planes in R^3 whose normal directions form nondegenerate curves.
The paper is devoted to the investigation of Esscher's transform on high dimensional Euclidean spaces in the light of its application to the central limit theorem. With this tool, we explore necessary and sufficient conditions of normal…
Classical results due to Ingham and Paley-Wiener characterize the existence of nonzero functions supported on certain subsets of the real line in terms of the pointwise decay of the Fourier transforms. We view these results as uncertainty…
The Generalized Central Limit Theorem is a remarkable generalization of the Central Limit Theorem, showing that the sum of a large number of independent, identically-distributed (i.i.d) random variables with infinite variance may converge…
We characterize the convergence in distribution to a standard normal law for a sequence of multiple stochastic integrals of a fixed order with variance converging to 1. Some applications are given, in particular to study the limiting…
We describe an algorithm, which - given the characters of tilting modules and assuming that Donkin's tilting conjecture is true - computes the characters of simple modules for an algebraic group in any characteristic.
We define in this paper a class of three indices tensor models, endowed with $O(N)^{\otimes 3}$ invariance ($N$ being the size of the tensor). This allows to generate, via the usual QFT perturbative expansion, a class of Feynman tensor…
Stein's method is used to prove limit theorems for random character ratios. Tools are developed for four types of structures: finite groups, Gelfand pairs, twisted Gelfand pairs, and association schemes. As one example an error term is…
We study the asymptotic behaviour of the quantum representations of the modular group in the large level limit. We prove that each element of the modular group acts as a Fourier integral operator. This provides a link between the classical…
We discuss the fundamental role of entanglement as the essential nonclassical feature providing the computational speed-up in the known quantum algorithms. We review the construction of the Fourier transform on an Abelian group and the…
It is demonstrated is this letter that linear multistep methods for integrating ordinary differential equations can be used to develop a family of fast forward scattering algorithms with higher orders of convergence. Excluding the cost of…
The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…
We consider the distribution of the major index on standard tableaux of arbitrary straight shape and certain skew shapes. We use cumulants to classify all possible limit laws for any sequence of such shapes in terms of a simple auxiliary…