Related papers: Products of pseudofinite structures

Ultraproducts are a well-known tool in the classical model theory of first-order logic. We explore their uses in the context of finite model theory.

We prove two results. (1) There is an absolute constant $D$ such that for any finite quasisimple group $S$, given 2D arbitrary automorphisms of $S$, every element of $S$ is equal to a product of $D$ `twisted commutators' defined by the…

We determine all the ways in which a direct product of two finite groups can be expressed as the set-theoretical union of proper subgroups in a family of minimal cardinality.

We prove a result on the structure of finite proper holomorphic mappings between complex manifolds that are products of hyperbolic Riemann surfaces. While an important special case of our result follows from the ideas developed by Remmert…

We prove that certain Fuchsian triangle groups are profinitely rigid in the absolute sense, i.e. each is distinguished from all other finitely generated, residually finite groups by its set of finite quotients. We also develop a method…

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…

We introduce a class of objects which we call 'affine surfaces'. These provide families of foliations on surfaces whose dynamics we are interested in. We present and analyze a couple of examples, and we define concepts related to these in…

We propose a general conjecture on decompositions of finite simple groups as products of conjugates of an arbitrary subset. We prove this conjecture for bounded subsets of arbitrary finite simple groups, and for large subsets of groups of…

We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…

All possible products of all elements of an odd order finite group are considered. A set of all such products is called as a K-set. A hypothesis of K-set coincidence of any group of an odd order with its commutant is proposed and the…

We initiate the study of pseudofiniteness in continuous logic. We introduce a related concept, namely that of pseudocompactness, and investigate the relationship between the two concepts. We establish some basic properties of…

We prove necessary and sufficient conditions for when graph wreath products are residually finite, generalising known results for the permutational wreath product and free product cases.

We give a categorical explanation for many properties of profinite coproducts of profinite groups, which were previously proven on a case-by-case basis. All of these properties take the form "certain functors preserve profinite coproducts".…

The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…

Several infinite products are studied that satisfy the transformation relation of the type $f(\alpha)=f(1/\alpha)$. For certain values of the parameters these infinite products reduce to modular forms. Finite counterparts of these infinite…

We prove that the product of two nearly holomorphic Hecke eigenforms is again a Hecke eigenform for only finitely many choices of factors.

We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…

We prove that the fundamental group of any Seifert 3-manifold is conjugacy separable. That is, conjugates may be distinguished in finite quotients or, equivalently, conjugacy classes are closed in the pro-finite topology.

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

We prove that there exist finitely presented, residually finite groups that are profinitely rigid in the class of all finitely presented groups but not in the class of all finitely generated groups. These groups are of the form $\Gamma…