127 research outputs found
Conspectus Specierum Nicotianae
No full textCONSPECTUS SPECIERUM NICOTIANAE
Conspectus Specierum Nicotianae ([1])
Title page ([1])
Introduction ([3])
1) Der gemeine Bauerntaback (Nicotiana Rustica, Linn.) (10)
2) Der deutsche Bauerntaback (Nicotiana Rustica Ovalis Ag.) (10)
3) Der Soldaten-Taback (Nicotiana Glutinosa Linn.) (11)
4) Der gemeine unächte virginische Taback (N. Tabacum Linn.) (11)
5) Der Gross-Taback (Nicotiana Macrophylla, Willd.) (11)
6) Stiel-Taback (N. Petiolata, Ag.) (12)
7) Der Strauch-Taback (N. Fruticosa, Willd.) (13)
8) Der klare Strauchtaback (N. Fruticosa eripuscula, Ag.) (13)
9) Der weissgeblümte (N. Angustifolia, Ag.) (14)
10) [...] Virginischer Taback (N. Virginica, Ag.) (14)
11) Der brasilianische Taback (Nicotiana Decurrens, Ag.) (14)
Nicotinana. Conspectus Specierum (16)
I. Tribus N. Rusticæ. (16)
II. Tribus N. Glutinosæ. (17)
III. Tribus N. Tabaci. (17)
IV. Tribus N. Paniculatæ. (20)
V. Tribus N. Quadrivalvis. (22)
VI. Tribus N. Nyctaginifloræ. (22)
Binding ( -
Sulfate de Quinidine. Propriétés pharmaco-dynamiques et thérapeutiques. Thèse pour le doctorat de l'Université (mention médecine), par C. Taback.
No full textUniversité de Toulouse. Faculté mixte de médecine et de pharmacie. Année 1922-1923. N° 64
"Wir bedürfen weder überseeischen Taback noch indischen Zucker ..." Vertriebsaktivitäten und handelspolitisches Engagement badisch-pfälzischer Gewerbepflanzenbauern in der ersten Hälfte des 19. Jahrhunderts
No full textGrüne N. "Wir bedürfen weder überseeischen Taback noch indischen Zucker .." Vertriebsaktivitäten und handelspolitisches Engagement badisch-pfälzischer Gewerbepflanzenbauern in der ersten Hälfte des 19. Jahrhunderts. In: Konersmann F, Lorenzen-Schmidt K-J, eds. Bauern als Händler. Ökonomische Diversivizierung und soziale Differenzierung bäuerlicher Agrarproduzenten im Zuge der Marktintegration (15.-19. Jahrhundert). Stuttgart: Lucius & Lucius; 2011: 135-162
Bilipschitz versus quasi-isometric equivalence for higher rank lamplighter groups
No full textWe describe a family of finitely presented groups which are quasi-isometric but not bilipschitz equivalent. The first such examples were described by the first author (Duke Math. J., 2010) and are the lamplighter groups F integral Z where F is a finite group; these groups are finitely generated but not finitely presented. The examples presented in this paper are higher rank generalizations of these lamplighter groups and include groups that are of type F-n for any n.ungraded113sciescopu
Refined upper bounds for right-arm rotation distance
No full textRotation distances measure the difference in shape in rooted binary trees. We construct sharp bounds on maximal right-arm rotation distance and restricted right-arm rotation distance for trees of size n. These bounds sharpen the results of Cleary and Taback and incorporate the lengths of the right side of the trees to improve the bounds
Thompson's group F is not almost convex
No full textAbstractWe show that Thompson's group F does not satisfy Cannon's almost convexity condition AC(n) for any positive integer n with respect to the standard generating set with two elements. To accomplish this, we construct a family of pairs of elements at distance n from the identity and distance 2 from each other, which are not connected by a path lying inside the n-ball of length less than k for increasingly large k. Our techniques rely upon Fordham's method for calculating the length of a word in F and upon an analysis of the generators' geometric actions on the tree pair diagrams representing elements of F
Tree-based language complexity of Thompson\u27s group F
No full textThe definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to C-graph automatic by Elder and the first author raise the question of whether Thompson\u27s group F is graph automatic. We define a language of normal forms based on the combinatorial caret types , which arise when elements of F are considered as pairs of finite rooted binary trees. The language is accepted by a finite state machine with two counters, and forms the basis of a 3-counter graph automatic structure for the group
Validation of the Genital Herpes Treatment Satisfaction Questionnaire (GHERPTSQ) in status and change versions
No full textBounding restricted rotation distance
No full textRestricted rotation distance between pairs of rooted binary trees quantifies differences in tree shape. Cleary exhibited a linear upper bound of 12n for the restricted rotation distance between two trees with n interior nodes, and a lower bound of (n − 1)/3 if the two trees satisfy a reduction condition. We obtain a significantly improved sharp upper bound of 4n − 8 for restricted rotation distance between two rooted binary trees with n interior nodes, and a significantly improved sharp lower bound of n − 2, again with the requirement that the trees satisfy a reduction condition. These improvements use work of Fordham to compute the word metric in Thompson’s group F. Key words: algorithms and data structures, binary trees, rotation distance
- …
