相关论文: On equations over direct powers of algebraic struc…

We study equations over relational structures that approximate groups and semigroups. For such structures we proved the criteria, when a direct power of such algebraic structures is equationally Noetherian.

We study equationally Noetherian varieties of groups, rings and monoids. Moreover, we describe equationally Noetherian direct powers for these algebraic structures.

This article is about equationally Noetherian and weak equationally Noetherian property of Ershov algebras. Here we show two canonical forms of the system of equations over Ershov algebras and two criteria of equationally Noetherian and…

We study equations over boolean algebras with distinguished elements. We prove the criteria, when a boolean algebra is equationally Noetherian, weakly equationally Noetherian, $\mathbf{q}_\omega$-compact or $\mathbf{u}_\omega$-compact. Also…

In this paper we discuss some special generalizations of equationally Noetherian property which naturally arise in the universal algebraic geometry. We introduce weakly equationally Noetherian, qw-compact, uw-compact, and weakly uw-compact…

Systems of equations and their solution sets are studied in polyadic groups. We prove that a polyadic group $(G, f)=\mathrm{der}_{\theta, b}(G, \cdot)$ is equational noetherian, if and only if the ordinary group $(G, \cdot)$ is equational…

In this paper, we prove a criterion for a predicate structure to be equationally Noetherian.

The theory of path algebras is usually circunscripted to the study of representations, usually linked to finite graphs. In our work, we focus on studying the structure of path algebras over a field associated to arbitrary graphs. We…

In this article, we describe the relation between the properties of being equational noetherian and ascending chain condition on ideals of an arbitrary algebra. We also give a formulation of Hilbert's basis theorem for varieties of algebras…

We prove that the inverse limit of the sequence dual to a sequence of Lie algebras is Noetherian up to the action of the direct limit of the corresponding sequence of classical algebraic groups when the sequence of groups consists of…

We show that every scheme/algebraic space/stack that is quasi-compact with quasi-finite diagonal can be approximated by a noetherian scheme/algebraic space/stack. More generally, we show that any stack which is etale-locally a global…

A structure of a complete lattice (in the sense of a poset) is defined on the underlying set of the orhtogonal group of a real Euclidean space, by a construction analogous to that of the weak order of a Coxeter system in terms of its root…

The observational characteristics of a linear structural equation model can be effectively described by polynomial constraints on the observed covariance matrix. However, these polynomials can be exponentially large, making them impractical…

If a nontrivial finite group coacts on a graded noetherian down-up algebra $A$ inner faithfully and homogeneously, then the fixed subring is not isomorphic to $A$. Therefore graded noetherian down-up algebras are rigid with respect to…

An equational condition is a set of equations in an algebraic language, and an algebraic structure satisfies such a condition if it possesses terms that meet the required equations. We find a single nontrivial equational condition which is…

Examples of exact categories in representation theory are given by the category of Delta-filtered modules over quasi-hereditary algebras, but also by various categories related to matrix problems, such as poset representations or…

We show that every quasi-compact and quasi-separated algebraic stack can be approximated by a noetherian algebraic stack. We give several applications such as eliminating noetherian hypotheses in the theory of good moduli spaces.

We describe various structures of algebraic nature on the space of continuous valuations on convex sets, their properties (like versions of Poincar\'e duality and hard Lefschetz theorem), and their relations and applications to integral…

Rough sets were proposed to deal with the vagueness and incompleteness of knowledge in information systems. There are may optimization issues in this field such as attribute reduction. Matroids generalized from matrices are widely used in…

We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…