Results 271 to 280 of about 4,534 (290)
Some of the next articles are maybe not open access.
RELATIONS ADMITTING A TRANSITIVE GROUP OF AUTOMORPHISMS
Mathematics of the USSR-Sbornik, 1975The concepts of a Cayley relation of arbitrary arity and a quotient relation are defined. Cayley relations are characterized as those relations whose automorphism groups contain regular subgroups. The freedom of Cayley relations is proved: any relation with a transitive automorphism group is isomorphic to a quotient relation of a Cayley relation.Using ...
openaire +2 more sources
Transitivity-related properties of fuzzy strict preference relations
Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569), 2002Given a fuzzy relation, S. Ovchinnikov and M. Roubens (1991) introduce a very general definition of fuzzy strict preference. The author investigates its transitivity-related properties including weak transitivity, consistency, acyclicity, etc.
openaire +1 more source
AGGREGATING TRANSITIVE FUZZY BINARY RELATIONS
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 1995We discuss the aggregation problem for transitive fuzzy binary relations. An aggregation procedure assigns a group fuzzy binary relation to each finite set of individual binary relations. Individual and group binary relations are assumed to be transitive fuzzy binary relation with respect to a given continuous t-norm.
openaire +1 more source
Relative Quaternion State Transition Relation
Journal of Guidance and Control, 1979The attitude of a maneuvering spacecraft relative to a desired noninertial reference is compactly represented in the quaternion format by the relative quaternion. The popular technique for bootstrapping the relative quaternion relies on the state transition matrix for the quaternion strapdown equations of motion wherein the rates are estimates of ...
openaire +1 more source
Operators over relations preserving transitivity
Discrete Mathematics and Applications, 1998Summary: Let \({\mathcal T}={\mathcal T}(A)\) be the class of all transitive relations on a finite set \(A\). We say that an operator \(r= F(r_1,\dots, r_n)\) on the set of relations preserves transitivity if \[ r_1,\dots, r_n\in{\mathcal T}\Rightarrow r\in{\mathcal T}. \] Let us introduce operators \(\tau^{(u)}_n(r_1,\dots, r_n)\), \(u= 0,1\), \(n\geq
openaire +2 more sources
Logics with Transitive Accessibility Relations
2014This chapter is about the model construction problem in classes of models satisfying the constraint of transitivity. We present the modal logics of the class of models where the accessibility relation is transitive (K4), transitive and serial (KD4), and transitive and reflexive (KT4, alias S4).
Olivier Gasquet +3 more
openaire +1 more source
Symmetry relations at phase transitions
Abstract According to Ehrenfest, a phase transitions in the solid state is of first order if the entropy or the volume change is discontinuous; if both are continuous, the phase transition is of second order. In a more recent classification, a phase transition is discontinuous if the entropy and an order parameter change discontinuously ...Ulrich Müller, Gemma de la Flor
openaire +1 more source
Transitive decomposition of min-transitive fuzzy relations
2006S. Díaz, B. De Baets, S. Montes
openaire +1 more source