Related papers: Complexity of the Fourier transform on the Johnson…
The Johnson graph J(n,N) is defined as the graph whose vertices are the n-subsets of the set {1,2,...,N}, where two vertices are adjacent if they share exactly n - 1 elements. Unlike Johnson graphs, induced subgraphs of Johnson graphs (JIS…
The symmetric group $\mathfrak{S}_n$ acts on the polynomial ring $\mathbb{Q}[\mathbf{x}_n] = \mathbb{Q}[x_1, \dots, x_n]$ by variable permutation. The invariant ideal $I_n$ is the ideal generated by all $\mathfrak{S}_n$-invariant…
We derive a formula for the entries in the change-of-basis matrix between Young's seminormal and natural representations of the symmetric group. These entries are determined as sums over weighted paths in the weak Bruhat graph on standard…
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 $R$ be a root system of type BC in $\mathfrak a=\mathbb R^r$ of general positive multiplicity. We introduce certain canonical weight function on $\mathbb R^r$ which in the case of symmetric domains corresponds to the integral kernel of…
The rational Cherednik algebra $\HH$ is a certain algebra of differential-reflection operators attached to a complex reflection group $W$. Each irreducible representation $S^\lambda$ of $W$ corresponds to a standard module $M(\lambda)$ for…
We consider the determination of the number $c_k(\alpha)$ of ordered factorisations of an arbitrary permutation on n symbols, with cycle distribution $\alpha$, into k-cycles such that the factorisations have minimal length and such that the…
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…
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…
We study the spherical slice transform which assigns to a function on the $n$-dimensional unit sphere the integrals of that function over cross-sections of the sphere by $k$-dimensional affine planes passing through the north pole. These…
The Hamiltonian of the quantum Calogero-Sutherland model of $N$ identical particles on the circle with $1/r^{2}$ interactions has eigenfunctions consisting of Jack polynomials times the base state. By use of the generalized Jack polynomials…
The Johnson filtration of the mapping class group of a compact, oriented surface is the descending series consisting of the kernels of the actions on the nilpotent quotients of the fundamental group of the surface. Each term of the Johnson…
An explicit formula is obtained for the generalized Macdonald functions on the $N$-fold Fock tensor spaces, calculating a certain matrix element of a composition of several screened vertex operators. As an application, we prove the…
In this paper we will give a similar factorization as in \cite{4}, \cite{5}, where the autors Svrtan and Meljanac examined certain matrix factorizations on Fock-like representation of a multiparametric quon algebra on the free associative…
Graph signal processing (GSP) advances spectral analysis on irregular domains. However, existing two-dimensional graph fractional Fourier transform (2D-GFRFT) employs a single fractional order for both factor graphs, thereby limiting its…
We present a new $O(k^2 \binom{n}{k}^2)$ method for generating an orthogonal basis of eigenvectors for the Johnson graph $J(n,k)$. Unlike standard methods for computing a full eigenbasis of sparse symmetric matrices, the algorithm presented…
The special unitary group SU(2) plays a fundamental role in the description of symmetries in quantum mechanics, theoretical physics, and spherical signal processing. In this paper, we address the computational challenges of performing…
Applying a method of Godsil and McKay \cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters…
A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list…
We suggest a categorification procedure for the SO(2N) one-variable specialization of the two-variable Kauffman polynomial. The construction has many similarities with the HOMFLYPT categorification: a planar graph formula for the polynomial…