English

Lucas atoms

Combinatorics 2019-09-09 v1 Number Theory

Abstract

Given two variables ss and tt, the associated sequence of Lucas polynomials is defined inductively by {0}=0\{0\}=0, {1}=1\{1\}=1, and {n}=s{n1}+t{n2}\{n\}=s\{n-1\}+t\{n-2\} for n2n\ge2. An integer (e.g., a Catalan number) defined by an expression of the form ini/jkj\prod_i n_i/\prod_j k_j has a Lucas analogue obtained by replacing each factor with the corresponding Lucas polynomial. There has been interest in deciding when such expressions, which are a priori only rational functions, are actually polynomials in s,ts,t. The approaches so far have been combinatorial. We introduce a powerful algebraic method for answering this question by factoring {n}=dnPd(s,t)\{n\}=\prod_{d|n} P_d(s,t), where we call the polynomials Pd(s,t)P_d(s,t) Lucas atoms. This permits us to show that the Lucas analogues of the Fuss-Catalan and Fuss-Narayana numbers for all irreducible Coxeter groups are polynomials in s,ts,t. Using gamma expansions, a technique which has recently become popular in combinatorics and geometry, one can show that the Lucas atoms have a close relationship with cyclotomic polynomials Φd(q)\Phi_d(q). Certain results about the Φd(q)\Phi_d(q) can then be lifted to Lucas atoms. In particular, one can prove analogues of theorems of Gauss and Lucas, deduce reduction formulas, and evaluate the Pd(s,t)P_d(s,t) at various specific values of the variables.

Keywords

Cite

@article{arxiv.1909.02593,
  title  = {Lucas atoms},
  author = {Bruce E. Sagan and Jordan Tirrell},
  journal= {arXiv preprint arXiv:1909.02593},
  year   = {2019}
}

Comments

23 pages

R2 v1 2026-06-23T11:07:08.589Z