We prove that every permutation of a Cartesian product of two finite sets can be written as a composition of three permutations, the first of which only modifies the left projection, the second only the right projection, and the third again only the left projection, and three alternations is indeed the optimal number. We show that for two countably infinite sets, the corresponding optimal number of alternations, called the alternation diameter, is four. The notion of alternation diameter can be defined in any category. In the category of finite-dimensional vector spaces, the diameter is also three. For the category of topological spaces, we exhibit a single self-homeomorphism of the plane which is not generated by finitely many alternations of homeomorphisms that only change one coordinate. The results on finite sets and vector spaces were previously known in the context of memoryless computation.
It turns out that the results about finite sets and vector spaces have been proved before in the context of memoryless computation: [Theorem 3] BuGiTh14 and [Theorem 2] GaRi15 are essentially the same result as Theorem . More related results on permutation groups can be found in @cite_11 . The motivation and framework is ostensibly different, but the case of finite sets is proved in [Theorem 3.1] BuGiTh09 using a version of Hall's theorem.
@cite_11
2550342065 1971667319 2888452402 1964155237
Author(s): Johnson, William Andrew | Advisor(s): Scanlon, Thomas | Abstract: This dissertation is a collection of results in model theory, related in one way or another to fields, NIP theories, and elimination of imaginaries. The most important result is a classification of dp-minimal fields, presented in Chapter 9. We construct in a canonical fashion a non-trivial Hausdorff definable field topology on any unstable dp-minimal field. Usingthis we classify the dp-minimal pure fields and valued fields up to elementary equivalence. Furthermore we prove that every VC-minimal field is real closed or algebraically closed.In Chapter 11, we analyze the theories of existentially closed fields with several valuations and orderings, as studied by van den Dries. We show that these model complete theories are NTP2, and analyze forking, dividing, and burden in these theories. The theory of algebraically closed fields with n independent valuation rings turns out to be an example of such a theory. This provides a new and natural example of an NTP2 theory which is neithersimple nor NIP, nor even a conceptual hybrid of something simple and something NIP.In Chapter 8, we exhibit a bad failure of elimination of imaginaries in a dense o-minimal structure. We produce an exotic interpretable set which cannot be put in definable bijection with a definable set, after naming any amount of parameters. However, we show that these exotic interpretable sets are still amenable to some of the tools of tame topology: they mustadmit nice definable topologies locally homeomorphic to definable sets.Chapter 12 proves the existence of Z nZ-valued definable strong Euler characteristics on pseudofinite fields, which measure the non-standard “size” of definable sets, mod n. The non-trivial result is that these “sizes” are definable in families of definable sets. This could probably be proven e cohomology, but we give a more elementary proof relying heavily on the theory of abelian varieties.We also present simplified and new proofs of several model-theoretic facts, including the definability of irreducibility and Zariski closure in ACF (Chapter 10), and elimination of imaginaries in ACVF (Chapter 6). This latter fact was originally proven by Haskell, Hrushovski, and Macpherson. We give a proof that is drastically simpler, inspired by Poizat’s proofs of elimination of imaginaries in ACF and DCF. This note uses the Theorem of the Alternative to prove new results on the implementability of general, asymmetric auctions, and to provide simpler proofs of known results for symmetric auctions. The tradeoff is that type spaces are taken to be finite. A version of the Riesz-Sobolev convolution inequality is formulated and proved for arbitrary compact connected Abelian groups. Maximizers are characterized and a quantitative stability theorem is proved, under natural hypotheses. A corresponding stability theorem for sets whose sumset has nearly minimal measure is also proved, sharpening recent results of other authors. For the special case of the group @math , a continuous deformation of sets is developed, under which an appropriately scaled Riesz-Sobolev functional is shown to be nondecreasing. We conjecture that every finite groupGhas a short presentation (in terms of generators and relations) in the sense that the totallengthof the relations is (log|G|)O(1). We show that it suffices to prove this conjecture for simple groups. Motivated by applications in computational complexity theory, we conjecture that for finite simple groups, such a short presentation is computable in polynomial time from the standard name ofG, assuming in the case of Lie type simple groups overGF(pm) that an irreducible polynomialfof degreemoverGF(p) and a primitive root ofGF(pm) are given. We verify this (stronger) conjecture for all finite simple groups except for the three families of rank 1 twisted groups: we do not handle the unitary groupsPSU(3, q) = 2A2(q), the Suzuki groupsSz(q) = 2B2(q), and the Ree groupsR(q) = 2G2(q). In particular,all finite groups G without composition factors of these types have presentations of length O((log|G|)3). For groups of Lie type (normal or twisted) of rank ≥ 2, we use a reduced version of the Curtis–Steinberg–Tits presentation.