150 citations · 160 across the 5 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DM2011★ 3 cited
Permutation Complexity Related to the Letter Doubling Map
Steven Widmer
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, π, of X is a linear ordering of X. This paper investigates the combinatorial…
math.CO2011
Permutation Complexity and the Letter Doubling Map
Steven Widmer
Given a countable set X (usually taken to be N or Z), an infinite permutation of X is a linear ordering of X. This paper investigates the combinatorial complexity of infi…