Search results for "Transitive relation"
showing 10 items of 74 documents
The guarded fragment with transitive guards
2004
The guarded fragment with transitive guards, (GF+TG), is an extension of the guarded frag- ment of 9rst-order logic, GF, in which certain predicates are required to be transitive, transitive predicate letters appear only in guards of the quanti9ers and the equality symbol may appear everywhere. We prove that the decision problem for (GF+TG) is decidable. Moreover, we show that the problem is in 2EXPTIME. This result is optimal since the satis9ability problem for GF is 2EXPTIME-complete (J. Symbolic Logic 64 (1999) 1719-1742). We also show that the satis- 9ability problem for two-variable (GF+TG) is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satis9ability …
How Correlated Are Community-Aware and Classical Centrality Measures in Complex Networks?
2021
Unlike classical centrality measures, recently developed community-aware centrality measures use a network’s community structure to identify influential nodes in complex networks. This paper investigates their relationship on a set of fifty real-world networks originating from various domains. Results show that classical and community-aware centrality measures generally exhibit low to medium correlation values. These results are consistent across networks. Transitivity and efficiency are the most influential macroscopic network features driving the correlation variation between classical and community-aware centrality measures. Additionally, the mixing parameter, the modularity, and the Max…
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations
2009
We show that every finitely satisfiable two-variable first-order formula with two equivalence relations has a model of size at most triply exponential with respect to its length. Thus the finite satisfiability problem for two-variable logic over the class of structures with two equivalence relations is decidable in nondeterministic triply exponential time. We also show that replacing one of the equivalence relations in the considered class of structures by a relation which is only required to be transitive leads to undecidability. This sharpens the earlier result that two-variable logic is undecidable over the class of structures with two transitive relations.
Attracteurs de Lorenz de variété instable de dimension arbitraire
1997
Abstract We construct the first examples of flows with robust multidimensional Lorenz-like attractors: the singularity contained in the attractor may have any number of expanding eigenvalues, and the attractor remains transitive in a whole neighbourhood of the initial flow. These attractors support a Sinai-Ruelle-Bowen SRB-measure and, contrary to the usual (low-dimensional) Lorenz models, they have infinite modulus of structural stability.
Some Characterisations of Soluble SST-Groups
2016
All groups considered in this paper are finite. A subgroup H of a group G is said to be SS-permutable or SS-quasinormal in G if H has a supplement K in G such that H permutes with every Sylow subgroup of K. Following [6], we call a group G an SST-group provided that SS-permutability is a transitive relation in G, that is, if A is an SS-permutable subgroup of B and B is an SS-permutable subgroup of G, then A is an SS-permutable subgroup of G. The main aim of this paper is to present several characterisations of soluble SST-groups.
Sylow permutable subnormal subgroups of finite groups II
2001
[EN] In this paper a local version of Agrawal's theorem about the structure of finite groups in which Sylow permutability is transitive is given. The result is used to obtain new characterisations of this class of finite groups.
On the quasi-isometric and bi-Lipschitz classification of 3D Riemannian Lie groups.
2021
AbstractThis note is concerned with the geometric classification of connected Lie groups of dimension three or less, endowed with left-invariant Riemannian metrics. On the one hand, assembling results from the literature, we give a review of the complete classification of such groups up to quasi-isometries and we compare the quasi-isometric classification with the bi-Lipschitz classification. On the other hand, we study the problem whether two quasi-isometrically equivalent Lie groups may be made isometric if equipped with suitable left-invariant Riemannian metrics. We show that this is the case for three-dimensional simply connected groups, but it is not true in general for multiply connec…
Periodic measures and partially hyperbolic homoclinic classes
2019
In this paper, we give a precise meaning to the following fact, and we prove it: $C^1$-open and densely, all the non-hyperbolic ergodic measures generated by a robust cycle are approximated by periodic measures. We apply our technique to the global setting of partially hyperbolic diffeomorphisms with one dimensional center. When both strong stable and unstable foliations are minimal, we get that the closure of the set of ergodic measures is the union of two convex sets corresponding to the two possible $s$-indices; these two convex sets intersect along the closure of the set of non-hyperbolic ergodic measures. That is the case for robustly transitive perturbation of the time one map of a tr…
Recurrence and genericity
2003
We prove a C^1-connecting lemma for pseudo-orbits of diffeomorphisms on compact manifolds. We explore some consequences for C^1-generic diffeomorphisms. For instance, C^1-generic conservative diffeomorphisms are transitive. Nous montrons un lemme de connexion C^1 pour les pseudo-orbites des diffeomorphismes des varietes compactes. Nous explorons alors les consequences pour les diffeomorphismes C^1-generiques. Par exemple, les diffeomorphismes conservatifs C^1-generiques sont transitifs.
Transitivity in coherence-based probability logic
2016
We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent p-consistent sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Moreover, we prove the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases. Finally, we apply our results to study selected probabilistic versions of classical categorical syllogisms and construct a new version of the squa…