1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
//! Dump `P_λ(x;q,t)` in the monomial basis for `scripts/check_macdonald.py`.
//!
//! One line per (λ, μ) with a nonzero coefficient:
//!
//! ```text
//! lambda | mu | numerator | denominator
//! ```
//!
//! Numerator and denominator are `a,b:c` terms for `c·qᵃtᵇ`, semicolon
//! separated. The denominator is **expanded** here purely so the comparison is
//! simple; the library keeps it factored.
use symfn::sym::SymFn;
use symfn::{macdonald_j, macdonald_p, macdonald_q, Frac, Monomial, Ring};
fn main() {
let top: u32 = std::env::args()
.nth(1)
.and_then(|s| s.parse().ok())
.unwrap_or(6);
let basis = std::env::args().nth(2).unwrap_or_else(|| "P".into());
for n in 1..=top {
for lambda in symfn::partitions_of(n) {
let p: Monomial<Frac<i128>> = match basis.as_str() {
"P" => macdonald_p(&lambda),
"Q" => macdonald_q(&lambda),
"J" => macdonald_j(&lambda),
other => panic!("unknown basis {other}"),
};
for (mu, c) in p.terms() {
let (num, _) = c.parts();
println!(
"{} | {} | {} | {}",
join(lambda.parts()),
join(mu.parts()),
poly(num),
poly(&c.denominator())
);
}
}
}
}
fn poly(p: &symfn::QtPoly<i128>) -> String {
if p.is_zero() {
return "0,0:0".into();
}
p.terms()
.map(|((a, b), c)| format!("{a},{b}:{c}"))
.collect::<Vec<_>>()
.join(";")
}
fn join(p: &[u32]) -> String {
p.iter()
.map(|x| x.to_string())
.collect::<Vec<_>>()
.join(",")
}