Repository navigation
Big blocks: singleton-or-large set partitions are real-rooted and interlace - #2593
Merged
Merged
Conversation
…rtitions
For k >= 2, the ordered lift of the polynomials counting set partitions with
blocks of size 1 or at least k (weighted by large blocks) satisfies
P_n = thetaPlusOne P_{n-1} + C(n-1,k-1) X thetaPlusOne P_{n-k}; a general
Euler-lag window theorem (DerivativeRecurrence/EulerLag) makes every row PF
with consecutive strict interlacing, and the multiplier sequence (1/r!)
transfers both to the unordered rows. An original result
(Alexandersson, Big-block polynomials for set partitions).
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
An original result (Alexandersson, Big-block polynomials for set partitions): for k ≥ 2, the polynomials counting set partitions of [n] whose blocks have size 1 or at least k, weighted by the number of blocks of size at least k, and their ordered lift, are PF with consecutive strict interlacing.
RealRooted.BigBlockSingletons.rows:IsPFPolynomial (orderedRow k n) ∧ IsPFPolynomial (row k n) ∧ StrictInterl (orderedRow k n) (orderedRow k (n+1)) ∧ StrictInterl (row k n) (row k (n+1)).P_n = θ₊₁ P_{n-1} + C(n-1,k-1) X θ₊₁ P_{n-k}; the new general moduleDerivativeRecurrence/EulerLag.leanproves the Euler-lag window theorem behind it, and the multiplier sequence (1/r!) transfers the result to the unordered rows.Local CI (build 11249 jobs, lint-style, runLinter on the new modules, private imports, script tests) passes.
🤖 Generated with Claude Code