54 research outputs found
Bringing Race Back into Racism: Keynote Address
No full textCritical Race Inquiry Launch, Sept. 30,2010. Keynote speaker: Dr. Tamari Kitossa: Bringing Race Back into Racism
Appealing Because He Is Appalling
Get PDFThis collection invites us to think about how African-descended men are seen as both appealing and appalling, and exposed to eroticized hatred and violence and how some resist, accommodate, and capitalize on their eroticization. Drawing on James Baldwin and Frantz Fanon, the contributors examine the contradictions, paradoxes, and politico-psychosexual implications of Black men as objects of sexual desire, fear, and loathing. Kitossa and the contributing authors use Baldwin’s and Fanon’s cultural and psychoanalytic interpretations of Black masculinities to demonstrate their neglected contributions to thinking about and beyond colonialist and Western gender and masculinity studies. This innovative and sophisticated work will be of interest to scholars and students of cultural and media studies, gender and masculinities studies, sociology, political science, history, and critical race and racialization.
Contributors: Katerina Deliovsky, Delroy Hall, Dennis O. Howard, Elishma Khokhar, Tamari Kitossa, Kemar McIntosh, Leroy F. Moore Jr., Watufani M. Poe, Satwinder Rehal, John G. Russell, Mohan Siddi.Publishe
Axion miniclusters : formation in the early universe and signals in gravitational microlensing
No full textAuthor: Tamari MeshvelianiMasterarbeit Universität Innsbruck 2018Masterarbeit Georg-August-Universität Göttingen 201
Axion miniclusters : formation in the early universe and signals in gravitational microlensing
No full textAuthor: Tamari MeshvelianiMasterarbeit Universität Innsbruck 2018Masterarbeit Georg-August-Universität Göttingen 201
Axion miniclusters : formation in the early universe and signals in gravitational microlensing
No full textAuthor: Tamari MeshvelianiMasterarbeit Universität Innsbruck 2018Masterarbeit Georg-August-Universität Göttingen 201
CHAINS OF MAXIMUM LENGTH IN THE TAMARI LATTICE
Get PDFThe Tamari lattice T[subscript n] was originally defined on bracketings of a set of n + 1 objects, with a cover relation based on the associativity rule in one direction. Although in several related lattices, the number of maximal chains is known, quoting Knuth, “The enumeration of such paths in Tamari lattices remains mysterious.”
The lengths of maximal chains vary over a great range. In this paper, we focus on the chains with maximum length in these lattices. We establish a bijection between the maximum length chains in the Tamari lattice and the set of standard shifted tableaux of staircase shape. We thus derive an explicit formula for the number of maximum length chains, using the Thrall formula for the number of shifted tableaux. We describe the relationship between chains of maximum length in the Tamari lattice and certain maximal chains in weak Bruhat order on the symmetric group, using standard Young tableaux. Additionally, recently, Bergeron and Pr ́eville-Ratelle introduced a generalized Tamari lattice. Some of the results mentioned above carry over to their generalized Tamari lattice
Toward the Enumeration of Maximal Chains in the Tamari Lattices
Get PDFabstract: The Tamari lattices have been intensely studied since they first appeared in Dov Tamari’s thesis around 1952. He defined the n-th Tamari lattice T(n) on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Despite their interesting aspects and the attention they have received, a formula for the number of maximal chains in the Tamari lattices is still unknown. The purpose of this thesis is to convey my results on progress toward the solution of this problem and to discuss future work.
A few years ago, Bergeron and Préville-Ratelle generalized the Tamari lattices to the m-Tamari lattices. The original Tamari lattices T(n) are the case m=1. I establish a bijection between maximum length chains in the m-Tamari lattices and standard m-shifted Young tableaux. Using Thrall’s formula, I thus derive the formula for the number of maximum length chains in T(n).
For each i greater or equal to -1 and for all n greater or equal to 1, I define C(i,n) to be the set of maximal chains of length n+i in T(n). I establish several properties of maximal chains (treated as tableaux) and identify a particularly special property: each maximal chain may or may not possess a plus-full-set. I show, surprisingly, that for all n greater or equal to 2i+4, each member of C(i,n) contains a plus-full-set. Utilizing this fact and a collection of maps, I obtain a recursion for the number of elements in C(i,n) and an explicit formula based on predetermined initial values. The formula is a polynomial in n of degree 3i+3. For example, the number of maximal chains of length n in T(n) is n choose 3.
I discuss current work and future plans involving certain equivalence classes of maximal chains in the Tamari lattices. If a maximal chain may be obtained from another by swapping a pair of consecutive edges with another pair in the Hasse diagram, the two maximal chains are said to differ by a square move. Two maximal chains are said to be in the same equivalence class if one may be obtained from the other by making a set of square moves.Dissertation/ThesisDoctoral Dissertation Mathematics 201
Intervals in the greedy Tamari posets
Get PDFWe consider a greedy version of the -Tamari order defined on -Dyck
paths, recently introduced by Dermenjian. Inspired by intriguing connections
between intervals in the ordinary 1-Tamari order and planar triangulations, and
more generally by the existence of simple formulas counting intervals in the
ordinary -Tamari orders, we investigate the number of intervals in the
greedy order on -Dyck paths of fixed size. We find again a simple formula,
which also counts certain planar maps (of prescribed size) called
-constellations.
For instance, when the number of intervals in the greedy order on
1-Dyck paths of length is proved to be , which is also the number of bipartite maps with edges.
Our approach is recursive, and uses a ``catalytic'' parameter, namely the
length of the final descent of the upper path of the interval. The resulting
bivariate generating function is algebraic for all . We show that the same
approach can be used to count intervals in the ordinary -Tamari lattices as
well. We thus recover the earlier result of the first author, Fusy and
Pr\'eville-Ratelle, who were using a different catalytic parameter.Comment: 24 page
- …
