Shuffling matrices, Kronecker product and discrete Fourier transform
From MaRDI portal
Publication:2410244
DOI10.1016/j.dam.2017.08.018zbMath1372.05027arXiv1605.09635OpenAlexW2412175722MaRDI QIDQ2410244
Daniele D'Angeli, Alfredo Donno
Publication date: 17 October 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.09635
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05)
Related Items (5)
Hypercube quantum search: exact computation of the probability of success in polynomial time ⋮ ADMM-based residual whiteness principle for automatic parameter selection in single image super-resolution problems ⋮ On the spectral structure of Jordan-Kronecker products of symmetric and skew-symmetric matrices ⋮ A group representation approach to balance of gain graphs ⋮ Decentralized adaptive control for quasi-consensus in heterogeneous nonlinear multiagent systems
Cites Work
- A generalization of the perfect shuffle
- Crested products of Markov chains
- No cut-off phenomenon for the ``Insect Markov chain
- Markov chains on orthogonal block structures
- The mathematics of perfect shuffles
- Matrix identities of the fast Fourier transform
- Trailing the dovetail shuffle to its lair
- On the properties of a new tensor product of matrices
- Permutations by Cutting and Shuffling
- Shuffling Cards and Stopping Times
- Groups of Perfect Shuffles
- Kronecker products and shuffle algebra
- The cutoff phenomenon in finite Markov chains.
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Representation Theory and Harmonic Analysis of Wreath Products of Finite Groups
- Magical Mathematics
- Matrix theory. Basic results and techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Shuffling matrices, Kronecker product and discrete Fourier transform
