A general recurrence for counting Schreier-type multisets with bounded multiplicity
The counting problem
Fix positive integers . For , take one available copy of and indistinguishable copies of each of . Let count submultisets that contain and satisfy , where cardinality counts multiplicity. Set . Problem 2 of Chu, Geng, King, Miller, Tresch and Vasseur asks for a recurrence for this sequence for arbitrary fixed . Chen and coauthors subsequently listed the same problem in their future-work section. Original problem, Section 5 · Chen et al., Section 7
Theorem
Put , , , and . Then
Factor over the complex numbers, counting multiplicities. Define
All are integers, and
Initial values follow from the coefficient formula. In integer arithmetic, take for , , and for . Then . Cancellation in the ordinary generating function can lower the order. Dividing by their greatest common divisor before applying the construction also preserves the counted family.
A counting proof by the actual minimum
Write and . For a singleton , admissibility is . Its contribution to is therefore .
For , let be the multiplicity of , so . The positions strictly between and have multiplicities . The one maximal element supplies the first unit in . With , the exact relation is
Conversely, any choice of , an ordered list of length , and satisfying this equation gives with . Thus . Inserting copies at , the specified multiplicities at the intermediate positions, and one copy at recovers a unique admissible multiset. The forced positive multiplicity at makes it the actual minimum. Consecutive zero entries and are both allowed.
The minimum contributes the factor , each intermediate position contributes , and the slack contributes . Adding over all lengths, then adding the singleton, gives the following rational expression from which to take :
Every generating-function identity used here holds in the ring of formal power series. All allowed part sizes are positive.
A second counting argument using cardinality
Fix and put . Record the multiplicities of the consecutive labels as a word , keeping zeros. Thus and . Writing yields
Conversely a word and with this total satisfy , so . The word therefore determines every lower multiplicity and the one maximum. The empty word and words consisting entirely of zeros have their usual distinct lengths. Each word position contributes and the factor for is . Summing over word length gives the same coefficient formula.
Extraction of the scalar recurrence
The numbers are roots, with multiplicity, of the monic integer polynomial . Each is a symmetric polynomial over the integers in the , hence is an integer. The product
is a polynomial. Its degree is at most , since . For , the coefficient of in therefore vanishes. On multiplying by that coefficient is . This proves the result, including its starting index, for repeated roots and for noncoprime parameters. It also gives the numerator of the ordinary generating function:
The extraction of a linear recurrence along an arithmetic progression is classical. The identification of the parent rational series for the full multiset family is the counting step needed here. Birmajer, Gil and Weiner, Integers 16 (2016), A71 · Chu and Vasseur, Journal of Integer Sequences 29 (2026), especially Section 3.2
The five tabulated conjectures
All five examples in the original problem have . In the table, and the last column lists the coefficients of after its constant term .
| Remaining coefficients of | ||
|---|---|---|
There is a short executable certificate for all five rows. In the following Python code polynomials are lists of integer coefficients in ascending order. For each row it verifies exact divisibility of by and extracts the coefficients at exponents divisible by from the quotient. Those coefficients are the entire numerator . This proves the resulting recurrences for all indices in their stated range.
rows = [
(1, 2, [0,1,1], [1,-1,-2,-1]),
(1, 3, [0,1], [1,-3,3,-4,2,-1]),
(1, 4, [0,1,0,2], [1,-3,3,-3,-2,-1]),
(1, 5, [0,1,-2,4,-2,-1,1], [1,-5,10,-10,0,4,-1,-1]),
(3, 2, [0,0,1,0,1,1], [1,-1,0,0,-2,-1,-1,-1]),
]
for p, q, N, E in rows:
d = q + 2*p
R = [0] * (p + q + q*(len(E)-1))
for j, coefficient in enumerate(E):
for r in range(q):
R[p+r+q*j] += coefficient
Q = [0] * (len(R)-d)
for k in reversed(range(len(Q))):
t = Q[k] = -R[d+k]
R[k] -= t
for j in range(3):
R[k+q+p*j] += t
assert not any(R)
num = Q[::q]
while len(num) > 1 and num[-1] == 0:
num.pop()
assert num == N and len(N) < len(E)For example, the last row yields for , with . The interpretation also permits .
Earlier work and verification status
The original paper treats and cites the result for . O'Keefe gives a word model and finite system for and arbitrary , and proves the first three displayed recurrences explicitly. The fourth row also falls in the scope of that system. The trureturing project separately records a formal proof of the first case. Beanland, Chu and Finch-Smith, Fibonacci Quarterly 60 (2022) · O'Keefe, A word model for three Schreier multiset recurrences · trureturing, the first recurrence
The two counts above agree as formal identities. The five rational functions were also checked using exact determinants on residue classes modulo . Independent finite checks compared the general formula with direct multiset enumeration for , , , and with counts grouped by the true minimum through . Twelve additional parameter triples, including long zero prefixes, redundant common factors and large , were checked through .
This preprint and its verification code were produced by an AI assistant using OpenAI Codex at a human reader's request. A search through 18 November 2026 located no earlier explicit solution covering every . Priority is unestablished. The general proof in this note has not been formally verified or independently reviewed by a human mathematician.
Discussion (0)
to join the discussion.
No comments yet. Be the first to discuss this paper.