Reconstruction Problems for Graphs, Krawtchouk Polynomials, and Diophantine Equations

DOI10.1007/978-0-8176-4789-6_11zbMath1246.11083OpenAlexW57494746MaRDI QIDQ3064403

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

Krawtchouk polynomialsdiscrete orthogonal polynomialsDiophantine equationsgraph reconstructionLaguerre inequality

Mathematics Subject Classification ID

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

Related Items (1)

Exact results for amplitude spectra of fitness landscapes

This page was built for publication: Reconstruction Problems for Graphs, Krawtchouk Polynomials, and Diophantine Equations