Neat homomorphisms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Neat Rings

A ring is called clean if every element is the sum of a unit and an idempotent. Throughout the last 30 years several characterizations of commutative clean rings have been given. We have compiled a thorough list, including some new equivalences, in hopes that in the future there will be a better understanding of this interesting class of rings. One of the fundamental properties of clean rings i...

متن کامل

SimAnt Simulation Using NEAT

In nature, ants in a colony often work together to complete a common task. We want to see if we can simulate this phenomenon. We create a simulation that looks at predator prey interactions based o↵ of the 1991 SimAnt game. In this game a spider attempts to eat individual ants from a colony, but if the ants form a large enough swarm they can work together to eat the spider. The question we are ...

متن کامل

Neat Embeddings and Amalgamation

We present a property of neat reducts commuting with forming subalgebras as a definability condition. The purpose of this paper is to relate results on neat reducts, a notion particular to cylindric algebras to results on the “more universal” strong amalgamation property in a very general setting. It is known [7], [8] and [6] that amalgamation properties in a class of algebras correspond to int...

متن کامل

Noisy Neurons, Neat Networks

In this issue of Neuron, Kiani et al. (2015) show that the correlated activity of multiple simultaneously recorded neurons can be used to identify, in a completely un-biased manner, distinct functional domains within prefrontal and (pre)motor cortex of macaque monkeys.

متن کامل

Lattice Homomorphisms Induced by Group Homomorphisms

Introduction. By a lattice homorphism of a group G onto a group G' we mean a single-valued mapping of the lattice L(G) of subgroups of G onto the lattice L(G') of subgroups of G', which preserves all unions and intersections, that is, which is subject to the conditions 1. (U,S,)0 = U,(S¿), 2. (r\vSr) = Ç)ASd>), for every (finite or infinite) set of subgroups 5„ of G. We call proper any l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1972

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1972.40.13