We consider the possible cardinalities of the following three cardinal invariants which are related to the permutation group on the set of natural numbers: the least cardinal number of maximal cofinitary permutation groups; the least cardinal number of maximal almost disjoint permutation families; the cofinality of the permutation group on the set of natural numbers.We show that it is consistent with that ; in fact we show that in the Miller model.

We extend Shelah's first many model result to show that an unstable theory has 2 κ many non-permutation group isomorphic models of size κ, where κ is an uncountable regular cardinal.

We extend Shelah's first many model result to show that an unstable theory has 2κmany non-permutation group isomorphic models of size κ, where κ is an uncountable regular cardinal.

We discuss some new properties of the natural Galois connection among set relation algebras, permutation groups, and first order logic. In particular, we exhibit infinitely many permutational relation algebras without a Galois closed representation, and we also show that every relation algebra on a set with at most six elements is Galois closed and essentially unique. Thus, we obtain the surprising result that on such sets, logic with three variables is as powerful in expression as full first order (...) logic. (shrink)

A permutation group G on a set A is ${\kappa }$ -homogeneous iff for all $X,Y\in \bigl [ {A} \bigr ]^ {\kappa } $ with $|A\setminus X|=|A\setminus Y|=|A|$ there is a $g\in G$ with $g[X]=Y$. G is ${\kappa }$ -transitive iff for any injective function f with $\operatorname {dom}(f)\cup \operatorname {ran}(f)\in \bigl [ {A} \bigr ]^ {\le {\kappa }} $ and $|A\setminus \operatorname {dom}(f)|=|A\setminus \operatorname {ran}(f)|=|A|$ there is a $g\in G$ with $f\subset g$.Giving a partial answer to a question (...) of P. M. Neumann [6] we show that there is an ${\omega }$ -homogeneous but not ${\omega }$ -transitive permutation group on a cardinal ${\lambda }$ provided (i) ${\lambda } {\omega }$ we give a method to construct large ${\kappa }$ -homogeneous, but not ${\kappa }$ -transitive permutation groups. Using this method we show that there exist ${\kappa }^+$ -homogeneous, but not ${\kappa }^+$ -transitive permutation groups on ${\kappa }^{+n}$ for each infinite cardinal ${\kappa }$ and natural number $n\ge 1$ provided $V=L$. (shrink)

Let λ ≤ κ be infinite cardinals and let Ω be a set of cardinality κ. The bounded permutation group B λ (Ω), or simply B λ , is the group consisting of all permutations of Ω which move fewer than λ points in Ω. We say that a permutation group G acting on Ω is a supplement of B λ if B λ G is the full symmetric group on Ω. In [7], Macpherson and Neumann claimed to (...) have classified all supplements of bounded permutation groups. Specifically, they claimed to have proved that a group G acting on the set Ω is a supplement of B λ if and only if there exists $\Delta \subset \Omega$ with $|\Delta| such that the setwise stabiliser G {Δ} acts as the full symmetric group on $\Omega\setminus\Delta$ . However I have found a mistake in their proof. The aim of this paper is to examine conditions under which Macpherson and Neumann's claim holds, as well as conditions under which a counterexample can be constructed. In the process we will discover surprising links with cardinal arithmetic and Shelah's recently developed pcf theory. (shrink)

We extend Morley's Theorem to show that if a theory is κ-p-categorical for some uncountable cardinal κ, it is uncountably categorical. We then discuss ω-p-categoricity and provide examples to show that similar extensions for the Baldwin-Lachlan and Lachlan Theorems are not possible.

We give a derivation of exclusion principles for the elementary particles of the standard model, using simple mathematical principles arising from a set theory of identical particles. We apply the theory of permutation group actions, stating some theorems which are proven elsewhere, and interpreting the results as a heuristic derivation of Pauli's Exclusion Principle (PEP) which dictates the formation of elements in the periodic table and the stability of matter, and also a derivation of quark confinement. We arrive at (...) these properties by using a symmetry property of collections of the particles themselves as compared for example to the symmetry property of their wave function under interchange of two particles. (shrink)

In this paper we study the automorphism groups of countable arithmetically saturated models of Peano Arithmetic. The automorphism groups of such structures form a rich class of permutation groups. When studying the automorphism group of a model, one is interested to what extent a model is recoverable from its automorphism group. Kossak-Schmerl [12] show that ifMis a countable, arithmetically saturated model of Peano Arithmetic, then Aut(M) codes SSy(M). Using that result they prove:Let M1. M2be countable arithmetically (...) saturated models of Peano Arithmetic such that Aut(M1)≅ Aut(M2).ThenSSy(M1) = SSy(M2).We show that ifMis a countable arithmetically saturated of Peano Arithmetic, then Aut(M) can recognize if some maximal open subgroup is a stabilizer of a nonstandard element, which is smaller than any nonstandard definable element. That fact is used to show the main theorem:Let M1,M2be countable arithmetically saturated models of Peano Arithmetic such thatAut(M1) ≅ Aut(M2).Then for every n<ωHere RT2nis Infinite Ramsey's Theorem stating that every 2-coloring of [ω]nhas an infinite homogeneous set. Theorem 0.2 shows that for models of a false arithmetic the converse of Kossak-Schmerl Theorem 0.1 is not true. Using the results of Reverse Mathematics we obtain the following corollary:There exist four countable arithmetically saturated models of Peano Arithmetic such that they have the same standard system but their automorphism groups are pairwise non-isomorphic. (shrink)

Let ${\mathfrak{M}}$ be a nonstandard model of Peano Arithmetic with domain M and let ${n \in M}$ be nonstandard. We study the symmetric and alternating groups S n and A n of permutations of the set ${\{0,1,\ldots,n-1\}}$ internal to ${\mathfrak{M}}$ , and classify all their normal subgroups, identifying many externally defined such normal subgroups in the process. We provide evidence that A n and S n are not split extensions by these normal subgroups, by showing that any such complement (...) if it exists, cannot be a limit of definable sets. We conclude by identifying an ${\mathbb{R}}$ -valued metric on ${\tilde{S}_n = S_n /B_S}$ and ${\tilde{A}_n = A_n /B_A}$ (where B S , B A are the maximal normal subgroups of S n and A n identified earlier) making these groups into topological groups, and by showing that if ${\mathfrak{M}}$ is ${\mathfrak\aleph_1}$ -saturated then ${\tilde{S}_n}$ and ${\tilde{A}_n}$ are complete with respect to this metric. (shrink)

We construct a Borel maximal cofinitary group.

Let S∞ denote the topological group of permutations of the natural numbers. A closed subgroup G of S∞ is called oligomorphic if for each n, its natural action on n-tuples of natural numbers has onl...

We show that it is consistent with ZFC + ¬CH that there is a maximal cofinitary group (or, maximal almost disjoint group) G ≤ Sym(ω) such that G is a proper subset of an almost disjoint family A $\subseteq$ Sym(ω) and |G| < |A|. We also ask several questions in this area.

We construct several forcing models in each of which there exists a maximal cofinitary group, i.e., a maximal almost disjoint group, G≤Sym, such that G is also a maximal almost disjoint family in Sym. We also ask several open questions in this area in the fourth section of this paper.

Due to the NP-hard nature, the permutation flowshop scheduling problem is a fundamental issue for Industry 4.0, especially under higher productivity, efficiency, and self-managing systems. This paper proposes an improved genetic-shuffled frog-leaping algorithm to solve the permutation flowshop scheduling problem. In the proposed IGSFLA, the optimal initial frog in the initialized group is generated according to the heuristic optimal-insert method with fitness constrain. The crossover mechanism is applied to both the subgroup and the global group to avoid the (...) local optimal solutions and accelerate the evolution. To evolve the frogs with the same optimal fitness more outstanding, the disturbance mechanism is applied to obtain the optimal frog of the whole group at the initialization step and the optimal frog of the subgroup at the searching step. The mathematical model of PFSSP is established with the minimum production cycle as the objective function, the fitness of frog is given, and the IGSFLA-based PFSSP is proposed. Experimental results have been given and analyzed, showing that IGSFLA not only provides the optimal scheduling performance but also converges effectively. (shrink)

This paper is a continuation of the authors' work , where the main problem considered was whether a given recursive structure is recursively isomorphic to a polynomial-time structure. In that paper, a recursive Abelian group was constructed which is not recursively isomorphic to any polynomial-time Abelian group. We now show that if every element of a recursive Abelian group has finite order, then the group is recursively isomorphic to a polynomial-time group. Furthermore, if the orders are bounded, then the group (...) is recursively isomorphic to a polynomial-time group with universe A being the set of tally representations of natural numbers Tal = s{;1s};* or the set of binary representations of the natural numbers Bin. We also construct a recursive Abelian group with all elements of finite order but which has elements of arbitrary large finite order which is not isomorphic to any polynomial-time group with universe Tal or Bin. Similar results are obtained for structures , where f is a permutation on the set A. (shrink)

Let T and T1 be tournaments with n elements, E a basis for T, E′ a basis for T′, and k ≥ 3 an integer. The dual of T is the tournament T” of basis E defined by T = T for all x, y ε E. A hemimorphism from T onto T′ is an isomorphism from T onto T” or onto T. A k-hemimorphism from T onto T′ is a bijection f from E to E′ such that for any (...) subset X of E of order k the restrictions T/X and T1/f are hemimorphic. The set of hemimorphisms of T onto itself has group structure, this group is called the group of hemimorphisms of T. In this work, we study the restrictions to n – 2 elements of a tournament with n elements. In particular, we prove: Let k ≥ 3 be an integer, T a tournament with n elements, where n ≥ k + 5. Then the following statements are equivalent: All restrictions of T to subsets with n – 2 elements are k-hemimorphic. All restrictions of T to subsets with n – 2 elements are 3-hemimorphic. All restrictions of T to subsets with n – 2 elements are hemimorphic. All restrictions of T to subsets with n – 2 elements are isomorphic, Either T is a strict total order, or the group of hemimorphisms of T is 2-homogeneous. (shrink)

This book addresses the need to create an "axiological epistemology". This term refers to knowledge of what is axiological, id est everything related to human values, and the know-how on how to manage the study of values. In knowledge societies, we know and live axiological projects that we do not receive from anyone, but that we must construct ourselves in a situation of continuous change. In view of the fact that the axiological crisis in which we are immersed is the (...) most serious one that humanity has suffered over its long history, the seriousness and urgency of the issue in question is evident. Adequate knowledge is required to solve this problem, which is at the root of all the problems we are experiencing. This work offers a potential solution that, in contrast to the past, cannot be definitive, but must be transformed throughout the continuous changes to ways of life as a result of technoscience. It will prove of great value to all those who must operate within human values and motivate groups, as well as to those interested in spirituality. (shrink)

In this paper, the connections between model theory and the theory of infinite permutation groups are used to study the n-existence and the n-uniqueness for n-amalgamation problems of stable theories. We show that, for any n ⩾ 2, there exists a stable theory having -existence and k-uniqueness, for every k ⩽ n, but has neither -existence nor -uniqueness. In particular, this generalizes the example, for n = 2, due to Hrushovski given in 3. © 2011 WILEY-VCH Verlag GmbH (...) & Co. KGaA, Weinheim. (shrink)

Assuming that every set is constructible, we find a${\text{\Pi }}_1^1 $maximal cofinitary group of permutations of$\mathbb{N}$which is indestructible by Cohen forcing. Thus we show that the existence of such groups is consistent with arbitrarily large continuum. Our method also gives a new proof, inspired by the forcing method, of Kastermans’ result that there exists a${\text{\Pi }}_1^1 $maximal cofinitary group inL.

We show that if p is a real type which is almost internal in a formula φ in a simple theory, then there is a type p' interalgebraic with a finite tuple of realizations of p, which is generated over φ. Moreover, the group of elementary permutations of p' over all realizations of φ is type-definable.

A cofinitary group is a subgroup of Sym(ℕ) where all nonidentity elements have finitely many fixed points. A maximal cofinitary group is a cofinitary group, maximal with respect to inclusion. We show that a maximal cofinitary group cannot have infinitely many orbits. We also show, using Martin's Axiom, that no further restrictions on the number of orbits can be obtained. We show that Martin's Axiom implies there exist locally finite maximal cofinitary groups. Finally we show that there exists a (...) uniformly computable sequence of permutations generating a cofinitary group whose isomorphism type is not computable. (shrink)

We prove that if an ultrafilter \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{L}}$$\end{document} is not coherent to a Q-point, then each analytic non-σ-bounded topological group G admits an increasing chain \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle G_\alpha:\alpha < \mathfrak b(\mathcal L)\rangle}$$\end{document} of its proper subgroups such that: (i) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\bigcup_{\alpha}G_\alpha=G}$$\end{document}; and (ii) For every σ-bounded subgroup H of G there exists α such that \documentclass[12pt]{minimal} \usepackage{amsmath} (...) \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${H\subset G_\alpha}$$\end{document}. In case of the group Sym(ω) of all permutations of ω with the topology inherited from ωω this improves upon earlier results of S. Thomas. (shrink)

For a Polish group let be the minimal number of translates of a fixed closed nowhere dense subset of required to cover . For many locally compact this cardinal is known to be consistently larger than which is the smallest cardinality of a covering of the real line by meagre sets. It is shown that for several non-locally compact groups . For example the equality holds for the group of permutations of the integers, the additive group of a separable (...) Banach space with an unconditional basis and the group of homeomorphisms of various compact spaces. (shrink)

Let S be the group of all permutations of the set of natural numbers. The cofinality spectrum CF(S) of S is the set of all regular cardinals λ such that S can be expressed as the union of a chain of λ proper subgroups. This paper investigates which sets C of regular uncountable cardinals can be the cofinality spectrum of S. The following theorem is the main result of this paper. Theorem. Suppose that $V \models GCH$ . Let C be (...) a set of regular uncountable cardinals which satisfies the following conditions. (a) C contains a maximum element. (b) If μ is an inaccessible cardinal such that $\mu = \sup(C \cap \mu)$ , then μ ∈ C. (c) If μ is a singular cardinal such that $\mu = \sup(C \cap \mu)$ , then μ + ∈ C. Then there exists a c.c.c. notion of forcing P such that $V^\mathbb{P} \models CF(S) = C$ . We shall also investigate the connections between the cofinality spectrum and pcf theory; and show that CF(S) cannot be an arbitrarily prescribed set of regular uncountable cardinals. (shrink)

The neutrosophic automorphisms of a neutrosophic groups G (I) , denoted by Aut(G (I)) is a neu-trosophic group under the usual mapping composition. It is a permutation of G (I) which is also a neutrosophic homomorphism. Moreover, suppose that X1 = X(G (I)) is the neutrosophic group of inner neutrosophic auto-morphisms of a neutrosophic group G (I) and Xn the neutrosophic group of inner neutrosophic automorphisms of Xn-1. In this paper, we show that if any neutrosophic group of (...) the sequence G (I), X1, X2, … is the identity, then G (I) is nilpotent. (shrink)

We study the notion of weak amalgamation in the context of diagonal conjugacy classes. Generalizing results of Kechris and Rosendal, we prove that for every countable structure M, Polish group G of permutations of M, and \, G has a comeager n-diagonal conjugacy class iff the family of all n-tuples of G-extendable bijections between finitely generated substructures of M, has the joint embedding property and the weak amalgamation property. We characterize limits of weak Fraïssé classes that are not homogenizable. Finally, (...) we investigate 1- and 2-diagonal conjugacy classes in groups of ball-preserving bijections of certain ordered ultrametric spaces. (shrink)

The dual character of invariance under transformations and definability by some operations has been used in classical works by, for example, Galois and Klein. Following Tarski, philosophers of logic have claimed that logical notions themselves could be characterized in terms of invariance. In this article, we generalize a correspondence due to Krasner between invariance under groups of permutations and definability in L∞∞ so as to cover the cases that are of interest in the logicality debates, getting McGee’s theorem about (...) quantifiers invariant under all permutations and definability in pure L∞∞ as a particular case. We also prove some optimality results along the way, regarding the kinds of relations which are needed so that every subgroup of the full permutation group is characterizable as a group of automorphisms. (shrink)

Given an admissible indexing φ of the countable atomless Boolean algebra B, an automorphism F of B is said to be recursively presented (relative to φ) if there exists a recursive function $p \in \operatorname{Sym}(\omega)$ such that F ⚬ φ = φ ⚬ p. Our key result on recursiveness: Both the subset of $\operatorname{Aut}(\mathscr{B})$ consisting of all those automorphisms which are recursively presented relative to some indexing, and its complement, the set of all "totally nonrecursive" automorphisms, are uncountable. This arises (...) as a consequence of the following combinatorial investigations: (1) A comparison of the cycle structures of f and f̄, where f is a permutation of some free basis of B and f̄ is the automorphism of B induced by f. (2) An explicit description of the permutations of ω whose conjugacy classes in $\operatorname{Sym}(\omega)$ are (a) uncountable, (b) countably infinite, and (c) finite. (shrink)

We study finitely generated free Heyting algebras from a topological and from a model theoretic point of view. We review Bellissima’s representation of the finitely generated free Heyting algebra; we prove that it yields an embedding in the profinite completion, which is also the completion with respect to a naturally defined metric. We give an algebraic interpretation of the Kripke model used by Bellissima as the principal ideal spectrum and show it to be first order interpretable in the Heyting algebra, (...) from which several model theoretic and algebraic properties are derived. In particular, we prove that a free finitely generated Heyting algebra has only one set of free generators, which is definable in it. As a consequence its automorphism group is the permutation group over its generators. (shrink)

The modern state of the Pauli exclusion principle studies is discussed. The Pauli exclusion principle can be considered from two viewpoints. On the one hand, it asserts that particles with half-integer spin (fermions) are described by antisymmetric wave functions, and particles with integer spin (bosons) are described by symmetric wave functions. This is a so-called spin-statistics connection. The reasons why the spin-statistics connection exists are still unknown, see discussion in text. On the other hand, according to the Pauli exclusion principle, (...) the permutation symmetry of the total wave functions can be only of two types: symmetric or antisymmetric, all other types of permutation symmetry are forbidden; although the solutions of the Schrödinger equation may belong to any representation of the permutation group, including the multi-dimensional ones. It is demonstrated that the proofs of the Pauli exclusion principle in some textbooks on quantum mechanics are incorrect and, in general, the indistinguishability principle is insensitive to the permutation symmetry of the wave function and cannot be used as a criterion for the verification of the Pauli exclusion principle. Heuristic arguments are given in favor that the existence in nature only the one-dimensional permutation representations (symmetric and antisymmetric) are not accidental. As follows from the analysis of possible scenarios, the permission of multi-dimensional representations of the permutation group leads to contradictions with the concept of particle identity and their independence. Thus, the prohibition of the degenerate permutation states by the Pauli exclusion principle follows from the general physical assumptions underlying quantum theory. (shrink)

One of the traditional ways mathematical ideas and even new areas of mathematics are created is from experiments. One of the best-known examples is that of the Fermat hypothesis, which was conjectured by Fermat in his attempts to find integer solutions for the famous Fermat equation. This hypothesis led to the creation of a whole field of knowledge, but it was proved only after several hundred years. This book, based on the author's lectures, presents several new directions of mathematical research. (...) All of these directions are based on numerical experiments conducted by the author, which led to new hypotheses that currently remain open, i.e., are neither proved nor disproved. The hypotheses range from geometry and topology (statistics of plane curves and smooth functions) to combinatorics (combinatorial complexity and random permutations) to algebra and number theory (continuous fractions and Galois groups). For each subject, the author describes the problem and presents numerical results that led him to a particular conjecture. In the majority of cases there is an indication of how the readers can approach the formulated conjectures (at least by conducting more numerical experiments). Written in Arnold's unique style, the book is intended for a wide range of mathematicians, from high school students interested in exploring unusual areas of mathematics on their own, to college and graduate students, to researchers interested in gaining a new, somewhat nontraditional perspective on doing mathematics. In the interest of fostering a greater awareness and appreciation of mathematics and its connections to other disciplines and everyday life, MSRI and the AMS are publishing books in the Mathematical Circles Library series as a service to young people, their parents and teachers, and the mathematics profession. Titles in this series are co-published with the Mathematical Sciences Research Institute (MSRI). (shrink)

This article discusses the role of diagrams in mathematical reasoning in the light of a case study in analysis. In the example presented certain combinatorial expressions were first found by using diagrams. In the published proofs the pictures were replaced by reasoning about permutation groups. This article argues that, even though the diagrams are not present in the published papers, they still play a role in the formulation of the proofs. It is shown that they play a role (...) in concept formation as well as representations of proofs. In addition we note that 'visualization' is used in two different ways. In the first sense 'visualization' denotes our inner mental pictures, which enable us to see that a certain fact holds, whereas in the other sense 'visualization' denotes a diagram or representation of something. (shrink)

We prove that the homeomorphism relation between compact spaces can be continuously reduced to the homeomorphism equivalence relation between absolute retracts, which strengthens and simplifies recent results of Chang and Gao, and Cieśla. It follows then that the homeomorphism relation of absolute retracts is Borel bireducible with the universal orbit equivalence relation. We also prove that the homeomorphism relation between regular continua is classifiable by countable structures and hence it is Borel bireducible with the universal orbit equivalence relation of the (...) permutation group on a countable set. On the other hand we prove that the homeomorphism relation between rim-finite metrizable compacta is not classifiable by countable structures. (shrink)

For each k 1, let Γk be the countable universal homogeneous k-hypergraph. In this paper, we shall classify the closed permutation groups G such that Aut G Sym. In particular, we shall show that there exist only finitely many such groups G for each k 1. We shall also show that each of the associated reducts of Γk is homogeneous with respect to a finite relational language.

We summarize the essential ingredients, which enabled us to derive the path-integral for a system of harmonically interacting spin-polarized identical particles in a parabolic confining potential, including both the statistics (Bose–Einstein or Fermi–Dirac) and the harmonic interaction between the particles. This quadratic model, giving rise to repetitive Gaussian integrals, allows to derive an analytical expression for the generating function of the partition function. The calculation of this generating function circumvents the constraints on the summation over the cycles of the (...) class='Hi'>permutation group. Moreover, it allows one to calculate the canonical partition function recursively for the system with harmonic two-body interactions. Also, static one-point and two-point correlation functions can be obtained using the same technique, which make the model a powerful trial system for further variational treatments of realistic interactions. (shrink)

Our purpose in this note is to study countable $\aleph_0$-categorical structures whose theories are tree-decomposable in the sense of Baldwin and Shelah. The permutation group corresponding to such a structure can be decomposed in a canonical manner into simpler permutation groups in the same class. As an application of the analysis we show that these structures are finitely homogeneous.

The main aim of this work is to relate integrability in QFT with a complete particle interpretation directly to the principle of causal localization, circumventing the standard method of finding sufficiently many conservation laws. Its precise conceptual-mathematical formulation as “modular localization” within the setting of local operator algebras also suggests novel ways of looking at general (non-integrable) QFTs which are not based on quantizing classical field theories.Conformal QFT, which is known to admit no particle interpretation, suggest the presence of a (...) “partial” integrability, referred to as “conformal integrability”. This manifests itself in a “braid-permutation” group structure which contains in particular informations about the anomalous dimensional spectrum. For chiral conformal models this reduces to the braid group as it is represented in Hecke- or Birman-Wenzl-algebras associated to chiral models.Another application of modular localization mentioned in this work is an alternative to the BRST formulation of gauge theories in terms of stringlike vectorpotentials within a Hilbert space setting. (shrink)

The thesis pseudofinite structures and counting dimensions is about the model theory of pseudofinite structures with the focus on groups and fields. The aim is to deepen our understanding of how pseudofinite counting dimensions can interact with the algebraic properties of underlying structures and how we could classify certain classes of structures according to their counting dimensions. Our approach is by studying examples. We treat three classes of structures: The first one is the class of H-structures, which are generic (...) expansions of existing structures. We give an explicit construction of pseudofinite H-structures as ultraproducts of finite structures. The second one is the class of finite difference fields. We study properties of coarse pseudofinite dimension in this class, show that it is definable and integer-valued and build a partial connection between this dimension and transformal transcendence degree. The third example is the class of pseudofinite primitive permutation groups. We generalise Hrushovski’s classical classification theorem for stable permutation groups acting on a strongly minimal set to the case where there exists an abstract notion of dimension, which includes both the classical model theoretic ranks and pseudofinite counting dimensions. In this thesis, we also generalise Schlichting’s theorem for groups to the case of approximate subgroups with a notion of commensurability.prepared by Tingxiang Zou.E-mail: [email protected]: https://tel.archives-ouvertes.fr/tel-02283810/document. (shrink)

We are concerned with the following problem. Suppose Γ and Σ are closed permutation groups on infinite sets C and W and ρ: Γ → Σ is a non-split, continuous epimorphism with finite kernel. Describe the possibilities for ρ. Here, we consider the case where ρ arises from a finite cover π: C → W. We give reasonably general conditions on the permutation structure W;Σ which allow us to prove that these covers arise in two possible ways. (...) The first way, reminiscent of covers of topological spaces, is as a covering of some Σ-invariant digraph on W. The second construction is less easy to describe, but produces the most familiar of these types of covers: a vector space covering its projective space. (shrink)

The empirical rule that systems of identical particles always obey either Bose or Fermi statistics is customarily imposed on the theory by adding it to the axioms of nonrelativistic quantum mechanics, with the result that other statistical behaviors are excluded a priori. A more general approach is to ask what other many-particle statistics are consistent with the indistinguishability of identical particles. This strategy offers a way to discuss possible violations of the Pauli Exclusion Principle, and it leads to some interesting (...) issues related to preparation of states and a superselection rule arising from invariance under the permutation group. (shrink)

A first-order structure $\mathfrak {A}$ is called monadically stable iff every expansion of $\mathfrak {A}$ by unary predicates is stable. In this paper we give a classification of the class $\mathcal {M}$ of $\omega $ -categorical monadically stable structure in terms of their automorphism groups. We prove in turn that $\mathcal {M}$ is the smallest class of structures which contains the one-element pure set, is closed under isomorphisms, and is closed under taking finite disjoint unions, infinite copies, and finite (...) index first-order reducts. Using our classification we show that every structure in $\mathcal {M}$ is first-order interdefinable with a finitely bounded homogeneous structure. We also prove that every structure in $\mathcal {M}$ has finitely many reducts up to interdefinability, thereby confirming Thomas’ conjecture for the class $\mathcal {M}$. (shrink)

A number of theories have been developed to characterize ALogTime (or uniform NC 1, or just NC 1), the class of languages accepted by alternating logtime Turing machines, in the same way that Buss’s theory ${{\bf S}^{1}_{2}}$ characterizes polytime functions. Among these, ALV′ (by Clote) is particularly interesting because it is developed based on Barrington’s theorem that the word problem for the permutation group S 5 is complete for ALogTime. On the other hand, ALV (by Clote), T 0 NC (...) 0 (by Clote and Takeuti) as well as Arai’s theory ${{\bf AID}+\Sigma_0^B{-}{\bf CA}}$ and its two-sorted version VNC 1 (by Cook and Morioka) are based on the circuit characterization of ALogTime. While the last three theories have been known to be equivalent, their relationship to ALV′ has been an open problem. Here we show that ALV′ is indeed equivalent to the other theories. (shrink)

Our purpose in this note is to study countable ℵ0-categorical structures whose theories are tree-decomposable in the sense of Baldwin and Shelah. The permutation group corresponding to such a structure can be decomposed in a canonical manner into simpler permutation groups in the same class. As an application of the analysis we show that these structures are finitely homogeneous.

In this paper, we wish to explore the role that textual representations play in the creation of new mathematical objects. We do so by analyzing texts by Joseph-Louis Lagrange (1736–1813) and Évariste Galois (1811–1832), which are seen as central to the historical development of the mathematical concept of groups. In our analysis, we consider how the material features of representations relate to the changes in conceptualization that we see in the texts.Against this backdrop, we discuss the idea that new (...) mathematical concepts, in general, are increasingly abstract in the sense of being detached from material configurations. Our analysis supports the opposite view. We suggest that changes in the material aspects of textual representations (i.e., the actual graphic inscriptions) play an active and crucial role in conceptual change.We employ an analytical framework adapted from Bruno Latour’s 1999 account of intertwined material and representational practices in the empirical sciences. This approach facilitates a foregrounding of the interconnection between the conceptual development of mathematics, and the construction, (re-)configuration, and manipulation of the materiality of representations. Our analysis suggests that, in mathematical practice, distinctions between the material and structural features of representations are not permanent and absolute. This problematizes the appropriateness of the distinction between concrete inscriptions and abstract relations in understanding the development of mathematical concepts. (shrink)