We present an overview of how certain computational tools currently interact with mathematical practice, and reflect on the implications for research mathematics in the short to medium term, as the field navigates the emerging age of AI and formal verification systems.

This is an introduction to calculus, and its applications to basic questions from physics. We first discuss the theory of functions $f:\mathbb R\to\mathbb R$, with the notion of continuity, and the construction of the derivative $f'(x)$ and of the integral $\int_a^bf(x)dx$. Then we investigate the case of the complex functions $f:\mathbb C\to\mathbb C$, and notably the holomorphic functions, and harmonic functions. Then, we discuss the multivariable functions, $f:\mathbb R^N\to\mathbb R^M$ or $f:\mathbb R^N\to\mathbb C^M$ or $f:\mathbb C^N\to\mathbb C^M$, with general theory, integration results, maximization questions, and basic applications to physics.

In 1953, Enrico Fermi criticized Dyson's model by quoting Johnny von Neumann: "With four parameters I can fit an elephant, and with five I can make him wiggle his trunk." So far, there have been several attempts to fit an elephant using four parameters, but as the problem has not been well-defined, the current methods do not completely satisfy the requirements. This paper defines the problem and presents an attempt.

Problems for the graduate students who want to improve problem-solving skills in geometry. Every problem has a short elegant solution -- this gives a hint which was not available when the problem was discovered.

In 1954, Alston S. Householder published \textit{Principles of Numerical Analysis}, one of the first modern treatments on matrix decomposition that favored a (block) LU decomposition-the factorization of a matrix into the product of lower and upper triangular matrices. And now, matrix decomposition has become a core technology in machine learning, largely due to the development of the back propagation algorithm in fitting a neural network. The sole aim of this survey is to give a self-contained introduction to concepts and mathematical tools in numerical linear algebra and matrix analysis in order to seamlessly introduce matrix decomposition techniques and their applications in subsequent sections. However, we clearly realize our inability to cover all the useful and interesting results concerning matrix decomposition and given the paucity of scope to present this discussion, e.g., the separated analysis of the Euclidean space, Hermitian space, Hilbert space, and things in the complex domain. We refer the reader to literature in the field of linear algebra for a more detailed introduction to the related fields. Keywords: Existence and computing of matrix decompositions, Floating point operations (flops), Low-rank approximation, Pivot, LU/PLU decomposition, CR/CUR/Skeleton decomposition, Coordinate transformation, ULV/URV decomposition, Rank decomposition, Rank revealing decomposition, Update/downdate, Tensor decomposition.

Order and symmetry are main structural principles in mathematics. We give five examples where on the face of it order is not apparent, but deeper investigations reveal that they are governed by order structures. These examples are finite topologies, associative algebras, subgroups of matrix groups, ideals in polynomial rings, and classes of bipartite graphs.

This is my laudation for Scholze's Fields medal 2018.

Although the same mathematical expression is used to describe physical diffusion and stochastic diffusion, there are intrinsic similarities and differences in their nature. A comparative study shows that characteristic terms of physical and stochastic diffusion cannot be placed exactly in one-to-one correspondence. Therefore, judgment needs to be exercised in transferring ideas between physical and stochastic diffusion.

This is a special collection of problems that were given to select applicants during oral entrance exams to the math department of Moscow State University. These problems were designed to prevent Jews and other undesirables from getting a passing grade. Among problems that were used by the department to blackball unwanted candidate students, these problems are distinguished by having a simple solution that is difficult to find. Using problems with a simple solution protected the administration from extra complaints and appeals. This collection therefore has mathematical as well as historical value.

The purpose of the present work is to provide short and supple teaching notes for a $30$ hours introductory course on elementary \textit{Enumerative Algebraic Combinatorics}. We fully adopt the \textit{Rota way}. The themes are organized into a suitable sequence that allows us to derive any result from the preceding ones by elementary processes. Definitions of \textit{combinatorial coefficients} are just by their \textit{combinatorial meaning}. The derivation techniques of formulae/results are founded upon constructions and two general and elementary principles/methods: - The \textit{bad element} method (for \textit{recursive} formulae). As the reader should recognize, the bad element method might be regarded as a combinatorial companion of the idea of \textit{conditional probability}. - The \textit{overcounting} principle (for \textit{close form} formulae). Therefore, \textit{no computation} is required in \textit{proofs}: \textit{computation formulae are byproducts of combinatorial constructions}. We tried to provide a self-contained presentation: the only prerequisite is standard high school mathematics. We limited ourselves to the \textit{combinatorial point of view}: we invite the reader to draw the (obvious) \textit{probabilistic interpretations}.

Bitcoin is the first decentralized peer-to-peer (P2P) electronic currency. It was created in November 2008 by Satoshi Nakamoto. Nakamoto released the first implementation of the protocol in an open source client software and the genesis of bitcoins began on January 9th 2009. The Bitcoin protocol is based on clever ideas which solve a form of the Byzantine Generals Problem and sets the foundation for Decentralized Trust Protocols. Still in its infancy, the currency and the protocol have the potential to disrupt the international financial system and other sectors where business is based on trusted third parties. The security of the bitcoin protocol relies on strong cryptography and one way hashing algorithms.

We guide the reader on a journey through mathematical modeling and numerical analysis, emphasizing the crucial interplay of both disciplines. Targeting undergraduate students with basic knowledge in dynamical systems and numerical methods for ordinary differential equations, we explore a model from mathematical biology where numerical methods fail badly due to catastrophic floating point errors. We analyze the reasons for this behavior by studying the steady states of the model and use the theory of invariants to develop an alternative model that is suited for numerical simulations. Our story intends to motivate combining analytical and numerical knowledge, even in cases where the world looks fine at first sight. We have set up an online repository containing an interactive notebook with all numerical experiments to make this study fully reproducible and useful for classroom teaching.

On 13-01-2024 the annual wintersymposium of the Koninlijk Wiskundig Genootschap (KWG) was held in the academiegebouw in Utrecht. The symposium had the theme ``inzichtelijk abstract''. Thomas Rot gave a lecture on his favourite theorem from topology. This article is a written account of this lecture. Audience comprised mostly of high school teachers and that is also the target audience of this article. The slides (in Dutch), which contain more pictures, are available~[8].

Which surfaces can be realized with two-dimensional faces of the five-dimensional cube (the penteract)? How can we visualize them? In recent work, Aveni, Govc, and Roldan, show that there exist 2690 connected closed cubical surfaces up to isomorphism in the 5-cube. They give a classification in terms of their genus $g$ for closed orientable cubical surfaces and their demigenus $k$ for a closed non-orientable cubical surface. In this paper, we explain the main idea behind the exhaustive search and we visualize the projection to $\mathbb{R}^3$ of a torus, a genus two torus, the projective plane, and the Klein bottle. We use reinforcement learning techniques to obtain configurations optimized for 3D printing.

The purpose of this note is to provide a gentle introduction to basic universal algebra and (abstract) clones.

In this expository article we present Rosenlicht's work on geometric class field theory, which classifies abelian coverings of smooth, projective, geometrically connected curves over perfect fields.