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.

Sign up for GitHub

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

Jump to bottom

Using biseq_t for word combinatorics #17500

Open
videlec opened this issue Dec 14, 2014 · 1 comment
Open

Using biseq_t for word combinatorics #17500

videlec opened this issue Dec 14, 2014 · 1 comment
Labels
c: combinatorics p: major / 3 t: enhancement

Comments

@videlec
Copy link
Contributor

videlec commented Dec 14, 2014

In #15820, biseq_t is used to model bounded sequence of integers. We should provide a way to use it in sage.combinat.words and see whether other datastructures are actually needed.

In the same time, we should think about moving low level functions on words to sage.data_structure.bounded_integer_sequences.

CC: @sagetrac-tmonteil @jdemeyer @seblabbe

Component: combinatorics

Issue created by migration from https://trac.sagemath.org/ticket/17500
@videlec videlec added this to the sage-6.5 milestone Dec 14, 2014
@jdemeyer

This comment has been minimized.

Sign in to view
@jdemeyer jdemeyer changed the title Using bitseq_t for word combinatorics Using biseq_t for word combinatorics Dec 14, 2014
@mkoeppe mkoeppe removed this from the sage-6.5 milestone Dec 29, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
c: combinatorics p: major / 3 t: enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@jdemeyer @videlec @mkoeppe