The cycles of the multiway perfect shuffle permutation.
Three generators for minimal writing-space computations
Three generators for minimal writing-space computations
We construct, for each integer n, three functions from {0,1}n to {0,1} such that any boolean mapping from {0,1}n to {0,1}n can be computed with a finite sequence of assignations only using the n input variables and those three functions.
Totally greedy coin sets and greedy obstructions.
Two sided Sand Piles Model and unimodal sequences
We introduce natural generalizations of two well-known dynamical systems, the Sand Piles Model and the Brylawski's model. We describe their order structure, their reachable configuration's characterization, their fixed points and their maximal and minimal length's chains. Finally, we present an induced model generating the set of unimodal sequences which amongst other corollaries, implies that this set is equipped with a lattice structure.