Pattern classes and priority queues

When a set of permutations comprising a pattern class C is submitted as input to a priority queue the resulting output is again a pattern class C'. The basis of C' is determined for pattern classes C whose basis elements have length 3, and is finite in these cases. An example is given of a class C with basis 2431 for which C is not finitely based

Isomorphisms between pattern classes

Isomorphisms p between pattern classes A and B are considered. It is shown that, if p is not a symmetry of the entire set of permutations, then, to within symmetry, A is a subset of one a small set of pattern classes whose structure, including their enumeration, is determined.Comment: 11 page

Subclasses of the separable permutations

We prove that all subclasses of the separable permutations not containing Av(231) or a symmetry of this class have rational generating functions. Our principal tools are partial well-order, atomicity, and the theory of strongly rational permutation classes introduced here for the first time

Inflations of Geometric Grid Classes: Three Case Studies

We enumerate three specific permutation classes defined by two forbidden patterns of length four. The techniques involve inflations of geometric grid classes

Testigo a su pesar. Entrevista sobre Nobody's business

Entrevista del autor con Alan Berline

On the inverse image of pattern classes under bubble sort

Let B be the operation of re-ordering a sequence by one pass of bubble sort. We completely answer the question of when the inverse image of a principal pattern class under B is a pattern class.Comment: 11 page

Crunching Biofilament Rings

We discuss a curious example for the collective mechanical behavior of coupled non-linear monomer units entrapped in a circular filament. Within a simple model we elucidate how multistability of monomer units and exponentially large degeneracy of the filament's ground state emerge as a collective feature of the closed filament. Surprisingly, increasing the monomer frustration, i.e., the bending prestrain within the circular filament, leads to a conformational softening of the system. The phenomenon, that we term polymorphic crunching, is discussed and applied to a possible scenario for membrane tube deformation by switchable dynamin or FtsZ filaments. We find an important role of cooperative inter-unit interaction for efficient ring induced membrane fission

New class of quantum error-correcting codes for a bosonic mode

We construct a new class of quantum error-correcting codes for a bosonic mode which are advantageous for applications in quantum memories, communication, and scalable computation. These 'binomial quantum codes' are formed from a finite superposition of Fock states weighted with binomial coefficients. The binomial codes can exactly correct errors that are polynomial up to a specific degree in bosonic creation and annihilation operators, including amplitude damping and displacement noise as well as boson addition and dephasing errors. For realistic continuous-time dissipative evolution, the codes can perform approximate quantum error correction to any given order in the timestep between error detection measurements. We present an explicit approximate quantum error recovery operation based on projective measurements and unitary operations. The binomial codes are tailored for detecting boson loss and gain errors by means of measurements of the generalized number parity. We discuss optimization of the binomial codes and demonstrate that by relaxing the parity structure, codes with even lower unrecoverable error rates can be achieved. The binomial codes are related to existing two-mode bosonic codes but offer the advantage of requiring only a single bosonic mode to correct amplitude damping as well as the ability to correct other errors. Our codes are similar in spirit to 'cat codes' based on superpositions of the coherent states, but offer several advantages such as smaller mean number, exact rather than approximate orthonormality of the code words, and an explicit unitary operation for repumping energy into the bosonic mode. The binomial quantum codes are realizable with current superconducting circuit technology and they should prove useful in other quantum technologies, including bosonic quantum memories, photonic quantum communication, and optical-to-microwave up- and down-conversion.Comment: Published versio