Hello everyone.
Christian Stump, Chris Berg and I have been thinking about statistics
on combinatorial objects in Sage. There are several already
implemented in Sage, and we think that it would be very useful to have
a means to identify. As a simple example, one might want to know all
the statisti
Hi Franco,
How would the user then ask for the statistics?
Integers.combinatorial_statistics() ?
or
combinatorial_statistics(Integers)
BTW, you can add the energy function for crystals to this list as well :-)
Best,
Anne
On 7/29/11 10:59 AM, Franco Saliola wrote:
Hello everyone.
Christia
Hallo Anne,
> How would the user then ask for the statistics?
>
> Integers.combinatorial_statistics() ?
>
> or
>
> combinatorial_statistics(Integers)
I would think of
Permutations().combinatorial_statistics()
gives a list of all combinatorial statistics defined on permutations, and
Permutation
Hallo Christian,
How would the user then ask for the statistics?
Integers.combinatorial_statistics() ?
or
combinatorial_statistics(Integers)
I would think of
Permutations().combinatorial_statistics()
gives a list of all combinatorial statistics defined on permutations, and
Permutations()
Hi,
> Oh, but wouldn't it be useful to find all combinatorial objects with
> combinatorial statistics with the same codomain? For example, if you did not
> know that there is a statistic preserving bijection between crystals and
> rigged configurations, you would not think of checking this. But if
Hi,
Oh, but wouldn't it be useful to find all combinatorial objects with
combinatorial statistics with the same codomain? For example, if you did not
know that there is a statistic preserving bijection between crystals and
rigged configurations, you would not think of checking this. But if sage
Hi Franco and all!
On Fri, Jul 29, 2011 at 08:58:01PM -0700, Anne Schilling wrote:
> >Christian Stump, Chris Berg and I have been thinking about statistics
> >on combinatorial objects in Sage. There are several already
> >implemented in Sage, and we think that it would be very useful to ha
