Search results for "Algebraic structure"
showing 5 items of 25 documents
Fibered aspects of Yoneda's regular span
2018
In this paper we start by pointing out that Yoneda's notion of a regular span $S \colon \mathcal{X} \to \mathcal{A} \times \mathcal{B}$ can be interpreted as a special kind of morphism, that we call fiberwise opfibration, in the 2-category $\mathsf{Fib}(\mathcal{A})$. We study the relationship between these notions and those of internal opfibration and two-sided fibration. This fibrational point of view makes it possible to interpret Yoneda's Classification Theorem given in his 1960 paper as the result of a canonical factorization, and to extend it to a non-symmetric situation, where the fibration given by the product projection $Pr_0 \colon \mathcal{A} \times \mathcal{B} \to \mathcal{A}$ i…
The algebraic structure of cohomological field theory
1993
Abstract The algebraic foundation of cohomological field theory is presented. It is shown that these theories are based upon realizations of an algebra which contains operators for both BRST and vector supersymmetry. Through a localization of this algebra, we construct a theory of cohomological gravity in arbitrary dimensions. The observables in the theory are polynomial, but generally non-local operators, and have a natural interpretation in terms of a universal bundle for gravity. As such, their correlation functions correspond to cohomology classes on moduli spaces of Riemannian connections. In this uniformization approach, different moduli spaces are obtained by introducing curvature si…
Algebraic Structures of Rough Sets
1994
This paper deals with some algebraic and set-theoretical properties of rough sets. Our considerations are based on the original conception of rough sets formulated by Pawlak [4, 5]. Let U be any fixed non-empty set traditionally called the universe and let R be an equivalence relation on U. The pair A = (U, R) is called the approximation space. We will call the equivalence classes of the relation R the elementary sets. We denote the family of elementary sets by U/R. We assume that the empty set is also an elementary set. Every union of elementary sets will be called a composed set. We denote the family of composed sets by ComR. We can characterize each set X ⊆ U using the composed sets [5].
The Concept of Duality and Applications to Markov Processes Arising in Neutral Population Genetics Models
1999
One possible and widely used definition of the duality of Markov processes employs functions H relating one process to another in a certain way. For given processes X and Y the space U of all such functions H, called the duality space of X and Y, is studied in this paper. The algebraic structure of U is closely related to the eigenvalues and eigenvectors of the transition matrices of X and Y. Often as for example in physics (interacting particle systems) and in biology (population genetics models) dual processes arise naturally by looking forwards and backwards in time. In particular, time-reversible Markov processes are self-dual. In this paper, results on the duality space are presented f…
Unit Operations in Approximation Spaces
2010
Unit operations are some special functions on sets. The concept of the unit operation originates from researches of U. Wybraniec-Skardowska. The paper is concerned with the general properties of such functions. The isomorphism between binary relations and unit operations is proved. Algebraic structures of families of unit operations corresponding to certain classes of binary relations are considered. Unit operations are useful in Pawlak's Rough Set Theory. It is shown that unit operations are upper approximations in approximation space. We prove, that in the approximation space (U, R) generated by a reflexive relation R the corresponding unit operation is the least definable approximation i…