An enumeration problem arising from a result about arithmetic progressions

MaRDI QIDQ3303751zbMATH OpenFDO

Authors Julian Benali, Harris Cobb, P. D. jun. Johnson

Publication date 4 August 2020

Full work available at URL http://ijmcs.future-in-tech.net/15.2/R-Benali-Cobb-Johnson.pdf

zbMATH Keywords

arithmetic progressionchromatic numbercyclic arithmetic progressionFibonacci sequencelinear homogeneous difference equationvan der Waerden hypergraphvertex independence number

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On arithmetic progressions in the generalized Thue-Morse word
• The number of q-ary words with restrictions on the length of the maximal run
• Sequences on sets of four numbers
• Large subsets of \(\mathbb{Z}_m^n\) without arithmetic progressions
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

Cited in

(3)

• scientific article; zbMATH DE number 1286135 (Why is no real title available?)
• scientific article; zbMATH DE number 1150154 (Why is no real title available?)
• scientific article; zbMATH DE number 3419191 (Why is no real title available?)

This page was built for publication: An enumeration problem arising from a result about arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303751)