activity
20202024
most citedAn Introduction to Completeness of Positive Linear Recurrence Sequences

3 citations · 8 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2024

Polyhedral geometry of refined -Catalan numbers

Matthias Beck, Mitsuki Hanada, Max Hlavacek +3

We study a refinement of the -Catalan numbers introduced by Xin and Zhang (2022, 2023) using tools from polyhedral geometry. These refined -Catalan numbers depend on a ve…

math.CO2024★ 1 cited

The -positivity of the chromatic symmetric function for twinned paths and cycles

Esther Banaian, Kyle Celano, Megan Chang-Lee +7

The operation of twinning a graph at a vertex was introduced by Foley, Hoàng, and Merkel (2019), who conjectured that twinning preserves -positivity of the chromatic symmetric f…

math.CO2022★ 2 cited

Generalized parking function polytopes

Mitsuki Hanada, John Lentfer, Andrés R. Vindas-Meléndez

A classical parking function of length is a list of positive integers whose nondecreasing rearrangement satisfies…

math.CO2020★ 3 cited

An Introduction to Completeness of Positive Linear Recurrence Sequences

Elżbieta Bołdyriew, John Haviland, Phúc Lâm +3

A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions…

math.CO2020

Completeness of Positive Linear Recurrence Sequences

Elżbieta Bołdyriew, John Haviland, Phúc Lâm +3

A sequence of positive integers is complete if every positive integer is a sum of distinct terms. A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneou…

math.NT2020★ 2 cited

Extending Zeckendorf's Theorem to a Non-constant Recurrence and the Zeckendorf Game on this Non-constant Recurrence Relation

Elżbieta Bołdyriew, Anna Cusenza, Linglong Dai +16

Zeckendorf's Theorem states that every positive integer can be uniquely represented as a sum of non-adjacent Fibonacci numbers, indexed from . This has been gene…

math.CO2020

Counting on Euler and Bernoulli Number Identities

Arthur T. Benjamin, John Lentfer, Thomas C. Martinez

While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoull…