Results 121 to 130 of about 2,231 (145)

On the syntactic monoids associated with a class of synchronized codes. [PDF]

ScientificWorldJournal, 2013
Wang SF.
europepmc   +1 more source

Aut ( F 5 ) has property (T). [PDF]

Math Ann, 2019
Kaluba M, Nowak PW, Ozawa N.
europepmc   +1 more source

On Lifting Idempotents [PDF]

Canadian Mathematical Bulletin, 1974
Let N be an ideal of a ring A. We say that idempotents modulo N can be lifted provided that for every a of A such that a2-a ∈ N there exists an element e2=e ∈ A such that e-a ∈ N. The technique of lifting idempotents is considered to be a fundamental tool in the classical theory of nonsemiprimitive Artinian rings (refer [2; p. 72]).
Kwangil Koh
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On idempotency of linear combinations of idempotent matrices

Applied Mathematics and Computation, 2004
Let \(P_1, P_2\) and \(P_3\) being any three different nonzero mutually commutative \(n\times n\) idempotent matrices, and \(c_1,c_2\) and \(c_3\) being nonzero scalars, the problem of characterizing some situations, where a linear combination of the form \(P=c_1P_1+c_2P_2\) or \(P=c_1P_1+c_2P_2+c_3P_3\), is also an idempotent matrix is considered ...
Sakarya Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Bölümü, Özdemir, Halim, Özdemir, Halim   +2 more
openaire   +1 more source

On the importance of idempotence

Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, 2006
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from some commutative semigroup. Subject to a fixed space of possible range shapes, the problem is to preprocess the points so that the total semigroup sum of the points lying within
Sunil Arya, Theocharis Malamatos, David M. Mount   +2 more
openaire   +2 more sources

AGGREGATION AND IDEMPOTENCE

The Review of Symbolic Logic, 2013
AbstractA 1-ary sentential context is aggregative (according to a consequence relation) if the result of putting the conjunction of two formulas into the context is a consequence (by that relation) of the results of putting first the one formula and then the other into that context.
openaire   +2 more sources

ON THE IDEMPOTENCY AND CO-IDEMPOTENCY OF THE MORPHOLOGICAL CENTER

International Journal of Pattern Recognition and Artificial Intelligence, 2001
By a novel use of distributivity we obtain polynomial time algorithms to decide whether or not a given min–max operator (stack filter) is idempotent or not. Several properties related to idempotency can also be tested in polynomial time. In particular we apply these results to the morphological center of two operators.
openaire   +1 more source

DISTRIBUTIVE IDEMPOTENT UNINORMS

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2003
A characterization of all idempotent uninorms satisfying the distributive property is given. The special cases of left-continuous and right-continuous idempotent uninorms are presented separately and it is also proved that all idempotent uninorms are autodistributive.
Daniel Ruiz 0001, Joan Torrens
openaire   +2 more sources

Idempotents in R

Mathematical Logic Quarterly, 1986
DeMorgan monoids stand to the relevant logic R as Boolean algebras do to classical logic, or as Heyting lattices do to intuitionistic logic. By an idempotent in a DeMorgan monoid we mean an element a such that \(a\circ a=a\), where \(\circ\) is the fusion (or consistency) operation defined by \(b\circ c=\sim (b\to \sim c)\).
openaire   +2 more sources

Idempotent uninorms

European Journal of Operational Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source