Results 11 to 20 of about 116,382 (312)
The permanent of a transitive relation [PDF]
Proceedings of the American Mathematical Society, 1970 H. Minc has constructed an upper bound on the permanent of any relation on a finite set. In this paper the permanent of any transitive relation on a finite set is calculated. The work in part is based upon the interpretation of a reflexive, transitive relation as a finite topology. The relationship to (finite) Borel fields is discussed briefly.
Henry Sharp
+6 more sources
The extended permutohedron on a transitive binary relation [PDF]
European Journal of Combinatorics, 2014 For a given transitive binary relation e on a set E, the transitive closures of open (i.e., co-transitive in e) sets, called the regular closed subsets, form an ortholattice Reg(e), the extended permutohedron on e. This construction, which contains the poset Clop(e) of all clopen sets, is a common generalization of known notions such as the generalized
Luigi Santocanale, Friedrich Wehrung
core +9 more sources
The role of memory in affirming-the-consequent fallacy. [PDF]
iScienceSummary: People tend to recognize that a transitive relation remains true even when its order is reversed. This affirming-the-consequent fallacy is thought to be uniquely related to human intelligence.
Higuchi Y +4 more
europepmc +2 more sources
Transitive Closures of Ternary Fuzzy Relations [PDF]
International Journal of Computational Intelligence Systems, 2021 Recently, we have introduced six types of composition of ternary fuzzy relations. These compositions are close in spirit to the composition of binary fuzzy relations.
Lemnaouar Zedam, Bernard De Baets
doaj +4 more sources
Transitivity of the εm-relation on (m-idempotent) hyperrings
Open Mathematics, 2018 On a general hyperring, there is a fundamental relation, denoted γ*, such that the quotient set is a classical ring. In a previous paper, the authors defined the relation εm on general hyperrings, proving that its transitive closure εm∗$\begin{array}{} \
Norouzi Morteza, Cristea Irina
doaj +3 more sources
Groups in Which Commutativity Is a Transitive Relation
Journal of Algebra, 1998 A group \(G\) is said to be a \(CT\)-group if commutativity is a transitive relation in the set of all non-trivial elements of \(G\). This is clearly equivalent to the property that the centralizers of all non-trivial elements of \(G\) are abelian. Clearly the Fitting subgroup of any \(CT\)-group is abelian.
Yu-Fen Wu
openalex +3 more sources
Scott-topology based on transitive binary relation [PDF]
Journal of Mahani Mathematical Research, 2022 In the study of partially ordered sets, topologies such as Scott-topology have shown to be of paramount importance. In order to have analogous topology-like tools in the more general setting of quantitative domains, we introduce a method to construct ...
Osama Sayed, Nabil Hassan Sayed
doaj +1 more source
The fluted fragment with transitive relations [PDF]
Annals of Pure and Applied Logic, 2022 We study the satisfiability problem for the fluted fragment extended with transitive relations. The logic enjoys the finite model property when only one transitive relation is available and the finite model property is lost when additionally either equality or a second transitive relation is allowed.
Ian Pratt-Hartmann, Lidia Tendera
openaire +4 more sources
, 2017 We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation.
Ian Pratt‐Hartmann
openalex +4 more sources
$\mathcal F$-hypercyclic and disjoint $\mathcal F$-hypercyclic properties of binary relations over topological spaces [PDF]
Mathematica Bohemica, 2020 We examine various types of $\mathcal F$-hypercyclic ($\mathcal F$-topologically transitive) and disjoint $\mathcal F$-hypercyclic (disjoint $\mathcal F$-topologically transitive) properties of binary relations over topological spaces.
Marko Kostić
doaj +1 more source