Honorary Fellow Derrick Henry Lehmer

Derrick Henry Lehmer. The wide scope of Professor Lehmer's research in Combinatorics, Number Theory, Computational Techniques, and the interconnections that exist among these areas can best be grasped by looking at the three volumes of his "Selected Papers" that appeared in 1981. Much of modern combinatorics is heavily dependent on on the computer, and Professor Lehmer, fallowing in a family tradition, has been a godfather to the development of computer algorithms, generating computational results, and getting other researchers to recognize the importance of computation.

From his citation as one of the first Honorary Fellows, BICA (1), 1991.

From his well-cited wikipedia page:
Derrick Henry "Dick" Lehmer (February 23, 1905 – May 22, 1991) was an American mathematician who refined Édouard Lucas' work in the 1930s and devised the Lucas–Lehmer test for Mersenne primes. Lehmer's peripatetic career as a number theorist, with him and his wife taking numerous types of work in the United States and abroad to support themselves during the Great Depression, fortuitously brought him into the center of research into early electronic computing.

Comments

Post a Comment

Popular posts from this blog

The Combinatorics 2018 conference June 3 to 9, 2018 in Arco, Province of Trento, Italy

Image
Skip to content. | Skip to navigation Search Site Advanced Search… Site Map   Accessibility   Contact   Personal tools Log in This is SunRain Plone Theme Navigation Home About us Research Groups Conferences Area privata Combinatorics 2018       You are here:   Home   /  Combinatorics 2018 Combinatorics 2018 The Combinatorics 2018 conference will be organised by the research groups of the Universities of Brescia (Catholic and State Universities), Padova, and Verona. It will take place from June 3 to 9, 2018 in Arco, Province of Trento, Italy. It will be the 20th edition of this conference held in Italy--the first one in 1981, the second in 1982, and every two years ever since--with the participation of many experts in finite geometries and their applications from all over the world. The main themes of the conference will be Finite Geometries, Incidence Structures, Combinatorial Designs and Graph Theory. Arc
Read more

Conference announcement: FQ15 13-17 June 2022, Aubervilliers, France

 https://fq15.telecom-paris.fr/ International Conference on Finite Fields and Their Applications 2022 (Fq15) The conference  Fq15  will take place at Campus Condorcet, Aubervilliers, France (on line 12 of the Paris metro, at one station from the limit of Paris) during the week of June 13-17, 2022. Fq15  will continue the 30-year-old tradition of a forum for researchers on the mathematical aspects of finite fields and their applications.  Scientific Scope Topics of interest include, but are not limited to: Theory: structure of finite fields, primitive elements, normal bases, polynomials, number-theoretic aspects of finite fields, character sums, function fields, planar functions and almost perfect nonlinear functions, equations over finite fields. Computation: algorithms and complexity, polynomial factorization, decomposition, and irreducibility testing, sequences and functions. Applications: algebraic coding theory, cryptography, algebraic geometry over finite fields, finite incidence
Read more

Conference Announcement: International Conference on Finite Fields and Their Applications 2022 (Fq15)

 https://fq15.telecom-paris.fr/ The conference  Fq15  will take place at Campus Condorcet, Aubervilliers, France (on line 12 of the Paris metro, at one station from the limit of Paris) during the week of June 13-17, 2022. Fq15  will continue the 30-year-old tradition of a forum for researchers on the mathematical aspects of finite fields and their applications. Previous editions of the  Fq  conference could be found  here . Scientific Scope Topics of interest include, but are not limited to: Theory: structure of finite fields, primitive elements, normal bases, polynomials, number-theoretic aspects of finite fields, character sums, function fields, planar functions and almost perfect nonlinear functions, equations over finite fields. Computation: algorithms and complexity, polynomial factorization, decomposition, and irreducibility testing, sequences and functions. Applications: algebraic coding theory, cryptography, algebraic geometry over finite fields, finite incidence geometry, desi
Read more