back to table · edit · history · where entries came from · files · download
4963 bytes, as of the version from 2026-09-16 08:49 (current). Recorded here, not run.
"""numberdb.org/T265 -- MacMahon $q$-Catalan numbers $\\widetilde C_n(q)$.
This generator fills T265, the table of the MacMahon specialisation
$\\widetilde C_n(q)=q^{\\binom n2}C_n(q,q^{-1})$. The two-variable
$q,t$-Catalan table is T262, and the Carlitz-Riordan one-variable convention
is T264.
Run it with SageMath:
$ sage -pip install numberdb # once
$ sage -python generate.py # check the table against this code
$ sage -python generate.py --publish # fill the draft, with NUMBERDB_API_KEY set
"""
import os
import sys
from functools import lru_cache
import numberdb.sage as numberdb
from sage.arith.misc import binomial
from sage.combinat.q_analogues import qt_catalan_number
from sage.rings.integer_ring import ZZ
from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing
TABLE = os.environ.get("NUMBERDB_TABLE", "T265")
# Measured before filling the draft: the chosen rows n=3..11 have largest value
# 1156 characters at n=11, and the entries block is still only a few KB.
MAX_N = 11
POLY = PolynomialRing(ZZ, ("q", "t"))
Q, T = POLY.gens()
def _key_from_stdin():
if os.environ.get("NUMBERDB_KEY_FROM_STDIN") != "1":
return
token = sys.stdin.read().strip()
if "=" in token and token.split("=", 1)[0].isupper():
token = token.split("=", 1)[1].strip().strip("'\"")
if token:
os.environ["NUMBERDB_API_KEY"] = token
def _qt(n):
return POLY(qt_catalan_number(n))
def _macmahon(n):
exponent = n * (n - 1) // 2
return POLY((Q ** exponent) * _qt(n)(q=Q, t=1 / Q))
@lru_cache(maxsize=None)
def _q_binomial(n, k):
if k < 0 or k > n:
return POLY.zero()
if k == 0 or k == n:
return POLY.one()
return _q_binomial(n - 1, k) + (Q ** (n - k)) * _q_binomial(n - 1, k - 1)
def _q_integer(n):
return sum(Q ** i for i in range(n))
def _macmahon_q_binomial(n):
quotient, remainder = _q_binomial(2 * n, n).quo_rem(_q_integer(n + 1))
if remainder != 0:
raise ArithmeticError("MacMahon quotient was not exact for n=%d" % n)
return quotient
def _catalan(n):
return ZZ(binomial(2 * n, n) // (n + 1))
class MacMahonQCatalanNumbers(numberdb.Generator):
"""Generator for T265, the table of $\\widetilde C_n(q)$."""
table = TABLE
parameters = ("n",)
type = "Z[]"
rigour = "exact"
def enumerate(self, max_n=MAX_N):
for n in range(3, max_n + 1):
yield {"n": str(n)}
def value(self, params, digits):
return _macmahon(int(params["n"]))
def run_integrity_checks():
for n in range(0, MAX_N + 1):
macmahon = _macmahon(n)
if macmahon != _macmahon_q_binomial(n):
raise ArithmeticError("MacMahon q-binomial check failed at n=%d" % n)
if macmahon(q=1, t=1) != _catalan(n):
raise ArithmeticError("MacMahon Catalan specialization failed at n=%d" % n)
if _macmahon(0) != 1 or _macmahon(1) != 1 or _macmahon(2) != Q ** 2 + 1:
raise ArithmeticError("small MacMahon q-Catalan cases failed")
def fill_draft_once(generator, message):
"""Fill a fresh draft without the client's empty upsert probe."""
from numberdb._generate import (
_check_precision,
_check_rigour,
_producer,
_run_name,
_source_files,
)
from numberdb._write import Entries, attach, submit_entries, to_text
table = generator.table
run = _run_name(generator)
entries = Entries(*generator.parameters)
for params in generator.enumerate():
params = dict(params)
wanted = generator.digits_for(params)
entry = generator._entry(params, wanted)
value = entry["number"]
identity = ",".join(str(params[name]) for name in generator.parameters)
_check_rigour(generator, table, identity, value)
written = to_text(value, wanted, generator.format)
_check_precision(table, identity, written, wanted, lowering=False)
record = dict(entry)
record.pop("digits", None)
entries.add(**params, **record, digits=wanted)
answer = submit_entries(
table,
entries,
message=message,
produced_by=_producer(generator, os.environ.get("NUMBERDB_ASSISTED_BY", "")),
upsert=False,
run=run,
rigour=generator.rigour,
)
for name, body in sorted(_source_files(generator).items()):
attach(table, name, body, run=run, message=message,
rigour=generator.rigour)
return answer
if __name__ == "__main__":
_key_from_stdin()
generator = MacMahonQCatalanNumbers()
run_integrity_checks()
if "--publish" in sys.argv or os.environ.get("NUMBERDB_PUBLISH") == "1":
print(fill_draft_once(
generator,
message="exact MacMahon q-Catalan polynomials"))
else:
report = generator.verify(sample=None)
print(report)
sys.exit(0 if report.ok else 1)