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

Fast combinations #33

Open
llrs opened this issue Feb 6, 2020 · 3 comments
Open

Fast combinations #33

llrs opened this issue Feb 6, 2020 · 3 comments

Comments

@llrs
Copy link
Member

llrs commented Feb 6, 2020

When the fuzzy set is very long, the calculation of size is quite slow.

The fast arrangements package might help here. Maybe the functions can be modified to apply a function to the combinations. Read also the content that lead me there. Although not sure if it can be tweaked.
@llrs
Copy link
Member Author

llrs commented Mar 2, 2020

Github at https://github.com/randy3k/arrangements

@llrs llrs mentioned this issue Sep 17, 2020
Open
@llrs
Copy link
Member Author

llrs commented Jun 17, 2023

A shortcut could be to estimate the lowest and highest number they can reach: pick the lowest number and elevate them to the power needed?
Leaving this here as I don't know if I'll implement it soon

@llrs
Copy link
Member Author

llrs commented Feb 21, 2024

There is a website in another domain (Flow cytometry) that explain that they used an algorithm to avoid this kind of problems. The paper linked is Minimizing spectral overlap in multicolor flow cytometry experiments.

"Fun" fact: this problem is "NP hard", so I know it wasn't on me that I was finding it difficult to solve 😄

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@llrs