Related papers: A Fast Fourier Transform for the Johnson graph
In this paper we consider the problem of approximating function evaluations $f(\boldsymbol x_j)$ at given nonequispaced points $\boldsymbol x_j$, $j=1,\dots N$, of a bandlimited function from given values $\hat{f}(\boldsymbol k)$,…
We consider the {\it infinite Johnson graph} $J_{\infty}$ whose vertex set consists of all subsets $X\subset {\mathbb N}$ satisfying $|X|=|{\mathbb N}\setminus X|=\infty$ and whose edges are pairs of such subsets $X,Y$ satisfying…
Knot and link invariants naturally arise from any braided Hopf algebra. We consider the computational complexity of the invariants arising from an elementary family of finite-dimensional Hopf algebras: quantum doubles of finite groups…
We show that interval partition functions (transition amplitudes) of three-dimensional $N = 2$ theories admit factorizations into sums of products of hemisphere partition functions with additional normalization factors. We prove the…
We present a systematic formalism based on a factorization theorem in soft-collinear effective theory to describe non-global observables at hadron colliders, such as gap-between-jets cross sections. The cross sections are factorized into…
Given a dataset, the task of learning a transform that allows sparse representations of the data bears the name of dictionary learning. In many applications, these learned dictionaries represent the data much better than the static…
We derive parametric integral representations for the general $n$-point function of scalar operators in momentum-space conformal field theory. Recently, this was shown to be expressible as a generalised Feynman integral with the topology of…
A permutation graph $G_\pi$ is a simple graph with vertices corresponding to the elements of $\pi$ and an edge between $i$ and $j$ when $i$ and $j$ are inverted in $\pi$. A set of vertices $D$ is said to dominate a graph $G$ when every…
In this note, firstly we give an easy proof of the factorization of symmetric matrices (see [Mos] math-ph/0203023), then we use it to prove the well-known fact that the automorphism group of a non-degenerate symmetric bilinear form acts…
In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…
We discuss interrelations between: Cohn localizations of full square matrices; a Leavitt localization of a row; and the Jacobson quasi-inverses of quasi-regular elements. The latter Jacobson localizations appear naturally and easily in…
In many network problems, graphs may change by the addition of nodes, or the same problem may need to be solved in multiple similar graphs. This generates inefficiency, as analyses and systems that are not transferable have to be…
In this paper we construct the supersymmetric tensor hierarchy of N=1, d=4 supergravity. We find some differences with the general bosonic construction of 4-dimensional gauged supergravities. The global symmetry group of N=1,d=4…
$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…
The quantum Fourier transform (QFT) is sometimes said to be the source of various exponential quantum speed-ups. In this paper we introduce a class of quantum circuits which cannot outperform classical computers even though the QFT…
The state-of-the-art automotive radars employ multidimensional discrete Fourier transforms (DFT) in order to estimate various target parameters. The DFT is implemented using the fast Fourier transform (FFT), at sample and computational…
The automata arising from the well known conversion of regular expression to non deterministic automata have rather particular transition graphs. We refer to them as the Glushkov graphs, to honour his nice expression-to-automaton…
We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…
We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Lo\`eve transform, and several others along with their continuous counterparts (Fourier transform, Fourier series,…