Abstracts Of Short Communications And Posters Of The ICM 1998 MS Classification 60, 62, 49 Author Moklyachuk, mikhail, Kyiv University SteklovMathematical Institute, Moscow, Russia Title krawtchouk polynomials applied http://www.mathematik.uni-bielefeld.de/icm98/abstracts/ps/late_ps.html
Sources Of Portraits Of Statisticians KRAVCHUK, mikhailo Pylypovich 18921942 = krawtchouk, mikhailo Pylypovich.From p. 425 in OSTROGRADSKY, mikhail Vasilevich 1801-1862. From p.124 in http://www.york.ac.uk/depts/maths/histstat/people/sources.htm
Extractions: PORTRAITS AND ARTICLES FROM BIOGRAPHICAL DICTIONARIES Click here for information about the life and work of statisticans INITIAL LETTER OF SURNAME ABBREVIATIONS USED Complementary information can be found at http://members.aol.com/jayKplanr/images.htm From the internet at http://www-groups.dcs.st-and.ac.uk/~history/BigPictures/Abbe.jpeg DSB , 6-9; ESS From p.242 in S M Stigler, Mathematical statistics in the early states, Annals of Statistics (1978), 239-275, reprinted in S M Stigler and I M Cohen (ed.), American Contributions to Mathematical Statistics in the Nineteenth Century , New York, NY: Arno Publishing Company 1980 (SF STI). DSB , 65-66; DAB
OSU Math - Seminar Search Results acting on pforms, together with the zeros of the krawtchouk polynomials, we 430PM MA417, mikhail Kogan MIT, Geometric Analysis Seminar Localization theorems http://www.math.ohio-state.edu/research/seminar.php?s=Geometric Analysis
Famous Mathematicians With A K Translate this page Julius Konig Samuel Konig Leo Konigsberger Diederik Korteweg Aleksandr KotelnikovSofia Kovalevskaya Edna Kramer Christian Kramp mikhail krawtchouk Mark Krein http://www.famousmathematician.com/az/mathematician_K.htm
4.4 Report on VI International krawtchouk Conference (Kiev) 22. Report on Madison Centennial Conference 23. http://staff.science.uva.nl/~thk/opsfnet/4.4
Extractions: . We will be able to read about positive experiences in the list of accepted papers (http://www.siam.org/journals/sima/maarts.htm). In about one year we intend to write an evaluation in OP-SF Net. Topic #7 OP-SF NET 4.4 - July 15, 1997 ~~~~~~~~~~~~~ From: Tom Koornwinder Subject: Back issues of OP-SF Net >From now on, back issues of OP-SF Net can also be obtained from the URL: http://turing.wins.uva.nl/~thk/opsfnet/ with a more convenient interface. The possibility to download by ftp from: ftp.wins.uva.nl, in directory pub/mathematics/reports/Analysis/koornwinder/opsfnet.dir will remain. Topic #8 OP-SF NET 4.4 - July 15, 1997 ~~~~~~~~~~~~~ From: Editor Subject: Seminar SPECIAL FUNCTIONS and GROUP THEORY, Amsterdam Program 11:00-12.00 Sander Hille (Rijksuniversiteit Leiden) Canonical representations of SU(1,n) associated to a character 12.15-13.15 Joris Van der Jeugt (Universiteit Gent, Belgium) Representation theory and orthogonal polynomials: convolution formulas and bilinear generating functions 14.30-15.30 Hjalmar Rosengren (Lunds Universitet, Sweden) Coupling coefficients and multivariable orthogonal polynomials 16.00-17.00 Tom Koornwinder (Universiteit van Amsterdam) The A1 tableau of Dunkl-Cherednik operators Date: Thursday, September 4, 1997. Place: Department of Mathematics, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam. See http://turing.wins.uva.nl/~koelink/semSFGT.html Contact: Erik Koelink, koelink@wins.uva.nl Topic #11 OP-SF NET 4.4 - July 15, 1997 ~~~~~~~~~~~~~ From: Wolfram Koepf
Untitled Report on VI International krawtchouk Conference (Kiev) 22. Report on Madison Centennial Conference 23. http://www.math.ohio-state.edu/JAT/DATA/OPSFNET/1997.04.fixed
Extractions: . We will be able to read about positive experiences in the list of accepted papers (http://www.siam.org/journals/sima/maarts.htm). In about one year we intend to write an evaluation in OP-SF Net. Topic #7 OP-SF NET 4.4 - July 15, 1997 ~~~~~~~~~~~~~ From: Tom Koornwinder Subject: Back issues of OP-SF Net >From now on, back issues of OP-SF Net can also be obtained from the URL: http://turing.wins.uva.nl/~thk/opsfnet/ with a more convenient interface. The possibility to download by ftp from: ftp.wins.uva.nl, in directory pub/mathematics/reports/Analysis/koornwinder/opsfnet.dir will remain. Topic #8 OP-SF NET 4.4 - July 15, 1997 ~~~~~~~~~~~~~ From: Editor Subject: Seminar SPECIAL FUNCTIONS and GROUP THEORY, Amsterdam Program 11:00-12.00 Sander Hille (Rijksuniversiteit Leiden) Canonical representations of SU(1,n) associated to a character 12.15-13.15 Joris Van der Jeugt (Universiteit Gent, Belgium) Representation theory and orthogonal polynomials: convolution formulas and bilinear generating functions 14.30-15.30 Hjalmar Rosengren (Lunds Universitet, Sweden) Coupling coefficients and multivariable orthogonal polynomials 16.00-17.00 Tom Koornwinder (Universiteit van Amsterdam) The A1 tableau of Dunkl-Cherednik operators Date: Thursday, September 4, 1997. Place: Department of Mathematics, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam. See http://turing.wins.uva.nl/~koelink/semSFGT.html Contact: Erik Koelink, koelink@wins.uva.nl Topic #11 OP-SF NET 4.4 - July 15, 1997 ~~~~~~~~~~~~~ From: Wolfram Koepf
Abstracts We shall give a survey on what is known about the integral zeros ofKrawtchouk polynomials. mikhail Muzychuk, BarIlan U., Israel. http://dimacs.rutgers.edu/Workshops/AssociationSchemes/abstract.html
Extractions: Alexei Ashikhmin , Bell Labs, Lucent Technologies Title: Quantum Error Detection This work is devoted to the problem of error detection with quantum codes. Unlike the classical case the definition of the undetected error event is not so transparent for quantum codes. In our work we define the notion of the quantum undetected error event under natural physical assumptions concerning transmission with error detection over the depolarizing channel. This allows us to derive an expression for the probability of quantum undetected error as a function of the weight enumerator of a quantum code. In the second part of the work we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent. The lower (existence) bound for stabilizer codes is proved by a counting argument for classical self-orthogonal quaternary codes. Upper bounds for any quantum codes are proved by linear programming. We present two general solutions of the LP problem. Together they give an upper bound on the exponent of undetected error. The upper and lower asymptotic bounds coincide for a certain interval of code rates close to 1. Christine Bachoc , University of Bordeaux, France Title: Harmonic weight enumerators They can be used to compute the coset distribution of C, and to help the classification of extremal codes. Explicit computations in the quantum case will be presented.
Full Alphabetical Index List of mathematical biographies indexed alphabetically http://www-groups.dcs.st-and.ac.uk/~history/Indexes/Full_Alph.html
Full Alphabetical Index Translate this page Full Alphabetical Index. Click below to go to one of the separatealphabetical indexes A B C D E F G H IJ K L M N O PQ R S T UV W http://www.maththinking.com/boat/mathematicians.html
