scholarly journals Admissible sequences and the preprojective component of a quiver

2005 ◽  
Vol 192 (2) ◽  
pp. 376-402 ◽  
Author(s):  
Mark Kleiner ◽  
Helene R. Tyler
Keyword(s):  
Preprojective Component ◽  
Admissible Sequences

Identification and Transformation of Terminal Morphemes in Medical English

1969 ◽  
Vol 8 (02) ◽  
pp. 84-90 ◽  
Author(s):  
A. W. Pratt ◽  
M. Pacak
Keyword(s):  
Word Form ◽  
Subsequent Transformation ◽  
Part Of Speech ◽  
Morphological Segmentation ◽  
Medical English ◽  
Nominal Form ◽  
Admissible Path ◽  
Near Future ◽  
The Given ◽  
Admissible Sequences

The system for the identification and subsequent transformation of terminal morphemes in medical English is a part of the information system for processing pathology data which was developed at the National Institutes of Health.The recognition and transformation of terminal morphemes is restricted to classes of adjectivals including the -ING and -ED forms, nominals and homographic adjective/noun forms.The adjective-to-noun and noun-to-noun transforms consist basically of a set of substitutions of adjectival and certain nominal suffixes by a set of suffixes which indicate the corresponding nominal form(s).The adjectival/nominal suffix has a polymorphosyntactic transformational function if it has the property of being transformed into more than one nominalizing suffix (e.g., the adjectival suffix -IC can be substituted by a set of nominalizing suffixes -Ø, -A, -E, -Y, -IS, -IA, -ICS): the adjectival suffix has a monomorphosyntactic transformational property if there is only one admissible transform (e.g., -CIC → -X).The morphological segmentation and the subsequent transformations are based on the following principles:a. The word form is segmented according to the principle of »double consonant cut,« i.e., terminal characters following the last set of double consonants are analyzed and treated as a potential suffix. For practical purposes only such terminal suffixes of a maximum length of four have been analyzed.b. The principle that the largest segment of a word form common to both adjective and noun or to both noun stems is retained as a word base for transformational operations, and the non-identical segment is considered to be a »suffix.«The backward right-to-left character search is initiated by the identification of the terminal grapheme of the given word form and is extended to certain admissible sequences of immediately preceding graphemes.The nodes which represent fixed sequences of graphemes are labeled according to their recognition and/or transformation properties.The tree nodes are divided into two groups:a. productive or activatedb. non-productive or non-activatedThe productive (activated) nodes are sequences of sets of graphemes which possess certain properties, such as the indication about part-of-speech class membership, the transformation properties, or both. The non-productive (non-activated) nodes have the function of connectors, i.e., they specify the admissible path to the productive nodes.The computer program for the identification and transformation of the terminal morphemes is open-ended and is already operational. It will be extended to other sub-fields of medicine in the near future.

scholarly journals Admissible sequences of positive operators

2018 ◽  
Vol 371 (5) ◽  
pp. 3721-3742 ◽  
Author(s):  
Victor Kaftal ◽  
David R. Larson
Keyword(s):  
Positive Operators ◽  
Admissible Sequences

Minimal algebras of infinite representation type with preprojective component

1983 ◽  
Vol 42 (2-3) ◽  
pp. 221-243 ◽  
Author(s):  
Dieter Happel ◽  
Dieter Vossieck
Keyword(s):  
Representation Type ◽  
Preprojective Component

scholarly journals Quasitilted algebras admit a preprojective component

1997 ◽  
Vol 125 (5) ◽  
pp. 1283-1291 ◽  
Author(s):  
Flavio U. Coelho ◽  
Dieter Happel
Keyword(s):  
Preprojective Component

Identification and Transformation of Terminal Morphemes in Medical Englishi)

1969 ◽  
Vol 8 (02) ◽  
pp. 84-90
Author(s):  
A. W. Pratt ◽  
M. Pacak
Keyword(s):  
National Institutes Of Health ◽  
Word Form ◽  
Subsequent Transformation ◽  
Part Of Speech ◽  
Morphological Segmentation ◽  
Nominal Form ◽  
Admissible Path ◽  
Near Future ◽  
The Given ◽  
Admissible Sequences

The system for the identification and subsequent transformation of terminal morphemes in medical English is a part of the information system for processing pathology data which was developed at the National Institutes of Health.The recognition and transformation of terminal morphemes is restricted to classes of adjectivals including the -ING and -ED forms, nominals and homographic adjective/noun forms.The adjective-to-noun and noun-to-noun transforms consist basically of a set of substitutions of adjectival and certain nominal suffixes by a set of suffixes which indicate the corresponding nominal form(s).The adjectival/nominal suffix has a polymorphosyntactic transformational function if it has the property of being transformed into more than one nominalizing suffix (e.g., the adjectival suffix -IC can be substituted by a set of nominalizing suffixes -0, -A, -E, -Y, -IS, -IA, -ICS): the adjectival suffix has a monomorphosyntactic transformational property if there is only one admissible transform (e.g., -CIC-X).The morphological segmentation and the subsequent transformations are based on the following principles:a. The word form is segmented according to the principle of »double consonant cut,« i.e., terminal characters following the last set of double consonants are analyzed and treated as a potential suffix. For practical purposes only such terminal suffixes of a maximum length of four have been analyzed.b. The principle that the largest segment of a word form common to both, adjective and noun or to both noun stems is retained as a word base for transformational operations, and the non-iden, tical segment is considered to be a »suffix.«The backward right-to-left character search is initiated by the identification of the terminal grapheme of the given word form and is extended to certain admissible sequences of immediately preceding graphemes.The nodes which represent fixed sequences of graphemes are labeled according to their recognition and/or transformation properties.The tree nodes are divided into two groups:a. productive or activatedb. non-productive or non-activatedThe productive (activated) nodes are sequences of sets of graphemes which possess certain properties, such as the indication about part-of-speech class membership, the transformation properties, or both. The non-productive (non-activated) nodes have the function of connectors, i.e., they specify the admissible path to the productive nodes.The computer program for the identification and transformation of the terminal morphemes is openended and is already operational. It will be extended to other sub-fields of medicine in the near future.

Admissible Sequences for Twisted Involutions in Weyl Groups

2011 ◽  
Vol 54 (4) ◽  
pp. 663-675 ◽  
Author(s):  
Ruth Haas ◽  
Aloysius G. Helminck
Keyword(s):  
Weyl Group ◽  
Root System ◽  
Weyl Groups ◽  
One To One ◽  
Admissible Sequences

AbstractLetW be a Weyl group, Σ a set of simple reflections inW related to a basis Δ for the root system Φ associated with W and θ an involution such that θ(Δ) = Δ. We show that the set of θ- twisted involutions in W, = {w ∈ W | θ(w) = w–1} is in one to one correspondence with the set of regular involutions . The elements of are characterized by sequences in Σ which induce an ordering called the Richardson–Springer Poset. In particular, for Φ irreducible, the ascending Richardson–Springer Poset of , for nontrivial θ is identical to the descending Richardson–Springer Poset of .

scholarly journals 4-uniform permutations with null nonlinearity

2020 ◽  
Vol 12 (6) ◽  
pp. 1133-1141
Author(s):  
Christof Beierle ◽  
Gregor Leander
Keyword(s):  
Linear Function ◽  
Interesting Property ◽  
Differential Uniformity ◽  
Admissible Sequences

Abstract We consider n-bit permutations with differential uniformity of 4 and null nonlinearity. We first show that the inverses of Gold functions have the interesting property that one component can be replaced by a linear function such that it still remains a permutation. This directly yields a construction of 4-uniform permutations with trivial nonlinearity in odd dimension. We further show their existence for all n = 3 and n ≥ 5 based on a construction in Alsalami (Cryptogr. Commun. 10(4): 611–628, 2018). In this context, we also show that 4-uniform 2-1 functions obtained from admissible sequences, as defined by Idrisova in (Cryptogr. Commun. 11(1): 21–39, 2019), exist in every dimension n = 3 and n ≥ 5. Such functions fulfill some necessary properties for being subfunctions of APN permutations. Finally, we use the 4-uniform permutations with null nonlinearity to construct some 4-uniform 2-1 functions from $\mathbb {F}_{2}^{n}$ F 2 n to $\mathbb {F}_{2}^{n-1}$ F 2 n − 1 which are not obtained from admissible sequences. This disproves a conjecture raised by Idrisova.

scholarly journals ON THE GEOMETRY OF ORBIT CLOSURES FOR REPRESENTATION-INFINITE ALGEBRAS

2012 ◽  
Vol 54 (3) ◽  
pp. 629-636 ◽  
Author(s):  
CALIN CHINDRIS
Keyword(s):  
Orbit Closure ◽  
Kronecker Algebra ◽  
Orbit Closures ◽  
Preprojective Component ◽  
Infinite Algebras

AbstractFor the Kronecker algebra, Zwara found in [14] an example of a module whose orbit closure is neither unibranch nor Cohen-Macaulay. In this paper, we explain how to extend this example to all representation-infinite algebras with a preprojective component.

scholarly journals Dense admissible sequences

2001 ◽  
Vol 70 (236) ◽  
pp. 1713-1719 ◽  
Author(s):  
David A. Clark ◽  
Norman C. Jarvis
Keyword(s):  
Admissible Sequences

Norm-attaining operators into Lorentz sequence spaces

2009 ◽  
Vol 139 (2) ◽  
pp. 225-235 ◽  
Author(s):  
María D. Acosta
Keyword(s):  
Orlicz Space ◽  
Sequence Space ◽  
Orlicz Function ◽  
Linear Operators ◽  
Sequence Spaces ◽  
Norm Attaining Operators ◽  
Norm Attaining ◽  
Admissible Sequences

We prove that the Lorentz sequence spaces do not have the property B of Lindenstrauss. In fact, for any admissible sequences w, v ∈ c0 \ l1, the set of norm-attaining operators from the Orlicz space hϕ(w) (ϕ is a certain Orlicz function) into d(v, 1) is not dense in the corresponding space of operators. We also characterize the spaces such that the subset of norm-attaining operators from the Marcinkiewicz sequence space into its dual is dense in the space of all bounded and linear operators between them.

Sign in / Sign up

Export Citation Format

Share Document