Generating functions for the number of permutations with limited displacement
From MaRDI portal
Publication:2380262
zbMATH Open1186.05012MaRDI QIDQ2380262FDOQ2380262
Authors: Torleiv Kløve
Publication date: 26 March 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/232477
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Cited In (7)
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- Strongly restricted permutations and tiling with fences
- Connections between two classes of generalized Fibonacci numbers squared and permanents of (0,1) Toeplitz matrices
- Covering radius of permutation groups with infinity-norm
- Generating functions of permutations with respect to their alternating runs
- Lower bounds on the size of spheres of permutations under the Chebychev distance
- Stirling numbers of the first kind for graphs
This page was built for publication: Generating functions for the number of permutations with limited displacement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380262)