3 citations · 5 across the 2 of their papers we have counts for
2 papers
math.CO2012★ 3 cited
Methods of computing deque sortable permutations given complete and incomplete information
Daniel Denton
The problem of determining which permutations can be sorted using certain switchyard networks dates back to Knuth in 1968. In this work, we are interested in permutations which are…
math.GT2011★ 2 cited
Shadow movies not arising from knots
Daniel Denton, Peter Doyle
A shadow diagram is a knot diagram with under-over information omitted; a shadow movie is a sequence of shadow diagrams related by shadow Reidemeister moves. We show that not every…