Skip to content

marnijulie/strong-interval-trees-maple

maple-code
Switch branches/tags

Name already in use

A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
1 branch 0 tags
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
Approximations.mpl
 
 
CountingSequences.mpl
 
 
README.md
 
 
Test-Theorem-5.mpl
 
 

README.md

strong-interval-trees-maple

This contains code and data related to the article "Some families of trees arising in permutation analysis" by Mathilde Bouvel, Marni Mishna and Cyril Nicaud Arxiv reference to come; Preliminary version at https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAS0170/4270.html (FPSAC 2013)

CountingSequences.mpl contains the counting sequences for Simple permutations, and P^(K) trees for k<=8 Constants.mpl contains approximate values for rho and tau for k from 3 to 30. Test-Theorem-5.mpl Tests the asymptotic formula given in Theorem 5

About

Some families of trees arising in permutation analysis

Resources

Readme
Activity

Stars

0 stars

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published