scholarly journals Dyck words and multiquark primitive amplitudes

2013 ◽  
Vol 88 (1) ◽  
Author(s):  
Tom Melia
Keyword(s):  
Dyck Words

Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order

2011 ◽  
pp. 182-194 ◽  
Author(s):  
Stephane Durocher ◽  
Pak Ching Li ◽  
Debajyoti Mondal ◽  
Aaron Williams
Keyword(s):  
Dyck Words

scholarly journals On rational Dyck paths and the enumeration of factor-free Dyck words

2018 ◽  
Vol 244 ◽  
pp. 36-43 ◽  
Author(s):  
Daniel Birmajer ◽  
Juan B. Gil ◽  
Michael D. Weiner
Keyword(s):  
Dyck Paths ◽  
Dyck Words

The Phagocyte Lattice of Dyck Words

Order ◽  
2006 ◽  
Vol 23 (2-3) ◽  
pp. 97-107 ◽  
Author(s):  
J. L. Baril ◽  
J. M. Pallo
Keyword(s):  
Dyck Words

scholarly journals Refunctionalization at Work

2008 ◽  
Vol 15 (4) ◽  
Author(s):  
Olivier Danvy ◽  
Kevin Millikin
Keyword(s):  
Programming Languages ◽  
Left Inverse ◽  
Shunting Yard ◽  
Dyck Words

We present the left inverse of Reynolds's defunctionalization and we show its relevance to programming and to programming languages. We propose two methods to transform a program that is almost in defunctionalized form into one that is actually in defunctionalized form, and we illustrate them with a recognizer for Dyck words and with Dijkstra's shunting-yard algorithm.

A novel approach to steganography based on the properties of Catalan numbers and Dyck words

2019 ◽  
Vol 100 ◽  
pp. 186-197 ◽  
Author(s):  
Muzafer Saračević ◽  
Saša Adamović ◽  
Vladislav Miškovic ◽  
Nemanja Maček ◽  
Marko Šarac
Keyword(s):  
Catalan Numbers ◽  
Novel Approach ◽  
Dyck Words

scholarly journals Refunctionalization at Work

2007 ◽  
Vol 14 (7) ◽  
Author(s):  
Olivier Danvy ◽  
Kevin Millikin
Keyword(s):  
Programming Languages ◽  
Left Inverse ◽  
Shunting Yard ◽  
Dyck Words

We present the left inverse of Reynolds's defunctionalization and we show its relevance to programming and to programming languages. We present two methods to put a program that is almost in defunctionalized form into one that is actually in defunctionalized form, and we illustrate them with a recognizer for Dyck words and with Dijkstra's shunting-yard algorithm.

scholarly journals On the ranks of configurations on the complete graph

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Robert Cori ◽  
Yvan Le Borgne
Keyword(s):  
Complete Graph ◽  
Efficient Algorithm ◽  
Complete Graphs ◽  
International Audience ◽  
Definition Of ◽  
Dyck Words

International audience We consider the parameter rank introduced for graph configurations by M. Baker and S. Norine. We focus on complete graphs and obtain an efficient algorithm to determine the rank for these graphs. The analysis of this algorithm leads to the definition of a parameter on Dyck words, which we call prerank. We prove that the distribution of area and prerank on Dyck words of given length $2n$ leads to a polynomial with variables $q,t$ which is symmetric in these variables. This polynomial is different from the $q,t-$Catalan polynomial studied by A. Garsia, J. Haglund and M. Haiman.

scholarly journals Some permutations on Dyck words

2016 ◽  
Vol 635 ◽  
pp. 51-63 ◽  
Author(s):  
Marilena Barnabei ◽  
Flavio Bonetti ◽  
Niccolò Castronuovo ◽  
Robert Cori
Keyword(s):  
Dyck Words
Sign in / Sign up

Export Citation Format

Share Document