Search results for "transitive"
showing 10 items of 98 documents
Using tools effectively despite defective hand posture: A single-case study.
2019
Apraxia, a cognitive disorder of motor control, can severely impair transitive actions (object-related) and may lead to action errors (e.g., rubbing a hammer on a nail instead of pounding it) and hand posture errors (e.g., grasping a tool in a wrong way). Here, we report a rare observation of a left-handed patient, left-lateralized for language, who developed a severe apraxia following a right brain lesion. Interestingly the patient showed a significant number of hand posture errors, while she perfectly demonstrated the actual use of tools. This case stressed the predictions made by the current theories of tool use. According to the manipulation-based approach, the hand posture errors shoul…
Solution of an initial-value problem for parabolic equations via monotone operator methods
2014
We study a general initial-value problem for parabolic equations in Banach spaces, by using a monotone operator method. We provide sufficient conditions for the existence of solution to such problem.
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).
A class of imprimitive groups
2010
We classify imprimitive groups inducing the alternating group A4 on the set of blocks, with the inertia subgroup satisfying some very natural geometrical conditions which force the group to operate linearly.
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…
Incomplete vertices in the prime graph on conjugacy class sizes of finite groups
2013
Abstract Given a finite group G, consider the prime graph built on the set of conjugacy class sizes of G. Denoting by π 0 the set of vertices of this graph that are not adjacent to at least one other vertex, we show that the Hall π 0 -subgroups of G (which do exist) are metabelian.
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.
Optical Routing of Uniform Instances in Cayley Graphs
2001
Abstract Abstract We consider the problem of routing uniform communication instances in Cayley graphs. Such instances consist of all pairs of nodes whose distance is included in a specified set U. We give bounds on the load induced by these instances on the links and for the wavelength assignment problem as well. For some classes of Cayley graphs that have special symmetry property (rotational graphs), we are able to construct routings for uniform instances such that the load is the same for each link of the graph.
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.