A Survey of Groups in Which Normality or Permutability is a Transitive Relation

Algebra ◽  
1999 ◽  
pp. 171-181 ◽  
Author(s):  
Derek J. S. Robinson
Keyword(s):  
2012 ◽  
Vol 24 (6) ◽  
Author(s):  
Kahled A. Al-Sharo ◽  
James C. Beidleman ◽  
Hermann Heineken ◽  
Matthew F. Ragland

2000 ◽  
Vol 3 (2) ◽  
Author(s):  
MARIAGRAZIA BIANCHI ◽  
ANNA GILLIO BERTA MAURI ◽  
MARCEL HERZOG ◽  
LIBERO VERARDI

2015 ◽  
Vol 100 (2) ◽  
pp. 192-198
Author(s):  
R. ESTEBAN-ROMERO ◽  
G. VINCENZI

We extend to soluble $\text{FC}^{\ast }$-groups, the class of generalised FC-groups introduced in de Giovanni et al. [‘Groups with restricted conjugacy classes’, Serdica Math. J. 28(3) (2002), 241–254], the characterisation of finite soluble T-groups obtained recently in Kaplan [‘On T-groups, supersolvable groups, and maximal subgroups’, Arch. Math. (Basel) 96(1) (2011), 19–25].


1968 ◽  
Vol 16 (2) ◽  
pp. 135-144
Author(s):  
G. J. O. Jameson

Let X be a partially ordered linear space, i.e. a real linear space with a reflexive, transitive relation ≦ such that


2001 ◽  
Vol 76 (5) ◽  
pp. 321-325 ◽  
Author(s):  
M. Asaad ◽  
A.A. Heliel

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1044 ◽  
Author(s):  
Jeong-Gon Lee ◽  
Kul Hur

We introduce the concepts of a bipolar fuzzy reflexive, symmetric, and transitive relation. We study bipolar fuzzy analogues of many results concerning relationships between ordinary reflexive, symmetric, and transitive relations. Next, we define the concepts of a bipolar fuzzy equivalence class and a bipolar fuzzy partition, and we prove that the set of all bipolar fuzzy equivalence classes is a bipolar fuzzy partition and that the bipolar fuzzy equivalence relation is induced by a bipolar fuzzy partition. Finally, we define an ( a , b ) -level set of a bipolar fuzzy relation and investigate some relationships between bipolar fuzzy relations and their ( a , b ) -level sets.


Author(s):  
Zili Zhou ◽  
Shaowu Liu ◽  
Guandong Xu ◽  
Wu Zhang

Multi-relation embedding is a popular approach to knowledge base completion that learns embedding representations of entities and relations to compute the plausibility of missing triplet. The effectiveness of embedding approach depends on the sparsity of KB and falls for infrequent entities that only appeared a few times. This paper addresses this issue by proposing a new model exploiting the entity-independent transitive relation patterns, namely Transitive Relation Embedding (TRE). The TRE model alleviates the sparsity problem for predicting on infrequent entities while enjoys the generalisation power of embedding. Experiments on three public datasets against seven baselines showed the merits of TRE in terms of knowledge base completion accuracy as well as computational complexity.


Heart Rhythm ◽  
2015 ◽  
Vol 12 (9) ◽  
pp. 2008-2009
Author(s):  
Marc W. Deyell ◽  
Joshua M. Cooper

Sign in / Sign up

Export Citation Format

Share Document