Related papers: Kernel Atomicity
In algebra, atomicity is the study of divisibility by and factorizations into atoms (also called irreducibles). In one side of the spectrum of atomicity we find the antimatter algebraic structures, inside which there are no atoms and,…
We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…
A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…
In a previous article by two of the present authors and S. Bonzio, \L ukasiewicz near semirings were introduced and it was proven that basic algebras can be represented (precisely, are term equivalent to) as near semirings. In the same work…
In the framework of idempotent mathematics, analogs of the classical kernel theorems of L. Schwartz and A. Grothendieck are studied. Idempotent versions of nuclear spaces (in the sense of A. Grothendieck) are discussed. The so-called…
The ascending chain condition on principal ideals (ACCP) is almost always complementary to atomicity within integral domains: in fact, Cohn initially stated that these two conditions were equivalent. This assertion has been shown to be…
Any two infinite-dimensional (separable) Hilbert spaces are unitarily isomorphic. The sets of all their self-adjoint operators are also therefore unitarily equivalent. Thus if all self-adjoint operators can be observed, and if there is no…
This paper is partly a report on current knowledge concerning the structure of (generic) quantized coordinate rings and their prime spectra, and partly propaganda in support of the conjecture that since these algebras share many common…
We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
A linear system on a smooth complex algebraic surface gives rise to a family of smooth curves in the surface. Such a family has a topological monodromy representation valued in the mapping class group of a fiber. Extending arguments of…
Let A be an associative algebra with identity over a field k. An atomistic subsemiring R of the lattice of subspaces of A, endowed with the natural product, is a subsemiring which is a closed atomistic sublattice. When R has no zero…
The two pillars of Algebraic topology - Homology and homotopy theory rely on the availability of basic building blocks called cells. Cells take the form of simplexes, and have properties such as faces, sub-cells, convexity and…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
Black holes in matrix theory may consist of interacting clusters (correlated domains) which saturate the uncertainty principle. We show that this assumption qualitatively accounts for the thermodynamic properties of both charged and neutral…
We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…
Let $G_\Gamma$ be a graph product over a finite simplicial graph $\Gamma$, and let $K_\Gamma$ denote the kernel of the canonical homomorphism from $G_\Gamma$ to the direct product of its vertex groups. It is known that, up to isomorphism,…
The basic hypothesis of a post-Copernican Cosmological theory is that {\em all the points} of the Universe have to be essentially equivalent: this hypothesis is required in order to avoid any privileged {\em observer}. This assumption has…
In parameterized algorithmics, the process of kernelization is defined as a polynomial time algorithm that transforms the instance of a given problem to an equivalent instance of a size that is limited by a function of the parameter. As,…