Results 81 to 90 of about 3,203 (298)
The Cayley graph built upon the semigroup of left ideals of a ring
上海师范大学学报. 自然科学版, 2014 We investigate the interaction between a ring R and the Cayley graph Cay(L(R)) of the semigroup of left ideals of R,as well as subdigraphs of this graph.Graph theoretic properties of these graphs are investigated,such as transitive closure,girth,radius ...
Aihua Li, Ralph P.Tucci
doaj +1 more source
Classes of automata and transitive closure
Information and Control, 1967 A study is made of the classes of predicates accepted by three types of multitape Turing machine. In order of decreasing acceptance powers, these are the general Turing machine, the linear-bounded automaton, and the two-way multitape nonwriting automaton.
openaire +2 more sources
Size-Estimation Framework with Applications to Transitive Closure and Reachability [PDF]
, 1997 Computing the transitive closure in directed graphs is a fundamental graph problem. We consider the more restricted problem of computing the number of nodes reachable from every node and the size of the transitive closure.
Cohen, Edith
core +1 more source
Microbiological Mechanisms of Sand‐Mixed Soil Improvement in Continuously Cropped Soil
Land Degradation &Development, EarlyView.ABSTRACT Sand‐mix soil is a widely adopted method for soil improvement in agricultural production. However, beyond the evident enhancement of physical structure, the mechanisms by which sand‐mix soil promotes crop root growth by influencing soil physicochemical properties and microbial communities remain insufficiently understood.
Yue Huang +11 more
wiley +1 more source
Matroidal Structure of Rough Sets Based on Serial and Transitive Relations
Journal of Applied Mathematics, 2012 The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery, and data mining. The theory of matroids is a generalization of
Yanfang Liu, William Zhu
doaj +1 more source
On the calculation of transitive reduction—closure of orders
Discrete Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michel Habib +2 more
openaire +2 more sources
Kuga–Satake Construction on Families of K3 Surfaces of Picard Rank 14
Mathematische Nachrichten, EarlyView.ABSTRACT The isometry between the type IV6 and the type II4 hermitian symmetric domains suggests a possible relation between suitable moduli spaces of K3 surfaces of Picard rank 14 and of polarized abelian 8‐folds with totally definite quaternion multiplication. We show how this isometry induces a geometrically meaningful map between such moduli spaces
Flora Poon
wiley +1 more source
Design Of Optimal Systolic Algorithms For The Transitive Closure Problem [PDF]
, 1992 We present new optimal systolic algorithms for the transitive closure problem on ring and linear array of processors. The data dependency of the Warshal-Floyd algorithm is exploited to obtain highly pipelined parallel algorithms. One of the algorithms is
Sarkar, D +3 more
core +3 more sources
Inducing Coverings on Hilbert Schemes
Mathematische Nachrichten, EarlyView.ABSTRACT We find an explicit geometric description of all coverings of Hilb2(Σ)$\operatorname{Hilb}^{2}(\Sigma)$ when Σ$\Sigma$ is a normal, complex, quasi‐projective surface with finite fundamental group. We then apply this construction to show that if Σ$\Sigma$ is an irreducible symplectic surface then Hilb2(Σ)$\operatorname{Hilb}^{2}(\Sigma)$ is an ...
Lucas Li Bassi, Filippo Papallo
wiley +1 more source
Наука и техника, 2009 A method for constructing a subset of labeled objects which is used in a heuristic algorithm of possible clusterization with partial training is proposed in the paper.
D. A. Viattchenin
doaj