相关论文: Words and Dominions
We present necessary and sufficient conditions for the existence of a countably additive measure on a complete Boolean algebra.
We provide algebraic conditions ensuring the decidability of the theory of modules over effectively given Pr\"ufer (in particular B\'ezout) domains whose localizations at maximal ideals have dense value groups. For B\'ezout domains, these…
A row and a column of two linear relations in Hilbert spaces are presented respectively as a sum and an intersection of two linear relations. As an application, necessary and sufficient conditions for the adjoint of a column to be a row are…
We describe necessary and sufficient conditions for the hereditarity of the category algebra of an infinite EI category satisfying certain combinatorial assumptions. More generally, we discuss conditions such that the left global dimension…
Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…
In this article we prove a necessary and a sufficient condition for a finite subset of the special linear group to be dominated. These conditions are purely geometric in nature, as they only involve the trace and the eigenvectors of the…
Let~$S$ be a finite nonabelian simple group, and let $H$ be a subgroup of $S$. In this work, the dominion (in the sense of Isbell) of $H$ in $S$ in rmVar(S)$ is determined, generalizing an example of B.H. Neumann. A necessary and sufficient…
We investigate the concept of dominion (in the sense of Isbell) in several varieties of nilpotent groups. We obtain a full description of dominions in the variety of nilpotent groups of class at most two. Then we look at the behavior of…
Due to the increased complexity of software development projects more and more systems are described by models. The sheer size makes it impractical to describe these systems by a single model. Instead many models are developed that provide…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
An equivalent condition for an element of a Lie algebra acting nilpotently in all its representations is obtained. Namely, it should belong to the derived algebra and go via factoring over the radical to a nilpotent element of the…
We give a natural definition of a Poisson Differential Algebra. Consistence conditions are formulated in geometrical terms. It is found that one can often locally put the Poisson structure on differential calculus in a simple canonical form…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
Many statistical models are algebraic in that they are defined in terms of polynomial constraints, or in terms of polynomial or rational parametrizations. The parameter spaces of such models are typically semi-algebraic subsets of the…
We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…
We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…
We characterize absorption in finite idempotent algebras by means of J\'onsson absorption and cube term blockers. As an application we show that it is decidable whether a given subset is an absorbing subuniverse of an algebra given by the…
A vocabulary is a list of words designating subsets from a grand set X. We model a vocabulary as a partition of X and study the aggregation of individual vocabularies into a collective one. We characterize aggregation rules when X is…
We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which…
We give necessary and sufficient conditions for existence and infinite divisibility of $\alpha$-determinantal processes. For that purpose we use results on negative binomial and ordinary binomial multivariate distributions.