Related papers: Mekler's construction and generalized stability
Let $(K,\mathcal O,k)$ be a $p$-modular system and assume $k$ is algebraically closed. We show that if $\Lambda$ is an $\mathcal O$-order in a separable $K$-algebra, then $\textrm{Pic}_{\mathcal O}(\Lambda)$ carries the structure of an…
A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…
A nonmonotonic logic of thresholded generalizations is presented. Given propositions A and B from a language L and a positive integer k, the thresholded generalization A=>B{k} means that the conditional probability P(B|A) falls short of one…
We prove that in theories without the tree property of the second kind (which include dependent and simple theories) forking and dividing over models are the same, and in fact over any extension base. As an application we show that…
We develop a theory of reduction for generalized Kahler and hyper-Kahler structures which uses the generalized Riemannian metric in an essential way, and which is not described with reference solely to a single generalized complex…
Let $G$ be a finite group, $N$ a normal subgroup of $G$, and $k$ a field of characteristic $p>0$. In this paper, we formulate the brick version of Clifford's theorem under suitable assumptions and prove it by using the theory of wide…
In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…
This paper explores the properties of multiplicative Lie algebra structures on a nilpotent group of class $2$. We also present a method for determining a multiplicative Lie algebra structure on a group that serves as an extension of one Lie…
We classify the stable formulas in the theory of Dense Linear Orders without endpoints, the stable formulas in the theory of Divisible Abelian Groups, and the stable formulas without parameters in the theory of Real Closed Fields. The third…
We introduce a strong notion of quasiconvexity in finitely generated groups, which we call stability. Stability agrees with quasiconvexity in hyperbolic groups and is preserved under quasi-isometry for finitely generated groups. We show…
In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…
We show how to build models of Synthetic Algebraic Geometry over rings k such that finitely presented k-algebra have a decidable equality. The construction is done in a constructive and weak (same proof theoretic strength as dependent type…
We show that the ample degree of a stable theory with trivial forking is preserved when we consider the corresponding theory of belles paires, if it exists. This result also applies to the theory of $H$-structures of a trivial theory of…
We give a survey of the implosion construction, extending some of its aspects relating to hypertoric geometry from type $A$ to a general reductive group, and interpret it in the context of the Moore-Tachikawa category. We use these ideas to…
In the context of Hrushovski constructions we take a language $ \mathcal{L} $ with a ternary relation $ R $ and consider the theory of the generic models $ M^{*}_{\alpha}, $ of the class of finite $ \mathcal{L}$-structures equipped with…
It is well known that the incompressible Euler equations can be formulated in a very geometric language. The geometric structures provide very valuable insights into the properties of the solutions. Analogies with the finite-dimensional…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
We characterize stable T for which the model completion of T_{aut} is stable (i.e., every completion is). Then we prove that ``some completion is stable'' is different and we characterize it. Finally we show that if T is stable, T_{aut} has…
Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…