Dr Ilia Krasikov

Reader Dr Ilia Krasikov

Contact

Mathematical Sciences
John Crank 507
Brunel University
Uxbridge
UB8 3PH
United Kingdom
Tel: +44 (0)1895 265630
Fax: +44 (0)1895 269732
Email: ilia.krasikov@brunel.ac.uk
Web: Google Scholar Profile

Research Interests

Graph theory, combinatorics, coding theory, number theory and orthogonal polynomials

University Research Centre Membership

Research Group Membership

Publications

Journal Papers

(2009) Fabbri, IM., Lucianetti, A. and Krasikov, I., On a Sturm Liouville periodic boundary values problem, Integral Transforms and Special Functions 20 (5) : 353- 364

(2009) Krasikov, I. and Zarkh, A., On zeros of discrete orthogonal polynomials, Journal of Approximation Theory 156 (2) : 121- 141 Download publication

(2008) Krasikov, I., On the Erdelyi-Magnus-Nevai conjecture for Jacobi polynomials, Constructive Approximation 28 (2) : 113- 125

(2007) Krasikov, I., Inequalities for orthonormal Laguerre polynomials, Journal of Approximation Theory 144 (1) : 1- 26

(2007) Krasikov, I., An upper bound on Jacobi polynomials, Journal of Approximation Theory 149 (2) : 116- 130

(2006) Krasikov, I., On extreme zeros of classical orthogonal polynomials, Journal of Computational and Applied Mathematics 193 (1) : 168- 182

(2005) Krasikov, I., On the maximum value of Jacobi polynomials, Journal of Approximation Theory 136 (1) : 1- 20

(2004) Krasikov, I. and Noble, SD., Finding next-to-shortest paths in a graph, Information Processing Letters 92 (3) : 117- 119 Download publication

(2004) Krasikov, I., Rodgers, GJ. and Tripp, CE., Growing random sequences, Journal of Physics A: Mathematical and General 37 (6) : 2365- 2370 Download publication

(2003) Krasikov, I. and Lagarias, JC., Bounds for the 3x+1 problem using difference inequalities, Acta Arithmetica 109 (3) : 237- 258

(2003) Krasikov, I., Bounds for zeros of the Laguerre polynomials, Journal of Approximation Theory 121 (2) : 287- 291

(2002) Krasikov, I., Lev, A. and Thatte, BD., Upper bounds on the automorphism group of a graph, Discrete Mathematics 256 (1-2) : 489- 493

(2002) Foster, WH. and Krasikov, I., Inequalities for real-root polynomials and entire functions, Advances in Applied Mathematics 29 (1) : 102- 114

(2001) Krasikov, I., Nonnegative quadratic forms and bounds on orthogonal polynomials, Journal of Approximation Theory 111 (1) : 31- 49

(2001) Krasikov, I. and Litsyn, S., On the distance distributions of BCH codes and their duals, Designs, Codes and Cryptography 23 (2) : 223- 231

(2000) Krasikov, I. and Litsyn, S., An improved upper bound on the minimum distance of doubly-even self-dual codes, IEEE Transactions on Information Theory 46 (1) : 274- 278 Download publication

(1999) Krasikov, I. and Litsyn, S., On the distance distribution of duals of BCH codes, IEEE Transactions on Information Theory 45 (1) : 247- 250 Download publication

(1997) Krasikov, I. and Litsyn, S., Estimates for the range of binomiality in codes' spectra, IEEE Transactions on Information Theory 43 (3) : 987- 991 Download publication

(1997) Krasikov, I. and Litsyn, S., Linear programming bounds for codes of small size, European Journal of Combinatorics 18 (6) : 647- 654

(1997) Krasikov, I. and Roditty, Y., On a reconstruction problem for sequences, Journal of Combinatorial Theory, Series A 77 (2) : 344- 348

(1997) Krasikov, I. and Litsyn, S., Linear programming bounds for doubly-even self-dual codes, IEEE Transactions on Information Theory 43 (4) : 1238- 1244 Download publication

(1996) Krasikov, I. and Litsyn, S., On integral zeros of Krawtchouk polynomials, Journal of Combinatorial Theory, Series A 74 (1) : 71- 99

(1996) Krasikov, I., Degree conditions for vertex switching reconstruction, Discrete Mathematics 160 (1-3) : 273- 278

(1995) Krasikov, I. and Litsyn, S., On the accuracy of the binomial approximation to the distance distribution of codes, IEEE Transactions on Information Theory 41 (5) : 1472- 1474 Download publication

(1995) Krasikov, I. and Litsyn, S., On spectra of BCH codes, IEEE Transactions on Information Theory 41 (3) : 786- 788 Download publication

(1994) Krasikov, I., Applications of balance equations to vertex switching reconstruction, Journal of Graph Theory 18 (3) : 217- 225 Download publication

(1994) Caro, Y., Krasikov, I. and Roddity, Y., On induced subgraphs of trees, with restricted degrees, Discrete Mathematics 125 (1-3) : 101- 106

(1994) Krasikov, I. and Roditty, Y., More on vertex-switching reconstruction, Journal of Combinatorial Theory, Series B 60 (1) : 40- 55

(1994) Krasikov, I. and Schönheim, J., On near subgroups, Discrete Mathematics 124 (1-3) : 133- 136

(1994) Krasikov, I. and Roditty, Y., Bounds for the harmonious chromatic number of a graph, Journal of Graph Theory 18 (2) : 205- 209 Download publication

(1993) Alon, N., Caro, Y. and Krasikov, I., Bisection of trees and sequences, Discrete Mathematics 114 (1-3) : 3- 7

(1992) Krasikov, I. and Roditty, Y., Switching reconstruction and diophantine equations, Journal of Combinatorial Theory, Series B 54 (2) : 189- 195

(1991) Caro, Y., Krasikov, I. and Roditty, Y., On the largest tree of given maximum degree in a connected graph, Journal of Graph Theory 15 (1) : 7- 13 Download publication

(1991) Krasikov, I., On a tree-cutting problem of P. Ash, Discrete Mathematics 93 (1) : 55- 61

(1991) Krasikov, I., Interchanging branches and similarity in a tree, Graphs and Combinatorics 7 (2) : 165- 175

(1990) Krasikov, I., A note on the edge-reconstruction of K1,m-free graphs, Journal of Combinatorial Theory, Series B 49 (2) : 295- 298

(1990) Krasikov, I. and Roditty, Y., Some applications of the nash-williams lemma to the edge-reconstruction conjecture, Graphs and Combinatorics 6 (1) : 37- 39

(1990) Krasikov, I. and Roditty, Y., Recent applications of nash-williams lemma to the edge-reconstruction conjecture, Ars Combinatoria 29A 215- 224

(1989) Alon, N., Krasikov, I. and Peres, Y., Reflection sequences, The American Mathematical Monthly 96 (9) : 820- 823

(1989) Alon, N., Caro, Y., Krasikov, I. and Roditty, Y., Combinatorial reconstruction problems, Journal of Combinatorial Theory, Series B 47 (2) : 153- 161

(1988) Krasikov, I. and Roditty, Y., Geometrical reconstruction, Ars Combinatoria 25B 211- 219

(1988) Krasikov, I. and Roditty, Y., Counting technique for reconstuction problems, Ars Combinatoria 25B 133- 140

(1987) Krasikov, I. and Roditty, Y., Balance equations for reconstruction problems, Archiv der Mathematik 48 (5) : 458- 464

(1987) Godsil, CD., Krasikov, I. and Roditty, Y., Reconstructing graphs from their k-edge deleted subgraphs, Journal of Combinatorial Theory, Series B 43 (3) : 360- 363

(1986) Krasikov, I., Ellingham, MN. and Myrvold, W., Legitimate number decks for trees, Ars Combinatoria 21 15- 17

(1985) Caro, Y., Krasikov, I. and Roditty, Y., Spanning trees and some edge reconstuctible graphs, Ars Combinatoria 20A 109- 118

(1985) Krasikov, I. and Schönheim, J., The reconstruction of a tree from its number deck, Discrete Mathematics 53 137- 145

Conference Papers

(1998) Krasikov, I. and Litsyn, S., On the distance distribution of duals of BCH codes, IEEE International Symposium on Information Theory

(1997) Krasikov, I. and Litsyn, S., On upper bounds for the distance of codes of small size, IEEE International Symposium on Information Theory

(1995) Krasikov, I. and Litsyn, S., On the binomial approximation to the distance distribution of codes, IEEE International Symposium on Information Theory

Book Chapters

(1993) Gavril, F., Krasikov, I. and Schönheim, J., Numerical decks of trees. In: Gimbel, J., Kennedy, JW. and Quintas, LV. eds. Quo Vadis, Graph Theory? - A Source Book for Challenges and Directions. (55) : 56- 69

Page last updated: Tuesday 13 May 2014