Reconstruction Problems for Graphs, Krawtchouk Polynomials, and Diophantine Equations

Thomas Stoll ()
Additional contact information
Thomas Stoll: University of Waterloo, Faculty of Mathematics, School of Computer Science

Chapter Chapter 11 in Structural Analysis of Complex Networks, 2011, pp 293-317 from Springer

Abstract: Abstract We give an overview about some reconstruction problems in graph theory, which are intimately related to integer roots of Krawtchouk polynomials. In this context, Tichy and the author recently showed that a binary Diophantine equation for Krawtchouk polynomials only has finitely many integral solution. Here, this result is extended. By using a method of Krasikov, we decide the general finiteness problem for binary Krawtchouk polynomials within certain ranges of the parameters.

Keywords: Krawtchouk polynomials; Graph reconstruction; Diophantine equations; Discrete orthogonal polynomials; Laguerre inequality (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-8176-4789-6_11

Ordering information: This item can be ordered from
http://www.springer.com/9780817647896

DOI: 10.1007/978-0-8176-4789-6_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().