An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity [PDF]
, 2009 A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations
Recasens Ferrés, Jorge +3 more
core +2 more sources
Strategic Change, EarlyView.ABSTRACT Traditional reward systems, which are largely salary‐centered and structurally rigid, are no longer sufficient in an era defined by digital transformation. Building on this premise, this study examines how emerging technologies reshape integrated compensation systems by uncovering their causal, mediating, and outcome‐oriented roles.
Seyed Hossein Razavi Hajiagha +5 more
wiley +1 more source
Familiar Verbs Are Not Always Easier Than Novel Verbs: How German Pre-School Children Comprehend Active and Passive Sentences [PDF]
, 2013 Many studies show a developmental advantage for transitive sentences with familiar verbs over those with novel verbs. It might be that once familiar verbs become entrenched in particular constructions, they would be more difficult to understand (than ...
Tomasello, Michael +11 more
core +1 more source
An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a proximity [PDF]
, 2008 A method to get the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is presented.
González, Ramón +2 more
core +2 more sources
Peskine Sixfolds and Debarre–Voisin Fourfolds With Associated Cubic Fourfolds
Mathematische Nachrichten, EarlyView.ABSTRACT We develop the notion of Peskine sixfolds with associated K3 surfaces and cubic fourfolds and work out numerical conditions for when these associations occur. In discriminant 24, the first family for which there is an associated cubic fourfold, we identify the cubic explicitly.
Corey Brooke +3 more
wiley +1 more source
Highly arc transitive digraphs: reachability, topological groups [PDF]
, 2005 Let D be a locally finite, connected, 1-arc transitive digraph. It is shown that the reachability relation is not universal in D provided that the stabilizer of an edge satisfies certain conditions which seem to be typical for highly arc transitive ...
Möller, Rögnvaldur G. +5 more
core +1 more source
Periodic linear groups in which permutability is a transitive relation [PDF]
, 2023 Maria Ferrara, Marco Trombetti
openalex +1 more source
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
Prime order derangements in primitive permutation groups [PDF]
, 2011 Let G be a transitive permutation group on a finite set Ω of size at least 2. An element of G is a derangement if it has no fixed points on Ω. Let r be a prime divisor of |Ω|.
Giudici, M. +10 more
core +1 more source
The Chaotic Properties of Increasing Gap Shifts
International Journal of Mathematics and Mathematical Sciences, 2019 It is well known that locally everywhere onto, totally transitive, and topologically mixing are equivalent on shift of finite type. It turns out that this relation does not hold true on shift of infinite type.
Nor Syahmina Kamarudin +2 more
doaj +1 more source