Reconstruction problems for graphs, Krawtchouk polynomials, and Diophantine equations

DOI10.1007/978-0-8176-4789-6_11MaRDI QIDQ3064403zbMATHOpenAlexFDO

Authors Thomas Stoll

Publication date 21 December 2010

Published in Structural Analysis of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-8176-4789-6_11

zbMATH Keywords

Diophantine equationsdiscrete orthogonal polynomialsgraph reconstructionKrawtchouk polynomialsLaguerre inequality

Mathematics Subject Classification ID

Classical hypergeometric functions, ({}_2F_1) (33C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Higher degree equations; Fermat's equation (11D41) Systems of functional equations and inequalities (39B72) Counting solutions of Diophantine equations (11D45)

Recommendations

• On integral zeros of Krawtchouk polynomials
• scientific article; zbMATH DE number 2061158
• Degree conditions for vertex switching reconstruction
• Switching reconstruction and diophantine equations
• Survey of binary Krawtchouk polynomials

Cited in

(3)

• Exact results for amplitude spectra of fitness landscapes
• Diophantine equations involving general Meixner and Krawtchouk polynomials
• On the reconstruction of the matching polynomial and the reconstruction conjecture

This page was built for publication: Reconstruction problems for graphs, Krawtchouk polynomials, and Diophantine equations

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