Related papers: Simple-like independence relations in abstract ele…

Cyclic monotone independence is an algebraic notion of noncommutative independence, introduced in the study of multi-matrix random matrix models with small rank. Its algebraic form turns out to be surprisingly close to monotone…

Let $K$ be a number field, $A/K$ be an absolutely simple abelian variety of CM type, and $\ell$ be a prime number. We give explicit bounds on the degree over $K$ of the division fields $K(A[\ell^n])$, and when $A$ is an elliptic curve we…

This is the second in a series of articles developing abstract classification theory for classes that have a notion of prime models over independent pairs and over chains. It deals with the problem of smoothness and establishing the…

We use orthogonality calculus to prove a downward transfer from categoricity in a successor in abstract elementary classes (AECs) that have a good frame (a forking-like notion for types of singletons) on an interval of cardinals:…

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…

We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories $T_\mathfrak{m}$ reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the…

Conditional independence and Markov properties are powerful tools allowing expression of multidimensional probability distributions by means of low-dimensional ones. As multidimensional possibilistic models have been studied for several…

We introduce a simple ecological model describing the spatial organization of two interacting populations whose individuals are indifferent to conspecifics and avoid the proximity to heterospecifics. At small population densities $\Phi$ a…

Let $G$ be a finite group. Then there exists a first-order statement $S(G)$ in the language of rings without parameters and depending only on $G$ such that, for any field $K$, we have that $K\models S(G)$ if and only if $K$ has a Galois…

We prove two structure theorems for simple, locally finite dimensional Lie algebras over an algebraically closed field of characteristic $p$ which give sufficient conditions for the algebras to be of the form $[R^{(-)}, R^{(-)}] / (Z(R)…

The method of imsets, introduced by Studen\'y, provides a geometric and combinatorial description of conditional independence statements. Elementary conditional independence statements over a finite set of discrete random variables…

This paper focuses on the characterization of $\aleph_0$-categorical theories of trees in the following sense: for any $\aleph_0$-cateorical theory $T$ of trees there is a tree plan $\Gamma$ such that $T=Th(\Gamma(\omega))$ where…

We generalize a well-known theorem binding the elementary equivalence relation on the level of PAC fields and the isomorphism class of their absolute Galois groups. Our results concern two cases: saturated PAC structures and non-saturated…

Suppose that $K$ is an infinite field which is large (in the sense of Pop) and whose first order theory is simple. We show that $K$ is {\em bounded}, namely has only finitely many separable extensions of any given finite degree. We also…

We say that a finite group $G$ satisfies the independence property if, for every pair of distinct elements $x$ and $y$ of $G$, either $\{x,y\}$ is contained in a minimal generating set for $G$ or one of $x$ and $y$ is a power of the other.…

We study AECs without assuming the amalgamation property in general. We do assume the disjoint amalgamation property in a specific cardinality lambda and assume that there is no maximal model in \lambda. Under these hypotheses, we prove the…

Let G be a simple algebraic group over an algebraically closed field k of characteristic 2. We consider analogues of the Jacobson-Morozov theorem in this setting. More precisely, we classify those nilpotent elements with a simple…

We extend the classical preferential attachment random graph model to random simplicial complexes. At each stage of the model, we choose one of the existing $k$-simplices with probability proportional to its $k$-degree. The chosen…

A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…

A class K of structures is controlled if, for all cardinals lambda, the relation of L_{infty,lambda}-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that the class of doubly transitive…