Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Disjoint unions of enumerated sets #7396

Closed
hivert opened this issue Nov 5, 2009 · 4 comments
Closed

Disjoint unions of enumerated sets #7396

hivert opened this issue Nov 5, 2009 · 4 comments

Comments

@hivert
Copy link

hivert commented Nov 5, 2009

The patch implement the disjoint union of a family of enumerated sets. It allows in particular to deal with infinite unions such as in

sage: DisjointUnionEnumeratedSets(
...       Family(NonNegativeIntegers(), Permutations))
Disjoint union of Lazy family (Permutations(i))_{i in Non negative integers}

Depend on #7395.

Florent

CC: @sagetrac-sage-combinat

Component: combinatorics

Keywords: Disjoint union, enumerated sets

Author: Florent Hivert

Reviewer: Nicolas M. Thiéry

Merged: sage-4.3.alpha0

Issue created by migration from https://trac.sagemath.org/ticket/7396

@hivert hivert added this to the sage-4.3 milestone Nov 5, 2009
@hivert hivert self-assigned this Nov 5, 2009
@hivert
Copy link
Author

hivert commented Nov 5, 2009

Attachment: trac_7396_enumset_unions-fh.patch.gz

@hivert

This comment has been minimized.

@nthiery
Copy link
Contributor

nthiery commented Nov 5, 2009

comment:3

Patch good to go (we polished it together:-))!

@mwhansen
Copy link
Contributor

Merged: sage-4.3.alpha0

@sagetrac-mvngu sagetrac-mvngu mannequin changed the title Disjoint unions of enumerated sets. Disjoint unions of enumerated sets Dec 26, 2009
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

3 participants