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

fix typo in ladder_idempotent #39638

Open
wants to merge 2 commits into
base: develop
Choose a base branch
from
Open

Conversation

fchapoton
Copy link
Contributor

that has currently a very wrong name

alos a few other minor details on the way

📝 Checklist

  • The title is concise and informative.
  • The description explains in detail what this PR is about.

Copy link

github-actions bot commented Mar 6, 2025

Documentation preview for this PR (built with commit 4950b1b; changes) is ready! 🎉
This preview will update shortly after each push to this PR.

from sage.combinat.permutation import (Permutation, Permutations,
from_permutation_group_element)
from sage.combinat.permutation_cython import (left_action_same_n,
right_action_same_n)
from sage.combinat.partition import _Partitions, Partitions, Partitions_n
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

should be before permutation

la = _Partitions(la)
if sum(la) != n:
raise ValueError(f"{la} is not a partition of {n}")
la = Partitions_n(n)(la)
Tlad, alpha = la.ladder_tableau(p, ladder_lengths=True)
if not all(val < p for val in alpha):
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

a detail: if any(val >= p for val in alpha):

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants