Related papers: Complexity of the Fourier transform on the Johnson…

It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time. Essential for the PFD computation is the construction of the…

We present the Hamiltonian formalism for $f(T)$ gravity, and prove that the theory has $\frac{n(n-3)}{2}+1$ degrees of freedom (d.o.f.) in $n$ dimensions. We start from a scalar-tensor action for the theory, which represents a scalar field…

Fix a natural $\alpha$. Let $n\ge \alpha$ be an integer. Consider the symmetric group $S_{\alpha+n}$ and its subgroup $S_n$. We consider the group algebra of $S_{\alpha+n}$ and its subalgebra $\mathbb{O}[\alpha;n]$ consisting of…

We generalize the famous weight basis constructions of the finite-dimensional irreducible representations of $\mathfrak{sl}(n,\mathbb{C})$ obtained by Gelfand and Tsetlin in 1950. Using combinatorial methods, we construct one such basis for…

We introduce a new spin-fermion mapping, for arbitrary spin $S$ generating the SU(2) group algebra, that constitutes a natural generalization of the Jordan-Wigner transformation for $S=1/2$. The mapping, valid for regular lattices in any…

Previous work of Chan--Church--Grochow and Baker--Wang shows that the set of spanning trees in a plane graph $G$ is naturally a torsor for the Jacobian group of $G$. Informally, this means that the set of spanning trees of $G$ naturally…

The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\log n)$.…

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…

We obtain new inversion formulas for the Funk type transforms of two kinds associated to spherical sections by hyperplanes passing through a common point $A$ which lies inside the n-dimensional unit sphere or on the sphere itself.…

In this work, we introduce a definition of the Discrete Fourier Transform (DFT) on Euclidean lattices in $\R^n$, that generalizes the $n$-th fold DFT of the integer lattice $\Z^n$ to arbitrary lattices. This definition is not applicable for…

In this paper, we provide a solution to the open problem of computing the Fourier transform of a binary function defined over $n$-bit vectors taking $m$-bit vector values. In particular, we introduce the two-modular Fourier transform (TMFT)…

Many stochastic processes are defined on special geometrical objects like spheres and cones. We describe how tools from harmonic analysis, i.e. Fourier analysis on groups, can be used to investigate probability density functions (pdfs) on…

Boson realizations map operators and states of groups to transformations and states of bosonic systems. We devise a graph-theoretic algorithm to construct the boson realizations of the canonical SU$(n)$ basis states, which reduce the…

The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalizaton group are small, we…

The two tableaux assigned by the Robinson--Schensted correspondence are equal if and only if the input permutation is an involution, so the RS algorithm restricts to a bijection between involutions in the symmetric group and standard…

We study in detail the Jordan forms of the Coxeter transformations and prove shearing formulas due to Subbotin and Sumin for the characteristic polynomials of the Coxeter transformations. Using shearing formulas we calculate characteristic…

For k >= 1, let Torelli_g^1(k) be the k-th term in the Johnson filtration of the mapping class group of a genus g surface with one boundary component. We prove that for all k, there exists some G_k >= 0 such that Torelli_g^1(k) is generated…

Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\mathcal{O}(n\lg(n))$, where $n$ is the number of points…

An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an $\mathbb{F}_2$-linear subspace of the field. We view these transforms as performing a change of basis from…

(Abridged abstract) For a finite real reflection group W and a W-orbit O of flats in its reflection arrangement---or equivalently a conjugacy class of its parabolic subgroups---we introduce a statistic on elements of W. We then study the…