Linear-order Species

sage.combinat.species.linear_order_species.LinearOrderSpecies(*args, **kwds)

Create a cached version of a function, which only recomputes values it hasn’t already computed. Synonyme: cached_function

INPUT:

  • f – a function
  • name (optional string) – name that the cached version of f should be provided with.

If f is a function, do either g = CachedFunction(f) or g = cached_function(f) to make a cached version of f, or put @cached_function right before the definition of f (i.e., use Python decorators):

@cached_function
def f(...):
    ....

The inputs to the function must be hashable.

EXAMPLES:

sage: @cached_function
... def mul(x, y=2):
...     return x*y
...
sage: mul(3)
6

We demonstrate that the result is cached, and that, moreover, the cache takes into account the various ways of providing default arguments:

sage: mul(3) is mul(3,2)
True
sage: mul(3,y=2) is mul(3,2)
True

The user can clear the cache:

sage: a = mul(4)
sage: mul.clear_cache()
sage: a is mul(4)
False

It is also possible to explicitly override the cache with a different value:

sage: mul.set_cache('foo',5)
sage: mul(5,2)
'foo'
class sage.combinat.species.linear_order_species.LinearOrderSpeciesStructure(parent, labels, list)

Bases: sage.combinat.species.structure.GenericSpeciesStructure

EXAMPLES:

sage: from sage.combinat.species.structure import GenericSpeciesStructure
sage: a = GenericSpeciesStructure(None, [2,3,4], [1,2,3])
sage: a
[2, 3, 4]
sage: a.parent() is None
True
sage: a == loads(dumps(a))
True
automorphism_group()

Returns the group of permutations whose action on this structure leave it fixed. For the species of linear orders, there is no non-trivial automorphism.

EXAMPLES:

sage: F = species.LinearOrderSpecies()
sage: a = F.structures(["a", "b", "c"]).random_element(); a
['a', 'b', 'c']
sage: a.automorphism_group()
Symmetric group of order 1! as a permutation group
canonical_label()

EXAMPLES:

sage: P = species.LinearOrderSpecies()
sage: s = P.structures(["a", "b", "c"]).random_element()
sage: s.canonical_label()
['a', 'b', 'c']
transport(perm)

Returns the transport of this structure along the permutation perm.

EXAMPLES:

sage: F = species.LinearOrderSpecies()
sage: a = F.structures(["a", "b", "c"]).random_element(); a
['a', 'b', 'c']
sage: p = PermutationGroupElement((1,2))
sage: a.transport(p)
['b', 'a', 'c']
class sage.combinat.species.linear_order_species.LinearOrderSpecies_class(min=None, max=None, weight=None)

Bases: sage.combinat.species.species.GenericCombinatorialSpecies

EXAMPLES:

sage: L = species.LinearOrderSpecies()
sage: L._check()
True
sage: L == loads(dumps(L))
True

Previous topic

Permutation species

Next topic

Set Species

This Page