Related papers: Rank axioms and supersimplicity

The study of classes of models of a finite diagram was initiated by S. Shelah in 1969. A diagram D is a set of types over the empty set, and the class of models of the diagram D consists of the models of T which omit all the types not in D.…

In a previous paper we developed the notions of th-independence and \th-ranks which define a geometric independence relation in a class of theories which we called ``rosy''. We proved that rosy theories include simple and o-minimal theories…

Semiring semantics for first-order logic provides a way to trace how facts represented by a model are used to deduce satisfaction of a formula. Team semantics is a framework for studying logics of dependence and independence in diverse…

We show that every separable simple tracially approximately divisible $C^*$-algebra has strict comparison, is either purely infinite, or has stable rank one. As a consequence, we show that every (non-unital) finite simple ${\cal Z}$-stable…

Let $A$ be a separable, unital, simple C*-algebra with stable rank one. We show that every strictly positive, lower semicontinuous, affine function on the simplex of normalized quasitraces of $A$ is realized as the rank of an operator in…

There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank $\le r$ locus is not Zariski closed, and understanding the closure (the…

We investigate the geometry of forking for U-rank 2 elements in supersimple w-categorical theories and prove stable forking and some structural properties for such elements. We extend this analysis to the case of U-rank 3 elements.

There is both theoretical and numerical evidence that the set of irreducible representations of a reductive group over local or finite fields is naturally partitioned into families according to analytic properties of representations.…

There is much more known about the family of superstable theories when compared to stable theories. This calls for a search of an analogous "super-dependent" characterization in the context of dependent theories. This problem has been…

For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$…

We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…

We prove a dichotomy for $D$-rank 1 types in simple theories that generalizes Buechler's dichotomy for $D$-rank 1 minimal types in stable theories: every $D$-rank 1 type is either 1-based or part of its algebraic closure, defined by a…

We treat the problem of testing independence between m continuous variables when m can be larger than the available sample size n. We consider three types of test statistics that are constructed as sums or sums of squares of pairwise rank…

We show that the Hrushovski-\fraisse limit of certain classes of trees lead to strictly superstable theories of various U-ranks. In fact, for each $ \alpha\in\omega+1\backslash\{0\} $ we introduce a strictly superstable theory of U-rank $…

We study mechanism which operate on ordinal preference information (i.e., rank ordered lists of alternatives) on the full domain of weak preferences that admits indifferences. We present a novel decomposition of strategyproofness into three…

In this paper, we have considered the dense rank for assigning positions to alternatives in weak orders. If we arrange the alternatives in tiers (i.e., indifference classes), the dense rank assigns position 1 to all the alternatives in the…

We define a notion of rank for words and subshifts that we call spacer rank, extending the notion of rank-one symbolic shifts of Gao and Hill. We construct infinite words of each finite spacer rank, of unbounded spacer rank, and show there…

In view of applications to the construction of moduli spaces of objects in algebraic supergeometry, we start a systematic study of stacks in that context. After defining a superstack as a stack over the \'etale site of superschemes, we…

We prove that if $T$ is an $\omega$-categorical supersimple theory with nontrivial dependence (given by forking), then there is a nontrivial regular 1-type over a finite set of reals which is realized by real elements; hence forking induces…

Let $R$ denote a 2-fir. The notions of F-independence and algebraic subsets of R are defined. The decomposition of an algebraic subset into similarity classes gives a simple way of translating the F-independence in terms of dimension of…