Related papers: Foundation ranks and supersimplicity
Working in a theory with an integer-valued dimension on interpretable sets, we classify pseudofinite definably primitive permutation groups acting on one-dimensional sets which satisfy a version of chain condition on centralizers and on…
In this paper, we extend previous work, where a notion of rank, called mu-rank, was proposed for noncommutative quadratic forms on two and three generators. In particular, we provide a definition of mu-rank one and two for noncommutative…
A divisibility relation on ultrafilters on the set $\mathbb{N}$ of natural numbers is defined as follows: ${\cal F}\hspace{1mm}\widetilde{\mid}\hspace{1mm}{\cal G}$ if and only if every set in $\cal F$ upward closed for divisibility also…
Ranking entities such as algorithms, devices, methods, or models based on their performances, while accounting for application-specific preferences, is a challenge. To address this challenge, we establish the foundations of a universal…
A new way of constructing fusion bases (i.e., the set of inequalities governing fusion rules) out of fusion elementary couplings is presented. It relies on a polytope reinterpretation of the problem: the elementary couplings are associated…
A matroid has been one of the most important combinatorial structures since it was introduced by Whitney as an abstraction of linear independence. As an important property of a matroid, it can be characterized by several different (but…
Given a tract $F$ in the sense of Baker and Bowler and a matrix $A$ with entries in $F$, we define several notions of rank for $A$. In this way, we are able to unify and find conceptually satisfying proofs for various results about ranks of…
We define a reasonably well-behaved class of ultraimaginaries, i.e.\ classes modulo invariant equivalence relations, called {\em tame}, and establish some basic simplicity-theoretic facts. We also show feeble elimination of supersimple…
We determine the rank of a general real binary form of degree d=4 and d=5. In the case d=5, the possible values of the rank of such general forms are 3,4,5. The existence of three typical ranks was unexpected. We prove that a real binary…
In this paper, we analyze and compare three of the many algebraic structures that have been used for modeling dependent type theories: categories with families, split type-categories, and representable maps of presheaves. We study these in…
We study H-structures associated to SU-rank 1 measurable structures. We prove that the SU-rank of the expansion is continuous and that it is uniformly definable in terms of the parameters of the formulas. We also introduce notions of…
We consider sentence-definable and diagram-definable subfamilies of given families of theories, calculi for these subfamilies, as well dynamics and characteristics of these subfamilies with respect to rank and degree.
We consider the four fragments FO2, the intersection of Sigma2 and FO2, the intersection of Pi2 and FO2, and Delta2 of first-order logic FO[<] over finite and infinite words. For all four fragments, we give characterizations in terms of…
It is important to classify covering subgroups of the fundamental group of a topological space using their topological properties in the topologized fundamental group. In this paper, we introduce and study some topologies on the fundamental…
We study real ternary forms whose real rank equals the generic complex rank, and we characterize the semialgebraic set of sums of powers representations with that rank. Complete results are obtained for quadrics and cubics. For quintics we…
We construct SU$(2|1)$, $d=1$ supersymmetric models based on the coupling of dynamical and semi-dynamical (spin) multiplets, where the interaction term of both multiplets is defined on the generalized chiral superspace. The dynamical…
We introduce the notion of a conformal pseudo-subriemannian fundamental graded Lie algebra of semisimple type. Moreover we give a classification of conformal pseudo-subriemannian fundamental graded Lie algebras of semisimple type and their…
Matching logic is a general formal framework for reasoning about a wide range of theories, with particular emphasis on programming language semantics. Notably, the intermediate language of the K semantics framework is an extension of…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
We show that a hypersimple unidimensional theory that has a club of reducts, in the partial order of all countable reducts, that are coordinatized in finite rank, is supersimple.