Toggle navigation
norsk
English
English
norsk
English
Login
Toggle navigation
View Item
Home
Faculty of Science and Technology
Department of Informatics
Department of Informatics
View Item
Home
Faculty of Science and Technology
Department of Informatics
Department of Informatics
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Lower bounds on the size of spheres of permutations under the Chebychev distance
Kløve, Torleiv
Peer reviewed, Journal article
Published version
View/
Open
Lower bounds on the size of spheres of permutations under the Chebychev distance.pdf (113.2Kb)
URI
https://hdl.handle.net/1956/4493
Date
2011
Metadata
Show full item record
Collections
Department of Informatics
[999]
Original version
https://doi.org/10.1007/s10623-010-9454-0
Abstract
Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |pi − i| ≤ d for all i are given
Publisher
Springer
Journal
Designs, Codes and Cryptography
Copyright
The Author(s)
Copyright The Author(s) 2010.
Except where otherwise noted, this item's license is described as Attribution-NonCommercial CC BY-NC
Search Archive
This Collection
Browse
Archive
Communities & Collections
By Issue Date
Authors
Titles
Subjects
Document Types
Journals
This Collection
By Issue Date
Authors
Titles
Subjects
Document Types
Journals
My Account
Login
Statistics
View Usage Statistics