Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Shorter strings containing all \(k\)-element permutations

From MaRDI portal
Publication:1944962
Jump to:navigation, search

DOI10.1016/j.ipl.2011.03.018zbMath1260.68315OpenAlexW2134460193MaRDI QIDQ1944962

Eugen Zălinescu

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.03.018


zbMATH Keywords

permutationscombinatorial problemssubsequences


Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)


Related Items (3)

Skip letters for short supersequence of all permutations ⋮ Fixing monotone Boolean networks asynchronously ⋮ Containing All Permutations



Cites Work

  • Short permutation strings
  • Short strings containing all k-element permutations
  • On Permutation-Embedding Sequences
  • Shortest string containing all permutations
  • Shortest string containing all permutations


This page was built for publication: Shorter strings containing all \(k\)-element permutations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1944962&oldid=14379853"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:55.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki