Search

Abstract: We show that for a monotone dendrite map , any ω-limit set is either finite or a minimal Cantor set. We also prove that where , , and denote the sets of periodic points, uniformly recurrent points, recurrent points and the union of all ω-limit sets respectively. Moreover, we prove that the following properties are equivalent: (i) , (ii) and (iii) . [Copyright &y& Elsevier]

The article focuses on a study aimed at disclosing the neural correlates of planning and executing tool use pantomimes as well as examines the response of the brain to pantomiming the use of unfamiliar tools. It cites the noticeable similarity in brain activation during these pantomimes for both tools. It offers an analysis of the pattern of activation linked with the planning and execution of familiar tools compared to that of goal-directed and transitive but nontool gestures. Activation in many other frontal regions is also identified.

The development of abstract schemas and productive rules in language is affected by both token and type frequencies. High token frequencies and surface similarities help to discover formal and functional commonalities between utterances and categorize them as instances of the same schema. High type frequencies and diversity help to develop slots in these schemas, which allow the production and comprehension of novel utterances. In the current study we looked at both token and type frequencies in two related constructions in German child-directed speech: simple transitive and complement-clause constructions. Both constructions contain high frequency verbs, which potentially support the development of verb-specific schemas. However, only the frequent verbs in the transitive constructions occur with a variety of subject types, which also supports the development of a slot in the subject position. We then used an elicited production task to compare 4- and 5-year-old German-speaking children's productivity with simple transitive constructions and complement-clause constructions. The children were prompted to change the subjects of high and low frequency simple transitive verbs, such as essen ''eat'' and naschen ''nibble'', mental-state complement-taking verbs, such as denken ''think'' and vermuten ''presume'', and communication complement-taking verbs, such as sagen ''say'' and berichten ''report''. In accordance with earlier findings, children had less difficulty producing new utterances with high frequency transitive verbs than with low frequency transitive verbs. For the other verb classes, however, we found either reverse frequency effects or no frequency effects. For these verb classes, children's productivity can be determined by diversity rather than simple token frequency. We discuss how token frequency interacts with diversity, discourse function, semantic complexity, and syntactic complexity. [ABSTRACT FROM AUTHOR]

Whilst certain verbs may appear in both the intransitive inchoative and the transitive causative constructions ( The ball rolled/The man rolled the ball), others may appear in only the former ( The man laughed/*The joke laughed the man). Some accounts argue that children acquire these restrictions using only (or mainly) statistical learning mechanisms such as entrenchment and pre-emption. Others have argued that verb semantics are also important. To test these competing accounts, adults (Experiment 1) and children aged 5--6 and 9--10 (Experiment 2) were taught novel verbs designed to be construed -- on the basis of their semantics -- as either intransitive-only or alternating. In support of the latter claim, participants' grammaticality judgments revealed that even the youngest group respected these semantic constraints. Frequency (entrenchment) effects were observed for familiar, but not novel, verbs (Experiment 1). We interpret these findings in the light of a new theoretical account designed to yield effects of both verb semantics and entrenchment/pre-emption. [ABSTRACT FROM AUTHOR]

This article examines changes in the valency marking in the history of English. I start with a discussion of the typological literature on measuring basic valency and point out the problems with such an approach. A sample of 18 Old English verbs provides no basic valency pattern for Old English; this makes Old English different from the other Germanic languages. I then review the evidence, presented in, for instance, Visser (1963), that there is an increase in transitivity in the history of English and argue that this increase is partly due to verbs ceasing to mark Theme-preserving alternations, between anticausative and causative. I also examine Theme-changing alternations, between intransitive and transitive, and argue that, due to the changes in aspect marking, objects become licensed by a light verb, v. I conclude by suggesting a syntactic structure that accounts for the various stages of English and argue that the main changes are due to an increase in morphological intransparency. [ABSTRACT FROM AUTHOR]

In the paper we present a construction of a one-sided cellular automaton over four elementary alphabet with radius 1 and prove that it is chaotic in the Devaney sense, has a positive topological entropy equal to log 2 > 0 and it is not E-chaotic and not injective. [ABSTRACT FROM AUTHOR]

Many of the verbs that young children learn early have been characterized as ‘light.’ However, there is no agreed upon definition of ‘lightness’ and no useable metric that could be applied to a wide array of verbs. This article provides evidence for one metric by which the ‘lightness’ of early-learned verbs might be measured: the number of objects with which they are associated (in adult judgment) or co-occur (in speech to and by children). The results suggest that early-learned light verbs and heavy verbs differ in the breadth of the objects they are associated with: light verbs have weak associations with specific objects, whereas heavy verbs are strongly associated with specific objects. However, there is an indication that verbs have narrower associations to objects in speech to children. The methodological usefulness of this metric is discussed as are the implications of the patterns of distributions for children’s learning of common verbs. [ABSTRACT FROM AUTHOR]

Copyright of Revista de Administração FACES Journal is the property of Revista de Administracao FACES Journal and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Background: Although the efficacy of treatments for spoken verb and sentence production deficits in aphasia has been documented widely, less is known about interventions for written verb and written sentence production deficits. Aims: This study documents a treatment aiming to improve production of (a) written subject-verb sentences (involving intransitive verbs) and (b) written subject-verb-object sentences (involving transitive verbs). Methods & Procedures: The participant, a 63-year-old female aphasic speaker, had a marked language comprehension deficit, apraxia of speech, relatively good spelling abilities, and no hemiplegia. The treatment involved intransitive verbs producing subject-verb active sentences and transitive verbs producing subject-verb-object active non-reversible sentences. The treatment was undertaken in the context of current UK clinical practice. Outcomes & Results: Statistical improvements were noted for the trained sets of verbs and sentences. Other improvements were also noted in LW's ability to retrieve some non-treated verbs and construct written sentences. Treatment did not generalise to sentence comprehension and letter spelling to dictation. Conclusions: Our participant's ability to write verbs and sentences improved as a result of the treatment. [ABSTRACT FROM AUTHOR]

Cognitive changes have been reported during healthy ageing, but there have been no investigations of older people's knowledge of transitive and intransitive forelimb postures and movements. A total of 18 healthy elderly participants in two age groups, old (66-76 years) and older (77-88 years), all of whom performed normally on the Mini-Mental Status Examination (MMSE) and Boston Naming Test (BNT), performed a transitive and intransitive gesture postural discrimination test. Whereas there were no significant differences between the two groups in education or performance on the MMSE and BNT, the older group performed significantly worse on both transitive and intransitive posture recognition with more errors in the recognition of transitive than in the recognition of intransitive postures. However, the recognition of both transitive and intransitive declined with age at a similar rate. These results support the hypothesis that, with ageing, there is a decrement in the brain systems important in the recognition of transitive and intransitive posture. [ABSTRACT FROM AUTHOR]

In the present paper we study the concept of Pareto optimality alternatives in finite set of alternatives at decision making in a group with finitely many individuals. It is considered the preference relations of the individuals and three versions of the Pareto optimality alternatives - weak, strong and full. It is proved that the sets of the strong and full optimality alternative are nonempty. [ABSTRACT FROM AUTHOR]

Abstract: It is shown that if X is a convex-transitive Banach space and , then and are convex-transitive. Here is the closed linear span of the simple functions in the Bochner space . If H is an infinite-dimensional Hilbert space and is convex-transitive, then is convex-transitive. Some new fairly concrete examples of convex-transitive spaces are provided. [Copyright &y& Elsevier]

Classifying objects needs permutation groups in mathematics. Similarly, consideration should be also done for actions of multi-groups, i.e., permutation multi-groups. In this paper, we consider the action of multi-groups on a finite multi-set, its orbits, multi-transitive, primitive, etc. By choosing an element p in or not in a permutation group Γ, define a new operation Op enables us to finding permutation multi-groups. Considering such permutation multi-groups, some interesting results in finite permutation groups are generalized to permutation multi-groups. [ABSTRACT FROM AUTHOR]

A group G is said to be a T-group (resp. PT-group, PST-group), if normality (resp. permutability, S-permutability) is a transitive relation. In this paper, we get the characterization of finite solvable PST-groups. We also give a new characterization of finite solvable PT-groups. [ABSTRACT FROM AUTHOR]

In the evolution of languages, some changes may lack functional explanations of their own and instead be mechanically triggered by changes occurring in other areas of the grammar. This paper illustrates the necessity to consider indirect explanations of typological regularities on the basis of examples taken from alignment typology, namely: a) in predominantly ergative languages, intransitive constructions with accusative alignment may develop as a result of the coalescence of light verb compounds; b) in predominantly ergative languages as well as in predominantly accusative languages, constructions deviating from the dominant alignment type may originate from elliptical variants of transitive constructions; and c) alignment changes (both from accusative to ergative, and from ergative to accusative) may occur as a consequence of the grammaticalization of TAM periphrases. [ABSTRACT FROM AUTHOR]

Abstract: English and German children aged 2 years 4 months and 4 years heard both novel and familiar verbs in sentences whose form was grammatical, but which mismatched the event they were watching (e.g., ‘The frog is pushing the lion’, when the lion was actually the ‘agent’ or ‘doer’ of the pushing). These verbs were then elicited in new sentences. All children mostly corrected the familiar verb (i.e., they used the agent as the grammatical subject), but there were cross-linguistic differences among the two-year-olds concerning the novel verb. When English 2-year-olds used the novel verb they mostly corrected. However, their most frequent response was to avoid using the novel verb altogether. German 2-year-olds corrected the novel verb significantly more often than their English counterparts, demonstrating more robust verb-general representations of agent- and patient-marking. These findings provide support for a ‘graded representations’ view of development, which proposes that grammatical representations may be simultaneously abstract but ‘weak’. [Copyright &y& Elsevier]

Let G be a finite permutation group on a set Ω with no fixed points in Ω; let m and k be integers with 0 < m < k. For a finite subset Γ of Ω, the movement of Γ is defined as move(Γ) = max/g∈G |Γg -- Γ|. Suppose further that G is not a 2-group and p is the least odd prime dividing |G| and move|Γ| ≥ m for all k-element subsets Γ of Ω. Then either |Ω| ≥ k + m or k ≥ 3m -- p -- 1, |Ω| ≥ 4m -- p. Moreover when |Ω| > k + m, then move(Γ) ≥ m for every subset Γ of Ω. These results generalize some earlier results on the Separation Theorem and permutation groups with bounded movement by Praeger. [ABSTRACT FROM AUTHOR]

This report is essentially an upgrade of the results of Audu (see [1] and [2]) on some finite permutation groups. It consists of the basic procedure for computing wreath product of groups. We also discussed the conditions under which the wreath products of permutation groups are faithful, transitive and primitive. Further, the centre of the stabilizer and the centre of wreath products was investigated. and finally, an illustration was supplied to support our findings. [ABSTRACT FROM AUTHOR]

The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800’s. This problem translates combinatorially into factoring a permutation of specified cycle type, with certain conditions on the cycle types of the factors, such as minimality and transitivity. Goulden and Jackson have given a proof for the number of minimal, transitive factorizations of a permutation into transpositions. This proof involves a partial differential equation for the generating series, called the Join-Cut equation. Recently, Bousquet-Mélou and Schaeffer have found the number of minimal, transitive factorizations of a permutation into arbitrary unspecified factors. This was proved by a purely combinatorial argument, based on a direct bijection between factorizations and certain objects called m-Eulerian trees. In this paper, we give a simple partial differential equation for Bousquet-Mélou and Schaeffer’s generating series, and for Goulden and Jackson’s generating series, as well as a new proof of the result by Bousquet-Mélou and Schaeffer. We apply algebraic methods based on Lagrange’s theorem, and combinatorial methods based on a new use of Bousquet-Mélou and Schaeffer’s m-Eulerian trees. [ABSTRACT FROM AUTHOR]

Abstract: For an oriented graph G with n vertices, let denote the minimum number of transitive subtournaments that decompose G. We prove several results on . In particular, if G is a tournament then and there are tournaments for which . For general G we prove that and this is tight. Some related parameters are also considered. [Copyright &y& Elsevier]

The present article analyzes the copular realization of GET in relation to its lexical transitive, intransitive motion and passive realizations. The change-of-state construction was previously defined by the author as X CHANGES TO Ystate. If COME, GO, TURN… copular realizations were proved to be constrained (Bonnefille, 2001 and 2004; Bonnefille & McMichael, 2001) by X MOVES TO Ylocation (Goldberg, 1995), the search for real-world constraints at work in this construction when used with GET leads us to the conclusion that the copular realization of GET is constrained by the blending of two constructions, i.e. X MOVES TO Ylocation and either X EXPERIENCES Y (with the meaning “receiving an object”) or X ACTS ON Y (with the meaning “obtaining/possessing an object”), depending on the degree of agenthood of X. [ABSTRACT FROM AUTHOR]

This paper introduces a new idea for presenting certain transitive extentions of a given transitive permutation group. A group is given as homomorphic image of an infinite semi-direct product of free products of n copies of cyclic groups of order 2 by a group of automorphisms. [ABSTRACT FROM AUTHOR]

Abstract: We prove that a tournament with n vertices has more than edge-disjoint transitive triples. We also prove some results on the existence of large packings of k-vertex transitive tournaments in an n-vertex tournament. Our proofs combine probabilistic arguments and some powerful packing results due to Wilson and to Frankl and Rödl. [Copyright &y& Elsevier]

A family F of subspaces of a finite-dimensional Hilbert space H is transitive if every operator leaving every element of F invariant is scalar. If dim H&ges;3, the minimum cardinality of a transitive family is 4. All 4-element transitive families of subspaces of 3-dimensional space are described. For spaces of dimension greater than 3, necessary, but not sufficient, conditions satisfied by every 4-element transitive family are obtained, showing that (i) either every pair of subspaces intersects in (0) or every pair spans H (but not both), (ii) at least three of the subspaces must have the same dimension (either [dimH/2] or [dimH/2]+1), the dimension of the remaining subspace differing from this common dimension by at most 1. [Copyright &y& Elsevier]

A &ast;-compactification of a T1 quasi-uniform space (X,U) is a compact T1 quasi-uniform space (Y,V) that has a T(V&ast;)-dense subspace quasi-isomorphic to (X,U), where V&ast; denotes the coarsest uniformity finer than V.With the help of the notion of T1 &ast;-half completion of a quasi-uniform space, which is introduced and studied here, we show that if a T1 quasi-uniform space (X,U) has a &ast;-compactification, then it is unique up to quasi-isomorphism. We identify the &ast;-compactification of (X,U) with the subspace of its bicompletion (X,U) consisting of all points which are closed in (X,T(U)) and prove that (X,U) is &ast;-compactifiable if and only if it is point symmetric and (X,U) is compact. Finally, we discuss some properties of locally fitting T0 quasi-uniform spaces, a large class of quasi-uniform spaces whose bicompletion is T1, and, hence, they are T1 &ast;-half completable. [Copyright &y& Elsevier]

Our aim in this note is to present a transitive graph that we conjecture is not quasi-isometric to any Cayley graph. No such graph is currently known. Our graph arises both as an abstract limit in a suitable space of graphs and in a concrete way as a subset of a product of trees. [ABSTRACT FROM AUTHOR]

Agreement in Itelmen is represented by means of both prefixes and suffixes. While the prefixes reference subjects (of both transitive and intransitive verbs), the suffixal agreement morphemes on a given verb may reference the subject, the object, or an oblique argument, or some combination of these. We propose that the proper characterization of the factors that determine which arguments control suffixal agreement involves a division of labour between morphology and a notion of discourse prominence/salience. In essence, we propose that the suffixal agreement morpheme is an object agreement marker, but the features of the subject are reflected in this position when the object lacks the relevant features (for example, we treat third person as the lack of a person feature), or is absent altogether (thus, intransitive verbs agree twice with their subjects). When a verb occurs with an oblique as well as a direct object, discourse salience will determine which of these non-subject arguments will control object agreement. In addition to providing a description of a complex range of facts from Itelmen, the paper sheds light on the nature of “multiple exponence” and the role of “competition” among affixes for a particular position in the verbal agreement system.

On taking a non-trivial and semi-transitive bi-relation constituted by two (hard and soft) binary relations, we report a (i) p -continuity assumption that guarantees the completeness and transitivity of its soft part, and a (ii) characterization of a connected topological space in terms of its attendant properties on the space. Our work generalizes antecedent results in applied mathematics, all following Eilenberg [14] , and now framed in the context of a parametrized-topological space. This re-framing is directly inspired by the continuity assumption in Wold [50] and the mixture-space structure proposed in Herstein and Milnor [27] , and the unifying synthesis of these pioneering but neglected papers that it affords may have independent interest. [ABSTRACT FROM AUTHOR]

A very simple, short and self-contained proof is presented of Burnside''s Theorem that every proper algebra of matrices over an algebraically closed field has a non-trivial invariant subspace. [Copyright &y& Elsevier]

Transitivity is a key element in a chaotic dynamical system. In this paper, we present some relations between transitivity, stronger and alternative notions of it on compact and dendrite spaces. The relation between Auslander and Yorke chaos and Devaney chaos on dendrites is also discussed. Moreover, we prove that Devaney chaos implies strong dense periodicity on dendrites while the converse is not true. [ABSTRACT FROM AUTHOR]