Yves Meyer has been selected to win the 2017 Abel Prize. The citation is “for his pivotal role in the development of the mathematical theory of wavelets”. His work is certainly well known within mathematics, especially within harmonic analysis and in its important applications in image processing, data compression, signal analysis, and many other modern settings.

There are announcements of the prize in various places:

I will defer to these other sources for general information about the prize and about Meyer’s work. Here I would like to bring out a few aspects of his work with the help of *Mathematical Reviews*. First of all, at the time of this writing, there are 8448 items in MathSciNet with the word “wavelet” or “wavelets” in the title. Looking for either “wavelet” or “wavelets” anywhere in our records for items produces 13705 matches. The earliest is

MR0001894 Baker, Bevan B.; Copson, E. T. *The Mathematical Theory of Huygens’ Principle*. Oxford University Press, New York, (1939). vii+155 pp.

where “spherical wavelets” are mentioned in the review. (I suspect that these are not the same thing we normally think of as wavelets.)

Secondly, since citations are a big thing these days, let me point out that in MathSciNet, Meyer is cited 4834 times by 3262 authors. His most highly cited work is, not surprisingly, about wavelets:

MR1228209 Meyer, Yves. *Wavelets and operators*. Translated from the 1990 French original by D. H. Salinger. Cambridge Studies in Advanced Mathematics, 37. Cambridge University Press, Cambridge, 1992. xvi+224 pp. ISBN: 0-521-42000-8; 0-521-45869-2

This is the first part of a multi-part book. The second part was published as

MR1456993 Meyer, Yves; Coifman, Ronald. *Wavelets. Calderón-Zygmund and multilinear operators*. Translated from the 1990 and 1991 French originals by David Salinger. Cambridge Studies in Advanced Mathematics, 48. Cambridge University Press, Cambridge, 1997. xx+315 pp. ISBN: 0-521-42001-6; 0-521-79473-0

The book was published in two parts in English, but in three parts in French:

MR1085487 Meyer, Yves. *Ondelettes et opérateurs. I. Ondelettes*. Actualités Mathématiques. Hermann, Paris, 1990.

MR1085488 Meyer, Yves. *Ondelettes et opérateurs. II. Opérateurs de Calderón-Zygmund*. Actualités Mathématiques. Hermann, Paris, 1990.

MR1160989 Meyer, Yves; Coifman, R. R. *Ondelettes et opérateurs. III. Opérateurs multilinéaires*. Actualités Mathématiques. Hermann, Paris, 1991

Meyer and Coifman have 37 joint publications listed in MathSciNet. The earliest is a paper on singular integrals published in the *Transactions of the AMS*. Their most frequently cited joint work is on pseudodifferential operators, and was published as a volume in the esteemed series *Astérisque* from the Société Mathématique de France*.*

Meyer has published three books with the American Mathematical Society:

MR1342019 Jaffard, Stéphane; Meyer, Yves. *Wavelet methods for pointwise regularity and local oscillations of functions*. Mem. Amer. Math. Soc. 123 (1996), no. 587, x+110 pp.

MR1483896 Meyer, Yves. *Wavelets, vibrations and scalings*. With a preface in French by the author. CRM Monograph Series, 9. American Mathematical Society, Providence, RI, 1998. x+133 pp. ISBN: 0-8218-0685-8

MR1852741 Meyer, Yves. *Oscillating patterns in image processing and nonlinear evolution equations*. The fifteenth Dean Jacqueline B. Lewis memorial lectures. University Lecture Series, 22. American Mathematical Society, Providence, RI, 2001. x+122 pp. ISBN: 0-8218-2920-3

There was a story last year about a recent result of Meyer’s. Meyer was looking at variations on the Poisson formula as given in the work of Nir Lev and Alexander Olevskii, Quasicrystals with discrete support and spectrum. *Rev. Mat. Iberoam.* 32 (2016), no. 4, 1341–1352 [MR3593527]. After lecturing several times on the result, Meyer came up with a simpler proof of the result. Like any good researcher, before sending off the paper to a journal, he checked the existing literature. In the references to the Lev and Olevskii paper, he found a paper by Guinand:

MR0107784 Guinand, A. P. Concordance and the harmonic analysis of sequences. *Acta Math*. 101 1959 235–271.

Meyer dug up a copy of the paper and was surprised to find that Guinand had the same solution as his own. But no one had noticed this. Lev and Olevskii had not. Nor, apparently, had Salomon Bochner, who made no mention of it in his review of the paper in Mathematical Reviews. Meyer adjusted his paper accordingly, giving priority to Guinand, and it was published in the Proceedings of the National Academy of Science USA:

MR3482845 Meyer, Yves F. Measures with locally finite support and spectrum. *Proc. Natl. Acad. Sci. USA* 113 (2016), no. 12, 3152–3158.

In the section labeled *Significance*, Meyer wrote, “Our new Poisson’s formulas were hidden inside an old and almost forgotten paper published in 1959 by A. P. Guinand.”

Wavelet image by JonMcLoone – Own work, CC BY-SA 3.0, Link

]]>Smith seems to enjoy the communal aspects of mathematics. She has organized conferences and two special years at MSRI. She also has an excellent reputation as a teacher — to date, she has supervised 16 Ph.D. students — and as a speaker. This is a photograph of her as she gave a lively invited address at an AMS meeting in Albuquerque. It is one of the few where she is not so animated as to be out of focus. Smith is an active collaborator, having written papers and books with 32 different coauthors. This is her coauthor cloud diagram on MathSciNet:

Smith has written two books (both with coauthors) that are listed in MathSciNet:

MR2062787

Kollár, János; Smith, Karen E.; Corti, Alessio

Rational and nearly rational varieties.

Cambridge Studies in Advanced Mathematics, 92. Cambridge University Press, Cambridge, 2004. vi+235 pp. ISBN: 0-521-83207-1

MR1788561

Smith, Karen E.; Kahanpää, Lauri; Kekäläinen, Pekka; Traves, William

An invitation to algebraic geometry.

Universitext. Springer-Verlag, New York, 2000. xii+155 pp. ISBN: 0-387-98980-3

She has another:

Johdatusta algebralliseen geometriaan by Lauri Kahanpää, Karen E. Smith and Pekka Kekäläinen, which she describes as the Finnish version of *An Invitation to Algebraic Geometry*.

The second book is aptly titled, as the writing is engaging and, as our reviewer wrote, it “will recruit new enthusiasts” to the subject.

In an earlier blog post, I mentioned the cross-linking between MathSciNet and the MacTutor History of Mathematics Archive. Smith is among the small group of living mathematicians to have a biography on the MacTutor site. The Agnes Scott site of Biographies of Women Mathematicians also has a biography of Smith.

Let me close with a few reviews of Karen Smith’s work.

**MR3352824**

Benito, Angélica(1-MI); Muller, Greg(1-MI); Rajchgot, Jenna(1-MI); Smith, Karen E.(1-MI)

Singularities of locally acyclic cluster algebras.

*Algebra Number Theory* 9 (2015), no. 4, 913–936.

13F60 (13A35 14B05)

Cluster algebras were introduced by S. Fomin and A. Zelevinsky [J. Amer. Math. Soc. 15 (2002), no. 2, 497–529; MR1887642]. Locally acyclic cluster algebras, recently introduced in [G. Muller, Adv. Math. 233 (2013), 207–247; MR2995670], are a large class of cluster algebras which include many interesting examples from representation theory and Teichmüller theory.

In this paper, the authors focus on the properties of singularities of locally acyclic cluster algebras over an arbitrary field $k$. Let ${\mathcal A}$ be a locally acyclic cluster algebra. The main theorem is that ${\mathcal A}$ over an $F$-finite field $k$ of prime characteristic is strongly $F$-regular and ${\mathcal A}$ over a field $k$ of characteristic zero has $($at worst$)$ canonical singularities, where $F$ is the Frobenius endomorphism. In addition, they also show that the upper cluster algebra ${\mathcal U}$ determined by ${\mathcal A}$ is always Frobenius split.

On the other hand, when ${\mathcal A}$ is nonlocally acyclic, the authors prove the following result: If ${\mathcal A}$ is strongly $F$-regular then ${\mathcal U}$ is strongly $F$-regular. Moreover, they also provide examples which demonstrate that in this case the strong $F$-regularity of ${\mathcal U}$ is still possible, though not necessary.

Finally, the authors claim that the lower bound algebra is also Frobenius split and investigate the canonical modules of upper cluster algebras in the Appendix.

Reviewed by Yichao Yang

**MR2068967**

Ein, Lawrence(1-ILCC); Lazarsfeld, Robert(1-MI); Smith, Karen E.(1-MI); Varolin, Dror(1-IL)

Jumping coefficients of multiplier ideals.

*Duke Math. J.* 123 (2004), no. 3, 469–506.

14B05 (32S05)

The authors introduce new invariants, which are generalizations of the log canonical threshold in a natural way: Let $X$ be a smooth complex algebraic variety and let $x \in X$ be a fixed point. Given an effective divisor $A$ on $X$, for any rational number $c>0$, one can define the multiplier ideal ${\mathcal J}(X, c\cdot A) \subseteq{\mathcal O}_X$. Then there exists an increasing sequence$$0=\xi_0(A;x)<\xi_1(A;x)<\xi_2(A;x)< \cdots$$ of rational numbers $\xi_i=\xi_i(A;x)$ characterized by the following properties: ${\mathcal J}(X, c \cdot A)_x ={\mathcal J}(X, \xi_i \cdot A)_x$ for $c \in [\xi_i, \xi_{i+1})$, while $${\mathcal J}(X, \xi_{i+1} \cdot A)_x \neq{\mathcal J}(X,\xi_{i} \cdot A)_x$$ for every $i$. Here $\xi_1$ is the log canonical threshold of $A$ at $x$. The authors call these rational numbers $\xi_i(A;x)$ the jumping coefficients or jumping numbers of $A$ at $x$. The paper under review develops the theory of jumping coefficients and gives a number of applications.

In Section 1, several formal properties of jumping coefficients are established by taking advantage of geometric properties of multiplier ideals which the reader can find in R. K. Lazarsfeld’s book [Positivity in algebraic geometry. II, Springer, Berlin, 2004; MR2095472]. In Section 2, a result due to Kollár and others [B. Lichtin, Ark. Mat. 27 (1989), no. 2, 283–304; MR1022282; J. Kollár, in Algebraic geometry—Santa Cruz 1995, 221–287, Proc. Sympos. Pure Math., 62, Part 1, Amer. Math. Soc., Providence, RI, 1997; MR1492525; T. Yano, Publ. Res. Inst. Math. Sci. 14 (1978), no. 1, 111–202; MR0499664] concerning a relationship between the log canonical threshold and the Bernstein-Sato polynomial is generalized. Developing further the line of Kollár’s argument, the authors show that if $\xi$ is a jumping coefficient of $f \in \Bbb{C}[t_1, \dots, t_d]$ lying in the interval $(0,1]$, then $-\xi$ is a root of the Bernstein-Sato polynomial of $f$. In Section 3, the authors connect jumping coefficients to uniform Artin-Rees numbers, which were introduced by C. L. Huneke [Invent. Math. 107 (1992), no. 1, 203–223; MR1135470]. As a corollary, they prove that if $(f=0)$ has an isolated singularity at a point $x \in X$ but otherwise is smooth, then $\tau(f,x)+\dim X$ is a uniform Artin-Rees number for $f$, where $\tau(f,x)$ denotes the Tyurina number of $f$ at $x$. In the last section, the authors attach jumping coefficients to graded families ${\mathfrak a}_{\bullet}$ of ideals using the asymptotic multiplier ideals ${\mathcal J}(c \cdot{\mathfrak a}_{\bullet})$ and establish a few results on them. These invariants are not necessarily rational and they point out that the collection of jumping coefficient of ${\mathfrak a}_{\bullet}$ can contain cluster points, but it satisfies the DCC.

The jumping coefficients are closely related to several other invariants and shed a new light on singularity theory.

Reviewed by Shunsuke Takagi

**MR1826369**

Ein, Lawrence(1-ILCC); Lazarsfeld, Robert(1-MI); Smith, Karen E.(1-MI)

Uniform bounds and symbolic powers on smooth varieties.

*Invent. Math.* 144 (2001), no. 2, 241–252.

13A10 (13H05 14Q20)

The authors use the theory of multiplier ideals to prove several uniform bounds, the most remarkable of which are the uniform bounds for symbolic powers on smooth varieties. Namely, if $X$ is a non-singular quasi-projective variety defined over the complex numbers and $Z$ is a reduced subscheme of $X$, let ${\mathfrak q}$ be the ideal sheaf of $Z$. If all the irreducible components of $Z$ have codimension at most $e$ in $X$, then the authors prove that for all $n \ge 1$, ${\mathfrak q}^{(ne)}\subseteq{\mathfrak q}^n$. The key ingredients in this remarkable constructive result are the asymptotic multiplier ideals and the subadditivity property of multiplier ideals, the latter proved by J.-P. Demailly, L. M. H. Ein and R. K. Lazarsfeld [Michigan Math. J. 48 (2000), 137–156; MR1786484].

Inspired by the results of this paper, Hochster and Huneke extended this symbolic powers result to arbitrary Noetherian regular rings containing a field [M. Hochster and C. Huneke, “Comparison of symbolic and ordinary powers of ideals”, preprint, 2000; per bibl.]. Hochster and Huneke used the theory of tight closure, pointing to yet another connection between multiplier ideals and tight closure. (For other such connections [see, e.g., K. E. Smith, Comm. Algebra 28 (2000), no. 12, 5915–5929 MR1808611 ].)

The reviewer had proved that (under fewer assumptions) there exists an integer $l$ such that for all $n$, ${\mathfrak q}^{(nl)}\subseteq{\mathfrak q}^n$ [Math. Z. 234 (2000), no. 4, 755–775; MR1778408], but the construction there does not produce the integer $l$ even with the extra restrictions of either the paper under review or of the paper of Hochster and Huneke.

Ein, Lazarsfeld and Smith also prove the analogous uniform bounds when the family of symbolic powers of a radical ideal is generalized to any countable graded family of nonzero ideals $\{{\mathfrak a}_n\}$ satisfying ${\mathfrak a}_n\cdot{\mathfrak a}_m \subseteq{\mathfrak a}_{n+m}$ for all $n,m\ge1$. A special case is when ${\mathfrak a}_n$ is the contraction of the $n$th power of the maximal ideal of a Rees valuation (i.e., a prime divisor of the first kind), giving a constructive improvement of a restricted case of Izumi’s theorem [S. Izumi, Publ. Res. Inst. Math. Sci. 21 (1985), no. 4, 719–735; MR0817161], [D. Rees, in Commutative algebra (Berkeley, CA, 1987), 407–416, Springer, New York, 1989; MR1015531], or [R. Hübl and I. Swanson, J. Pure Appl. Algebra 161(2001), no. 1-2, 145–166 MR1834082 ].

Reviewed by Irena Swanson

*Quanta* has an interview by Siobhan Roberts with Sylvia Serfaty, a mathematician at the Courant Institute who work in analysis, PDEs, and mathematical physics. Serfaty is by any measure a successful mathematician. She publishes three or four articles per year in good journals. She has written a successful book with Étienne Sandier. She has won some great prizes. Yet Serfaty does not consider herself a genius. Moreover, she disputes the idea that you need to be a genius or a prodigy to do mathematics. While there are geniuses in mathematics, they are rare. She correctly points out that you don’t have to be in that thin slice to do interesting mathematics. Rather, to be successful you have to be curious and persistent. Serfaty says, “You enjoy solving a problem if you have difficulty solving it. The fun is in the struggle with a problem that resists.”^{1}

Serfaty is not alone in this point of view. Terry Tao wrote on his blog:

Does one have to be a genius to do mathematics?

The answer is an emphatic **NO**. In order to make good and useful contributions to mathematics, one does need to work hard, learn one’s field well, learn other fields and tools, ask questions, talk to other mathematicians, and think about the “big picture”. And yes, a reasonable amount of intelligence, patience, and maturity is also required. But one does **not** need some sort of magic “genius gene” that spontaneously generates *ex nihilo* deep insights, unexpected solutions to problems, or other supernatural abilities.

Tao cites an article in *New Scientist *magazine that makes the same point: most people who do incredible work are not necessarily mutants. Rather, for the most part, they find something that interests them deeply, then work very hard to make progress.

In the spirit of using MathSciNet to dig more deeply into an article in *Quanta*, below is a copy of the review of the book by Serfaty and Sandier mentioned in the interview. In the meantime, I recommend *Quanta* for its articles on mathematics — and other things.

– – – – –

** ^{1}** When my students used to complain that something was hard, I would tell them, “It wouldn’t be fun if it wasn’t hard.” This went down better with the graduate students than the undergrads.

**MR2279839**

Sandier, Etienne(F-PARIS12); Serfaty, Sylvia(1-NY-X)

Vortices in the magnetic Ginzburg-Landau model.

Progress in Nonlinear Differential Equations and their Applications, 70. *Birkhäuser Boston, Inc., Boston, MA,* 2007. xii+322 pp. ISBN: 978-0-8176-4316-4; 0-8176-4316-8

This book presents a detailed and comprehensive account of the rigorous mathematical analysis of the Ginzburg-Landau model of superconductivity in two dimensions. In the planar Ginzburg-Landau model, the state of a superconductor with cross-section $\Omega\subset\Bbb R^2$ is described by a complex order parameter, $u\in H^1(\Omega;\Bbb C)$ and magnetic vector potential $A\in H^1(\Omega; \Bbb R^2)$, so that the magnetic field $h=\nabla \times A$ is oriented orthogonally to the plane. Assuming the superconductor is exposed to an external magnetic field of constant intensity $h_{\rm ex}$, the physically observable configurations $(u,A)$ should minimize, $$ G_\epsilon (u,A) = \int_\Omega \left\{ \frac12 |(\nabla – iA)u|^2 + {1\over 4\epsilon^2}(|u|^2-1)^2 + \frac12 (h-h_{\rm ex})^2\right\} dx. $$ Here $\epsilon>0$ is the reciprocal of the Ginzburg-Landau parameter. Most results in this book concern the singular limit $\epsilon\to 0$.

The largest part of the book concerns the structure of energy minimizers for external fields $h_{\rm ex}$ nearby the “lower critical field” $H_{c_1}\sim |\ln\epsilon|$, the smallest value of the external field at which vortices are observed. In fact, the book illustrates how complex and interesting the $\epsilon\to 0$ limit actually is, with different types of minimizers appearing depending on the order of $h_{\rm ex}-H_{c_1}$.

For $h_{\rm ex}$ close to $H_{c_1}$, $h_{\rm ex}- H_{c_1}=O(\ln|\ln\epsilon|)$, they prove that minimizers have finitely many vortices, the number being bounded in $\epsilon$. As $\epsilon\to 0$ these vortices will accumulate at specific points in the domain, determined by the minimum of $h$ for vortexless configurations. This result was first proven by the authors in [Calc. Var. Partial Differential Equations 17 (2003), no. 1, 17–28; MR1979114], but here they refine their result by blowing up around the limiting points. They obtain an asymptotic expansion of the critical fields at which additional vortices are produced, as well as a renormalized energy to determine the configuration of the vortices around the concentration point.

If $h_{\rm ex}-H_{c_1}=O(|\ln\epsilon|)$, they show that minimizers will have an unbounded number of vortices as $\epsilon\to 0$, and these vortices will spread out over the sample $\Omega$. They present the result of [E. Sandier and S. Serfaty, Ann. Sci. École Norm. Sup. (4) 33 (2000), no. 4, 561–592; MR1832824], proving that the suitably normalized vorticity measure and magnetic field $h$ converge to a solution to an obstacle problem for $h$. The result is presented here in the framework of gamma convergence.

The book presents some original, previously unpublished results for the regime where $\ln|\ln\epsilon| \ll h_{\rm ex}- H_{c_1} \ll |\ln\epsilon|$. In this limit, minimizers have an unbounded number of vortices which nevertheless accumulate at points, as in the first case above. After blowing up around these points, the authors prove that the normalized vortex interaction energy $\Gamma$-converges to a classical Gauss variation problem from potential theory.

Many other results are also presented, including a study of bifurcation branches of local minimizers with fixed numbers of vortices and some new results on vorticity measures for nonminimizing solutions of the Ginzburg–Landau equations.

Several new techniques (and improvements on recent methods) are introduced. The methods used in proof are based on sharp matching upper and lower bounds on the energy. Most results depend on improving lower bounds on the energy, and the authors derive new sharp versions of the “vortex ball” constructions (see [E. Sandier, J. Funct. Anal. 152 (1998), no. 2, 379–403; MR1607928] or [R. L. Jerrard, SIAM J. Math. Anal. 30 (1999), no. 4, 721–746 (electronic); MR1684723].) Another new technique introduced in the book combines the vortex ball construction with the Pohozaev identity to obtain a finer analysis of vortices. The Pohozaev balls method is instrumental in the analysis of configurations with finitely many vortices, and leads to a sharpening and simplification of classical results of F. Bethuel, H. R. Brezis and F. Hélein [Ginzburg-Landau vortices, Birkhäuser Boston, Boston, MA, 1994; MR1269538].

Given the prevalence of Ginzburg-Landau-type models in condensed matter physics, these techniques are likely to find many applications and extensions in other singularly perturbed problems with quantized singularities, such as Bose-Einstein condensates, gauge field theories (such as Chern-Simons-Higgs), ferromagnetism, and liquid crystals.

Reviewed by Stanley A. Alama

]]>Plenty. Citation counts depend on matching algorithms. The algorithms try to pair an item in the reference list of an article with a known item in a database. Usually, you want to have matches or near matches on multiple points: author name, title, year of publication, page range, source (name of the journal). However, bibliographic styles are not consistent. And some authors make mistakes or take shortcuts, providing too little information. Some journals enforce telegraphic reference styles. Here is an example I chose at random from a respected physics journal:

- R. Yang and Z. Q. Wu,
*Earth Planet. Sci. Lett.***404**, 14 (2014). - J. C. Crowhurst, J. M. Brown, A. F. Goncharov, and S. D. Jacobsen,
*Science***319**, 451 (2008). - H. Marquardt, S. Speziale, H. J. Reichmann, D. J. Frost, and F. R. Schilling,
*Earth Planet. Sci. Lett.***287**, 345 (2009).

Note that there are no titles. Also, a page range isn’t given, just a starting page. This style makes it hard for the matching algorithm, but it is a standard style in the physics literature, not just this journal.

Some old-school citations are almost impossible for an algorithm to find. Here’s an old old-school example, from an old paper by Lefschetz in the Annals of Mathematics in 1920 .

• • • • •

The references are given almost as prose, but heavily abbreviated. My copy of Whittaker and Watson is full of citations as footnotes. (And I can only imagine how many times that book is referenced the way I just did, by the authors’ names, not by the title.¹) Such citations are rarer now, but they still occur.

Errors in citations can propagate. When I wrote my PhD thesis, an important result that I used was the Borel-Weil-Bott Theorem. Bott’s paper is

MR0089473

Bott, Raoul

Homogeneous vector bundles.

*Ann. of Math. (2)* **66** (1957), 203–248.

However, I found that many papers cited it incorrectly. Moreover, I could see that some authors copied the citation to Bott’s paper from the references in another paper. If one paper had it incorrect, then subsequent articles make the same mistake. I don’t remember exactly which ones I encountered way back in grad school, but examples are easy to find. For instance, one paper has the year and pages correct, but has the volume number as 56. Another puts the volume number at 60. (Getting warmer!) Kostant’s paper establishing his famous formula for the multiplicity of a weight gets everything right except the page range. In his paper on Lie algebra cohomology and the Borel-Weil-Bott Theorem (published two years later), Kostant has a complete and correct citation.

Citations to books can be troublesome. Often, the citation is spare, giving the author, title, and year. Here is a citation from a paper published in 2016 to a famous book by Dautray and Lions:

21. Dautray R, Lions JL. *Mathematical Analysis and Numerical Methods for Sciences and Technology*. Springer: Berlin, 1990.

We matched that to

**MR1036731**

Dautray, Robert(F-POLY); Lions, Jacques-Louis(F-CDF)

Mathematical analysis and numerical methods for science and technology. Vol. 1.

Physical origins and classical methods. With the collaboration of Philippe Bénilan, Michel Cessenat, André Gervat, Alain Kavenoky and Hélène Lanchon. Translated from the French by Ian N. Sneddon. With a preface by Jean Teillac. *Springer-Verlag, Berlin,* 1990. xviii+695 pp. ISBN: 3-540-50207-6; 3-540-66097-6.

But it could also have been Volume 3 or Volume 4, which were also published in 1990:

**MR1064315**

Dautray, Robert(F-POLY); Lions, Jacques-Louis(F-CDF)

Mathematical analysis and numerical methods for science and technology. Vol. 3.

Spectral theory and applications. With the collaboration of Michel Artola and Michel Cessenat. Translated from the French by John C. Amson. *Springer-Verlag, Berlin,* 1990. x+515 pp. ISBN: 3-540-50208-4; 3-540-66099-2

**MR1081946**

Dautray, Robert(F-POLY); Lions, Jacques-Louis(F-CDF)

Mathematical analysis and numerical methods for science and technology. Vol. 4.

Integral equations and numerical methods. With the collaboration of Michel Artola, Philippe Bénilan, Michel Bernadou, Michel Cessenat, Jean-Claude Nédélec, Jacques Planchard and Bruno Scheurer. Translated from the French by John C. Amson. *Springer-Verlag, Berlin,* 1990. x+465 pp. ISBN: 3-540-50209-2; 3-540-66100-X

Volume 2 was published in 1988. Volume 5 was 1992, and Volume 6 was 1993.

Formats vary greatly, with some including the city of publication, some including series information (such as *Ergebnisse* or maybe *Ergebnisse der Mathematik* or *Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge*). If the series information is given, a volume number might be included. In checking changes in citations after releasing the new features for MathSciNet, we realized that there were instances of a citation to a book in a series mixing up the volume number and the year of publication. (We fixed them.)

The propagation of the errors with citations to Bott’s paper described above was partly due to authors taking a shortcut. Few people wanted to figure out the appropriate abbreviation for the *Annals of Mathematics* or where to put the volume number versus the publication year. So many of us looked at the references in another paper to sort that out. With some of the tools built into MathSciNet, such shortcuts are no longer necessary. At Mathematical Reviews, we work very hard to make sure we have complete and accurate bibliographic information for the entries in MathSciNet. We also work hard to make it easy for you to use that information. My earlier post References and Citations tells you ways to do that, including obtaining the information in BibTeX format.

If you use the bibliographic data from MathSciNet in your references, then everybody’s matching algorithms will have a much easier time pairing those references with the paper in their databases. This helps people count. And you will have an easier time writing up the paper!

¹ This is related to the problem of *Alice’s Restaurant*. Sometimes what we call a thing is not the name of the thing. There is a song called *Alice’s Restaurant*, which is about Alice’s restaurant. But “Alice’s Restaurant” is not the name of the restaurant – it’s just the name of the song *about* the restaurant.

**We have given MathSciNet some upgrades.**

As of January 3rd, 2017, MathSciNet will be running on new software, which has allowed us to add some great new features, with more to come in February 2017. This post provides some highlights of how MathSciNet is bigger, better, faster, more.

And please visit the AMS Booth at the JMM in Atlanta to see demonstrations of the new features of MathSciNet, as well as to meet some of the Editors from Mathematical Reviews. There will be free access to MathSciNet at JMM!

Lists of search results will be sortable in a number of different ways, including chronologically, reverse chronologically, and by citations.

Here are the results of a search for publications with Anywhere=(fundamental lemma), sorted three different ways:

**Classic sort: Newest First**

**Oldest First**

**Sorted by Number of Citations**

Previously, searches in MathSciNet assumed you were looking for a phrase. Now, searches in MathSciNet insert Boolean **AND** between terms by default. Thus, the search

will return all items where the word **fundamental** and the word **lemma** both occur somewhere. They need not be adjacent.

The search

will search for the phrase **fundamental lemma** anywhere in our listing of the item. The two words will need to be adjacent to each other.

Here is what the results of the second search, for “fundamental lemma”, look like:

Notice that the number of matches has dropped from 2510 to 512, which is to be expected.

Here are the results sorted by citations:

Lists of search results will now include facets that allow users to filter and refine searches. These are the choices listed in the sidebar on the left. The possible refinements here are item type, author, institution, primary classification, journal, and year. Returning to the example just listed (searching for the phrase “fundamental lemma”), we can refine the search by choosing an author:

These matches are based on the author identification (author disambiguation) that goes into creating the Mathematical Reviews author database. (See Who Wrote That? for more on our author identification.) The numbers in parentheses tell how many matches there are: 14 matches for Báo Châu Ngô, 13 for Yuval Z. Flicker, 13 for Jean-Loup Waldspurger, and so on.

Clicking on **Laumon, Gérard** produces

Notice that the refined results are still sorted by number of citations. The choice of sorting follows along with the refining process.

In this screen shot, notice that the first two items have a light blue background:

That is because the two items are related. Indeed, they are Parts I and II. We gather them together, even though they were published as two separate books. Indeed, they have one joint review, written by Jonathan David Rogawski.

We can further refine the search by making a choice of Primary Classification.

We see that there are just two choices: Number Theory (MSC=11) with 6 items and Topological groups, Lie groups (MSC=22) with 4 items. Let’s look at the 4 items with primary classification Topological groups, Lie groups:

Notice that the results are still sorted by “Citations”.

Another way to refine these results further is to enter a new search term in the “Search within results” box. This adds the new search term and looks for it anywhere in our record for the item: Author, Title, Journal, Review Text, etc. This example is left as an exercise to the reader…

**[This section was updated 2017 March 03 to reflect some refinements to Author Searches]**

The results of an Author Search now display with more information. Let’s use the Fields Medalist Wendelin Werner as an example, pretending that we don’t remember his first name. Navigating to the **Authors** tab, we enter “Werner” in the search field.

The results look vastly different now:

There is plenty of extra information to help choose the Werner we were actually looking for. In this case, there are 104 matches. My screen shot only allows us to see the first 12, sorted by Profile Name. **Note** that the search is looking for “Werner” only as a last name. (An earlier version of New MathSciNet looked in both first name and last name.) By default, the results are listed alphabetically by Profile Name (the name that appears in the Author Profile). We can re-sort by Citations:

There are a few matches with lots of citations. One of them has 1548 citations. We can also see that this Werner started publishing at around the right time to have recently won a Fields Medal. Clicking on Werner, Wendelin brings us to his Author Profile page on MathSciNet

An alternative way to have found Wendelin Werner, assuming we knew something of his mathematics, would have been to refine by Primary Classification. That is to say, to select the classification in which he has published most frequently. In Werner’s case, that is Probability Theory and Stochastic Processes (MSC=60). Note that 6 of these authors have this class as their most frequently occurring MSC.

Selecting Probability Theory and Stochastic Processes yields

Note that, again, the sorting by Citations has followed us as we have refined the search. Wendelin Werner, the Fields Medalist, is still the top result. Clicking on his name leads us again to his Author Profile page

These are just a few highlights of what can be done with the new features of MathSciNet. You can watch a demo video of some of the sorting and faceting improvements. (The video was made when the new features were still prototypes – so some things will look slightly different.) But, the best thing is to try them out — after January 3rd!

And keep watch for more new features that will come later in 2017:

**Search Result Alerts:**Users will be able to log in and create email alerts that will send them any new results for queries that they create. This will allow users to be notified when, for example, an author’s citations count changes, or a new issue is added to a journal.**Autosuggest for Journals and Author Search Boxes:**MathSciNet’s journals and author search boxes will now suggest useful search strings for journal titles and author names.

I would be remiss if I didn’t thank **Erol Ozil**. He is the head of IT at Mathematical Reviews and is the mastermind behind these new features. To begin with, he set the stage for the upgrades by initiating the change in our search software. He then did an amazing job of getting the changes coded in the new environment. As database experts know, this requires restructuring the underlying databases to take advantage of the new code. There were a thousand issues, both large and small, that came up along the way. Erol dealt with them all.

Thank you, Erol.

]]>

Here is a list of the prizewinners that have been announced so far, with links to their Author Profiles on MathSciNet and to the news announcements of the prizes. (A list of all AMS Prizes and Awards is available here.) From the Author Profiles, you can explore the award-winning work of these mathematicians.

- James G. Arthur to receive 2017 AMS Steele Prize for Lifetime Achievement
- Leon Simon to receive 2017 AMS Steele Prize for Seminal Contribution to Research
- Dusa McDuff and Dietmar Salamon to receive 2017 AMS Steele Prize for Exposition
- András Vasy to receive 2017 AMS Bôcher Prize
- Henri Darmon to receive 2017 AMS Cole Prize in Number Theory
- Laura DeMarco to receive 2017 AMS Satter Prize
- László Erdős and Horng-Tzer Yau to receive 2017 AMS Eisenbud Prize
- John Friedlander and Henryk Iwaniec to receive 2017 AMS Doob Prize
- David Bailey, Jonathan Borwein, Andrew Mattingly, and Glenn Wightwick to receive 2017 AMS Conant Prize
- David H. Yang to Receive 2017 AMS-MAA-SIAM Morgan Prize.

Congratulations!

]]>You can see other statistics about us at MathSciNet by the Numbers.

]]>John O’Connor found 1706 mathematicians with biographies in their archive who have author profiles in MathSciNet. For each of these mathematicians, they have inserted a link from their biography to our Author Profile Page. (It’s at the end of the biography, with the other links.) And reciprocally, we have a link from the MathSciNet Author Profile page to the biography page at St. Andrews.

Here are 37 examples:

- Lars Ahlfors: MathSciNet, MacTutor
- Vladimir Arnold: MathSciNet, MacTutor
- Sergei Bernstein: MathSciNet, MacTutor
- Lipman Bers: MathSciNet, MacTutor
- Raoul Bott: MathSciNet, MacTutor
- Alberto Calderón: MathSciNet, MacTutor
- Constantin Carathéodory: MathSciNet, MacTutor
- Henri Cartan: MathSciNet, MacTutor
- S.S. Chern: MathSciNet, MacTutor
- Richard Courant: MathSciNet, MacTutor
- H.S.M. Coxeter: MathSciNet, MacTutor
- Jean Dieudonné: MathSciNet, MacTutor
- Ferdinand Gotthold Max Eisenstein: MathSciNet, MacTutor
- Arthur Erdélyi: MathSciNet, MacTutor
- Paul Erdős: MathSciNet, MacTutor
- Friedrich Ludwig Gottlob Frege: MathSciNet, MacTutor
- Israel Gelfand: MathSciNet, MacTutor
- Josiah Willard Gibbs: MathSciNet, MacTutor
- Boris Vladimirovich Gnedenko: MathSciNet, MacTutor
- Daniel Gorenstein: MathSciNet, MacTutor
- Hans Grauert: MathSciNet, MacTutor
- Godfrey Harold Hardy: MathSciNet, MacTutor
- Olga Alexandrovna Ladyzhenskaya: MathSciNet, MacTutor
- Anneli Cahn Lax: MathSciNet, MacTutor
- Peter Lax: MathSciNet, MacTutor
- André Lichnerowicz: MathSciNet, MacTutor
- Otto Neugebauer: MathSciNet, MacTutor
- Ilya Piatetski-Shapiro: MathSciNet, MacTutor
- Marina Ratner: MathSciNet, MacTutor
- Julia Hall Bowman Robinson: MathSciNet, MacTutor
- James Burton Serrin: MathSciNet, MacTutor
- Claude Elwood Shannon: MathSciNet, MacTutor
- John Robert Stallings: MathSciNet, MacTutor
- William Paul Thurston: MathSciNet, MacTutor
- Hermann Klaus Hugo Weyl: MathSciNet, MacTutor
- Jean-Christophe Yoccoz: MathSciNet, MacTutor
- Oscar Zariski: MathSciNet, MacTutor

I am very grateful to John O’Connor who did the matching between the two sites.

]]>Here are some examples with links:

Henri Cartan

Claude Chevalley

Georges de Rham

Jean Dieudonné

Wolfgang Doeblin

Charles Ehresmann

Gaston Julia

Pierre Lelong

André Lichnerowicz

Raphaël Salem

Laurent Schwartz

André Weil

To find the listing for an item that comes from contributed data for a thesis, you should go to the main search page of MathSciNet and enter “Thesis” in the “MSC Primary”. If you want to narrow the results to just those theses coming from NUMDAM, enter “NUMDAM” in the “Anywhere” field. The biggest source of data and links for theses we have is from ProQuest. As of this morning, we have metadata for 79,758 ProQuest theses. (More information about theses in MathSciNet was given in an earlier post.)

We are very grateful to NUMDAM and to ProQuest for their help in providing these data and links to users of MathSciNet.

]]>

Fall Central Sectional Meeting

University of St. Thomas, Minneapolis, MN

October 28-30, 2016 (Friday – Sunday)

Mike Jones will be giving the demos and answering questions.

Fall Southeastern Sectional Meeting

North Carolina State University, Raleigh, NC

November 12-13, 2016 (Saturday – Sunday)

Edward Dunne will be giving demos and answering questions. (Yes, that’s me!)

]]>