Acoustic phonetic properties of p-words and g-words in Sora.
                        
                    
    
            A study of the acoustic properties of Sora encompassing simple and grammatically complex words. 
        more » 
        « less   
        
    
                            - Award ID(s):
- 1844532
- PAR ID:
- 10490143
- Publisher / Repository:
- Uni-Konstanz
- Date Published:
- Journal Name:
- Proceedings of formal approaches to South Asian languages
- ISSN:
- 2510-2818
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
- 
            Abstract Kreweras words are words consisting of n $$\mathrm {A}$$ A ’s, n $$\mathrm {B}$$ B ’s, and n $$\mathrm {C}$$ C ’s in which every prefix has at least as many $$\mathrm {A}$$ A ’s as $$\mathrm {B}$$ B ’s and at least as many $$\mathrm {A}$$ A ’s as $$\mathrm {C}$$ C ’s. Equivalently, a Kreweras word is a linear extension of the poset $$\mathsf{V}\times [n]$$ V × [ n ] . Kreweras words were introduced in 1965 by Kreweras, who gave a remarkable product formula for their enumeration. Subsequently they became a fundamental example in the theory of lattice walks in the quarter plane. We study Schützenberger’s promotion operator on the set of Kreweras words. In particular, we show that 3 n applications of promotion on a Kreweras word merely swaps the $$\mathrm {B}$$ B ’s and $$\mathrm {C}$$ C ’s. Doing so, we provide the first answer to a question of Stanley from 2009, asking for posets with ‘good’ behavior under promotion, other than the four families of shapes classified by Haiman in 1992. We also uncover a strikingly simple description of Kreweras words in terms of Kuperberg’s $$\mathfrak {sl}_3$$ sl 3 -webs, and Postnikov’s trip permutation associated with any plabic graph. In this description, Schützenberger’s promotion corresponds to rotation of the web.more » « less
- 
            Blank, in his Ph.D. thesis on determining whether a planar closed curve $$\gamma$$ is self-overlapping, constructed a combinatorial word geometrically over the faces of $$\gamma$$ by drawing cuts from each face to a point at infinity and tracing their intersection points with $$\gamma$$. Independently, Nie, in an unpublished manuscript, gave an algorithm to determine the minimum area swept out by any homotopy from a closed curve $$\gamma$$ to a point. Nie constructed a combinatorial word algebraically over the faces of $$\gamma$$ inspired by ideas from geometric group theory, followed by dynamic programming over the subwords. In this paper, we examine the definitions of the two words and prove the equivalence between Blank's word and Nie's word under the right assumptions.more » « less
 An official website of the United States government
An official website of the United States government 
				
			 
					 
					
 
                                    