Search results for "Transitive relation"
showing 10 items of 74 documents
Multiply Transitive Permutation Groups
1982
Since the beginnings of finite group theory, the multiply transitive permutation groups have exercised a certain fascination. This is mainly due to the fact that apart from the symmetric and alternating groups not many of them were known. Only very recently final results about multiply transitive permutation groups have been proved, using the classification of all finite simple groups (see 7.5).
Some contributions to the theory of transformation monoids
2019
The aim of this paper is to present some contributions to the theory of finite transformation monoids. The dominating influence that permutation groups have on transformation monoids is used to describe and characterise transitive transformation monoids and primitive transitive transformation monoids. We develop a theory that not only includes the analogs of several important theorems of the classical theory of permutation groups but also contains substantial information about the algebraic structure of the transformation monoids. Open questions naturally arising from the substantial paper of Steinberg [A theory of transformation monoids: combinatorics and representation theory. Electron. J…
On the decision problem for the guarded fragment with transitivity
2002
The guarded fragment with transitive guards, [GF+TG], is an extension of GF in which certain relations are required to be transitive, transitive predicate letters appear only in guards of the quantifiers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable. This answers the question posed in (Ganzinger et al., 1999). Moreover, we show that the problem is 2EXPTIME-complete. This result is optimal since the satisfiability problem for GF is 2EXPTIME-complete (Gradel, 1999). We also show that the satisfiability problem for two-variable [GF+TG] is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satisfiability pr…
On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
2005
We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. We also show that finite models for sentences of GF with more transitive predicate letters used only in guards have essentially different properties than infinite ones.
A Local Approach to Certain Classes of Finite Groups
2003
Abstract We develop several local approaches for the three classes of finite groups: T-groups (normality is a transitive relation) and PT-groups (permutability is a transitive relation) and PST-groups (S-permutability is a transitive relation). Here a subgroup of a finite group G is S-permutable if it permutes with all the Sylow subgroup of G.
On periodic radical groups in which permutability is a transitive relation
2007
Abstract A group G is said to be a PT - group if permutability is a transitive relation in the set of all subgroups of G . Our purpose in this paper is to study PT -groups in the class of periodic radical groups satisfying min- p for all primes p .
Imprimitive groups highly transitive on blocks
2004
We classify imprimitive groups acting highly transitively on blocks and satisfying conditions common in geometry. They can be realized as suitable subgroups of twisted wreath products.
The Role of Prominence Information in the Real-Time Comprehension of Transitive Constructions: A Cross-Linguistic Approach
2008
Approaches to language processing have traditionally been formulated with reference to general cognitive concepts (e.g. working memory limitations) or have based their representational assumptions on concepts from generative linguistic theory (e.g. structure determines interpretation). Thus, many well-established generalisations about language that have emerged from cross-linguistic/typological research have not as yet had a major influence in shaping ideas about online processing. Here, we examine the viability of using typologically motivated concepts to account for phenomena in online language comprehension. In particular, we focus on the comprehension of simple transitive sentences (i.e…
A Learning-Automata Based Solution for Non-equal Partitioning: Partitions with Common GCD Sizes
2021
The Object Migration Automata (OMA) has been used as a powerful tool to resolve real-life partitioning problems in random Environments. The virgin OMA has also been enhanced by incorporating the latest strategies in Learning Automata (LA), namely the Pursuit and Transitivity phenomena. However, the single major handicap that it possesses is the fact that the number of objects in each partition must be equal. Obviously, one does not always encounter problems with equally-sized groups (When the true underlying problem has non-equally-sized groups, the OMA reports the best equally-sized solution as the recommended partition.). This paper is the pioneering attempt to relax this constraint. It p…
'The sisters did her every imaginable injury': Power and violence in Cinderella
2012
The main aim of this article is to discuss the results achieved after investigating the presence of violence in the Grimm brothers’ <em>Cinderella</em> with the intention of finding out what kind of processes predominate in this tale and whether they can be related to violent actions. The analysis involved firstly, a study of the frequency and concordances of some words belonging to the semantic field ‘violence’, surveying in detail the context in which they appear and secondly, the analysis of transitivity processes. The method proved to be a good strategy to check whether each character’s identity and social position (power) were somehow related to the infliction of violence w…