Search results for "Algebras"
showing 10 items of 281 documents
The overlap algebra of regular opens
2010
Abstract Overlap algebras are complete lattices enriched with an extra primitive relation, called “overlap”. The new notion of overlap relation satisfies a set of axioms intended to capture, in a positive way, the properties which hold for two elements with non-zero infimum. For each set, its powerset is an example of overlap algebra where two subsets overlap each other when their intersection is inhabited. Moreover, atomic overlap algebras are naturally isomorphic to the powerset of the set of their atoms. Overlap algebras can be seen as particular open (or overt) locales and, from a classical point of view, they essentially coincide with complete Boolean algebras. Contrary to the latter, …
Divisible designs from semifield planes
2002
AbstractWe give a general method to construct divisible designs from semifield planes and we use this technique to construct some divisible designs. In particular, we give the case of twisted field plane as an example.
Root-restricted Kleenean rotations
2010
We generalize the Kleene theorem to the case where nonassociative products are used. For this purpose, we apply rotations restricted to the root of binary trees.
Periodic Groups Covered by Transitive Subgroups of Finitary Permutations or by Irreducible Subgroups of Finitary Transformations
1999
Let X be either the class of all transitive groups of finitary permutations, or the class of all periodic irreducible finitary linear groups. We show that almost primitive X-groups are countably recognizable, while totally imprimitive X-groups are in general not countably recognizable. In addition we derive a structure theorem for groups all of whose countable subsets are contained in totally imprimitive X-subgroups. It turns out that totally imprimitive p-groups in the class X are countably recognizable.
Defining relations of minimal degree of the trace algebra of 3×3 matrices
2008
Abstract The trace algebra C n d over a field of characteristic 0 is generated by all traces of products of d generic n × n matrices, n , d ⩾ 2 . Minimal sets of generators of C n d are known for n = 2 and n = 3 for any d as well as for n = 4 and n = 5 and d = 2 . The defining relations between the generators are found for n = 2 and any d and for n = 3 , d = 2 only. Starting with the generating set of C 3 d given by Abeasis and Pittaluga in 1989, we have shown that the minimal degree of the set of defining relations of C 3 d is equal to 7 for any d ⩾ 3 . We have determined all relations of minimal degree. For d = 3 we have also found the defining relations of degree 8. The proofs are based …
L 2-topological invariants of 3-manifolds
1995
We give results on theL2-Betti numbers and Novikov-Shubin invariants of compact manifolds, especially 3-manifolds. We first study the Betti numbers and Novikov-Shubin invariants of a chain complex of Hilbert modules over a finite von Neumann algebra. We establish inequalities among the Novikov-Shubin invariants of the terms in a short exact sequence of chain complexes. Our algebraic results, along with some analytic results on geometric 3-manifolds, are used to compute theL2-Betti numbers of compact 3-manifolds which satisfy a weak form of the geometrization conjecture, and to compute or estimate their Novikov-Shubin invariants.
A natural and rigid model of quantum groups
1992
We introduce a natural (Frechet-Hopf) algebra A containing all generic Jimbo algebras U t (sl(2)) (as dense subalgebras). The Hopf structures on A extend (in a continuous way) the Hopf structures of generic U t (sl(2)). The Universal R-matrices converge in A\(\hat \otimes \)A. Using the (topological) dual of A, we recover the formalism of functions of noncommutative arguments. In addition, we show that all these Hopf structures on A are isomorphic (as bialgebras), and rigid in the category of bialgebras.
On Rough Sets in Topological Boolean Algebras
1994
We have focused on rough sets in topological Boolean algebras. Our main ideas on rough sets are taken from concepts of Pawlak [4] and certain generalizations of his constructions which were offered by Wiweger [7]. One of the most important results of this note is a characterization of the rough sets determined by regular open and regular closed elements.
Heyting-valued interpretations for Constructive Set Theory
2006
AbstractWe define and investigate Heyting-valued interpretations for Constructive Zermelo–Frankel set theory (CZF). These interpretations provide models for CZF that are analogous to Boolean-valued models for ZF and to Heyting-valued models for IZF. Heyting-valued interpretations are defined here using set-generated frames and formal topologies. As applications of Heyting-valued interpretations, we present a relative consistency result and an independence proof.
A General Algorithm to Calculate the Inverse Principal $p$-th Root of Symmetric Positive Definite Matrices
2019
We address the general mathematical problem of computing the inverse p-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary p-th roots and their inverses of symmetric positive definite matrices is presented. We show that the order of convergence is at least quadratic and that adaptively adjusting a parameter q always leads to an even faster convergence. In this way, a better performance than with previously known iteration schemes is achieved. The efficiency of the iterative functions is demonstrated for various matrices with different densities, condition numbers and spectral radii.