Related papers: The weakest nontrivial idempotent equations
Every orthonomic system of partial differential equations is known to possess a finite number of integrability conditions sufficient to ensure the validity of all. Herewith we offer an efficient algorithm to construct a sufficient set of…
An element e of an ordered semigroup $(S,\cdot,\leq)$ is called an ordered idempotent if $e\leq e^2$. We call an ordered semigroup $S$ idempotent ordered semigroup if every element of $S$ is an ordered idempotent. Every idempotent semigroup…
Let A be a unital algebra with a nontrivial idempotent e, and f=1-e. Suppose that A satisfies that exe.eAf={0}=fAe.exe implies exe=0 and eAf.fxf={0}=fxf.fAe implies fxf=0 for each x in A. We obtain the (necessary and) sufficient conditions…
Newtonian dynamical systems which accept the normal shift on an arbitrary Riemannian manifold are considered. For them the determinating equations making the weak normality condition are derived. The expansion for the algebra of tensor…
We define the concepts of weakly precious and precious rings which generalize the notions of weakly clean and nil-clean rings. We obtain some fundamental properties of these rings. We also obtain certain subclasses of such rings and then…
The average result of a weak measurement of some observable $A$ can, under post-selection of the measured quantum system, exceed the largest eigenvalue of $A$. The nature of weak measurements, as well as the presence of post-selection and…
Simple representations of documents based on the occurrences of terms are ubiquitous in areas like Information Retrieval, and also frequent in Natural Language Processing. In this work we propose a logical-probabilistic approach to the…
In this paper we show an explicit relation between chains of torsion classes and weak stability conditions over an abelian category. In particular, up to a natural equivalence, they coincide. We investigate topological properties of the…
A semigroup $S$ is called an equational domain (e.d.) if any finite union of algebraic sets over $S$ is algebraic. For a semigroup $S$ with a finite ideal we find the necessary and sufficient conditions to be an e.d.
It is argued that a weak value of an observable is a robust property of a single pre- and post-selected quantum system rather than a statistical property. During an infinitesimal time a system with a given weak value affects other systems…
Real-life problems are governed by equations which are nonlinear in nature. Nonlinear equations occur in modeling problems, such as minimizing costs in industries and minimizing risks in businesses. A technique which does not involve the…
Stereotypical reasoning assumes that the situation at hand is one of a kind and that it enjoys the properties generally associated with that kind of situation. It is one of the most basic forms of nonmonotonic reasoning. A formal model for…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
We discuss a notion of weak solution for a semilinear wave equation that models the interaction of an elastic body with a rigid substrate through an adhesive layer, relying on results in [2]. Our analysis embraces the vector-valued case in…
We show that the category of N-complexes has a Str\om model structure, meaning the weak equivalences are the chain homotopy equivalences. This generalizes the analogous result for the category of chain complexes (N = 2). The trivial objects…
Generalized contextuality is a hallmark of nonclassical theories like quantum mechanics. Yet, three fundamental computational problems concerning its decidability and complexity remain open. First, determining the complexity of deciding if…
A real $n$-by-$n$ idempotent matrix $A$ with all entries having the same absolute value is called {\it absolutely flat}. We consider the possible ranks of such matrices and herein characterize the triples: size, constant, and rank for which…
We exhibit two relation algebra atom structures such that they are elementarily equivalent but their term algebras are not. This answers Problem 14.19 in the book Hirsch, R. and Hodkinson, I., "Relation Algebras by Games", North-Holland,…
A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality…
A variety of algebras is called limit if it is non-finitely based but all its proper subvarieties are finitely based. A monoid is aperiodic if all its subgroups are trivial. We classify all limit varieties of aperiodic monoids with…