相关论文: Stable domination and independence in algebraicall…

For a set $S$ of vertices of a graph $G$, a vertex $u$ in $V(G)\setminus S$, and a vertex $v$ in $S$, let ${\rm dist}_{(G,S)}(u,v)$ be the distance of $u$ and $v$ in the graph $G-(S\setminus \{ v\})$. Dankelmann et al. (Domination with…

We prove an arithmetic regularity lemma for stable subsets of finite abelian groups, generalising our previous result for high-dimensional vector spaces over finite fields of prime order. A qualitative version of this generalisation was…

We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^\fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved…

Choice and independence of premise principles play an important role in characterizing Kreisel's modified realizability and G\"odel's Dialectica interpretation. In this paper we show that a great many intuitionistic set theories are closed…

E. Hrushovski proved tha the theory of difference-differential fields has a model companion. We prove this result and other maind properties of this theory that we call DCFA. We describe the SU rank a its relation with transcendence degree.…

Let $V$ be a quasi-projective algebraic variety over a non-archimedean valued field. We introduce topological methods into the model theory of valued fields, define an analogue $\hat {V}$ of the Berkovich analytification $V^{an}$ of $V$,…

A dominating set of a graph $G$ is a set $S \subseteq V(G)$ such that every vertex in $V(G) \setminus S$ has a neighbor in $S$, where two vertices are neighbors if they are adjacent. A secure dominating set of $G$ is a dominating set $S$ of…

Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence…

The well-known notion of domination in a graph abstracts the idea of protecting locations with guards. This paper introduces a new graph invariant, the autonomous domination number, which abstracts the idea of defending a collection of…

In earlier work we developed the theory of signatures of hermitian forms over algebras with involution with respect to orderings on the base field of the algebra and obtained in particular that the total signature of a hermitian form is a…

In a previous paper we constructed rank and support variety theories for "quantum elementary abelian groups," that is, tensor products of copies of Taft algebras. In this paper we use both variety theories to classify the thick tensor…

The two main theorems proved here are as follows: If $A$ is a finite dimensional algebra over an algebraically closed field, the identity component of the algebraic group of outer automorphisms of $A$ is invariant under derived equivalence.…

This paper introduces and studies the stability of the strong domination number of a graph, denoted $\operatorname{st}_{\gamma_{st}}(G)$, defined as the minimum number of vertices whose removal changes the strong domination number…

We study quotients of quasi-affine schemes by unipotent groups over fields of characteristic 0. To do this, we introduce a notion of stability which allows us to characterize exactly when a principal bundle quotient exists and, together…

Burgers equation is a classic model, which arises in numerous applications. At its very core it is a simple conservation law, which serves as a toy model for various dynamics phenomena. In particular, it supports explicit heteroclinic…

A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…

The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra B to each formula. We show some basic results regarding the effect of the properties of B on the behavior of…

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

This paper discusses the formalization of proofs "by diagram chasing", a standard technique for proving properties in abelian categories. We discuss how the essence of diagram chases can be captured by a simple many-sorted first-order…

We study the properties of algebraic independence and pointwise algebraic independence in a class of continuous theories, the randomizations $T^R$ of complete first order theories $T$. If algebraic and definable closure coincide in $T$,…