Related papers: Stable domination and independence in algebraicall…

We develop the theory of generically stable types, independence relation based on nonforking and stable weight in the context of dependent (NIP) theories.

This is the third installment in a series of papers on algebraic set theory. In it, we develop a uniform approach to sheaf models of constructive set theories based on ideas from categorical logic. The key notion is that of a "predicative…

Autonomous morphology, such as inflection class systems and paradigmatic distribution patterns, is widespread and diachronically resilient in natural language. Why this should be so has remained unclear given that autonomous morphology…

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…

Starting from an abstract elementary class with no maximal models, Shelah and Villaveces have shown (assuming instances of diamond) that categoricity implies a superstability-like property for a certain independence relation called…

We define a general class of dependent type theories, encompassing Martin-L\"of's intuitionistic type theories and variants and extensions. The primary aim is pragmatic: to unify and organise their study, allowing results and constructions…

Let $X$ be a max-stable random vector with positive continuous density. It is proved that the conditional independence of any collection of disjoint sub-vectors of $X$ given the remaining components implies their joint independence. We…

Let $f:X\to X $ be a dominant self-morphism of an algebraic variety over an algebraically closed field of characteristic zero. We consider the set $\Sigma_{f^{\infty}}$ of $f$-periodic (irreducible closed) subvarieties of small dynamical…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

In the stable general linear group over an arbitrary field, we prove that every element with determinant $\pm 1$ is the product of three involutions, and of no less in general. We also obtain several results of the same flavor, with…

We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of all dependent sequent calculi, and exhibiting it as the category of algebras for a monad on a presheaf…

We provide a complete system of invariants for the formal classification of complex analytic unipotent germs of diffeomorphism at $\cn{n}$ fixing the orbits of a regular vector field. We reduce the formal classification problem to solve a…

In this paper, we investigate the relation between the (fractional) domination number of a digraph $G$ and the independence number of its underlying graph, denoted by $\alpha(G)$. More precisely, we prove that every digraph $G$ has…

We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…

A binding group theorem is proved in the context of quantifier-free internality to the fixed field in difference-closed fields of characteristic zero. This is articulated as a statement about the birational geometry of isotrivial algebraic…

Let $V$ be a complete discrete valuation ring with residue field $\mathbb{F}$. We define a cyclic homology theory for algebras over $\mathbb{F}$, by lifting them to free algebras over $V$, which we enlarge to tube algebras and complete…

Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…

This paper initiates the study of fractional eternal domination in graphs, a natural relaxation of the well-studied eternal domination problem. We study the connections to flows and linear programming in order to obtain results on the…

In this paper we study stable finiteness of ample groupoid algebras with applications to inverse semigroup algebras and Leavitt path algebras, recovering old results and proving some new ones. In addition, we develop a theory of (faithful)…

For every natural number $m$, the existentially closed models of the theory of fields with $m$ commuting derivations can be given a first-order geometric characterization in several ways. In particular, the theory of these differential…