Results 11 to 20 of about 1,612,373 (342)
The variety generated by order algebras [PDF]
Algebra Universalis, 2002 Every ordered set \((A,\leq )\) can be considered as an algebra \((A,\cdot )\) in a natural way, where \(xy=x\) iff \(x\leq y\) and \(xy=y\) otherwise. The variety generated by order algebras is investigated. It is proved, among other things, that this variety is not finitely based and, although locally finite, it is not contained in any finitely ...
Freese, R. +5 more
openaire +4 more sources
Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real-World Data. [PDF]
Adv Intell DiscovThis article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Ren Y, Wei GW.
europepmc +2 more sources
ALGEBRAIC LINEAR ORDERINGS [PDF]
International Journal of Foundations of Computer Science, 2011 An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the ...
Stephen L. Bloom, Zoltán Ésik
openaire +4 more sources
Equivalence of order and algebraic properties in ordered $$^*$$-algebras [PDF]
Positivity, 2020 The aim of this article is to describe a class of *-algebras that allows to treat well-behaved algebras of unbounded operators independently of a representation. To this end, Archimedean ordered *-algebras (*-algebras whose real linear subspace of Hermitian elements are an Archimedean ordered vector space with rather weak compatibilities with the ...
openaire +4 more sources
Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra? [PDF]
Conference on Uncertainty in Artificial Intelligence, 2013 In this paper, the feasibility of using finite totally ordered probability models under Aleliunas's Theory of Probabilistic Logic [Aleliunas, 1988] is investigated.
Xiang Yang, M. Beddoes, D. Poole
semanticscholar +1 more source
Unordered Tuples in Quantum Computation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 It is well known that the C*-algebra of an ordered pair of qubits is M_2 (x) M_2. What about unordered pairs? We show in detail that M_3 (+) C is the C*-algebra of an unordered pair of qubits. Then we use Schur-Weyl duality to characterize the C*-algebra
Robert Furber, Bas Westerbaan
doaj +1 more source
A lattice model for condensation in Levin-Wen systems
Journal of High Energy Physics, 2023 Levin-Wen string-net models provide a construction of (2+1)D topologically ordered phases of matter with anyonic localized excitations described by the Drinfeld center of a unitary fusion category.
Jessica Christian +3 more
doaj +1 more source
Quotients and subalgebras of sup-algebras; pp. 311–322 [PDF]
Proceedings of the Estonian Academy of Sciences, 2015 An ordered algebra is called a sup-algebra if its underlying poset is a complete lattice and its operations are compatible with joins in each variable. In this article we study quotients and subalgebras of sup-algebras.
Xia Zhang, Valdis Laan
doaj +1 more source
Differential Equations & Applications, 2019 In this paper we prove some coupled and mixed coupled hybrid fixed point theorems involving different algebraic combinations of three operators and coupled operators in a partially ordered Banach algebra by an application of a coupled hybrid fixed point ...
B. Dhage
semanticscholar +1 more source
Identities in the Algebra of Partial Maps [PDF]
, 2005 We consider the identities of a variety of semigroup-related algebras modelling the algebra of partial maps. We show that the identities are intimately related to a weak semigroup deductive system and we show that the equational theory is decidable.
Marcel Jackson +3 more
core +1 more source