Results 31 to 40 of about 559,747 (351)
Dual digraphs of finite semidistributive lattices
Cubo, 2022 Dual digraphs of finite join-semidistributive lattices, meet-semidistributive lattices and semidistributive lattices are characterised. The vertices of the dual digraphs are maximal disjoint filter-ideal pairs of the lattice.
Andrew Craig +2 more
doaj +1 more source
Tree Canonization and Transitive Closure
Information and Computation, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Etessami, E, Immerman, N
openaire +2 more sources
Market formation as transitive closure: The evolving pattern of trade in music [PDF]
Network Science, 2015 Where do new markets come from? I construct a network model in which national markets are nodes and flows of recorded music between them are links and conduct a longitudinal analysis of the global pattern of trade in the period 1976–2010.
Jesse Shore
semanticscholar +1 more source
Data fragmentation for parallel transitive closure strategies [PDF]
, 1993 Addresses the problem of fragmenting a relation to make the parallel computation of the transitive closure efficient, based on the disconnection set approach. To better understand this design problem, the authors focus on transportation networks.
Apers, Peter M.G. +3 more
core +2 more sources
L-Recursion and a new Logic for Logarithmic Space [PDF]
, 2011 We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space.
, , Grohe, Martin, Laubner, Bastian
core +1 more source
Merotopies associated with quasi-uniformities
Applied General Topology, 2000 To an arbitrary quasi-uniformity on the set X, a merotopy on X is assigned. There are results concerning the question whether this merotopy is compatible with the topology induced by the quasi-uniformity end whether the closure operation induced by the ...
Ákos Császár
doaj +1 more source
Topological Properties of Generalized Rough Approximation Operators Based on Objects [PDF]
Jisuanji kexue, 2023 Rough set theory is a mathematical tool to deal with uncertain problems.The core notion of rough set theory is appro-ximation operators.Pawlak approximation operators based on equivalence relations cab be extended to generalized rough approximation ...
LI Yanyan, QIN Keyun
doaj +1 more source
Transitive closure of interval-valued relations [PDF]
2008 3rd International Conference on Intelligent System and Knowledge Engineering, 2008 Peer ...
González del Campo, Ramón +2 more
openaire +2 more sources
On the Positive Calculus of Relations with Transitive Closure
Symposium on Theoretical Aspects of Computer Science, 2018 Binary relations are such a basic object that they appear in many places in mathematics and computer science. For instance, when dealing with graphs, program semantics, or termination guarantees, binary relations are always used at some point.
D. Pous
semanticscholar +1 more source
On Generalized Transitive Matrices
Journal of Applied Mathematics, 2011 Transitivity of generalized fuzzy matrices over a special type of semiring is considered. The semiring is called incline algebra which generalizes Boolean algebra, fuzzy algebra, and distributive lattice.
Jing Jiang, Lan Shu, Xinan Tian
doaj +1 more source