2020
DOI: 10.1016/j.aim.2020.107387
|View full text |Cite
|
Sign up to set email alerts
|

Lucas atoms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
8
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(8 citation statements)
references
References 3 publications
0
8
0
Order By: Relevance
“…Notably, γ-positivity of a polynomial implies that its coefficients are symmetric and unimodal, and the coefficients of γ-positive polynomials often have nice geometric and combinatorial interpretations, see [1,39] for details. If the γ-vector of f (x) alternates in sign, then we say that f (x) is alternatingly γ-positive (see [11,31,45] for instance). For example, (1 + x 2 ) n is alternatingly γ-positive, since…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations
“…Notably, γ-positivity of a polynomial implies that its coefficients are symmetric and unimodal, and the coefficients of γ-positive polynomials often have nice geometric and combinatorial interpretations, see [1,39] for details. If the γ-vector of f (x) alternates in sign, then we say that f (x) is alternatingly γ-positive (see [11,31,45] for instance). For example, (1 + x 2 ) n is alternatingly γ-positive, since…”
Section: Introductionmentioning
confidence: 99%
“…where the alternating γ-coefficients n k 2 k count k-simplices in the n-cube (see [48, A013609]). There has been considerable recent interest in the study alternatingly γ-positive polynomials, see [11,31,34,45] for instance. For example, Lin etal.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…However, Kitayama and Shiomi [2] showed that Ψ n (x) is often reducible in finite fields. More recently, Sagan and Tirrell [5] studied the bivariate Lucas polynomials and their factorization using Lucas atoms. The bivariate Lucas polynomials are defined such that L 1 (s, t) = 1, L 2 (s, t) = s, and L n (s, t) = L n−1 (s, t) • s + L n−2 (s, t) • t for all integers n ≥ 3.…”
Section: Introductionmentioning
confidence: 99%