Search results for "PROPERTY"

showing 10 items of 955 documents

The Argument Dependency Model

2015

This chapter summarizes the architecture of the extended Argument Dependency Model (eADM), a model of language comprehension that aspires toward neurobiological plausibility. It combines design principles from neurobiology with insights on cross-linguistic diversity. Like other current models, the eADM posits that auditory language processing proceeds along two distinct streams in the brain emanating from auditory cortex: the antero-ventral and postero-dorsal streams. Both streams are organized hierarchically and information processing takes place in a cascaded fashion. Each stream has functionally unified computational properties congruent with its role in primate audition. While the dorsa…

Cognitive sciencehierarchical processingDependency (UML)business.industryComputer scienceInformation processingcross-linguistic diversityAuditory cortexcomputer.software_genreNoncommutative geometryComprehensionRange (mathematics)dorsal streamventral streamArtificial intelligenceArgument (linguistics)businesscomputerCommutative propertyNatural language processinglanguage comprehension
researchProduct

Weak associativity and restricted rotation

2009

A restricted rotation induced by a weak associative law is introduced. The corresponding equivalence relation is identical to the Glivenko congruence on Tamari lattices, i.e. lattices of binary trees endowed by the well-known rotation operation.

CombinatoricsBinary treeLattice (order)Signal ProcessingEquivalence relationAssociative propertyComputer Science ApplicationsInformation SystemsTheoretical Computer ScienceMathematicsInformation Processing Letters
researchProduct

Two Questions of L. A. Shemetkov on Critical Groups

1996

Throughout the paper we consider only finite groups. Let X be a class of groups. A group G is called s-critical for X , or simply X-critical, if G is not in X but all proper subgroups of G are in X. w Ž .x Ž . Following Doerk and Hawkes 3, VII, 6.1 , we denote Crit X the class s of all X-critical groups. Knowledge of the structure of the groups in Ž . Crit X for a class of groups X can often help one to obtain detailed s information for the structure of the groups belonging to X. Ž w Ž .x. O. J. Schmidt see 5, III, 5.2 studied the N-critical groups, where N is the formation of the nilpotent groups. These groups are also called w x Schmidt groups. In 2 , answering to a question posed by Shem…

CombinatoricsClass (set theory)NilpotentProperty (philosophy)Algebra and Number TheoryGroup (mathematics)Structure (category theory)Cyclic groupMathematicsUniverse (mathematics)Journal of Algebra
researchProduct

Sigma-fragmentability and the property SLD in C(K) spaces

2009

Abstract We characterize two topological properties in Banach spaces of type C ( K ) , namely, being σ-fragmented by the norm metric and having a countable cover by sets of small local norm-diameter (briefly, the property norm-SLD). We apply our results to deduce that C p ( K ) is σ-fragmented by the norm metric when K belongs to a certain class of Rosenthal compacta as well as to characterize the property norm-SLD in C p ( K ) in case K is scattered.

CombinatoricsDiscrete mathematicsClass (set theory)Property (philosophy)Cover (topology)Metric (mathematics)Banach spaceSigmaCountable setGeometry and TopologyMathematicsTopology and its Applications
researchProduct

On extremal intersection numbers of a block design

1982

K.N. Majumdar has shown that for a 2-(v, k, @l) design D there are three numbers @a, @t, and @S such that each intersection number of D is not greater than @S and not less than max{@a, @t}. In this paper we investigate designs having one of these 'extremal' intersection numbers. Quasisymmetric designs with at least one extremal intersection number are characterized. Furthermore, we show that a smooth design D having the intersection number @S or @a>0 is isomorphic to the system of points and hyperplanes of a finite projective space. Using this theorem, we can characterize all smooth strongly resolvable designs.

CombinatoricsDiscrete mathematicsIntersectionHyperplaneDiscrete Mathematics and CombinatoricsProjective spaceIntersection numberFinite intersection propertyMajumdarTheoretical Computer ScienceMathematicsBlock designDiscrete Mathematics
researchProduct

Degree sequences of digraphs with highly irregular property

1998

CombinatoricsDiscrete mathematicsProperty (philosophy)Degree (graph theory)Applied MathematicsDiscrete Mathematics and CombinatoricsDigraphMathematicsDiscussiones Mathematicae Graph Theory
researchProduct

On the structure of the set of equivalent norms on ℓ1 with the fixed point property

2012

Abstract Let A be the set of all equivalent norms on l 1 which satisfy the FPP. We prove that A contains rays. In fact, every renorming in l 1 which verifies condition (⁎) in Theorem 2.1 is the starting point of a (closed or open) ray composed by equivalent norms on l 1 with the FPP. The standard norm ‖ ⋅ ‖ 1 or P.K. Linʼs norm defined in Lin (2008) [12] are examples of such norms. Moreover, we study some topological properties of the set A with respect to some equivalent metrics defined on the set of all norms on l 1 equivalent to ‖ ⋅ ‖ 1 .

CombinatoricsDiscrete mathematicsRenorming theoryApplied MathematicsNorm (mathematics)Fixed-point theoremNonexpansive mappingsFixed point theoryEquivalence of metricsFixed-point propertyStabilityAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Hypergraph functor and attachment

2010

Using an arbitrary variety of algebras, the paper introduces a fuzzified version of the notion of attachment in a complete lattice of Guido, to provide a common framework for the concept of hypergraph functor considered by different authors in the literature. The new notion also gives rise to a category of variable-basis topological spaces which is a proper supercategory of the respective category of Rodabaugh.

CombinatoricsFiber functorClosed categoryFunctorArtificial IntelligenceLogicMathematics::Category TheoryConcrete categoryUniversal propertyCone (category theory)Variety (universal algebra)Topological spaceMathematicsFuzzy Sets and Systems
researchProduct

On formations of finite groups with the generalised Wielandt property for residuals

2014

Abstract A formation F of finite groups has the generalised Wielandt property for residuals, or F is a GWP-formation, if the F -residual of a group generated by two F -subnormal subgroups is the subgroup generated by their F -residuals. We prove that every GWP-formation is saturated. This is one of the crucial steps in the hunt for a solution of the classification problem.

CombinatoricsFinite groupAlgebra and Number TheoryProperty (philosophy)Group (mathematics)ResidualMathematicsJournal of Algebra
researchProduct

On complements of 𝔉-residuals of finite groups

2016

ABSTRACTA formation 𝔉 of finite groups has the generalized Wielandt property for residuals, or 𝔉 is a GWP-formation, if the 𝔉-residual of a group generated by two 𝔉-subnormal subgroups is the subgroup generated by their 𝔉-residuals. The main aim of the paper is to determine some sufficient conditions for a finite group to split over its 𝔉-residual.

CombinatoricsFinite groupAlgebra and Number TheoryProperty (programming)Group (mathematics)010102 general mathematics0103 physical sciences010307 mathematical physics0101 mathematics01 natural sciencesMathematicsCommunications in Algebra
researchProduct