Sums of powered characteristic roots count distance-independent circular sets

DOI10.7151/DMGT.1658zbMATH Open1293.05278OpenAlexW2052837878WikidataQ60692822 ScholiaQ60692822MaRDI QIDQ2866463FDOQ2866463

Authors: Zdzisław Skupień 

Publication date: 13 December 2013

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1658

Recommendations

• On the sum of powered distances to certain sets of points on the circle
• On the sum of roots of a closed set
• Publication:4864300
• scientific article; zbMATH DE number 554181
• The number of subsets without a fixed circular distance
• scientific article; zbMATH DE number 6314709
• Note on integer powers in sumsets
• scientific article; zbMATH DE number 410203
• Sumsets containing powers of an integer
• Solution counts and sums of roots of unity

zbMATH Keywords

generating functionspower sumsPisot numbersLucas numbersco-reciprocal polynomialsdistance independent set

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Recurrences (11B37) PV-numbers and generalizations; other special algebraic numbers; Mahler measure (11R06)

Cited In (2)

• Title not available (Why is that?)
• Some identities for generalized Fibonacci and Lucas numbers

This page was built for publication: Sums of powered characteristic roots count distance-independent circular sets

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