The enumeration of permutations avoiding 2143 and 4231

We enumerate the pattern class Av(2143, 4231) and completely describe its permutations. The main tools are simple permutations and monotone grid classes

2×2 monotone grid classes are finitely based

In this note, we prove that all 2×2 monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain 2×2 (generalized) grid classes having two monotone cells in the same row

De Finetti theorem on the CAR algebra

The symmetric states on a quasi local C*-algebra on the infinite set of indices J are those invariant under the action of the group of the permutations moving only a finite, but arbitrary, number of elements of J. The celebrated De Finetti Theorem describes the structure of the symmetric states (i.e. exchangeable probability measures) in classical probability. In the present paper we extend De Finetti Theorem to the case of the CAR algebra, that is for physical systems describing Fermions. Namely, after showing that a symmetric state is automatically even under the natural action of the parity automorphism, we prove that the compact convex set of such states is a Choquet simplex, whose extremal (i.e. ergodic w.r.t. the action of the group of permutations previously described) are precisely the product states in the sense of Araki-Moriya. In order to do that, we also prove some ergodic properties naturally enjoyed by the symmetric states which have a self--containing interest.Comment: 23 pages, juornal reference: Communications in Mathematical Physics, to appea

Improving bounds on packing densities of 4-point permutations

We consolidate what is currently known about packing densities of 4-point permutations and in the process improve the lower bounds for the packing densities of 1324 and 1342. We also provide rigorous upper bounds for the packing densities of 1324, 1342, and 2413. All our bounds are within $10^{-4}$ of the true packing densities. Together with the known bounds, this gives us a fairly complete picture of all 4-point packing densities. We also provide new upper bounds for several small permutations of length at least five. Our main tool for the upper bounds is the framework of flag algebras introduced by Razborov in 2007.Comment: journal style, 18 page

Interlocked permutations

The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels. Our results are purely combinatorial and in line with previous work of the third author about permutation capacity.Comment: 8 page