Fields extensions and their basic properties.

Algebraic closure of a field: existence and uniqueness. Kronecker's construction.

Splitting fields and normal extensions.

Separable, inseparable and purely inseparable extensions. Primitive element theorem.

Galois extensions. Galois group and Galois correspondence for finite extensions.

Prefinite groups and Krull topology. Galois correspondence for infinite extensions.

Galois group of an equation. Cyclotomic extensions. Generic equation of degree n.

Linear independence of characters. Trace and norm. Hilbert 90 theorem. Cyclic extensions and Kummer theory.

Solvable groups. Solvable and solvable by radicals extensions.

More examples and applications.

Algebra S. Bosch

Algebra S. Lang

Algebra M. Artin

Class Field Theory J. Neukirch

1. Topological classification of curves and compact surfaces. Triangulations, Euler characteristic.
2. Smooth and regular curves in Euclidean space. Immersions and imbeddings. Arc length. Curvature and the Fundamental Theorem of local geometry of plane curves.
3. Regular surfaces in R^3, local coordinates. Inverse image of a regular value. Maps and diffeomorphisms. Tangent plane and derivative of a map. Normal unit vector, orientation
and the Gauss map of a surface in R^3. Orientable surfaces, examples. The Moebius band is non-orientable.
4. Riemannian metric, examples. The shape operator is self-adjoint. Principal and asymptotic directions. The Mean and Gauss curvatures.
5. The geometry of the Gauss map. The sign of the Gauss curvature and position of the tangent plane. Theorems of Meusnieur and Olinde Rodrigues. Geometric properties of compact surfaces, Minimal surfaces and Ruled surfaces.
6. Isometries and local isometries. The Shape operator in isothermal coordinates. Proof of Gauss' Theorema Egregium. Examples, counter-examples and applications.
7. Homeworks.
8. 12 hours of lab for the visualization and computation on curves and surfaces.

Textbooks
[1] J.M. Lee, Introduction to topological manifolds. Springer, (2000). - – http://dx.doi.org/10.1007/b98853
[2] E. Sernesi, Geometria 2. Boringhieri, (1994).
[3] M. Do Carmo , Differential Geometry of Curves and Surfaces. Prentice Hall, (1976).
[4] M.Abate, F.Tovena, Curve e Superfici. Springer, (2006).

Rings and ideals, maximal ideals and prime ideals, nilradical andJacobson radical, the spectrum of a ring. Modules, finitely generated modules and Nakayama's Lemma, exact sequences, tensor product, restriction and extension of scalars. Rings and modules of fractions, localization. Primary decomposition. Integral dependence and valuation. Chain conditions. Noetherian rings, Hilbert's Basis Theorem, Nullstellensatz. Discrete valuation rings and Dedekind domains. Hints of dimension theory.

M. F. Atiyah, I. G. Macdonald, Introduction to Commutative Algebra. Addison-Wesley, 1996.
M. Reid, Undergraduate Algebraic Geometry, Cambridge University Press, 1988.
D. Eisenbud, Commutative Algebra with a view toward Algebraic Geometry, Springer-Verlag, 1995.
A. Gathmann, Commutative Algebra, Lecture notes.

Algebraic varieties in affine and projective spaces over algebraically closed fields.
Veronese and Segre varieties.
Products and projections.
Local geometry of algebraic varieties

Divisors linear systems and e morphisms of projective varieties.
Commutative algebra

I. Shafarevich. Basic algebraic geometry vol. 1 Springer-Verlag, New York-Heidelberg, 1977.
L. Caporaso. Introduzione alla geometria algebrica . Versione preliminare.

1) Computability, complexity and representability:

- Introduction to decision problems, algorithmic and non-algorithmic procedures, deterministic computations, discrete procedures, the notion of alphabet, of speech. Decidability and semi-decidability of a set. Deterministic, finitary and discrete computations. Formal algorithms: formal definition of algorithm, configurations of input, output, transition function. Example of formalization of an algorithm. Decidability for finished automata. Representation of the automata by matrices. Free Monoid of words. Formal semi-rings. Non-deterministic finite automata. Regular Languages. Equivalence between deterministic and non-deterministic automata.

- Turing machines: definition, decidability for Turing machine, stopping time, stopping space. Cost of computation. Complexity: worst-case and average case. Independence of decision time from a finite number of input configurations. Complexity functions, complexity classes DTIME and DSPACE (deterministic time and space). Inclusion DTIME (T (n)) ⊂ DSPACE (T (n)) ⊂ DTIME (2 ^ {cT (n)}). Pumping Lemma. Simulation of algorithms, simulation of the half tape Turing machine, simulation of a multi-tape machine. Special Turing machines. Linear Speedup theorem for Turing machines with an extended alphabet. Evaluation of acceleration coefficient in relation to alphabets. Decisions of natural number sets. Independence from representation. Considerations concerning complexity.

- Turing computability: definition of Turing computable function, characteristic functions of Turing decidable sets, the class of Turing computable functions is closed by composition, concatenation, primitive recursion and minimization. Examples of Turing computable functions. Recursive Functions: equivalence between Turing computability and recursive functions. Ackermann function ([1] chapter 1,2,3,4,5 and [4] chapter 1).

- Time-constructible functions. The notion of T-clock. Examples of some time constructible function. Closure by composition.

- Non-deterministic Turing machines: characterization through the decidability of projection sets. Definition of the class of polynomial non-deterministic functions. NP-complete problems.

2) Lambda calculus and functional programming:

- Declarative programming: a historical outline on the lambda calculus, basic definitions, the terms of the lambda calculus, the simple substitution. Relations on the lambda terms. Congruences, transition to the context. α-equivalence. alpha-equivalence passes to the context. The transitive closure of a relationship, owned by Church-Rosser. Listing of lambda-terms concerning alpha-equivalence.

- Definition of beta-reduction and beta-equivalence. Church-Rosser's theorem for beta-reduction. Normal forms for beta-reduction. Beta-reduction strategies. Normalizing strategy: left reduction (left most-outer most). Head reduction. Soluble Terms. Head Normal Forms. Solvability characterization theorem.

- Representation of the recursive functions: lambda definability theorem. Existence of the fixed point for the lambda terms. Church Fixed Point and Curry fixed point.
- Representation of other data types in the lambda-calculus: pairs, lists, trees, the solution of recursive equations on lambda-terms ([2] chapters 1, 2, 5).

[1] DEHORNOY, P., COMPLEXITÈ ET DECIDABILITÈ. SPRINGER-VERLAG, (1993).
[2] KRIVINE, J.-L., LAMBDA CALCULUS: TYPES AND MODELS. ‪ELLIS HORWOOD, (1993).
[3] SIPSER,M., INTRODUCTION TO THE THEORY OF COMPUTATION.THOMSON COURSE TECHNOLOGY, (2006).

Introduction to set theory: aggregates and sets, necessity of a theory, ordinals and cardinals, antinomies and paradoxes, main characteristics of axiomatic set theory. Zermelo’s axiomatic set theory and Zermelo-Fraenkel’s axiomatic set theory: preliminaries and conventions, Zermelo’s axioms, the replacement axiom and Zermelo-Fraenkel’s theory, extensions of the language by definition. Ordinals: orders, well-orders and well-foundedness, well-foundedness and induction principle, the ordinal numbers, well-orders and ordinals, ordinal induction (proofs and definitions), diagonal argument and limit ordinals, infinity axiom and ordinal arithmetic, hints on the use of ordinals in proof-theory. Axiom of choice: equivalent formulations (and proof of the equivalence), infinite sets and axiom of choice. Cardinals: equipotent sets and infinite sets, the cardinal numbers, cardinal arithmetic.

Testi: V. Michele Abrusci e Lorenzo Tortora de Falco, Logica. Vol. 2 Incompletezza, teoria assiomatica degli insiemi, Springer, 2018

Categories.
Abstract and geometrical implicial complexes.
Singular homology and simplicial homology.
Cohomology
Duality Theorems
Persistent homology and data analysis
Elements of differential topology
Differential forms and de Rham cohomology

Allen Hatcher: Algebraic topology Cambridge University press.
Vidit Nanda: Computational Algebraic Topology - Lecture notes
James R. Munkres : Topology Prentice Hall.
Raoul Bott, Loring W. Tu,Differential forms in algebraic topology.Springer, (1986).
Marco Abate, Francesca Tovena,Geometria Differenziale.Springer, (2011).

Lebesgue integration in Rn, Fourier transform, theory of differential equations

Luigi Chierchia, Analisi matematica due
Reed-Simon

Measure theory, outer measures, construction of Borel measures.
Integration theory, limit theorems, convergence in mean and in measure, integration on product spaces.
Radon measures, regularity, positive linear functionals, Riesz representation theorem.
Signed measures, decomposition theorems, differentiation, BV functions, fundamental theorem of calculus.
Lp spaces, basic properties, dual spaces, density theorems.
Introduction to geometric measure theory

G. Folland - "Real Analysis" - Wiley

1. General theory:
- Existence and uniqueness theorems (Gronwall's lemmas; Picard's theorem, Peano's theorem).
- Existence intervals and maximal solutions.
- Dependence on initial data and parameters.

2. Qualitative analysis of some simple EDO classes. Phase space.

3. Linear systems with constant coefficients. Exponential of matrices and Jordan's normal form theorem.

4. Linear systems with variable coefficients. Solution spaces. The Wronskian.

6. Periodic solutions and Fourier series.

7. Hamiltonian systems and celestial mechanics (introduction)

Gerald Teschl: Ordinary Differential Equations and Dynamical Systems , Graduate Studies in Mathematics Volume 140, American Mathematical Society, 2011

Shair Ahmad and Antonio Ambrosetti, Differential Equations. A first course on ODE and a brief introduction to PDE
Series: De Gruyter Textbook De Gruyter | 2019 DOI: https://doi.org/10.1515/9783110652864

Evolution equations of Mathematical Physics: transport, wave and heat equations. Introduction to quantum mechanics. Fourier transform

[B] P. Butta', Note del corso di Fisica Matematica
[Cr] W. Craig, A course on Partial Differential Equations
[L1] V. Lubicz, Apppunti di Meccanica Quantistica

Linear Systems
Direst methods: Gaussian elimination. Pivoting strategies. Gaussian elimination as a factorization. Doolittle and Choleshy factorizations. Iterative methods: Jacobi, Gauss-Seidel, SOR, Richardson, and related convergence results. Comparison of direct vs iterative solvers. Stability of algorithms for the solution of linear systems.

Iterative Methods for Scalar Nonlinear Equations
The intermediate zero theorem. The algorithms of bisection, Newton, secants, chords, and related convergence results. (Reference: Chapter 1 excluding Section 1.2.3, and Appendices A.1, A.2)

Approximation of Functions
General approximation strategies. Interpolating polynomial in Lagrange and Newton form. Representation of the interpolation error. Convergence of the interpolating polynomial for analytic functions. Refinement strategies in interpolation: Chebyshev nodes, composite approximations. Error estimates. Hermite polynomial, construction and representation of the error. Least Squares approximations. (Reference: Chapter 5 excluding Section 5.2, and Appendix A.4)

Numerical Integration
General principles of numerical integration. Polya's Theorem on the convergence of interpolatory quadrature formulae. Closed and open Newton-Cotes formulae. Stability results and error estimation. Generalized Newton-Cotes formulae and their convergence. Gaussian quadratures and their convergence. (Reference: Chapter 6)

Laboratory Activity
C language coding of some of the major algorithms, and in particular: Gaussian elimination, iterative methods for linear systems and scalar equations, Lagrange/Newton interpolation with a refinement strategy.

N.B.: References are provided with respect to the course notes.

Roberto Ferretti, "Appunti del corso di Analisi Numerica", available from the course page

Roberto Ferretti, "Esercizi d'esame di Analisi Numerica", available from the course page

Slides of the lessons, available from the course page

Branching processes, introduction to Sigma-algebras, measure spaces and probability spaces. Contruction of Lebesgue measure. Pi-systems, Dynkin's lemma. Properties of measures, sup and inf limits of events, measurable functions and random variables. Borel-Cantelli lemmas. Law and distribution of a random variable. Concept of independence. Convergence in probability and almost sure convergence. Skorokhod's representation theorem. Kolmogorov's 0-1 law.
Integrals, their properties and related theorems. Expectation of random variables. Markov, Jensen and Hoelder's inequalities. L^p spaces. Weierstrass' Theorem. Product measures, Fubini's theorem and joint laws.
Conditional expectation and its properties. Martingales, predictable processes. Stopping times and stopped processes. Optional stopping theorem, applications to random walks. Theorems about convergence of martingales. Strong law of large numbers.
Doob's inequalities for martingales and sub-martingales, applications. Characteristic functions and inversion theorem. Fourier transform in L^1. Equivalence between convergence in distribution and convergence of characteristic functions. Central limit theorem.

D. Williams, Probability with martingales
R. Durrett, Probability: Theory and examples

Fields extensions and their basic properties.

Algebraic closure of a field: existence and uniqueness. Kronecker's construction.

Splitting fields and normal extensions.

Separable, inseparable and purely inseparable extensions. Primitive element theorem.

Galois extensions. Galois group and Galois correspondence for finite extensions.

Prefinite groups and Krull topology. Galois correspondence for infinite extensions.

Galois group of an equation. Cyclotomic extensions. Generic equation of degree n.

Linear independence of characters. Trace and norm. Hilbert 90 theorem. Cyclic extensions and Kummer theory.

Solvable groups. Solvable and solvable by radicals extensions.

More examples and applications.

Algebra S. Bosch

Algebra S. Lang

Algebra M. Artin

Class Field Theory J. Neukirch

Evolution equations of Mathematical Physics: transport, wave and heat equations. Introduction to quantum mechanics. Fourier transform

[B] P. Butta', Note del corso di Fisica Matematica
[Cr] W. Craig, A course on Partial Differential Equations
[L1] V. Lubicz, Apppunti di Meccanica Quantistica

1. Topological classification of curves and compact surfaces. Triangulations, Euler characteristic.
2. Smooth and regular curves in Euclidean space. Immersions and imbeddings. Arc length. Curvature and the Fundamental Theorem of local geometry of plane curves.
3. Regular surfaces in R^3, local coordinates. Inverse image of a regular value. Maps and diffeomorphisms. Tangent plane and derivative of a map. Normal unit vector, orientation
and the Gauss map of a surface in R^3. Orientable surfaces, examples. The Moebius band is non-orientable.
4. Riemannian metric, examples. The shape operator is self-adjoint. Principal and asymptotic directions. The Mean and Gauss curvatures.
5. The geometry of the Gauss map. The sign of the Gauss curvature and position of the tangent plane. Theorems of Meusnieur and Olinde Rodrigues. Geometric properties of compact surfaces, Minimal surfaces and Ruled surfaces.
6. Isometries and local isometries. The Shape operator in isothermal coordinates. Proof of Gauss' Theorema Egregium. Examples, counter-examples and applications.
7. Homeworks.
8. 12 hours of lab for the visualization and computation on curves and surfaces.

Textbooks
[1] J.M. Lee, Introduction to topological manifolds. Springer, (2000). - – http://dx.doi.org/10.1007/b98853
[2] E. Sernesi, Geometria 2. Boringhieri, (1994).
[3] M. Do Carmo , Differential Geometry of Curves and Surfaces. Prentice Hall, (1976).
[4] M.Abate, F.Tovena, Curve e Superfici. Springer, (2006).

Rings and ideals, maximal ideals and prime ideals, nilradical andJacobson radical, the spectrum of a ring. Modules, finitely generated modules and Nakayama's Lemma, exact sequences, tensor product, restriction and extension of scalars. Rings and modules of fractions, localization. Primary decomposition. Integral dependence and valuation. Chain conditions. Noetherian rings, Hilbert's Basis Theorem, Nullstellensatz. Discrete valuation rings and Dedekind domains. Hints of dimension theory.

M. F. Atiyah, I. G. Macdonald, Introduction to Commutative Algebra. Addison-Wesley, 1996.
M. Reid, Undergraduate Algebraic Geometry, Cambridge University Press, 1988.
D. Eisenbud, Commutative Algebra with a view toward Algebraic Geometry, Springer-Verlag, 1995.
A. Gathmann, Commutative Algebra, Lecture notes.

Linear Systems
Direst methods: Gaussian elimination. Pivoting strategies. Gaussian elimination as a factorization. Doolittle and Choleshy factorizations. Iterative methods: Jacobi, Gauss-Seidel, SOR, Richardson, and related convergence results. Comparison of direct vs iterative solvers. Stability of algorithms for the solution of linear systems.

Iterative Methods for Scalar Nonlinear Equations
The intermediate zero theorem. The algorithms of bisection, Newton, secants, chords, and related convergence results. (Reference: Chapter 1 excluding Section 1.2.3, and Appendices A.1, A.2)

Approximation of Functions
General approximation strategies. Interpolating polynomial in Lagrange and Newton form. Representation of the interpolation error. Convergence of the interpolating polynomial for analytic functions. Refinement strategies in interpolation: Chebyshev nodes, composite approximations. Error estimates. Hermite polynomial, construction and representation of the error. Least Squares approximations. (Reference: Chapter 5 excluding Section 5.2, and Appendix A.4)

Numerical Integration
General principles of numerical integration. Polya's Theorem on the convergence of interpolatory quadrature formulae. Closed and open Newton-Cotes formulae. Stability results and error estimation. Generalized Newton-Cotes formulae and their convergence. Gaussian quadratures and their convergence. (Reference: Chapter 6)

Laboratory Activity
C language coding of some of the major algorithms, and in particular: Gaussian elimination, iterative methods for linear systems and scalar equations, Lagrange/Newton interpolation with a refinement strategy.

N.B.: References are provided with respect to the course notes.

Roberto Ferretti, "Appunti del corso di Analisi Numerica", available from the course page

Roberto Ferretti, "Esercizi d'esame di Analisi Numerica", available from the course page

Slides of the lessons, available from the course page

Branching processes, introduction to Sigma-algebras, measure spaces and probability spaces. Contruction of Lebesgue measure. Pi-systems, Dynkin's lemma. Properties of measures, sup and inf limits of events, measurable functions and random variables. Borel-Cantelli lemmas. Law and distribution of a random variable. Concept of independence. Convergence in probability and almost sure convergence. Skorokhod's representation theorem. Kolmogorov's 0-1 law.
Integrals, their properties and related theorems. Expectation of random variables. Markov, Jensen and Hoelder's inequalities. L^p spaces. Weierstrass' Theorem. Product measures, Fubini's theorem and joint laws.
Conditional expectation and its properties. Martingales, predictable processes. Stopping times and stopped processes. Optional stopping theorem, applications to random walks. Theorems about convergence of martingales. Strong law of large numbers.
Doob's inequalities for martingales and sub-martingales, applications. Characteristic functions and inversion theorem. Fourier transform in L^1. Equivalence between convergence in distribution and convergence of characteristic functions. Central limit theorem.

D. Williams, Probability with martingales
R. Durrett, Probability: Theory and examples

Algebraic varieties in affine and projective spaces over algebraically closed fields.
Veronese and Segre varieties.
Products and projections.
Local geometry of algebraic varieties

Divisors linear systems and e morphisms of projective varieties.
Commutative algebra

I. Shafarevich. Basic algebraic geometry vol. 1 Springer-Verlag, New York-Heidelberg, 1977.
L. Caporaso. Introduzione alla geometria algebrica . Versione preliminare.

1) Computability, complexity and representability:

- Introduction to decision problems, algorithmic and non-algorithmic procedures, deterministic computations, discrete procedures, the notion of alphabet, of speech. Decidability and semi-decidability of a set. Deterministic, finitary and discrete computations. Formal algorithms: formal definition of algorithm, configurations of input, output, transition function. Example of formalization of an algorithm. Decidability for finished automata. Representation of the automata by matrices. Free Monoid of words. Formal semi-rings. Non-deterministic finite automata. Regular Languages. Equivalence between deterministic and non-deterministic automata.

- Turing machines: definition, decidability for Turing machine, stopping time, stopping space. Cost of computation. Complexity: worst-case and average case. Independence of decision time from a finite number of input configurations. Complexity functions, complexity classes DTIME and DSPACE (deterministic time and space). Inclusion DTIME (T (n)) ⊂ DSPACE (T (n)) ⊂ DTIME (2 ^ {cT (n)}). Pumping Lemma. Simulation of algorithms, simulation of the half tape Turing machine, simulation of a multi-tape machine. Special Turing machines. Linear Speedup theorem for Turing machines with an extended alphabet. Evaluation of acceleration coefficient in relation to alphabets. Decisions of natural number sets. Independence from representation. Considerations concerning complexity.

- Turing computability: definition of Turing computable function, characteristic functions of Turing decidable sets, the class of Turing computable functions is closed by composition, concatenation, primitive recursion and minimization. Examples of Turing computable functions. Recursive Functions: equivalence between Turing computability and recursive functions. Ackermann function ([1] chapter 1,2,3,4,5 and [4] chapter 1).

- Time-constructible functions. The notion of T-clock. Examples of some time constructible function. Closure by composition.

- Non-deterministic Turing machines: characterization through the decidability of projection sets. Definition of the class of polynomial non-deterministic functions. NP-complete problems.

2) Lambda calculus and functional programming:

- Declarative programming: a historical outline on the lambda calculus, basic definitions, the terms of the lambda calculus, the simple substitution. Relations on the lambda terms. Congruences, transition to the context. α-equivalence. alpha-equivalence passes to the context. The transitive closure of a relationship, owned by Church-Rosser. Listing of lambda-terms concerning alpha-equivalence.

- Definition of beta-reduction and beta-equivalence. Church-Rosser's theorem for beta-reduction. Normal forms for beta-reduction. Beta-reduction strategies. Normalizing strategy: left reduction (left most-outer most). Head reduction. Soluble Terms. Head Normal Forms. Solvability characterization theorem.

- Representation of the recursive functions: lambda definability theorem. Existence of the fixed point for the lambda terms. Church Fixed Point and Curry fixed point.
- Representation of other data types in the lambda-calculus: pairs, lists, trees, the solution of recursive equations on lambda-terms ([2] chapters 1, 2, 5).

[1] DEHORNOY, P., COMPLEXITÈ ET DECIDABILITÈ. SPRINGER-VERLAG, (1993).
[2] KRIVINE, J.-L., LAMBDA CALCULUS: TYPES AND MODELS. ‪ELLIS HORWOOD, (1993).
[3] SIPSER,M., INTRODUCTION TO THE THEORY OF COMPUTATION.THOMSON COURSE TECHNOLOGY, (2006).

The crisis of classical physics. Waves and particles. State vectors and operators. Measurements, observables and uncertainty relation. The position operator. Translations and momentum. Time evolution and the Schrödinger equation. One-dimensional problems. Parity. Harmonic oscillator. Symmetries and conservation laws. Time independent perturbation theory. Time dependent perturbation theory.

Lecture notes available on the course website

J.J. Sakurai, Jim Napolitano - Meccanica Quantistica Moderna - Zanichelli
An english version of the book is also available:
Sakurai J.J., Modern Quantum Mechanics - Addison-Wesley

§I.Relativistic Field Theory

The Poincaré Group. Symmetries: global vs local. Noether's first and second theorems and conservation laws. The canonical stress-energy and angular momentum tensors. Improvements. Belinfante's argument and symmetric energy-momentum tensor. Local symmetries and conserved quantities.

§II.Gravity as a relativistic field theory

Particles and fields in Special Relativity. Irreps of the Poincaré group: Wigner's induced representation method. Massless particles: ISO(D-2) little group and gauge invariance. From relativistic massless spin-2 particles to full GR. Fierz-Pauli quadratic Lagrangian. Nöther method and non-linear completions. Nöther's construction of Yang-Mills Lagrangian. The transverse-traceless gravitational cubic vertex. Weinberg's Equivalence Principle from relativistic invariance of the S matrix. Spin and the sign of static forces.

§III.Elements of differential geometry

Topological spaces. Manifolds. Diffeomorphisms. Tangent spaces and vectors. Coordinate basis. Derivative operators on manifolds. Levi-Civita connection. Torsion. Differential forms: definition, wedge product, interior and exterior derivatives, Hodge dual. Lie derivative of forms and Cartan's formula. Yang-Mills theory in the language of forms. Weyl tensor. Riemann and Weyl tensors in various dimensions: counting components for irreps of GL(D). Conformal transformations of the metric tensor. Conformally flat spaces. Conformally coupled scalar fields.

§IV. The Cartan-Weyl formulation of GR and Fermionic couplings

Local inertial frames. The frame field and its relation to the metric field. Local Lorentz transformations. The spin connection. The vielbein postulate. Torsion constraint and second-order formulation. The contorsion tensor. Local Lorentz curvature. Gravity as a gauge theory of the Poincaré algebra. Connection one-forms on the Poincar\'e algebra. Local Poincar\'e transformations. Torsion and curvature over the Poincar\'e algebra. First-order formulation and Cartan-Weyl's action. Relation between gauge transformations and diffeomorphisms. Spinors on curved manifolds. Minimally coupled Fermionic matter. Dirac Lagrangian.

§V. Maximally symmetric spaces

Homogeneous and isotropic spaces. Characterisation of maximally symmetric spaces: curvature constant and signature. MSS as vacuum solutions to the EH equations with cosmological constant. Construction from embedding in (D+1) pseudo-Lorentzian spaces: metric and Christoffel coefficients.

§VI. The Schwarzschild black hole

Spherically symmetric spaces. The Schwarzschild solution. Birkhoff's theorem. Singularities, definitions and criteria: curvature singularites and geodesic incompleteness. Free-fall towards the horizon. The tortoise coordinate. Extension of a space-time. Eddington-Finkelstein coordinates. Event horizons, black holes and white holes. Kruskal-Szekeres coordinates. Maximal extension of the Schwarzschild solution. Kruskal's diagram and eternal black holes. (A)dS-Schwarzschild space-time.

§VII. More general black holes

Conformal diagrams. Event horizons. Reissner-Nordström and Kerr black holes. Black hole thermodynamics.

§VII. Gravitational energy

Conserved quantities in gauge theories: the example of Yang-Mills theory. Covariant conservation and ordinary conservation. Einstein-Hilbert equations for asymptotically flat metrics. Candidate for gravitational energy-momentum tensor. The superpotential. ADM energy and momentum. Example: ADM energy of the Schwarzschild solution. The positive-energy theorem (without proof). Generic background with Killing vectors. Quadrupole radiation.

§VIII. Asymptotic symmetries

General notion of asymptotic symmetry group. The example of Maxwell's theory in flat space. Covariant phase space formalism. Asymptotically flat spacetime and Bondi-van der Burg-Metzner-Sachs supertranslations. Applications: soft theorems and memory effects.

Note: some topics may be assigned as homework problems, as an alternative to the oral exam

-Carroll S, Spacetime and Geometry: An Introduction to General Relativity (Addison-Wesley 2014/Cambridge University Press, 2019)
-Weinberg S, Gravitation and Cosmology - principles and applications of the general theory of relativity, (John Wiley \& Sons, 1972)
-Wald R, General Relativity (The University of Chicago Press, 1984)

The objective of Linguaggi di Programmazione course is to introduce main formal language theory concepts and results as well as their application for programming language classification.
Most relevant approaches for syntactic analysis of programming languages are introduced. Learning how to recognize the structure of a programming language and the implementation techniques for the abrstract machine.
Understanding the Object Oriented paradigm together with other non imperative approaches.

[1] Maurizio Gabbrielli, Simone Martini,Programming Languages - Principles and paradigms, 2/ed. McGraw-Hill, (2011).
[2] Dean Wampler, Alex Payne, Programming Scala: Scalability = Functional Programming + Objects, 2 edizione. O’Reilly Media, (2014).
[3] David Parsons, Foundational Java Key Elements and Practical Programming. Springer- Verlag, (2012).
Course Slides provided by the lecturer.

1. Machine learning. Types of learning. Loss functions. Empirical risk minimization. Generalization and overfitting.
2. Model optimization. Convex functions. Gradient descent. Stochastic gradient descent.
3. Regression. Linear regression. Basis functions. Feature selection. Regularization.
4. Classification. Generative models. Nearest neighbor. Logistic regression. Support vector machines. Neural networks.
5. Ensemble methods. Decision trees. Boosting. Bagging.
6. Unsupervised learning. K-means clustering. Hierarchical clustering. Principal component analysis.
7. Application of the methods using the Python language. Examples using the NumPy, Pandas, SciKit-Learn, and TensorFlow libraries.

J. Watt, R. Borhani, A. Katsaggelos. Machine Learning Refined. Cambridge University Press, 2nd edition, 2020.

Random variables and their distribution, moment generating function, mean variance and covariance.
Random sampling model and statistical model.
Statistics: concept, examples, sufficient statistics.
Point estimators: definition and desired properties, moments, maximum likelihood and Bayes.
Computational methods: Newton-Raphson, EM algorithm
Improving an estimator: Rao-Blackwell, UMVU estimator, full statistic, Lehman-Scheff ́e II and Cramer-Rao
Confidence intervals: intuitive, pivotal quantity, IC for Bayes and asymptotic IC.
Hypothesis testing: likelihood ratio, pivotal quantity test (Z and T test), duality with IC, UMP, Neyman-Pearson and Karlin-Rubin tests.
Non-parametric methods: goodness-of-fit, contingency table, Kolmogorov-Smirnov and ranking tests.
Analysis of variance (ANOVA) and F.
Regression: linear, multiple linear, generalized linear and Logistic / Poisson

Statistical Inference, Casella e Berger, 2nd Edition, Duxbury Advanced Series.

Additional reference:
Luca Leuzzi, Enzo Marinari, Giorgio Parisi
CALCOLO DELLE PROBABILITÀ: un trattatello per principianti volenterosi

The high scool mathematics: programs, key and critical points; the mathematicians' mathematics and the mathematics for the citizen
From exercise to problem solving. Didactic theories and theorists. Guido and Emma Castelnuovo. Croce, Gentile and mathematics.
Didactic methodologies. Scholastic laws.

Battaglini Frank, Di Martino, Natalini, Rosolini "Didattica della matematica", Mondadori Università

Introduction to set theory: aggregates and sets, necessity of a theory, ordinals and cardinals, antinomies and paradoxes, main characteristics of axiomatic set theory. Zermelo’s axiomatic set theory and Zermelo-Fraenkel’s axiomatic set theory: preliminaries and conventions, Zermelo’s axioms, the replacement axiom and Zermelo-Fraenkel’s theory, extensions of the language by definition. Ordinals: orders, well-orders and well-foundedness, well-foundedness and induction principle, the ordinal numbers, well-orders and ordinals, ordinal induction (proofs and definitions), diagonal argument and limit ordinals, infinity axiom and ordinal arithmetic, hints on the use of ordinals in proof-theory. Axiom of choice: equivalent formulations (and proof of the equivalence), infinite sets and axiom of choice. Cardinals: equipotent sets and infinite sets, the cardinal numbers, cardinal arithmetic.

Testi: V. Michele Abrusci e Lorenzo Tortora de Falco, Logica. Vol. 2 Incompletezza, teoria assiomatica degli insiemi, Springer, 2018

Categories.
Abstract and geometrical implicial complexes.
Singular homology and simplicial homology.
Cohomology
Duality Theorems
Persistent homology and data analysis
Elements of differential topology
Differential forms and de Rham cohomology

Allen Hatcher: Algebraic topology Cambridge University press.
Vidit Nanda: Computational Algebraic Topology - Lecture notes
James R. Munkres : Topology Prentice Hall.
Raoul Bott, Loring W. Tu,Differential forms in algebraic topology.Springer, (1986).
Marco Abate, Francesca Tovena,Geometria Differenziale.Springer, (2011).

Lebesgue integration in Rn, Fourier transform, theory of differential equations

Luigi Chierchia, Analisi matematica due
Reed-Simon

Measure theory, outer measures, construction of Borel measures.
Integration theory, limit theorems, convergence in mean and in measure, integration on product spaces.
Radon measures, regularity, positive linear functionals, Riesz representation theorem.
Signed measures, decomposition theorems, differentiation, BV functions, fundamental theorem of calculus.
Lp spaces, basic properties, dual spaces, density theorems.
Introduction to geometric measure theory

G. Folland - "Real Analysis" - Wiley

1. General theory:
- Existence and uniqueness theorems (Gronwall's lemmas; Picard's theorem, Peano's theorem).
- Existence intervals and maximal solutions.
- Dependence on initial data and parameters.

2. Qualitative analysis of some simple EDO classes. Phase space.

3. Linear systems with constant coefficients. Exponential of matrices and Jordan's normal form theorem.

4. Linear systems with variable coefficients. Solution spaces. The Wronskian.

6. Periodic solutions and Fourier series.

7. Hamiltonian systems and celestial mechanics (introduction)

Gerald Teschl: Ordinary Differential Equations and Dynamical Systems , Graduate Studies in Mathematics Volume 140, American Mathematical Society, 2011

Shair Ahmad and Antonio Ambrosetti, Differential Equations. A first course on ODE and a brief introduction to PDE
Series: De Gruyter Textbook De Gruyter | 2019 DOI: https://doi.org/10.1515/9783110652864

Graphs: basic definitions. Simple and non simple graphs, planarity, connectivity, degree, regularity, incidence and adjacency matrices. Examples of families of graphs. The '' handshaking lemma ''.
Graphs obtained from others: complement, subgraph, cancellation and contraction. Isomorphisms and automorphisms of graphs. Connectivity: paths, cycles. A graph is bipartite if and only if each cycle has equal length.
Connetivity and connected component. Connectivity for sides and vertices. Eulerian and semi-Eulerian graphs.
Euler's theorem: a connected graph is Eulerian if and only if every vertex has an even degree. Hamiltonian graphs. Sufficient conditions to guarantee that a graph is Hamiltonian: the theorems of Ore and Dirac.
the Ore theorem. Trees and forests. The cyclomatic number and the "cutset" rank of a graph.
Fundamental system of cycles and cuts associated with a generating forest. Enumeration of generating forests. The Cayley theorem.
Generating trees: the "greedy" algorithm for the "connector problem". Planar graphs. K3.3 and K5 are not planar. Statement of the theorem of Kuratovski and variations.
Euler's formula for planar graphs. The dual of a planar graph.
Correspondence between cycles and cuts for planar graphs and their dual. Dual abstract. A graph that admits a dual abstract is planar. Colorings: initial considerations and some properties.
Colorings: the 5 colors theorem. Graphs on surfaces: classification of topological surfaces.
Coloring of faces and duality between this problem and the coloring of vertices. Reduction of the proof of the 4-color theorem to the coloring of cubic graph faces. '' The marriage problem ": Hall's theorem.
Hall's theorem in the language of transversals. Criteria of existence of transversal and partial transversivities. Application to the construction of Latin squares. Direct graphs: basic notions and orientability.
The Max-Flow Min-Cut theorem and Menger's theorem.
Complexity of algorithms and applications to the theory of graphs.
Introduction to the theory of matroids: definitions using bases and independent elements. Graphical and cographic matroids, vector matroids and the problem of representability.
Definition of matroid using the cycles and the rank function. Minors of a matroid. Transverse matroids and the Rado Theorem for matroids.
Union of matroids and applications: existence of disjoint bases in a matroid. Duality for matroids and applications to graphic and cographic matroids. Planar matroids and the generalization of Kuratovski's theorem for matroids.
Elements of algebraic graph theory: the incidence matrix and the Laplacian matrix of an oriented graph. The vertex space and the space of edges of a graph. Subspaces of the cycles and subspace of the cuts of a defined oriented graph of the incidence matrix.
Basis for the space of the cycles and for the space of the cuts of a graph. The Riemann-Roch theorem for graphs.
Proof of the "generalized Matrix Tree theorem". The contraction / restriction algorithm for matroids. Examples. The number of acyclical orientations of a graph.
Graph polynomials: the chromatic polynomial, the "reliabiliaty" polynomial. Examples. The polynomial rank of a matroid. Properties and first applications.
Proof of the structure theorem for functions on matroids that satisfy contraction/restriction properties. Their incarnation through the polynomial rank.
Whitey's moves and two isomorphisms for graphs. Isomorphism between graphical matroids implies isomorphism between graphs in case the graphs are 3 connected.
Whitney's Theorem for graphic matroids: sketch of the demonstration. Characterization for minors excluded from binary and regular matroids. The theorem of Seymour.

R. Diestel: Graph theory, Spriger GTM 173.
R. Wilson: Introduction to Graph theory, Prentice Hall.
B. Bollobas: Modern Graph theory, Springer GTM 184.
J. A. Bondy, U.S.R. Murty: Graph theory, Springer GTM 244.
N. Biggs: Algebraic graph theory, Cambridge University Press.
C. D. Godsil, G. Royle: Algebraic Graph theory, Springer GTM 207.
J. G. Oxley: Matroid theory. Oxford graduate texts in mathematics, 3.

Division, Factorization, Some Elementary Properties of Primes, Some Results and Problems Concerning Primes.
ARITHMETIC FUNCTIONS: The Divisor Function. The Moebius Function. The Euler Function. Dirichlet Convolution
CONGRUENCES: Sets of Residues,Some Interesting Congruences, Some Linear Congruences, Some Polynomial Congruences, Primitive Roots, the Theorem of Gauss.
QUADRATIC RESIDUES: The Legendre Symbol. Quadratic Reciprocity. The Jacobi Symbol.The Distribution of Quadratic Residues.
SUMS OF INTEGER SQUARES: Sums of Two Squares. Number of Representations. Sums of Four Squares. Sums of Three Squares.
ELEMENTARY PRIME NUMBER THEORY: Euclid's Theorem Revisited. The Von Mangoldt Function. Tchebycheff's Theorem. Some Results of Mertens

Chen, W; ELEMENTARY NUMBER THEORY. https://rutherglen.science.mq.edu.au/wchen/lnentfolder/lnent.html
Chowdhury, F.; Chowdhury, M. R. Essentials of Number Theory. Pi Publications, Dhaka, Bangladesh, 2005. ISBN 984-32-2836-7
Hardy, G. H.; Wright, E. M. An introduction to the theory of numbers. Fifth edition. The Clarendon Press, Oxford University Press, New York, 1979. xvi+426 pp. ISBN: 0-19-853170-2; 0-19-853171-0
Davenport, H. Aritmetica superiore. Un'introduzione alla teoria dei numeri. Editore: Zanichelli, 1994. 199 pp. ISBN: 8808091546
Gioia, A. A. The theory of numbers. An introduction. Reprint of the 1970 original. Dover Publications, Inc., Mineola, NY, 2001. xii+207 pp. ISBN: 0-486-41449-3
Rosen, K. H. Elementary number theory and its applications. Fourth edition. Addison-Wesley, Reading, MA, 2000. xviii+638 pp. ISBN: 0-201-87073-8
Tattersall, J. J. Elementary number theory in nine chapters. Cambridge University Press, Cambridge, 1999. viii+407 pp. ISBN: 0-521-58531-7

The main theorems of Functional Analysis.

H. Brezis, Functional Analysis.

Recalls on the elementary properties of groups. Direct and semi-direct products. Permutation groups and simplicity of alternate groups. Actions on groups. Sylow's theorems. Finitely generated abelian groups, free groups, nilpotent groups and solvable groups. Since this is an advanced course, other topics can also be included upon request of the class.

A. Machì, Gruppi. Una introduzione a idee e metodi della Teoria dei Gruppi, SPRINGER VERLAG (2007).
M. Artin, Algebra, BOLLATI BORINGHIERI (1997).

Preliminaries: definition of hyper-surface, integration on hyper-surfaces, the divergence theorem; the Laplace equation: the mean value inequalities, the minimum and maximum principle, the Harnack inequality, the Green representation, the Poisson integral, convergence's theorems, interior estimates on the derivatives, the Perron method for the Dirichlet problem.

“Elliptic partial differential equations of second order. Reprint of the 1998 edition”, D. Gilbarg e N.S. Trudinger, Classics in Mathematics, Springer-Verlag
"Partial differential equations. Second edition", Lawrence C. Evans, Graduate Studies in Mathematics 19, American Mathematical Society

Definition and basic properties of the Sobolev spaces W^{1,p} (Ω). Extension operators. Sobolev inequalities. The space W^{1,p}_0 (Ω). Variational formulation of some elliptic boundary value problems. Existence of weak solutions. Regularity of weak solutions.

"Analisi funzionale", H. Brézis, Liguori Editore
"Partial differential equations. Second edition", Lawrence C. Evans, Graduate Studies in Mathematics 19, American Mathematical Society

Complex numbers: algebraic and topological properties. Geometric representation of complex numbers: polar coordinates and the complex exponential.
Complex functions with complex variables: continuity and properties, differentiability and first properties. Holomorphic functions: properties and examples of holomorphic and non-holomorphic functions. Cauchy-Riemann equations. The real and imaginary parts of holomorphic functions are harmonic conjugated.
Equations of Cauchy-Riemann: proof. Examples. Sequences and complex series. Properties. Power series with complex values. Abel's theorem and Hadamard's formula.
Proof of Abel's Theorem. Taylor's formula for series of complex powers. The exponential and the trigonometric functions as analytical functions. Basic properties.
Periodicity of the complex exponential function. The complex logarithm: first considerations. The ring of formal powers series with complex coefficients: basic properties. Analytical functions: definition and first properties.
Series of converging powers are analytical within the convergence region. Composition of analytical functions. Theorem of the inverse function.
Inverse by composition of a formal series and its convergence. Complex powers and properties. The binomial series and properties. Consequences of the inverse theorem: the canonical form of an analytic function.
Local properties of analytical functions: open function theorem, invertibility criterion, principle of the maximum local module. The fundamental theorem of algebra. Parameterized curves. A holomorphic function with zero derivative is constant.
The locus of the zeros of a non-constant analytical function is discrete. Analytical continuation of functions defined on open connected sets. Principle of the maximum global module. Integrals in paths: definition and first properties. Examples.
A continuous function in a connected open admits a primitive if and only if its integral along a closed curve is zero. Integration of uniformly converging series of functions. Examples. Local primitive of a holomorphic function.
Local primitive of a holomorphic function. The Goursat theorem. Integral of a holomorphic function along a continuous path.
The homotopical form of the Cauchy Theorem. Global primitive of a holomorphic function in a simply connected domain. Applications to the study of the logarithm.
The integral formula of Cauchy. Cauchy formula for development in series and applications: a holomorphic and analytical function; the theorem of Liouville and the fundamental theorem of algebra.
Integral formula for derivatives. The number of windings of a curve with respect to a point. Curves homologous to 0. The global formula of Cauchy.
Proof of the global Cauchy formula. Examples.
The first homology group of an open set with values ​​in integers. The Cauchy formula for homological invariance. Examples.
Applications of the Cauchy theorem: uniform limit on holomorphic function compacts is holomorphic. Examples. Laurent series.
Series expansion of a holomorphic function in a circular crown in the Laurent series. Isolated singularities and the field of meromorphic functions. Examples. Statement of the classification theorem of isolated singularities and residual theorem: local and global versions.
Proof of the classification theorem of isolated singularities and proof of the residues theorem. The logarithmic derivative and the principle of the argument. Calculation of residues.
Classification of the connected open of C. The Riemann map theorem and the uniformization theorem (without proof). The Riemann sphere as a compactification of the complex plane. The group of linear transformations of the projective line and the linear transformations produced by them. The group of automorphisms of the complex plane.
The lemma of Schwarz and the group of automorphisms of the unitary disc. Elements of global analytical functions and function. The logarithm as a global analytical function.
The n-th rooty as a global analytical function. The bundle of germs of analytical functions and its properties. The Riemann surface associated with a global analytical function.
Examples and properties of Riemann surface. The Riemann surface associated with an algebraic function and properties. Summary and considerations on the course program.

L. V. Ahlfors: Complex Analysis, McGraw-Hill.
S. Lang: Complex analysis, GTM 103.
E. Freitag, R. Busam: Complex Analysis, Springer.

INTRODUCTION TO STATISTICAL MECHANICS AND GIBBS STATES
– The goals of statistical mechanics
– Review of thermodynamics. Convex functions and Legendre transform
– Models of statistical mechanics: canonical ensemble, grand canonical and Gibbs states.
– The Ising model and the lattice gas models. Existence of the thermodynamic limit for the free energy of the Ising or lattice gas model.
– The general structure of Gibbs states. Extremal states and mixtures. The notion of phase transition: loss of analyticity and non-uniqueness of the Gibbs state.

THE ISING MODEL
– Review of known results on the Ising model in one or more dimensions.
– The solution of the one-dimensional Ising model via the transfer matrix method.
– The mean field Ising model: exact solution. Phase transition and loss of equivalence between statistical ensembles
– Ising with long-range interactions (Kac potentials) in the mean-field limit. The Maxwell construction.
– FKG and Griffiths inequalities. Existence of the infinite volume correlation functions of states with + and − conditions in the ferromagnetic Ising model.
- The geometric representation of the Ising model: high and low temperature contours.
- Existence of a phase transition in the low temperature Ising model: the Peierls's argument.
– Absence of a phase transition at high temperature and exponential decay of boundary effects boundary conditions.
– Lee-Yang theorem and analyticity of the pressure at non-zero magnetic field.
– Existence of a phase transition in the one dimensional Ising model with power law interaction |x − y|^{−p}, 1

S. Friedli, Y. Velenik: Statistical Mechanics of Lattice Systems: a Concrete Mathematical Introduction, Cambridge University Press, 2017.

G. Gallavotti: Statistical Mechanics. A short treatise, ed. Springer-Verlag, 1999.

Ordinary Differential Equations
Finite difference approximation for ordinary differential equations: Euler's method. Consistency, stability, absolute stability. Second order Runge-Kutta methods.
Single step implicit methods: backward Euler and Crank-Nicolson methods. Convergence of single step methods. Multi-step methods: general structure, complexity, absolute stability. Stability and consistency of multi-step methods. Adams methods, BDF methods, Predictor-Corrector methods. (Reference: Chapter 7 of curse notes "Appunti del corso di Analisi Numerica")

Partial Differential Equations
Finite difference approximation for partial differential equations. Semi-discrete approximations and convergence. The Lax-Richtmeyer theorem. Transport equation: the method of characteristics. The "Upwind" (semi-discrete and fully-discrete) scheme, consistency and stability. Heat equation: Fourier approximation. Finite difference scheme, consistency and stability. Poisson equation: Fourier approximation. Finite difference scheme, convergence. (Reference: notes by R. LeVeque, "Finite Difference methods for differential equations", selected chapters 1, 2, 3, 12, 13)

Roberto Ferretti, "Appunti del corso di Analisi Numerica", in pdf on the course page

Roberto Ferretti, "Esercizi d'esame di Analisi Numerica", in pdf on the course page

Lecture slides in pdf on the course page

Additional notes provided by the teacher

Linear dynamical systems. Forced harmonic oscillator with or without
friction. Stability theorems. Parametric resonance. Chain of
coupled harmonic oscillators: continuum limit and equations of
vibrating rope. Classic elastic diffusion. Hidden prime integrals
in the two-body problem and the harmonic oscillator problem

V.I. Arnol'd, Mathematical Methods of Classical Mechanics, Editors
Riuniti, Rome, 1979 G. Gallavotti, Meccanica Elementare, ed. P.
Boringhieri, Turin, 1986 G. Gentile, Introduction to systems
dynamics, 1 (Ordinary differential equations, qualitative analysis and
some applications) and
2 (Lagrangian and Hamiltonian mechanics) L.D. Landau, E.M. Lifshitz,
Meccanica, Editori Riuniti, Rome, 1976

Notes on graph theory: graph, directed graph, tree, free and rooted tree, connection, strong connection, acyclicality; isomorphisms between graphs, planarity, Kuratowski's theorem, Euler's formula; coloring of graphs, Eulerian paths, Hamiltonian circuits.
Review of algorithm theory and computational complexity: complexity classes, the class of NP, NP-complete, NP-hard problems. Problems of decision, search, enumeration and optimization; problems of nonlinear programming, convex programming, linear programming and integer linear programming; combinatorial optimization problems. Recalls on the elements of combinatorics.
Optimization problems on graphs: visit of graphs, verification of fundamental properties, connection, presence of cycles, strongly connected components, topological ordering of a graph. Minimum spanning tree (Prim and Kruskal algorithms). Paths of minimum cost (Dijkstra and Bellman-Ford algorithms, dynamic programming technique, Floyd-Warshall algorithm, computation of the transitive closure of a graph). Networks and calculation of the maximum flow on a network, maximum flow / minimum cut theorem, Ford-Fulkerson algorithm, Edmonds-Karp algorithm, preflow algorithms, "push-relabel" algorithms.
Partitioning problems of graphs, trees and paths into connected components, objective functions and algorithmic techniques.
Stable marriage problem, generalizations and applications of the problem, Gale and Shapley algorithm.
Huffman codes.
Programming laboratory for the implementation of algorithms in Python language and with the help of Mathematica software.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, "Introduction to algorithms"

Lecture notes and other teaching material in Italian provided by the teacher and made available on the course website (http://www.mat.uniroma3.it/users/liverani/IN440) and on the Microsoft Teams platform

Symplectic geometry and Hamiltonian formalism. Other topics, depending on the interests of the audience

[Z] Zehnder - "Lectures on dynamical systems".

INTRODUCTION TO STATISTICAL MECHANICS AND GIBBS STATES
– The goals of statistical mechanics
– Review of thermodynamics. Convex functions and Legendre transform
– Models of statistical mechanics: canonical ensemble, grand canonical and Gibbs states.
– The Ising model and the lattice gas models. Existence of the thermodynamic limit for the free energy of the Ising or lattice gas model.
– The general structure of Gibbs states. Extremal states and mixtures. The notion of phase transition: loss of analyticity and non-uniqueness of the Gibbs state.

THE ISING MODEL
– Review of known results on the Ising model in one or more dimensions.
– The solution of the one-dimensional Ising model via the transfer matrix method.
– The mean field Ising model: exact solution. Phase transition and loss of equivalence between statistical ensembles
– Ising with long-range interactions (Kac potentials) in the mean-field limit. The Maxwell construction.
– FKG and Griffiths inequalities. Existence of the infinite volume correlation functions of states with + and − conditions in the ferromagnetic Ising model.
- The geometric representation of the Ising model: high and low temperature contours.
- Existence of a phase transition in the low temperature Ising model: the Peierls's argument.
– Absence of a phase transition at high temperature and exponential decay of boundary effects boundary conditions.
– Lee-Yang theorem and analyticity of the pressure at non-zero magnetic field.
– Existence of a phase transition in the one dimensional Ising model with power law interaction |x − y|^{−p}, 1

S. Friedli, Y. Velenik: Statistical Mechanics of Lattice Systems: a Concrete Mathematical Introduction, Cambridge University Press, 2017.

G. Gallavotti: Statistical Mechanics. A short treatise, ed. Springer-Verlag, 1999.

Ordinary Differential Equations
Finite difference approximation for ordinary differential equations: Euler's method. Consistency, stability, absolute stability. Second order Runge-Kutta methods.
Single step implicit methods: backward Euler and Crank-Nicolson methods. Convergence of single step methods. Multi-step methods: general structure, complexity, absolute stability. Stability and consistency of multi-step methods. Adams methods, BDF methods, Predictor-Corrector methods. (Reference: Chapter 7 of curse notes "Appunti del corso di Analisi Numerica")

Partial Differential Equations
Finite difference approximation for partial differential equations. Semi-discrete approximations and convergence. The Lax-Richtmeyer theorem. Transport equation: the method of characteristics. The "Upwind" (semi-discrete and fully-discrete) scheme, consistency and stability. Heat equation: Fourier approximation. Finite difference scheme, consistency and stability. Poisson equation: Fourier approximation. Finite difference scheme, convergence. (Reference: notes by R. LeVeque, "Finite Difference methods for differential equations", selected chapters 1, 2, 3, 12, 13)

Roberto Ferretti, "Appunti del corso di Analisi Numerica", in pdf on the course page

Roberto Ferretti, "Esercizi d'esame di Analisi Numerica", in pdf on the course page

Lecture slides in pdf on the course page

Additional notes provided by the teacher

1. Introduction to information theory.
Reliable transmission of information. Shannon's information content. Measures of information. Entropy, mutual information, informational divergence. Data compression. Error correction. Data processing theorems. Fundamental inequalities. Information diagrams. Informational divergence and maximum likelihood.

2. Source coding and data compression
Typical sequences. Typicality in probability. Asymptotic equipartitioning property. Block codes and variable length codes. Coding rate. Source coding theorem. Lossless data compression. Huffman code. Universal codes. Ziv-Lempel compression.

3. Channel coding
Channel capacity. Discrete memoryless channels. Information transmitted over a channel. Decoding criteria. Noisy channel coding theorem.

4. Further codes and applications
Hamming space. Linear codes. Generating matrix and check matrix. Cyclic codes. Hash codes.

David J. C. MacKay. Information Theory, Inference and Learning Algorithms. Cambridge University Press, 2004.

Teaching mathematics with the help of a computer: GeoGebra and Mathematica softwares.
Commands for numerical and symbolic calculus, graphics visualization, parametric surfaces and curves with animations in changing parameters.
Solving problems: triangle's properties in Euclidean and non-Euclidean geometry with examples, approximation of pi and other irrational numbers, solutions of equations and inequalities, systems of equations, defining and visualizing geometrical loci, function integral and derivatives, approximation of surface area.

List of problems given in class concerning visualization and solutions with the help of software Mathematica or GeoGebra.

1. Classic Cryptography

- Basic cryptosystems: encryption by substitution, by translation, by permutation, affine cryptosystem, by Vigenère, by Hill. Stream encryption (synchronous and asynchronous), Linear feedback shift registers (LFSR) on finite fields, Autokey cypher. Product cyphers. Basic cryptanalysis: classification of attacks; cryptoanalysis for affine cyphers, for substitution cypher (frequency analysis), for Vigenere cypher: Kasiski test, coincidence index; cryptoanalysis of Hill's cypher and LFSR: algebraic attacks, cube attack.

2. Application of Shannon theory to cryptography

- Security of cyphers: computational security, provable security, unconditional security. Basics of probability: discrete random variables, joint probability, conditional probability, independent random variables, Bayes' theorem. Random variables associated with cryptosystems. Perfect secrecy for encryption systems. Vernam cryptosystem. Entropy. Huffman codes. Spurious Keys and Unicity distance.

3. Block cyphers

- iterative encryption schemes; Substitution-Permutation Networks (SPN); Linear cryptanalysis for SPN: Piling-Up Lemma, linear approximation of S-boxes, linear attacks on S-boxes; Differential cryptanalysis for SPN; Feistel cyphers; DES: description and analysis; AES: description; Notes on finite fields: operations on finite fields, Euclid's generalized algorithm for the computation of the GCD and inverse; Operating modes for block cyphers.

4. Hash functions and codes for message authentication

- Hash functions and data integrity. Safe hash functions: resistance to the pre-image, resistance to the second pre-image, collision resistance. The random oracle model: ideal hash functions, properties of independence. Randomized algorithms, collision on the problem of the second pre-image, collision on the problem of the pre-image. Iterated hash functions; the construction of Merkle-Damgard. Safe Hash Algorithm (SHA-1). Authentication Codes (MAC): nested authentication codes (HMAC).

[1] Antoine Joux, Algorithmic Cryptanalysis, (2010) CRC Press.
[2] Douglas Stinson, Cryptography: Theory and Practice, 3rd edition, (2006) Chapman and Hall/CRC.
[3] Delfs H., Knebl H., Introduction to Cryptography, (2007) Springer Verlag.

Graphs: basic definitions. Simple and non simple graphs, planarity, connectivity, degree, regularity, incidence and adjacency matrices. Examples of families of graphs. The '' handshaking lemma ''.
Graphs obtained from others: complement, subgraph, cancellation and contraction. Isomorphisms and automorphisms of graphs. Connectivity: paths, cycles. A graph is bipartite if and only if each cycle has equal length.
Connetivity and connected component. Connectivity for sides and vertices. Eulerian and semi-Eulerian graphs.
Euler's theorem: a connected graph is Eulerian if and only if every vertex has an even degree. Hamiltonian graphs. Sufficient conditions to guarantee that a graph is Hamiltonian: the theorems of Ore and Dirac.
the Ore theorem. Trees and forests. The cyclomatic number and the "cutset" rank of a graph.
Fundamental system of cycles and cuts associated with a generating forest. Enumeration of generating forests. The Cayley theorem.
Generating trees: the "greedy" algorithm for the "connector problem". Planar graphs. K3.3 and K5 are not planar. Statement of the theorem of Kuratovski and variations.
Euler's formula for planar graphs. The dual of a planar graph.
Correspondence between cycles and cuts for planar graphs and their dual. Dual abstract. A graph that admits a dual abstract is planar. Colorings: initial considerations and some properties.
Colorings: the 5 colors theorem. Graphs on surfaces: classification of topological surfaces.
Coloring of faces and duality between this problem and the coloring of vertices. Reduction of the proof of the 4-color theorem to the coloring of cubic graph faces. '' The marriage problem ": Hall's theorem.
Hall's theorem in the language of transversals. Criteria of existence of transversal and partial transversivities. Application to the construction of Latin squares. Direct graphs: basic notions and orientability.
The Max-Flow Min-Cut theorem and Menger's theorem.
Complexity of algorithms and applications to the theory of graphs.
Introduction to the theory of matroids: definitions using bases and independent elements. Graphical and cographic matroids, vector matroids and the problem of representability.
Definition of matroid using the cycles and the rank function. Minors of a matroid. Transverse matroids and the Rado Theorem for matroids.
Union of matroids and applications: existence of disjoint bases in a matroid. Duality for matroids and applications to graphic and cographic matroids. Planar matroids and the generalization of Kuratovski's theorem for matroids.
Elements of algebraic graph theory: the incidence matrix and the Laplacian matrix of an oriented graph. The vertex space and the space of edges of a graph. Subspaces of the cycles and subspace of the cuts of a defined oriented graph of the incidence matrix.
Basis for the space of the cycles and for the space of the cuts of a graph. The Riemann-Roch theorem for graphs.
Proof of the "generalized Matrix Tree theorem". The contraction / restriction algorithm for matroids. Examples. The number of acyclical orientations of a graph.
Graph polynomials: the chromatic polynomial, the "reliabiliaty" polynomial. Examples. The polynomial rank of a matroid. Properties and first applications.
Proof of the structure theorem for functions on matroids that satisfy contraction/restriction properties. Their incarnation through the polynomial rank.
Whitey's moves and two isomorphisms for graphs. Isomorphism between graphical matroids implies isomorphism between graphs in case the graphs are 3 connected.
Whitney's Theorem for graphic matroids: sketch of the demonstration. Characterization for minors excluded from binary and regular matroids. The theorem of Seymour.

R. Diestel: Graph theory, Spriger GTM 173.
R. Wilson: Introduction to Graph theory, Prentice Hall.
B. Bollobas: Modern Graph theory, Springer GTM 184.
J. A. Bondy, U.S.R. Murty: Graph theory, Springer GTM 244.
N. Biggs: Algebraic graph theory, Cambridge University Press.
C. D. Godsil, G. Royle: Algebraic Graph theory, Springer GTM 207.
J. G. Oxley: Matroid theory. Oxford graduate texts in mathematics, 3.

Presentation of the problems that can be treated through integrals on large number of dimensions

Basics

Probability and Random variables

Measurement, uncertainty and its propagation

Curve-fitting, least-squares, optimization

Classical numerical integration, speed of convergence

Integration MC (Mean, variance)

Sampling Strategies

Applications

Propagation of uncertainties

Generation according to a distribution

Real World Applications

Cosmic Rays Shower

System Availabilty

Further applications

Weinzierl, S. - Introduction to Monte Carlo methods arXiv:hep-ph/0006269

Taylor, J. - Introduzione all'analisi degli errori : lo studio delle incertezze nelle misure fisiche - Zanichelli Disponibile nella biblioteca Scientifica di Roma Tre

Dubi, A. - Monte Carlo applications in systems engineering - Wiley Disponibile nella biblioteca Scientifica di Roma Tre

Teacher's notes

CONTENTS OF THE LECTURES: the numbers in round brackets refer to the chapter and section of the textbook adopted.
Kinetic theory of gases. Boltzmann equation and H theorem. (1, Par.2.1,2.2,2.3,2.4)
Maxwell-Boltzmann distribution. (1, Par. 2.5)
Phase space and Liouville theorem. (1, Par. 3.1,3.2)
Gibbs ensembles. Micro canonical ensemble. Definition of entropy. (1, Par. 3.3,3.4)
The ideal gas in the micro canonical ensemble. (1, Par. 3.6)
The equipartition theorem. (1, Par. 3.5)
The canonical ensemble. (1, Par.4.1).
The partition function and the free energy. Fluctuations of energy in the canonical ensemble. (1 Par. 4.4)
The grand canonical ensemble. The grand potential. The ideal gas in the grand canonical ensemble. (1 Par. 4.3).
Fluctuations of the particle number. (1 Par. 4.4)
Classical theory of the linear response and fluctuation-dissipation theorem. (1, Par. 8.4).
Einstein and Langevin theories of the Brownian motion. (Par. 1 par. 11.1,11.2).
Johnson-Nyqvist theory of thermal noise. (1 Par. 11.3).
Quantum statistical mechanics and the density matrix. (1, Par. 6.2,6.3,6.4)
Fermi-Dirac and Bose-einstein quantum statistics. ( 1, Par. 7.1)
The Fermi gas. The Sommerfeld expansion and the electron specific heat. (1, Par. 7.2)
The Bose gas. The Bose-Einstein condensation. (1, Par. 7.3)
Quantum theory of black-body radiation. (1, Par. 7.5)

e-Learning Moodle Platform with Supplementary Material

Suggested textbook:
1) C. Di Castro and R. Raimondi, Statistical Mechanics and Applications in Condensed Matter, Cambridge University Press, 2015.

Topics Part A

• Coordinates and Telescopes
• Elements of Spectroscopy
• Stars and Stellar Evolution • Galaxies
• Active Galactic Nuclei


Program Part A

• Overview

• Celestial coordinates (1.3)

• Telescopes and resolving power (6.1)

• Parallax distance (3.1)

• Flux, brightness, apparent and absolute magnitudes, colors (3.2, 3.3, 3.6)

• The black body (3.4, 3.5)

• Hertzsprung-Russel diagram (8.2)

• Open and globular clusters: position, stellar populations and HR diagram (13.3)

• White dwarfs, Novae and SuperNovae (notes and partly in 15 and 16)

• The classification of galaxies (24.1)

• The rotation curve of galaxies and dark matter (25.3)

• The center of the Galaxy and its Black Hole (25.4)

• Hubble's law and expansion of the Universe (27.2)

• Probability of collision between stars and galaxies (handouts)

• Black Holes: outline of General Relativity (outline 17)

• Active Galactic Nuclei (28.1, 28.2, 28.3)


Topics Part B

• Structure and stellar evolution
• Elements of Spectroscopy
• Distances and expansion of the Universe • Galaxies
• GRB and gravitational waves

Program Part B

• Acretion disks and X-ray emission in Active Galactic Nuclei (28.2)

• Stars of Neutrons and Pulsars (16.6, 16.7)

• Gamma Ray Bursts (handouts)

• Gravitational Waves (lecture notes)

• Spectroscopy: eq. Boltzmann-excitation and Saha-ionization (8.1)

• Spectroscopy: speed, temperature and density measurements (handouts)

• Eq. of star structure, time and Kelvin-Helmholtz instability (11.1-4)

• Nuclear reactions of hydrogen (11.3)

• Jeans mass of gravitational collapse, free-fall time and Initial Mass Function (12.2, 12.3)

• The Milky Way and the local group (25.1, 25.2)

• Metallicity (25.2)

• Transit of Venus and measurement of the Earth-Sun distance (handouts)

• Distance scale (27.1)

• Hubble's law and expansion of the Universe (27.2)

• Local Group, Clusters of Galaxies, large scale structure of the Universe (27.3)

• The Big Bang and the background radiation (29.2 brief notes and lecture notes)

A copy of the lecture notes can be downloaded from the course website.

In brackets, the paragraphs from “An Introduction to Modern Astrophysics, II ed. - B.W. Carrol, D.A. Ostlie - Ed. Pearson, Addison Wesley ”(copies available in the library). The discussion in the course has been simplified compared to what is reported in the text. Alternative text in Italian: Attilio Ferrari, Stars, Galaxies, Universe - Fundamentals of Astrophysics - Ed. Springer

1. The themes of logic
2. Classical logic: propositions, proofs
3. Classical logic: connectives
4. Classical logic: types, variables, quantifiers
5. First-order Classical logic
6. Classes and sets
7. Codes, digits, Boolean algebra
8. Turing Machine
9. Axiomatization and formalization of first-order classical logic
10. Logic and other disciplines

V. Michele Abrusci, LOGICA - Lezioni di primo livello, Quarta edizione, Wolters Kluwer, 2018

Division, Factorization, Some Elementary Properties of Primes, Some Results and Problems Concerning Primes.
ARITHMETIC FUNCTIONS: The Divisor Function. The Moebius Function. The Euler Function. Dirichlet Convolution
CONGRUENCES: Sets of Residues,Some Interesting Congruences, Some Linear Congruences, Some Polynomial Congruences, Primitive Roots, the Theorem of Gauss.
QUADRATIC RESIDUES: The Legendre Symbol. Quadratic Reciprocity. The Jacobi Symbol.The Distribution of Quadratic Residues.
SUMS OF INTEGER SQUARES: Sums of Two Squares. Number of Representations. Sums of Four Squares. Sums of Three Squares.
ELEMENTARY PRIME NUMBER THEORY: Euclid's Theorem Revisited. The Von Mangoldt Function. Tchebycheff's Theorem. Some Results of Mertens

Chen, W; ELEMENTARY NUMBER THEORY. https://rutherglen.science.mq.edu.au/wchen/lnentfolder/lnent.html
Chowdhury, F.; Chowdhury, M. R. Essentials of Number Theory. Pi Publications, Dhaka, Bangladesh, 2005. ISBN 984-32-2836-7
Hardy, G. H.; Wright, E. M. An introduction to the theory of numbers. Fifth edition. The Clarendon Press, Oxford University Press, New York, 1979. xvi+426 pp. ISBN: 0-19-853170-2; 0-19-853171-0
Davenport, H. Aritmetica superiore. Un'introduzione alla teoria dei numeri. Editore: Zanichelli, 1994. 199 pp. ISBN: 8808091546
Gioia, A. A. The theory of numbers. An introduction. Reprint of the 1970 original. Dover Publications, Inc., Mineola, NY, 2001. xii+207 pp. ISBN: 0-486-41449-3
Rosen, K. H. Elementary number theory and its applications. Fourth edition. Addison-Wesley, Reading, MA, 2000. xviii+638 pp. ISBN: 0-201-87073-8
Tattersall, J. J. Elementary number theory in nine chapters. Cambridge University Press, Cambridge, 1999. viii+407 pp. ISBN: 0-521-58531-7

Notes on graph theory: graph, directed graph, tree, free and rooted tree, connection, strong connection, acyclicality; isomorphisms between graphs, planarity, Kuratowski's theorem, Euler's formula; coloring of graphs, Eulerian paths, Hamiltonian circuits.
Review of algorithm theory and computational complexity: complexity classes, the class of NP, NP-complete, NP-hard problems. Problems of decision, search, enumeration and optimization; problems of nonlinear programming, convex programming, linear programming and integer linear programming; combinatorial optimization problems. Recalls on the elements of combinatorics.
Optimization problems on graphs: visit of graphs, verification of fundamental properties, connection, presence of cycles, strongly connected components, topological ordering of a graph. Minimum spanning tree (Prim and Kruskal algorithms). Paths of minimum cost (Dijkstra and Bellman-Ford algorithms, dynamic programming technique, Floyd-Warshall algorithm, computation of the transitive closure of a graph). Networks and calculation of the maximum flow on a network, maximum flow / minimum cut theorem, Ford-Fulkerson algorithm, Edmonds-Karp algorithm, preflow algorithms, "push-relabel" algorithms.
Partitioning problems of graphs, trees and paths into connected components, objective functions and algorithmic techniques.
Stable marriage problem, generalizations and applications of the problem, Gale and Shapley algorithm.
Huffman codes.
Programming laboratory for the implementation of algorithms in Python language and with the help of Mathematica software.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, "Introduction to algorithms"

Lecture notes and other teaching material in Italian provided by the teacher and made available on the course website (http://www.mat.uniroma3.it/users/liverani/IN440) and on the Microsoft Teams platform

The main theorems of Functional Analysis.

H. Brezis, Functional Analysis.

Recalls on the elementary properties of groups. Direct and semi-direct products. Permutation groups and simplicity of alternate groups. Actions on groups. Sylow's theorems. Finitely generated abelian groups, free groups, nilpotent groups and solvable groups. Since this is an advanced course, other topics can also be included upon request of the class.

A. Machì, Gruppi. Una introduzione a idee e metodi della Teoria dei Gruppi, SPRINGER VERLAG (2007).
M. Artin, Algebra, BOLLATI BORINGHIERI (1997).

Preliminaries: definition of hyper-surface, integration on hyper-surfaces, the divergence theorem; the Laplace equation: the mean value inequalities, the minimum and maximum principle, the Harnack inequality, the Green representation, the Poisson integral, convergence's theorems, interior estimates on the derivatives, the Perron method for the Dirichlet problem.

“Elliptic partial differential equations of second order. Reprint of the 1998 edition”, D. Gilbarg e N.S. Trudinger, Classics in Mathematics, Springer-Verlag
"Partial differential equations. Second edition", Lawrence C. Evans, Graduate Studies in Mathematics 19, American Mathematical Society

Definition and basic properties of the Sobolev spaces W^{1,p} (Ω). Extension operators. Sobolev inequalities. The space W^{1,p}_0 (Ω). Variational formulation of some elliptic boundary value problems. Existence of weak solutions. Regularity of weak solutions.

"Analisi funzionale", H. Brézis, Liguori Editore
"Partial differential equations. Second edition", Lawrence C. Evans, Graduate Studies in Mathematics 19, American Mathematical Society

Highlights of Linear Algebra:
Matrix-matrix multiplication; column & row space; rank
The four fundamental subspaces of linear algebra
Fundamentals of Matrix factorizations:
A=LU rows & columns point of view
A=LU elimination & factorization; permutations
A=RU=VU; Orthogonal matrices
Eigensystems and Linear ODE
Intro to PSym; the energy function
Gradient and Hessian
Singular Value Decomposition
Eckart-Young; derivative of a matrix norm
Principal Component Analysis
Generalized evectors;
Norms
Least Squares
Convexity & Newton’s method
Newton & L-M method; Recap of non-linear regression
Lagrange multipliers

Machine Learning:
Gradient Descend; exact line search; GD in action; GD with Matlab
Learning & Loss; Intro to Deep Neural Network; DNN with Matlab
Loss functions: Quadratic VS Cross entropy
Stocastics Gradient Descend (SGD) & Kaczmarcz; SGD convergence rates & ADAM
Matlab interface for DNN
Construction of DNN: the key steps
Backpropagation and the Chain Rule
Machine Learning examples with Wolfram Mathematica
Convolutional NN + Mathematica examples of 1D convolution
Convolution and 2D filters + Mathematica examples of 2D convolution
Matlab Live Script, Network Designer, Pretrained Net

Lecture notes

G. Strang,
Linear Algebra and Learning from Data,
Wellesley-Cambridge Press

Complex numbers: algebraic and topological properties. Geometric representation of complex numbers: polar coordinates and the complex exponential.
Complex functions with complex variables: continuity and properties, differentiability and first properties. Holomorphic functions: properties and examples of holomorphic and non-holomorphic functions. Cauchy-Riemann equations. The real and imaginary parts of holomorphic functions are harmonic conjugated.
Equations of Cauchy-Riemann: proof. Examples. Sequences and complex series. Properties. Power series with complex values. Abel's theorem and Hadamard's formula.
Proof of Abel's Theorem. Taylor's formula for series of complex powers. The exponential and the trigonometric functions as analytical functions. Basic properties.
Periodicity of the complex exponential function. The complex logarithm: first considerations. The ring of formal powers series with complex coefficients: basic properties. Analytical functions: definition and first properties.
Series of converging powers are analytical within the convergence region. Composition of analytical functions. Theorem of the inverse function.
Inverse by composition of a formal series and its convergence. Complex powers and properties. The binomial series and properties. Consequences of the inverse theorem: the canonical form of an analytic function.
Local properties of analytical functions: open function theorem, invertibility criterion, principle of the maximum local module. The fundamental theorem of algebra. Parameterized curves. A holomorphic function with zero derivative is constant.
The locus of the zeros of a non-constant analytical function is discrete. Analytical continuation of functions defined on open connected sets. Principle of the maximum global module. Integrals in paths: definition and first properties. Examples.
A continuous function in a connected open admits a primitive if and only if its integral along a closed curve is zero. Integration of uniformly converging series of functions. Examples. Local primitive of a holomorphic function.
Local primitive of a holomorphic function. The Goursat theorem. Integral of a holomorphic function along a continuous path.
The homotopical form of the Cauchy Theorem. Global primitive of a holomorphic function in a simply connected domain. Applications to the study of the logarithm.
The integral formula of Cauchy. Cauchy formula for development in series and applications: a holomorphic and analytical function; the theorem of Liouville and the fundamental theorem of algebra.
Integral formula for derivatives. The number of windings of a curve with respect to a point. Curves homologous to 0. The global formula of Cauchy.
Proof of the global Cauchy formula. Examples.
The first homology group of an open set with values ​​in integers. The Cauchy formula for homological invariance. Examples.
Applications of the Cauchy theorem: uniform limit on holomorphic function compacts is holomorphic. Examples. Laurent series.
Series expansion of a holomorphic function in a circular crown in the Laurent series. Isolated singularities and the field of meromorphic functions. Examples. Statement of the classification theorem of isolated singularities and residual theorem: local and global versions.
Proof of the classification theorem of isolated singularities and proof of the residues theorem. The logarithmic derivative and the principle of the argument. Calculation of residues.
Classification of the connected open of C. The Riemann map theorem and the uniformization theorem (without proof). The Riemann sphere as a compactification of the complex plane. The group of linear transformations of the projective line and the linear transformations produced by them. The group of automorphisms of the complex plane.
The lemma of Schwarz and the group of automorphisms of the unitary disc. Elements of global analytical functions and function. The logarithm as a global analytical function.
The n-th rooty as a global analytical function. The bundle of germs of analytical functions and its properties. The Riemann surface associated with a global analytical function.
Examples and properties of Riemann surface. The Riemann surface associated with an algebraic function and properties. Summary and considerations on the course program.

L. V. Ahlfors: Complex Analysis, McGraw-Hill.
S. Lang: Complex analysis, GTM 103.
E. Freitag, R. Busam: Complex Analysis, Springer.

Symplectic geometry and Hamiltonian formalism. Other topics, depending on the interests of the audience

[Z] Zehnder - "Lectures on dynamical systems".

Fields extensions and their basic properties.

Algebraic closure of a field: existence and uniqueness. Kronecker's construction.

Splitting fields and normal extensions.

Separable, inseparable and purely inseparable extensions. Primitive element theorem.

Galois extensions. Galois group and Galois correspondence for finite extensions.

Prefinite groups and Krull topology. Galois correspondence for infinite extensions.

Galois group of an equation. Cyclotomic extensions. Generic equation of degree n.

Linear independence of characters. Trace and norm. Hilbert 90 theorem. Cyclic extensions and Kummer theory.

Solvable groups. Solvable and solvable by radicals extensions.

More examples and applications.

Algebra S. Bosch

Algebra S. Lang

Algebra M. Artin

Class Field Theory J. Neukirch

1. Topological classification of curves and compact surfaces. Triangulations, Euler characteristic.
2. Smooth and regular curves in Euclidean space. Immersions and imbeddings. Arc length. Curvature and the Fundamental Theorem of local geometry of plane curves.
3. Regular surfaces in R^3, local coordinates. Inverse image of a regular value. Maps and diffeomorphisms. Tangent plane and derivative of a map. Normal unit vector, orientation
and the Gauss map of a surface in R^3. Orientable surfaces, examples. The Moebius band is non-orientable.
4. Riemannian metric, examples. The shape operator is self-adjoint. Principal and asymptotic directions. The Mean and Gauss curvatures.
5. The geometry of the Gauss map. The sign of the Gauss curvature and position of the tangent plane. Theorems of Meusnieur and Olinde Rodrigues. Geometric properties of compact surfaces, Minimal surfaces and Ruled surfaces.
6. Isometries and local isometries. The Shape operator in isothermal coordinates. Proof of Gauss' Theorema Egregium. Examples, counter-examples and applications.
7. Homeworks.
8. 12 hours of lab for the visualization and computation on curves and surfaces.

Textbooks
[1] J.M. Lee, Introduction to topological manifolds. Springer, (2000). - – http://dx.doi.org/10.1007/b98853
[2] E. Sernesi, Geometria 2. Boringhieri, (1994).
[3] M. Do Carmo , Differential Geometry of Curves and Surfaces. Prentice Hall, (1976).
[4] M.Abate, F.Tovena, Curve e Superfici. Springer, (2006).

Rings and ideals, maximal ideals and prime ideals, nilradical andJacobson radical, the spectrum of a ring. Modules, finitely generated modules and Nakayama's Lemma, exact sequences, tensor product, restriction and extension of scalars. Rings and modules of fractions, localization. Primary decomposition. Integral dependence and valuation. Chain conditions. Noetherian rings, Hilbert's Basis Theorem, Nullstellensatz. Discrete valuation rings and Dedekind domains. Hints of dimension theory.

M. F. Atiyah, I. G. Macdonald, Introduction to Commutative Algebra. Addison-Wesley, 1996.
M. Reid, Undergraduate Algebraic Geometry, Cambridge University Press, 1988.
D. Eisenbud, Commutative Algebra with a view toward Algebraic Geometry, Springer-Verlag, 1995.
A. Gathmann, Commutative Algebra, Lecture notes.

Algebraic varieties in affine and projective spaces over algebraically closed fields.
Veronese and Segre varieties.
Products and projections.
Local geometry of algebraic varieties

Divisors linear systems and e morphisms of projective varieties.
Commutative algebra

I. Shafarevich. Basic algebraic geometry vol. 1 Springer-Verlag, New York-Heidelberg, 1977.
L. Caporaso. Introduzione alla geometria algebrica . Versione preliminare.

1) Computability, complexity and representability:

- Introduction to decision problems, algorithmic and non-algorithmic procedures, deterministic computations, discrete procedures, the notion of alphabet, of speech. Decidability and semi-decidability of a set. Deterministic, finitary and discrete computations. Formal algorithms: formal definition of algorithm, configurations of input, output, transition function. Example of formalization of an algorithm. Decidability for finished automata. Representation of the automata by matrices. Free Monoid of words. Formal semi-rings. Non-deterministic finite automata. Regular Languages. Equivalence between deterministic and non-deterministic automata.

- Turing machines: definition, decidability for Turing machine, stopping time, stopping space. Cost of computation. Complexity: worst-case and average case. Independence of decision time from a finite number of input configurations. Complexity functions, complexity classes DTIME and DSPACE (deterministic time and space). Inclusion DTIME (T (n)) ⊂ DSPACE (T (n)) ⊂ DTIME (2 ^ {cT (n)}). Pumping Lemma. Simulation of algorithms, simulation of the half tape Turing machine, simulation of a multi-tape machine. Special Turing machines. Linear Speedup theorem for Turing machines with an extended alphabet. Evaluation of acceleration coefficient in relation to alphabets. Decisions of natural number sets. Independence from representation. Considerations concerning complexity.

- Turing computability: definition of Turing computable function, characteristic functions of Turing decidable sets, the class of Turing computable functions is closed by composition, concatenation, primitive recursion and minimization. Examples of Turing computable functions. Recursive Functions: equivalence between Turing computability and recursive functions. Ackermann function ([1] chapter 1,2,3,4,5 and [4] chapter 1).

- Time-constructible functions. The notion of T-clock. Examples of some time constructible function. Closure by composition.

- Non-deterministic Turing machines: characterization through the decidability of projection sets. Definition of the class of polynomial non-deterministic functions. NP-complete problems.

2) Lambda calculus and functional programming:

- Declarative programming: a historical outline on the lambda calculus, basic definitions, the terms of the lambda calculus, the simple substitution. Relations on the lambda terms. Congruences, transition to the context. α-equivalence. alpha-equivalence passes to the context. The transitive closure of a relationship, owned by Church-Rosser. Listing of lambda-terms concerning alpha-equivalence.

- Definition of beta-reduction and beta-equivalence. Church-Rosser's theorem for beta-reduction. Normal forms for beta-reduction. Beta-reduction strategies. Normalizing strategy: left reduction (left most-outer most). Head reduction. Soluble Terms. Head Normal Forms. Solvability characterization theorem.

- Representation of the recursive functions: lambda definability theorem. Existence of the fixed point for the lambda terms. Church Fixed Point and Curry fixed point.
- Representation of other data types in the lambda-calculus: pairs, lists, trees, the solution of recursive equations on lambda-terms ([2] chapters 1, 2, 5).

[1] DEHORNOY, P., COMPLEXITÈ ET DECIDABILITÈ. SPRINGER-VERLAG, (1993).
[2] KRIVINE, J.-L., LAMBDA CALCULUS: TYPES AND MODELS. ‪ELLIS HORWOOD, (1993).
[3] SIPSER,M., INTRODUCTION TO THE THEORY OF COMPUTATION.THOMSON COURSE TECHNOLOGY, (2006).

Introduction to set theory: aggregates and sets, necessity of a theory, ordinals and cardinals, antinomies and paradoxes, main characteristics of axiomatic set theory. Zermelo’s axiomatic set theory and Zermelo-Fraenkel’s axiomatic set theory: preliminaries and conventions, Zermelo’s axioms, the replacement axiom and Zermelo-Fraenkel’s theory, extensions of the language by definition. Ordinals: orders, well-orders and well-foundedness, well-foundedness and induction principle, the ordinal numbers, well-orders and ordinals, ordinal induction (proofs and definitions), diagonal argument and limit ordinals, infinity axiom and ordinal arithmetic, hints on the use of ordinals in proof-theory. Axiom of choice: equivalent formulations (and proof of the equivalence), infinite sets and axiom of choice. Cardinals: equipotent sets and infinite sets, the cardinal numbers, cardinal arithmetic.

Testi: V. Michele Abrusci e Lorenzo Tortora de Falco, Logica. Vol. 2 Incompletezza, teoria assiomatica degli insiemi, Springer, 2018

Categories.
Abstract and geometrical implicial complexes.
Singular homology and simplicial homology.
Cohomology
Duality Theorems
Persistent homology and data analysis
Elements of differential topology
Differential forms and de Rham cohomology

Allen Hatcher: Algebraic topology Cambridge University press.
Vidit Nanda: Computational Algebraic Topology - Lecture notes
James R. Munkres : Topology Prentice Hall.
Raoul Bott, Loring W. Tu,Differential forms in algebraic topology.Springer, (1986).
Marco Abate, Francesca Tovena,Geometria Differenziale.Springer, (2011).

Lebesgue integration in Rn, Fourier transform, theory of differential equations

Luigi Chierchia, Analisi matematica due
Reed-Simon

Measure theory, outer measures, construction of Borel measures.
Integration theory, limit theorems, convergence in mean and in measure, integration on product spaces.
Radon measures, regularity, positive linear functionals, Riesz representation theorem.
Signed measures, decomposition theorems, differentiation, BV functions, fundamental theorem of calculus.
Lp spaces, basic properties, dual spaces, density theorems.
Introduction to geometric measure theory

G. Folland - "Real Analysis" - Wiley

1. General theory:
- Existence and uniqueness theorems (Gronwall's lemmas; Picard's theorem, Peano's theorem).
- Existence intervals and maximal solutions.
- Dependence on initial data and parameters.

2. Qualitative analysis of some simple EDO classes. Phase space.

3. Linear systems with constant coefficients. Exponential of matrices and Jordan's normal form theorem.

4. Linear systems with variable coefficients. Solution spaces. The Wronskian.

6. Periodic solutions and Fourier series.

7. Hamiltonian systems and celestial mechanics (introduction)

Gerald Teschl: Ordinary Differential Equations and Dynamical Systems , Graduate Studies in Mathematics Volume 140, American Mathematical Society, 2011

Shair Ahmad and Antonio Ambrosetti, Differential Equations. A first course on ODE and a brief introduction to PDE
Series: De Gruyter Textbook De Gruyter | 2019 DOI: https://doi.org/10.1515/9783110652864

Evolution equations of Mathematical Physics: transport, wave and heat equations. Introduction to quantum mechanics. Fourier transform

[B] P. Butta', Note del corso di Fisica Matematica
[Cr] W. Craig, A course on Partial Differential Equations
[L1] V. Lubicz, Apppunti di Meccanica Quantistica

Linear Systems
Direst methods: Gaussian elimination. Pivoting strategies. Gaussian elimination as a factorization. Doolittle and Choleshy factorizations. Iterative methods: Jacobi, Gauss-Seidel, SOR, Richardson, and related convergence results. Comparison of direct vs iterative solvers. Stability of algorithms for the solution of linear systems.

Iterative Methods for Scalar Nonlinear Equations
The intermediate zero theorem. The algorithms of bisection, Newton, secants, chords, and related convergence results. (Reference: Chapter 1 excluding Section 1.2.3, and Appendices A.1, A.2)

Approximation of Functions
General approximation strategies. Interpolating polynomial in Lagrange and Newton form. Representation of the interpolation error. Convergence of the interpolating polynomial for analytic functions. Refinement strategies in interpolation: Chebyshev nodes, composite approximations. Error estimates. Hermite polynomial, construction and representation of the error. Least Squares approximations. (Reference: Chapter 5 excluding Section 5.2, and Appendix A.4)

Numerical Integration
General principles of numerical integration. Polya's Theorem on the convergence of interpolatory quadrature formulae. Closed and open Newton-Cotes formulae. Stability results and error estimation. Generalized Newton-Cotes formulae and their convergence. Gaussian quadratures and their convergence. (Reference: Chapter 6)

Laboratory Activity
C language coding of some of the major algorithms, and in particular: Gaussian elimination, iterative methods for linear systems and scalar equations, Lagrange/Newton interpolation with a refinement strategy.

N.B.: References are provided with respect to the course notes.

Roberto Ferretti, "Appunti del corso di Analisi Numerica", available from the course page

Roberto Ferretti, "Esercizi d'esame di Analisi Numerica", available from the course page

Slides of the lessons, available from the course page

Branching processes, introduction to Sigma-algebras, measure spaces and probability spaces. Contruction of Lebesgue measure. Pi-systems, Dynkin's lemma. Properties of measures, sup and inf limits of events, measurable functions and random variables. Borel-Cantelli lemmas. Law and distribution of a random variable. Concept of independence. Convergence in probability and almost sure convergence. Skorokhod's representation theorem. Kolmogorov's 0-1 law.
Integrals, their properties and related theorems. Expectation of random variables. Markov, Jensen and Hoelder's inequalities. L^p spaces. Weierstrass' Theorem. Product measures, Fubini's theorem and joint laws.
Conditional expectation and its properties. Martingales, predictable processes. Stopping times and stopped processes. Optional stopping theorem, applications to random walks. Theorems about convergence of martingales. Strong law of large numbers.
Doob's inequalities for martingales and sub-martingales, applications. Characteristic functions and inversion theorem. Fourier transform in L^1. Equivalence between convergence in distribution and convergence of characteristic functions. Central limit theorem.

D. Williams, Probability with martingales
R. Durrett, Probability: Theory and examples

Fields extensions and their basic properties.

Algebraic closure of a field: existence and uniqueness. Kronecker's construction.

Splitting fields and normal extensions.

Separable, inseparable and purely inseparable extensions. Primitive element theorem.

Galois extensions. Galois group and Galois correspondence for finite extensions.

Prefinite groups and Krull topology. Galois correspondence for infinite extensions.

Galois group of an equation. Cyclotomic extensions. Generic equation of degree n.

Linear independence of characters. Trace and norm. Hilbert 90 theorem. Cyclic extensions and Kummer theory.

Solvable groups. Solvable and solvable by radicals extensions.

More examples and applications.

Algebra S. Bosch

Algebra S. Lang

Algebra M. Artin

Class Field Theory J. Neukirch

Evolution equations of Mathematical Physics: transport, wave and heat equations. Introduction to quantum mechanics. Fourier transform

[B] P. Butta', Note del corso di Fisica Matematica
[Cr] W. Craig, A course on Partial Differential Equations
[L1] V. Lubicz, Apppunti di Meccanica Quantistica

1. Topological classification of curves and compact surfaces. Triangulations, Euler characteristic.
2. Smooth and regular curves in Euclidean space. Immersions and imbeddings. Arc length. Curvature and the Fundamental Theorem of local geometry of plane curves.
3. Regular surfaces in R^3, local coordinates. Inverse image of a regular value. Maps and diffeomorphisms. Tangent plane and derivative of a map. Normal unit vector, orientation
and the Gauss map of a surface in R^3. Orientable surfaces, examples. The Moebius band is non-orientable.
4. Riemannian metric, examples. The shape operator is self-adjoint. Principal and asymptotic directions. The Mean and Gauss curvatures.
5. The geometry of the Gauss map. The sign of the Gauss curvature and position of the tangent plane. Theorems of Meusnieur and Olinde Rodrigues. Geometric properties of compact surfaces, Minimal surfaces and Ruled surfaces.
6. Isometries and local isometries. The Shape operator in isothermal coordinates. Proof of Gauss' Theorema Egregium. Examples, counter-examples and applications.
7. Homeworks.
8. 12 hours of lab for the visualization and computation on curves and surfaces.

Textbooks
[1] J.M. Lee, Introduction to topological manifolds. Springer, (2000). - – http://dx.doi.org/10.1007/b98853
[2] E. Sernesi, Geometria 2. Boringhieri, (1994).
[3] M. Do Carmo , Differential Geometry of Curves and Surfaces. Prentice Hall, (1976).
[4] M.Abate, F.Tovena, Curve e Superfici. Springer, (2006).

Rings and ideals, maximal ideals and prime ideals, nilradical andJacobson radical, the spectrum of a ring. Modules, finitely generated modules and Nakayama's Lemma, exact sequences, tensor product, restriction and extension of scalars. Rings and modules of fractions, localization. Primary decomposition. Integral dependence and valuation. Chain conditions. Noetherian rings, Hilbert's Basis Theorem, Nullstellensatz. Discrete valuation rings and Dedekind domains. Hints of dimension theory.

M. F. Atiyah, I. G. Macdonald, Introduction to Commutative Algebra. Addison-Wesley, 1996.
M. Reid, Undergraduate Algebraic Geometry, Cambridge University Press, 1988.
D. Eisenbud, Commutative Algebra with a view toward Algebraic Geometry, Springer-Verlag, 1995.
A. Gathmann, Commutative Algebra, Lecture notes.

Linear Systems
Direst methods: Gaussian elimination. Pivoting strategies. Gaussian elimination as a factorization. Doolittle and Choleshy factorizations. Iterative methods: Jacobi, Gauss-Seidel, SOR, Richardson, and related convergence results. Comparison of direct vs iterative solvers. Stability of algorithms for the solution of linear systems.

Iterative Methods for Scalar Nonlinear Equations
The intermediate zero theorem. The algorithms of bisection, Newton, secants, chords, and related convergence results. (Reference: Chapter 1 excluding Section 1.2.3, and Appendices A.1, A.2)

Approximation of Functions
General approximation strategies. Interpolating polynomial in Lagrange and Newton form. Representation of the interpolation error. Convergence of the interpolating polynomial for analytic functions. Refinement strategies in interpolation: Chebyshev nodes, composite approximations. Error estimates. Hermite polynomial, construction and representation of the error. Least Squares approximations. (Reference: Chapter 5 excluding Section 5.2, and Appendix A.4)

Numerical Integration
General principles of numerical integration. Polya's Theorem on the convergence of interpolatory quadrature formulae. Closed and open Newton-Cotes formulae. Stability results and error estimation. Generalized Newton-Cotes formulae and their convergence. Gaussian quadratures and their convergence. (Reference: Chapter 6)

Laboratory Activity
C language coding of some of the major algorithms, and in particular: Gaussian elimination, iterative methods for linear systems and scalar equations, Lagrange/Newton interpolation with a refinement strategy.

N.B.: References are provided with respect to the course notes.

Roberto Ferretti, "Appunti del corso di Analisi Numerica", available from the course page

Roberto Ferretti, "Esercizi d'esame di Analisi Numerica", available from the course page

Slides of the lessons, available from the course page

Branching processes, introduction to Sigma-algebras, measure spaces and probability spaces. Contruction of Lebesgue measure. Pi-systems, Dynkin's lemma. Properties of measures, sup and inf limits of events, measurable functions and random variables. Borel-Cantelli lemmas. Law and distribution of a random variable. Concept of independence. Convergence in probability and almost sure convergence. Skorokhod's representation theorem. Kolmogorov's 0-1 law.
Integrals, their properties and related theorems. Expectation of random variables. Markov, Jensen and Hoelder's inequalities. L^p spaces. Weierstrass' Theorem. Product measures, Fubini's theorem and joint laws.
Conditional expectation and its properties. Martingales, predictable processes. Stopping times and stopped processes. Optional stopping theorem, applications to random walks. Theorems about convergence of martingales. Strong law of large numbers.
Doob's inequalities for martingales and sub-martingales, applications. Characteristic functions and inversion theorem. Fourier transform in L^1. Equivalence between convergence in distribution and convergence of characteristic functions. Central limit theorem.

D. Williams, Probability with martingales
R. Durrett, Probability: Theory and examples

Algebraic varieties in affine and projective spaces over algebraically closed fields.
Veronese and Segre varieties.
Products and projections.
Local geometry of algebraic varieties

Divisors linear systems and e morphisms of projective varieties.
Commutative algebra

I. Shafarevich. Basic algebraic geometry vol. 1 Springer-Verlag, New York-Heidelberg, 1977.
L. Caporaso. Introduzione alla geometria algebrica . Versione preliminare.

1) Computability, complexity and representability:

- Introduction to decision problems, algorithmic and non-algorithmic procedures, deterministic computations, discrete procedures, the notion of alphabet, of speech. Decidability and semi-decidability of a set. Deterministic, finitary and discrete computations. Formal algorithms: formal definition of algorithm, configurations of input, output, transition function. Example of formalization of an algorithm. Decidability for finished automata. Representation of the automata by matrices. Free Monoid of words. Formal semi-rings. Non-deterministic finite automata. Regular Languages. Equivalence between deterministic and non-deterministic automata.

- Turing machines: definition, decidability for Turing machine, stopping time, stopping space. Cost of computation. Complexity: worst-case and average case. Independence of decision time from a finite number of input configurations. Complexity functions, complexity classes DTIME and DSPACE (deterministic time and space). Inclusion DTIME (T (n)) ⊂ DSPACE (T (n)) ⊂ DTIME (2 ^ {cT (n)}). Pumping Lemma. Simulation of algorithms, simulation of the half tape Turing machine, simulation of a multi-tape machine. Special Turing machines. Linear Speedup theorem for Turing machines with an extended alphabet. Evaluation of acceleration coefficient in relation to alphabets. Decisions of natural number sets. Independence from representation. Considerations concerning complexity.

- Turing computability: definition of Turing computable function, characteristic functions of Turing decidable sets, the class of Turing computable functions is closed by composition, concatenation, primitive recursion and minimization. Examples of Turing computable functions. Recursive Functions: equivalence between Turing computability and recursive functions. Ackermann function ([1] chapter 1,2,3,4,5 and [4] chapter 1).

- Time-constructible functions. The notion of T-clock. Examples of some time constructible function. Closure by composition.

- Non-deterministic Turing machines: characterization through the decidability of projection sets. Definition of the class of polynomial non-deterministic functions. NP-complete problems.

2) Lambda calculus and functional programming:

- Declarative programming: a historical outline on the lambda calculus, basic definitions, the terms of the lambda calculus, the simple substitution. Relations on the lambda terms. Congruences, transition to the context. α-equivalence. alpha-equivalence passes to the context. The transitive closure of a relationship, owned by Church-Rosser. Listing of lambda-terms concerning alpha-equivalence.

- Definition of beta-reduction and beta-equivalence. Church-Rosser's theorem for beta-reduction. Normal forms for beta-reduction. Beta-reduction strategies. Normalizing strategy: left reduction (left most-outer most). Head reduction. Soluble Terms. Head Normal Forms. Solvability characterization theorem.

- Representation of the recursive functions: lambda definability theorem. Existence of the fixed point for the lambda terms. Church Fixed Point and Curry fixed point.
- Representation of other data types in the lambda-calculus: pairs, lists, trees, the solution of recursive equations on lambda-terms ([2] chapters 1, 2, 5).

[1] DEHORNOY, P., COMPLEXITÈ ET DECIDABILITÈ. SPRINGER-VERLAG, (1993).
[2] KRIVINE, J.-L., LAMBDA CALCULUS: TYPES AND MODELS. ‪ELLIS HORWOOD, (1993).
[3] SIPSER,M., INTRODUCTION TO THE THEORY OF COMPUTATION.THOMSON COURSE TECHNOLOGY, (2006).

The crisis of classical physics. Waves and particles. State vectors and operators. Measurements, observables and uncertainty relation. The position operator. Translations and momentum. Time evolution and the Schrödinger equation. One-dimensional problems. Parity. Harmonic oscillator. Symmetries and conservation laws. Time independent perturbation theory. Time dependent perturbation theory.

Lecture notes available on the course website

J.J. Sakurai, Jim Napolitano - Meccanica Quantistica Moderna - Zanichelli
An english version of the book is also available:
Sakurai J.J., Modern Quantum Mechanics - Addison-Wesley

§I.Relativistic Field Theory

The Poincaré Group. Symmetries: global vs local. Noether's first and second theorems and conservation laws. The canonical stress-energy and angular momentum tensors. Improvements. Belinfante's argument and symmetric energy-momentum tensor. Local symmetries and conserved quantities.

§II.Gravity as a relativistic field theory

Particles and fields in Special Relativity. Irreps of the Poincaré group: Wigner's induced representation method. Massless particles: ISO(D-2) little group and gauge invariance. From relativistic massless spin-2 particles to full GR. Fierz-Pauli quadratic Lagrangian. Nöther method and non-linear completions. Nöther's construction of Yang-Mills Lagrangian. The transverse-traceless gravitational cubic vertex. Weinberg's Equivalence Principle from relativistic invariance of the S matrix. Spin and the sign of static forces.

§III.Elements of differential geometry

Topological spaces. Manifolds. Diffeomorphisms. Tangent spaces and vectors. Coordinate basis. Derivative operators on manifolds. Levi-Civita connection. Torsion. Differential forms: definition, wedge product, interior and exterior derivatives, Hodge dual. Lie derivative of forms and Cartan's formula. Yang-Mills theory in the language of forms. Weyl tensor. Riemann and Weyl tensors in various dimensions: counting components for irreps of GL(D). Conformal transformations of the metric tensor. Conformally flat spaces. Conformally coupled scalar fields.

§IV. The Cartan-Weyl formulation of GR and Fermionic couplings

Local inertial frames. The frame field and its relation to the metric field. Local Lorentz transformations. The spin connection. The vielbein postulate. Torsion constraint and second-order formulation. The contorsion tensor. Local Lorentz curvature. Gravity as a gauge theory of the Poincaré algebra. Connection one-forms on the Poincar\'e algebra. Local Poincar\'e transformations. Torsion and curvature over the Poincar\'e algebra. First-order formulation and Cartan-Weyl's action. Relation between gauge transformations and diffeomorphisms. Spinors on curved manifolds. Minimally coupled Fermionic matter. Dirac Lagrangian.

§V. Maximally symmetric spaces

Homogeneous and isotropic spaces. Characterisation of maximally symmetric spaces: curvature constant and signature. MSS as vacuum solutions to the EH equations with cosmological constant. Construction from embedding in (D+1) pseudo-Lorentzian spaces: metric and Christoffel coefficients.

§VI. The Schwarzschild black hole

Spherically symmetric spaces. The Schwarzschild solution. Birkhoff's theorem. Singularities, definitions and criteria: curvature singularites and geodesic incompleteness. Free-fall towards the horizon. The tortoise coordinate. Extension of a space-time. Eddington-Finkelstein coordinates. Event horizons, black holes and white holes. Kruskal-Szekeres coordinates. Maximal extension of the Schwarzschild solution. Kruskal's diagram and eternal black holes. (A)dS-Schwarzschild space-time.

§VII. More general black holes

Conformal diagrams. Event horizons. Reissner-Nordström and Kerr black holes. Black hole thermodynamics.

§VII. Gravitational energy

Conserved quantities in gauge theories: the example of Yang-Mills theory. Covariant conservation and ordinary conservation. Einstein-Hilbert equations for asymptotically flat metrics. Candidate for gravitational energy-momentum tensor. The superpotential. ADM energy and momentum. Example: ADM energy of the Schwarzschild solution. The positive-energy theorem (without proof). Generic background with Killing vectors. Quadrupole radiation.

§VIII. Asymptotic symmetries

General notion of asymptotic symmetry group. The example of Maxwell's theory in flat space. Covariant phase space formalism. Asymptotically flat spacetime and Bondi-van der Burg-Metzner-Sachs supertranslations. Applications: soft theorems and memory effects.

Note: some topics may be assigned as homework problems, as an alternative to the oral exam

-Carroll S, Spacetime and Geometry: An Introduction to General Relativity (Addison-Wesley 2014/Cambridge University Press, 2019)
-Weinberg S, Gravitation and Cosmology - principles and applications of the general theory of relativity, (John Wiley \& Sons, 1972)
-Wald R, General Relativity (The University of Chicago Press, 1984)

Teaching mathematics with the help of a computer: GeoGebra and Mathematica softwares.
Commands for numerical and symbolic calculus, graphics visualization, parametric surfaces and curves with animations in changing parameters.
Solving problems: triangle's properties in Euclidean and non-Euclidean geometry with examples, approximation of pi and other irrational numbers, solutions of equations and inequalities, systems of equations, defining and visualizing geometrical loci, function integral and derivatives, approximation of surface area.

List of problems given in class concerning visualization and solutions with the help of software Mathematica or GeoGebra.

The objective of Linguaggi di Programmazione course is to introduce main formal language theory concepts and results as well as their application for programming language classification.
Most relevant approaches for syntactic analysis of programming languages are introduced. Learning how to recognize the structure of a programming language and the implementation techniques for the abrstract machine.
Understanding the Object Oriented paradigm together with other non imperative approaches.

[1] Maurizio Gabbrielli, Simone Martini,Programming Languages - Principles and paradigms, 2/ed. McGraw-Hill, (2011).
[2] Dean Wampler, Alex Payne, Programming Scala: Scalability = Functional Programming + Objects, 2 edizione. O’Reilly Media, (2014).
[3] David Parsons, Foundational Java Key Elements and Practical Programming. Springer- Verlag, (2012).
Course Slides provided by the lecturer.

1. Machine learning. Types of learning. Loss functions. Empirical risk minimization. Generalization and overfitting.
2. Model optimization. Convex functions. Gradient descent. Stochastic gradient descent.
3. Regression. Linear regression. Basis functions. Feature selection. Regularization.
4. Classification. Generative models. Nearest neighbor. Logistic regression. Support vector machines. Neural networks.
5. Ensemble methods. Decision trees. Boosting. Bagging.
6. Unsupervised learning. K-means clustering. Hierarchical clustering. Principal component analysis.
7. Application of the methods using the Python language. Examples using the NumPy, Pandas, SciKit-Learn, and TensorFlow libraries.

J. Watt, R. Borhani, A. Katsaggelos. Machine Learning Refined. Cambridge University Press, 2nd edition, 2020.

Random variables and their distribution, moment generating function, mean variance and covariance.
Random sampling model and statistical model.
Statistics: concept, examples, sufficient statistics.
Point estimators: definition and desired properties, moments, maximum likelihood and Bayes.
Computational methods: Newton-Raphson, EM algorithm
Improving an estimator: Rao-Blackwell, UMVU estimator, full statistic, Lehman-Scheff ́e II and Cramer-Rao
Confidence intervals: intuitive, pivotal quantity, IC for Bayes and asymptotic IC.
Hypothesis testing: likelihood ratio, pivotal quantity test (Z and T test), duality with IC, UMP, Neyman-Pearson and Karlin-Rubin tests.
Non-parametric methods: goodness-of-fit, contingency table, Kolmogorov-Smirnov and ranking tests.
Analysis of variance (ANOVA) and F.
Regression: linear, multiple linear, generalized linear and Logistic / Poisson

Statistical Inference, Casella e Berger, 2nd Edition, Duxbury Advanced Series.

Additional reference:
Luca Leuzzi, Enzo Marinari, Giorgio Parisi
CALCOLO DELLE PROBABILITÀ: un trattatello per principianti volenterosi

The high scool mathematics: programs, key and critical points; the mathematicians' mathematics and the mathematics for the citizen
From exercise to problem solving. Didactic theories and theorists. Guido and Emma Castelnuovo. Croce, Gentile and mathematics.
Didactic methodologies. Scholastic laws.

Battaglini Frank, Di Martino, Natalini, Rosolini "Didattica della matematica", Mondadori Università

Introduction to set theory: aggregates and sets, necessity of a theory, ordinals and cardinals, antinomies and paradoxes, main characteristics of axiomatic set theory. Zermelo’s axiomatic set theory and Zermelo-Fraenkel’s axiomatic set theory: preliminaries and conventions, Zermelo’s axioms, the replacement axiom and Zermelo-Fraenkel’s theory, extensions of the language by definition. Ordinals: orders, well-orders and well-foundedness, well-foundedness and induction principle, the ordinal numbers, well-orders and ordinals, ordinal induction (proofs and definitions), diagonal argument and limit ordinals, infinity axiom and ordinal arithmetic, hints on the use of ordinals in proof-theory. Axiom of choice: equivalent formulations (and proof of the equivalence), infinite sets and axiom of choice. Cardinals: equipotent sets and infinite sets, the cardinal numbers, cardinal arithmetic.

Testi: V. Michele Abrusci e Lorenzo Tortora de Falco, Logica. Vol. 2 Incompletezza, teoria assiomatica degli insiemi, Springer, 2018

Categories.
Abstract and geometrical implicial complexes.
Singular homology and simplicial homology.
Cohomology
Duality Theorems
Persistent homology and data analysis
Elements of differential topology
Differential forms and de Rham cohomology

Allen Hatcher: Algebraic topology Cambridge University press.
Vidit Nanda: Computational Algebraic Topology - Lecture notes
James R. Munkres : Topology Prentice Hall.
Raoul Bott, Loring W. Tu,Differential forms in algebraic topology.Springer, (1986).
Marco Abate, Francesca Tovena,Geometria Differenziale.Springer, (2011).

Lebesgue integration in Rn, Fourier transform, theory of differential equations

Luigi Chierchia, Analisi matematica due
Reed-Simon

Measure theory, outer measures, construction of Borel measures.
Integration theory, limit theorems, convergence in mean and in measure, integration on product spaces.
Radon measures, regularity, positive linear functionals, Riesz representation theorem.
Signed measures, decomposition theorems, differentiation, BV functions, fundamental theorem of calculus.
Lp spaces, basic properties, dual spaces, density theorems.
Introduction to geometric measure theory

G. Folland - "Real Analysis" - Wiley

1. General theory:
- Existence and uniqueness theorems (Gronwall's lemmas; Picard's theorem, Peano's theorem).
- Existence intervals and maximal solutions.
- Dependence on initial data and parameters.

2. Qualitative analysis of some simple EDO classes. Phase space.

3. Linear systems with constant coefficients. Exponential of matrices and Jordan's normal form theorem.

4. Linear systems with variable coefficients. Solution spaces. The Wronskian.

6. Periodic solutions and Fourier series.

7. Hamiltonian systems and celestial mechanics (introduction)

Gerald Teschl: Ordinary Differential Equations and Dynamical Systems , Graduate Studies in Mathematics Volume 140, American Mathematical Society, 2011

Shair Ahmad and Antonio Ambrosetti, Differential Equations. A first course on ODE and a brief introduction to PDE
Series: De Gruyter Textbook De Gruyter | 2019 DOI: https://doi.org/10.1515/9783110652864

Graphs: basic definitions. Simple and non simple graphs, planarity, connectivity, degree, regularity, incidence and adjacency matrices. Examples of families of graphs. The '' handshaking lemma ''.
Graphs obtained from others: complement, subgraph, cancellation and contraction. Isomorphisms and automorphisms of graphs. Connectivity: paths, cycles. A graph is bipartite if and only if each cycle has equal length.
Connetivity and connected component. Connectivity for sides and vertices. Eulerian and semi-Eulerian graphs.
Euler's theorem: a connected graph is Eulerian if and only if every vertex has an even degree. Hamiltonian graphs. Sufficient conditions to guarantee that a graph is Hamiltonian: the theorems of Ore and Dirac.
the Ore theorem. Trees and forests. The cyclomatic number and the "cutset" rank of a graph.
Fundamental system of cycles and cuts associated with a generating forest. Enumeration of generating forests. The Cayley theorem.
Generating trees: the "greedy" algorithm for the "connector problem". Planar graphs. K3.3 and K5 are not planar. Statement of the theorem of Kuratovski and variations.
Euler's formula for planar graphs. The dual of a planar graph.
Correspondence between cycles and cuts for planar graphs and their dual. Dual abstract. A graph that admits a dual abstract is planar. Colorings: initial considerations and some properties.
Colorings: the 5 colors theorem. Graphs on surfaces: classification of topological surfaces.
Coloring of faces and duality between this problem and the coloring of vertices. Reduction of the proof of the 4-color theorem to the coloring of cubic graph faces. '' The marriage problem ": Hall's theorem.
Hall's theorem in the language of transversals. Criteria of existence of transversal and partial transversivities. Application to the construction of Latin squares. Direct graphs: basic notions and orientability.
The Max-Flow Min-Cut theorem and Menger's theorem.
Complexity of algorithms and applications to the theory of graphs.
Introduction to the theory of matroids: definitions using bases and independent elements. Graphical and cographic matroids, vector matroids and the problem of representability.
Definition of matroid using the cycles and the rank function. Minors of a matroid. Transverse matroids and the Rado Theorem for matroids.
Union of matroids and applications: existence of disjoint bases in a matroid. Duality for matroids and applications to graphic and cographic matroids. Planar matroids and the generalization of Kuratovski's theorem for matroids.
Elements of algebraic graph theory: the incidence matrix and the Laplacian matrix of an oriented graph. The vertex space and the space of edges of a graph. Subspaces of the cycles and subspace of the cuts of a defined oriented graph of the incidence matrix.
Basis for the space of the cycles and for the space of the cuts of a graph. The Riemann-Roch theorem for graphs.
Proof of the "generalized Matrix Tree theorem". The contraction / restriction algorithm for matroids. Examples. The number of acyclical orientations of a graph.
Graph polynomials: the chromatic polynomial, the "reliabiliaty" polynomial. Examples. The polynomial rank of a matroid. Properties and first applications.
Proof of the structure theorem for functions on matroids that satisfy contraction/restriction properties. Their incarnation through the polynomial rank.
Whitey's moves and two isomorphisms for graphs. Isomorphism between graphical matroids implies isomorphism between graphs in case the graphs are 3 connected.
Whitney's Theorem for graphic matroids: sketch of the demonstration. Characterization for minors excluded from binary and regular matroids. The theorem of Seymour.

R. Diestel: Graph theory, Spriger GTM 173.
R. Wilson: Introduction to Graph theory, Prentice Hall.
B. Bollobas: Modern Graph theory, Springer GTM 184.
J. A. Bondy, U.S.R. Murty: Graph theory, Springer GTM 244.
N. Biggs: Algebraic graph theory, Cambridge University Press.
C. D. Godsil, G. Royle: Algebraic Graph theory, Springer GTM 207.
J. G. Oxley: Matroid theory. Oxford graduate texts in mathematics, 3.

The main theorems of Functional Analysis.

H. Brezis, Functional Analysis.

Division, Factorization, Some Elementary Properties of Primes, Some Results and Problems Concerning Primes.
ARITHMETIC FUNCTIONS: The Divisor Function. The Moebius Function. The Euler Function. Dirichlet Convolution
CONGRUENCES: Sets of Residues,Some Interesting Congruences, Some Linear Congruences, Some Polynomial Congruences, Primitive Roots, the Theorem of Gauss.
QUADRATIC RESIDUES: The Legendre Symbol. Quadratic Reciprocity. The Jacobi Symbol.The Distribution of Quadratic Residues.
SUMS OF INTEGER SQUARES: Sums of Two Squares. Number of Representations. Sums of Four Squares. Sums of Three Squares.
ELEMENTARY PRIME NUMBER THEORY: Euclid's Theorem Revisited. The Von Mangoldt Function. Tchebycheff's Theorem. Some Results of Mertens

Chen, W; ELEMENTARY NUMBER THEORY. https://rutherglen.science.mq.edu.au/wchen/lnentfolder/lnent.html
Chowdhury, F.; Chowdhury, M. R. Essentials of Number Theory. Pi Publications, Dhaka, Bangladesh, 2005. ISBN 984-32-2836-7
Hardy, G. H.; Wright, E. M. An introduction to the theory of numbers. Fifth edition. The Clarendon Press, Oxford University Press, New York, 1979. xvi+426 pp. ISBN: 0-19-853170-2; 0-19-853171-0
Davenport, H. Aritmetica superiore. Un'introduzione alla teoria dei numeri. Editore: Zanichelli, 1994. 199 pp. ISBN: 8808091546
Gioia, A. A. The theory of numbers. An introduction. Reprint of the 1970 original. Dover Publications, Inc., Mineola, NY, 2001. xii+207 pp. ISBN: 0-486-41449-3
Rosen, K. H. Elementary number theory and its applications. Fourth edition. Addison-Wesley, Reading, MA, 2000. xviii+638 pp. ISBN: 0-201-87073-8
Tattersall, J. J. Elementary number theory in nine chapters. Cambridge University Press, Cambridge, 1999. viii+407 pp. ISBN: 0-521-58531-7

Recalls on the elementary properties of groups. Direct and semi-direct products. Permutation groups and simplicity of alternate groups. Actions on groups. Sylow's theorems. Finitely generated abelian groups, free groups, nilpotent groups and solvable groups. Since this is an advanced course, other topics can also be included upon request of the class.

A. Machì, Gruppi. Una introduzione a idee e metodi della Teoria dei Gruppi, SPRINGER VERLAG (2007).
M. Artin, Algebra, BOLLATI BORINGHIERI (1997).

Preliminaries: definition of hyper-surface, integration on hyper-surfaces, the divergence theorem; the Laplace equation: the mean value inequalities, the minimum and maximum principle, the Harnack inequality, the Green representation, the Poisson integral, convergence's theorems, interior estimates on the derivatives, the Perron method for the Dirichlet problem.

“Elliptic partial differential equations of second order. Reprint of the 1998 edition”, D. Gilbarg e N.S. Trudinger, Classics in Mathematics, Springer-Verlag
"Partial differential equations. Second edition", Lawrence C. Evans, Graduate Studies in Mathematics 19, American Mathematical Society

Definition and basic properties of the Sobolev spaces W^{1,p} (Ω). Extension operators. Sobolev inequalities. The space W^{1,p}_0 (Ω). Variational formulation of some elliptic boundary value problems. Existence of weak solutions. Regularity of weak solutions.

"Analisi funzionale", H. Brézis, Liguori Editore
"Partial differential equations. Second edition", Lawrence C. Evans, Graduate Studies in Mathematics 19, American Mathematical Society

Complex numbers: algebraic and topological properties. Geometric representation of complex numbers: polar coordinates and the complex exponential.
Complex functions with complex variables: continuity and properties, differentiability and first properties. Holomorphic functions: properties and examples of holomorphic and non-holomorphic functions. Cauchy-Riemann equations. The real and imaginary parts of holomorphic functions are harmonic conjugated.
Equations of Cauchy-Riemann: proof. Examples. Sequences and complex series. Properties. Power series with complex values. Abel's theorem and Hadamard's formula.
Proof of Abel's Theorem. Taylor's formula for series of complex powers. The exponential and the trigonometric functions as analytical functions. Basic properties.
Periodicity of the complex exponential function. The complex logarithm: first considerations. The ring of formal powers series with complex coefficients: basic properties. Analytical functions: definition and first properties.
Series of converging powers are analytical within the convergence region. Composition of analytical functions. Theorem of the inverse function.
Inverse by composition of a formal series and its convergence. Complex powers and properties. The binomial series and properties. Consequences of the inverse theorem: the canonical form of an analytic function.
Local properties of analytical functions: open function theorem, invertibility criterion, principle of the maximum local module. The fundamental theorem of algebra. Parameterized curves. A holomorphic function with zero derivative is constant.
The locus of the zeros of a non-constant analytical function is discrete. Analytical continuation of functions defined on open connected sets. Principle of the maximum global module. Integrals in paths: definition and first properties. Examples.
A continuous function in a connected open admits a primitive if and only if its integral along a closed curve is zero. Integration of uniformly converging series of functions. Examples. Local primitive of a holomorphic function.
Local primitive of a holomorphic function. The Goursat theorem. Integral of a holomorphic function along a continuous path.
The homotopical form of the Cauchy Theorem. Global primitive of a holomorphic function in a simply connected domain. Applications to the study of the logarithm.
The integral formula of Cauchy. Cauchy formula for development in series and applications: a holomorphic and analytical function; the theorem of Liouville and the fundamental theorem of algebra.
Integral formula for derivatives. The number of windings of a curve with respect to a point. Curves homologous to 0. The global formula of Cauchy.
Proof of the global Cauchy formula. Examples.
The first homology group of an open set with values ​​in integers. The Cauchy formula for homological invariance. Examples.
Applications of the Cauchy theorem: uniform limit on holomorphic function compacts is holomorphic. Examples. Laurent series.
Series expansion of a holomorphic function in a circular crown in the Laurent series. Isolated singularities and the field of meromorphic functions. Examples. Statement of the classification theorem of isolated singularities and residual theorem: local and global versions.
Proof of the classification theorem of isolated singularities and proof of the residues theorem. The logarithmic derivative and the principle of the argument. Calculation of residues.
Classification of the connected open of C. The Riemann map theorem and the uniformization theorem (without proof). The Riemann sphere as a compactification of the complex plane. The group of linear transformations of the projective line and the linear transformations produced by them. The group of automorphisms of the complex plane.
The lemma of Schwarz and the group of automorphisms of the unitary disc. Elements of global analytical functions and function. The logarithm as a global analytical function.
The n-th rooty as a global analytical function. The bundle of germs of analytical functions and its properties. The Riemann surface associated with a global analytical function.
Examples and properties of Riemann surface. The Riemann surface associated with an algebraic function and properties. Summary and considerations on the course program.

L. V. Ahlfors: Complex Analysis, McGraw-Hill.
S. Lang: Complex analysis, GTM 103.
E. Freitag, R. Busam: Complex Analysis, Springer.

INTRODUCTION TO STATISTICAL MECHANICS AND GIBBS STATES
– The goals of statistical mechanics
– Review of thermodynamics. Convex functions and Legendre transform
– Models of statistical mechanics: canonical ensemble, grand canonical and Gibbs states.
– The Ising model and the lattice gas models. Existence of the thermodynamic limit for the free energy of the Ising or lattice gas model.
– The general structure of Gibbs states. Extremal states and mixtures. The notion of phase transition: loss of analyticity and non-uniqueness of the Gibbs state.

THE ISING MODEL
– Review of known results on the Ising model in one or more dimensions.
– The solution of the one-dimensional Ising model via the transfer matrix method.
– The mean field Ising model: exact solution. Phase transition and loss of equivalence between statistical ensembles
– Ising with long-range interactions (Kac potentials) in the mean-field limit. The Maxwell construction.
– FKG and Griffiths inequalities. Existence of the infinite volume correlation functions of states with + and − conditions in the ferromagnetic Ising model.
- The geometric representation of the Ising model: high and low temperature contours.
- Existence of a phase transition in the low temperature Ising model: the Peierls's argument.
– Absence of a phase transition at high temperature and exponential decay of boundary effects boundary conditions.
– Lee-Yang theorem and analyticity of the pressure at non-zero magnetic field.
– Existence of a phase transition in the one dimensional Ising model with power law interaction |x − y|^{−p}, 1

S. Friedli, Y. Velenik: Statistical Mechanics of Lattice Systems: a Concrete Mathematical Introduction, Cambridge University Press, 2017.

G. Gallavotti: Statistical Mechanics. A short treatise, ed. Springer-Verlag, 1999.

Ordinary Differential Equations
Finite difference approximation for ordinary differential equations: Euler's method. Consistency, stability, absolute stability. Second order Runge-Kutta methods.
Single step implicit methods: backward Euler and Crank-Nicolson methods. Convergence of single step methods. Multi-step methods: general structure, complexity, absolute stability. Stability and consistency of multi-step methods. Adams methods, BDF methods, Predictor-Corrector methods. (Reference: Chapter 7 of curse notes "Appunti del corso di Analisi Numerica")

Partial Differential Equations
Finite difference approximation for partial differential equations. Semi-discrete approximations and convergence. The Lax-Richtmeyer theorem. Transport equation: the method of characteristics. The "Upwind" (semi-discrete and fully-discrete) scheme, consistency and stability. Heat equation: Fourier approximation. Finite difference scheme, consistency and stability. Poisson equation: Fourier approximation. Finite difference scheme, convergence. (Reference: notes by R. LeVeque, "Finite Difference methods for differential equations", selected chapters 1, 2, 3, 12, 13)

Roberto Ferretti, "Appunti del corso di Analisi Numerica", in pdf on the course page

Roberto Ferretti, "Esercizi d'esame di Analisi Numerica", in pdf on the course page

Lecture slides in pdf on the course page

Additional notes provided by the teacher

Notes on graph theory: graph, directed graph, tree, free and rooted tree, connection, strong connection, acyclicality; isomorphisms between graphs, planarity, Kuratowski's theorem, Euler's formula; coloring of graphs, Eulerian paths, Hamiltonian circuits.
Review of algorithm theory and computational complexity: complexity classes, the class of NP, NP-complete, NP-hard problems. Problems of decision, search, enumeration and optimization; problems of nonlinear programming, convex programming, linear programming and integer linear programming; combinatorial optimization problems. Recalls on the elements of combinatorics.
Optimization problems on graphs: visit of graphs, verification of fundamental properties, connection, presence of cycles, strongly connected components, topological ordering of a graph. Minimum spanning tree (Prim and Kruskal algorithms). Paths of minimum cost (Dijkstra and Bellman-Ford algorithms, dynamic programming technique, Floyd-Warshall algorithm, computation of the transitive closure of a graph). Networks and calculation of the maximum flow on a network, maximum flow / minimum cut theorem, Ford-Fulkerson algorithm, Edmonds-Karp algorithm, preflow algorithms, "push-relabel" algorithms.
Partitioning problems of graphs, trees and paths into connected components, objective functions and algorithmic techniques.
Stable marriage problem, generalizations and applications of the problem, Gale and Shapley algorithm.
Huffman codes.
Programming laboratory for the implementation of algorithms in Python language and with the help of Mathematica software.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, "Introduction to algorithms"

Lecture notes and other teaching material in Italian provided by the teacher and made available on the course website (http://www.mat.uniroma3.it/users/liverani/IN440) and on the Microsoft Teams platform

Symplectic geometry and Hamiltonian formalism. Other topics, depending on the interests of the audience

[Z] Zehnder - "Lectures on dynamical systems".

INTRODUCTION TO STATISTICAL MECHANICS AND GIBBS STATES
– The goals of statistical mechanics
– Review of thermodynamics. Convex functions and Legendre transform
– Models of statistical mechanics: canonical ensemble, grand canonical and Gibbs states.
– The Ising model and the lattice gas models. Existence of the thermodynamic limit for the free energy of the Ising or lattice gas model.
– The general structure of Gibbs states. Extremal states and mixtures. The notion of phase transition: loss of analyticity and non-uniqueness of the Gibbs state.

THE ISING MODEL
– Review of known results on the Ising model in one or more dimensions.
– The solution of the one-dimensional Ising model via the transfer matrix method.
– The mean field Ising model: exact solution. Phase transition and loss of equivalence between statistical ensembles
– Ising with long-range interactions (Kac potentials) in the mean-field limit. The Maxwell construction.
– FKG and Griffiths inequalities. Existence of the infinite volume correlation functions of states with + and − conditions in the ferromagnetic Ising model.
- The geometric representation of the Ising model: high and low temperature contours.
- Existence of a phase transition in the low temperature Ising model: the Peierls's argument.
– Absence of a phase transition at high temperature and exponential decay of boundary effects boundary conditions.
– Lee-Yang theorem and analyticity of the pressure at non-zero magnetic field.
– Existence of a phase transition in the one dimensional Ising model with power law interaction |x − y|^{−p}, 1

S. Friedli, Y. Velenik: Statistical Mechanics of Lattice Systems: a Concrete Mathematical Introduction, Cambridge University Press, 2017.

G. Gallavotti: Statistical Mechanics. A short treatise, ed. Springer-Verlag, 1999.

Ordinary Differential Equations
Finite difference approximation for ordinary differential equations: Euler's method. Consistency, stability, absolute stability. Second order Runge-Kutta methods.
Single step implicit methods: backward Euler and Crank-Nicolson methods. Convergence of single step methods. Multi-step methods: general structure, complexity, absolute stability. Stability and consistency of multi-step methods. Adams methods, BDF methods, Predictor-Corrector methods. (Reference: Chapter 7 of curse notes "Appunti del corso di Analisi Numerica")

Partial Differential Equations
Finite difference approximation for partial differential equations. Semi-discrete approximations and convergence. The Lax-Richtmeyer theorem. Transport equation: the method of characteristics. The "Upwind" (semi-discrete and fully-discrete) scheme, consistency and stability. Heat equation: Fourier approximation. Finite difference scheme, consistency and stability. Poisson equation: Fourier approximation. Finite difference scheme, convergence. (Reference: notes by R. LeVeque, "Finite Difference methods for differential equations", selected chapters 1, 2, 3, 12, 13)

Roberto Ferretti, "Appunti del corso di Analisi Numerica", in pdf on the course page

Roberto Ferretti, "Esercizi d'esame di Analisi Numerica", in pdf on the course page

Lecture slides in pdf on the course page

Additional notes provided by the teacher

1. Introduction to information theory.
Reliable transmission of information. Shannon's information content. Measures of information. Entropy, mutual information, informational divergence. Data compression. Error correction. Data processing theorems. Fundamental inequalities. Information diagrams. Informational divergence and maximum likelihood.

2. Source coding and data compression
Typical sequences. Typicality in probability. Asymptotic equipartitioning property. Block codes and variable length codes. Coding rate. Source coding theorem. Lossless data compression. Huffman code. Universal codes. Ziv-Lempel compression.

3. Channel coding
Channel capacity. Discrete memoryless channels. Information transmitted over a channel. Decoding criteria. Noisy channel coding theorem.

4. Further codes and applications
Hamming space. Linear codes. Generating matrix and check matrix. Cyclic codes. Hash codes.

David J. C. MacKay. Information Theory, Inference and Learning Algorithms. Cambridge University Press, 2004.

Teaching mathematics with the help of a computer: GeoGebra and Mathematica softwares.
Commands for numerical and symbolic calculus, graphics visualization, parametric surfaces and curves with animations in changing parameters.
Solving problems: triangle's properties in Euclidean and non-Euclidean geometry with examples, approximation of pi and other irrational numbers, solutions of equations and inequalities, systems of equations, defining and visualizing geometrical loci, function integral and derivatives, approximation of surface area.

List of problems given in class concerning visualization and solutions with the help of software Mathematica or GeoGebra.

1. Classic Cryptography

- Basic cryptosystems: encryption by substitution, by translation, by permutation, affine cryptosystem, by Vigenère, by Hill. Stream encryption (synchronous and asynchronous), Linear feedback shift registers (LFSR) on finite fields, Autokey cypher. Product cyphers. Basic cryptanalysis: classification of attacks; cryptoanalysis for affine cyphers, for substitution cypher (frequency analysis), for Vigenere cypher: Kasiski test, coincidence index; cryptoanalysis of Hill's cypher and LFSR: algebraic attacks, cube attack.

2. Application of Shannon theory to cryptography

- Security of cyphers: computational security, provable security, unconditional security. Basics of probability: discrete random variables, joint probability, conditional probability, independent random variables, Bayes' theorem. Random variables associated with cryptosystems. Perfect secrecy for encryption systems. Vernam cryptosystem. Entropy. Huffman codes. Spurious Keys and Unicity distance.

3. Block cyphers

- iterative encryption schemes; Substitution-Permutation Networks (SPN); Linear cryptanalysis for SPN: Piling-Up Lemma, linear approximation of S-boxes, linear attacks on S-boxes; Differential cryptanalysis for SPN; Feistel cyphers; DES: description and analysis; AES: description; Notes on finite fields: operations on finite fields, Euclid's generalized algorithm for the computation of the GCD and inverse; Operating modes for block cyphers.

4. Hash functions and codes for message authentication

- Hash functions and data integrity. Safe hash functions: resistance to the pre-image, resistance to the second pre-image, collision resistance. The random oracle model: ideal hash functions, properties of independence. Randomized algorithms, collision on the problem of the second pre-image, collision on the problem of the pre-image. Iterated hash functions; the construction of Merkle-Damgard. Safe Hash Algorithm (SHA-1). Authentication Codes (MAC): nested authentication codes (HMAC).

[1] Antoine Joux, Algorithmic Cryptanalysis, (2010) CRC Press.
[2] Douglas Stinson, Cryptography: Theory and Practice, 3rd edition, (2006) Chapman and Hall/CRC.
[3] Delfs H., Knebl H., Introduction to Cryptography, (2007) Springer Verlag.

Graphs: basic definitions. Simple and non simple graphs, planarity, connectivity, degree, regularity, incidence and adjacency matrices. Examples of families of graphs. The '' handshaking lemma ''.
Graphs obtained from others: complement, subgraph, cancellation and contraction. Isomorphisms and automorphisms of graphs. Connectivity: paths, cycles. A graph is bipartite if and only if each cycle has equal length.
Connetivity and connected component. Connectivity for sides and vertices. Eulerian and semi-Eulerian graphs.
Euler's theorem: a connected graph is Eulerian if and only if every vertex has an even degree. Hamiltonian graphs. Sufficient conditions to guarantee that a graph is Hamiltonian: the theorems of Ore and Dirac.
the Ore theorem. Trees and forests. The cyclomatic number and the "cutset" rank of a graph.
Fundamental system of cycles and cuts associated with a generating forest. Enumeration of generating forests. The Cayley theorem.
Generating trees: the "greedy" algorithm for the "connector problem". Planar graphs. K3.3 and K5 are not planar. Statement of the theorem of Kuratovski and variations.
Euler's formula for planar graphs. The dual of a planar graph.
Correspondence between cycles and cuts for planar graphs and their dual. Dual abstract. A graph that admits a dual abstract is planar. Colorings: initial considerations and some properties.
Colorings: the 5 colors theorem. Graphs on surfaces: classification of topological surfaces.
Coloring of faces and duality between this problem and the coloring of vertices. Reduction of the proof of the 4-color theorem to the coloring of cubic graph faces. '' The marriage problem ": Hall's theorem.
Hall's theorem in the language of transversals. Criteria of existence of transversal and partial transversivities. Application to the construction of Latin squares. Direct graphs: basic notions and orientability.
The Max-Flow Min-Cut theorem and Menger's theorem.
Complexity of algorithms and applications to the theory of graphs.
Introduction to the theory of matroids: definitions using bases and independent elements. Graphical and cographic matroids, vector matroids and the problem of representability.
Definition of matroid using the cycles and the rank function. Minors of a matroid. Transverse matroids and the Rado Theorem for matroids.
Union of matroids and applications: existence of disjoint bases in a matroid. Duality for matroids and applications to graphic and cographic matroids. Planar matroids and the generalization of Kuratovski's theorem for matroids.
Elements of algebraic graph theory: the incidence matrix and the Laplacian matrix of an oriented graph. The vertex space and the space of edges of a graph. Subspaces of the cycles and subspace of the cuts of a defined oriented graph of the incidence matrix.
Basis for the space of the cycles and for the space of the cuts of a graph. The Riemann-Roch theorem for graphs.
Proof of the "generalized Matrix Tree theorem". The contraction / restriction algorithm for matroids. Examples. The number of acyclical orientations of a graph.
Graph polynomials: the chromatic polynomial, the "reliabiliaty" polynomial. Examples. The polynomial rank of a matroid. Properties and first applications.
Proof of the structure theorem for functions on matroids that satisfy contraction/restriction properties. Their incarnation through the polynomial rank.
Whitey's moves and two isomorphisms for graphs. Isomorphism between graphical matroids implies isomorphism between graphs in case the graphs are 3 connected.
Whitney's Theorem for graphic matroids: sketch of the demonstration. Characterization for minors excluded from binary and regular matroids. The theorem of Seymour.

R. Diestel: Graph theory, Spriger GTM 173.
R. Wilson: Introduction to Graph theory, Prentice Hall.
B. Bollobas: Modern Graph theory, Springer GTM 184.
J. A. Bondy, U.S.R. Murty: Graph theory, Springer GTM 244.
N. Biggs: Algebraic graph theory, Cambridge University Press.
C. D. Godsil, G. Royle: Algebraic Graph theory, Springer GTM 207.
J. G. Oxley: Matroid theory. Oxford graduate texts in mathematics, 3.

Presentation of the problems that can be treated through integrals on large number of dimensions

Basics

Probability and Random variables

Measurement, uncertainty and its propagation

Curve-fitting, least-squares, optimization

Classical numerical integration, speed of convergence

Integration MC (Mean, variance)

Sampling Strategies

Applications

Propagation of uncertainties

Generation according to a distribution

Real World Applications

Cosmic Rays Shower

System Availabilty

Further applications

Weinzierl, S. - Introduction to Monte Carlo methods arXiv:hep-ph/0006269

Taylor, J. - Introduzione all'analisi degli errori : lo studio delle incertezze nelle misure fisiche - Zanichelli Disponibile nella biblioteca Scientifica di Roma Tre

Dubi, A. - Monte Carlo applications in systems engineering - Wiley Disponibile nella biblioteca Scientifica di Roma Tre

Teacher's notes

CONTENTS OF THE LECTURES: the numbers in round brackets refer to the chapter and section of the textbook adopted.
Kinetic theory of gases. Boltzmann equation and H theorem. (1, Par.2.1,2.2,2.3,2.4)
Maxwell-Boltzmann distribution. (1, Par. 2.5)
Phase space and Liouville theorem. (1, Par. 3.1,3.2)
Gibbs ensembles. Micro canonical ensemble. Definition of entropy. (1, Par. 3.3,3.4)
The ideal gas in the micro canonical ensemble. (1, Par. 3.6)
The equipartition theorem. (1, Par. 3.5)
The canonical ensemble. (1, Par.4.1).
The partition function and the free energy. Fluctuations of energy in the canonical ensemble. (1 Par. 4.4)
The grand canonical ensemble. The grand potential. The ideal gas in the grand canonical ensemble. (1 Par. 4.3).
Fluctuations of the particle number. (1 Par. 4.4)
Classical theory of the linear response and fluctuation-dissipation theorem. (1, Par. 8.4).
Einstein and Langevin theories of the Brownian motion. (Par. 1 par. 11.1,11.2).
Johnson-Nyqvist theory of thermal noise. (1 Par. 11.3).
Quantum statistical mechanics and the density matrix. (1, Par. 6.2,6.3,6.4)
Fermi-Dirac and Bose-einstein quantum statistics. ( 1, Par. 7.1)
The Fermi gas. The Sommerfeld expansion and the electron specific heat. (1, Par. 7.2)
The Bose gas. The Bose-Einstein condensation. (1, Par. 7.3)
Quantum theory of black-body radiation. (1, Par. 7.5)

e-Learning Moodle Platform with Supplementary Material

Suggested textbook:
1) C. Di Castro and R. Raimondi, Statistical Mechanics and Applications in Condensed Matter, Cambridge University Press, 2015.

Topics Part A

• Coordinates and Telescopes
• Elements of Spectroscopy
• Stars and Stellar Evolution • Galaxies
• Active Galactic Nuclei


Program Part A

• Overview

• Celestial coordinates (1.3)

• Telescopes and resolving power (6.1)

• Parallax distance (3.1)

• Flux, brightness, apparent and absolute magnitudes, colors (3.2, 3.3, 3.6)

• The black body (3.4, 3.5)

• Hertzsprung-Russel diagram (8.2)

• Open and globular clusters: position, stellar populations and HR diagram (13.3)

• White dwarfs, Novae and SuperNovae (notes and partly in 15 and 16)

• The classification of galaxies (24.1)

• The rotation curve of galaxies and dark matter (25.3)

• The center of the Galaxy and its Black Hole (25.4)

• Hubble's law and expansion of the Universe (27.2)

• Probability of collision between stars and galaxies (handouts)

• Black Holes: outline of General Relativity (outline 17)

• Active Galactic Nuclei (28.1, 28.2, 28.3)


Topics Part B

• Structure and stellar evolution
• Elements of Spectroscopy
• Distances and expansion of the Universe • Galaxies
• GRB and gravitational waves

Program Part B

• Acretion disks and X-ray emission in Active Galactic Nuclei (28.2)

• Stars of Neutrons and Pulsars (16.6, 16.7)

• Gamma Ray Bursts (handouts)

• Gravitational Waves (lecture notes)

• Spectroscopy: eq. Boltzmann-excitation and Saha-ionization (8.1)

• Spectroscopy: speed, temperature and density measurements (handouts)

• Eq. of star structure, time and Kelvin-Helmholtz instability (11.1-4)

• Nuclear reactions of hydrogen (11.3)

• Jeans mass of gravitational collapse, free-fall time and Initial Mass Function (12.2, 12.3)

• The Milky Way and the local group (25.1, 25.2)

• Metallicity (25.2)

• Transit of Venus and measurement of the Earth-Sun distance (handouts)

• Distance scale (27.1)

• Hubble's law and expansion of the Universe (27.2)

• Local Group, Clusters of Galaxies, large scale structure of the Universe (27.3)

• The Big Bang and the background radiation (29.2 brief notes and lecture notes)

A copy of the lecture notes can be downloaded from the course website.

In brackets, the paragraphs from “An Introduction to Modern Astrophysics, II ed. - B.W. Carrol, D.A. Ostlie - Ed. Pearson, Addison Wesley ”(copies available in the library). The discussion in the course has been simplified compared to what is reported in the text. Alternative text in Italian: Attilio Ferrari, Stars, Galaxies, Universe - Fundamentals of Astrophysics - Ed. Springer

1. The themes of logic
2. Classical logic: propositions, proofs
3. Classical logic: connectives
4. Classical logic: types, variables, quantifiers
5. First-order Classical logic
6. Classes and sets
7. Codes, digits, Boolean algebra
8. Turing Machine
9. Axiomatization and formalization of first-order classical logic
10. Logic and other disciplines

V. Michele Abrusci, LOGICA - Lezioni di primo livello, Quarta edizione, Wolters Kluwer, 2018

Division, Factorization, Some Elementary Properties of Primes, Some Results and Problems Concerning Primes.
ARITHMETIC FUNCTIONS: The Divisor Function. The Moebius Function. The Euler Function. Dirichlet Convolution
CONGRUENCES: Sets of Residues,Some Interesting Congruences, Some Linear Congruences, Some Polynomial Congruences, Primitive Roots, the Theorem of Gauss.
QUADRATIC RESIDUES: The Legendre Symbol. Quadratic Reciprocity. The Jacobi Symbol.The Distribution of Quadratic Residues.
SUMS OF INTEGER SQUARES: Sums of Two Squares. Number of Representations. Sums of Four Squares. Sums of Three Squares.
ELEMENTARY PRIME NUMBER THEORY: Euclid's Theorem Revisited. The Von Mangoldt Function. Tchebycheff's Theorem. Some Results of Mertens

Chen, W; ELEMENTARY NUMBER THEORY. https://rutherglen.science.mq.edu.au/wchen/lnentfolder/lnent.html
Chowdhury, F.; Chowdhury, M. R. Essentials of Number Theory. Pi Publications, Dhaka, Bangladesh, 2005. ISBN 984-32-2836-7
Hardy, G. H.; Wright, E. M. An introduction to the theory of numbers. Fifth edition. The Clarendon Press, Oxford University Press, New York, 1979. xvi+426 pp. ISBN: 0-19-853170-2; 0-19-853171-0
Davenport, H. Aritmetica superiore. Un'introduzione alla teoria dei numeri. Editore: Zanichelli, 1994. 199 pp. ISBN: 8808091546
Gioia, A. A. The theory of numbers. An introduction. Reprint of the 1970 original. Dover Publications, Inc., Mineola, NY, 2001. xii+207 pp. ISBN: 0-486-41449-3
Rosen, K. H. Elementary number theory and its applications. Fourth edition. Addison-Wesley, Reading, MA, 2000. xviii+638 pp. ISBN: 0-201-87073-8
Tattersall, J. J. Elementary number theory in nine chapters. Cambridge University Press, Cambridge, 1999. viii+407 pp. ISBN: 0-521-58531-7

Notes on graph theory: graph, directed graph, tree, free and rooted tree, connection, strong connection, acyclicality; isomorphisms between graphs, planarity, Kuratowski's theorem, Euler's formula; coloring of graphs, Eulerian paths, Hamiltonian circuits.
Review of algorithm theory and computational complexity: complexity classes, the class of NP, NP-complete, NP-hard problems. Problems of decision, search, enumeration and optimization; problems of nonlinear programming, convex programming, linear programming and integer linear programming; combinatorial optimization problems. Recalls on the elements of combinatorics.
Optimization problems on graphs: visit of graphs, verification of fundamental properties, connection, presence of cycles, strongly connected components, topological ordering of a graph. Minimum spanning tree (Prim and Kruskal algorithms). Paths of minimum cost (Dijkstra and Bellman-Ford algorithms, dynamic programming technique, Floyd-Warshall algorithm, computation of the transitive closure of a graph). Networks and calculation of the maximum flow on a network, maximum flow / minimum cut theorem, Ford-Fulkerson algorithm, Edmonds-Karp algorithm, preflow algorithms, "push-relabel" algorithms.
Partitioning problems of graphs, trees and paths into connected components, objective functions and algorithmic techniques.
Stable marriage problem, generalizations and applications of the problem, Gale and Shapley algorithm.
Huffman codes.
Programming laboratory for the implementation of algorithms in Python language and with the help of Mathematica software.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, "Introduction to algorithms"

Lecture notes and other teaching material in Italian provided by the teacher and made available on the course website (http://www.mat.uniroma3.it/users/liverani/IN440) and on the Microsoft Teams platform

The main theorems of Functional Analysis.

H. Brezis, Functional Analysis.

Recalls on the elementary properties of groups. Direct and semi-direct products. Permutation groups and simplicity of alternate groups. Actions on groups. Sylow's theorems. Finitely generated abelian groups, free groups, nilpotent groups and solvable groups. Since this is an advanced course, other topics can also be included upon request of the class.

A. Machì, Gruppi. Una introduzione a idee e metodi della Teoria dei Gruppi, SPRINGER VERLAG (2007).
M. Artin, Algebra, BOLLATI BORINGHIERI (1997).

Preliminaries: definition of hyper-surface, integration on hyper-surfaces, the divergence theorem; the Laplace equation: the mean value inequalities, the minimum and maximum principle, the Harnack inequality, the Green representation, the Poisson integral, convergence's theorems, interior estimates on the derivatives, the Perron method for the Dirichlet problem.

“Elliptic partial differential equations of second order. Reprint of the 1998 edition”, D. Gilbarg e N.S. Trudinger, Classics in Mathematics, Springer-Verlag
"Partial differential equations. Second edition", Lawrence C. Evans, Graduate Studies in Mathematics 19, American Mathematical Society

Definition and basic properties of the Sobolev spaces W^{1,p} (Ω). Extension operators. Sobolev inequalities. The space W^{1,p}_0 (Ω). Variational formulation of some elliptic boundary value problems. Existence of weak solutions. Regularity of weak solutions.

"Analisi funzionale", H. Brézis, Liguori Editore
"Partial differential equations. Second edition", Lawrence C. Evans, Graduate Studies in Mathematics 19, American Mathematical Society

Highlights of Linear Algebra:
Matrix-matrix multiplication; column & row space; rank
The four fundamental subspaces of linear algebra
Fundamentals of Matrix factorizations:
A=LU rows & columns point of view
A=LU elimination & factorization; permutations
A=RU=VU; Orthogonal matrices
Eigensystems and Linear ODE
Intro to PSym; the energy function
Gradient and Hessian
Singular Value Decomposition
Eckart-Young; derivative of a matrix norm
Principal Component Analysis
Generalized evectors;
Norms
Least Squares
Convexity & Newton’s method
Newton & L-M method; Recap of non-linear regression
Lagrange multipliers

Machine Learning:
Gradient Descend; exact line search; GD in action; GD with Matlab
Learning & Loss; Intro to Deep Neural Network; DNN with Matlab
Loss functions: Quadratic VS Cross entropy
Stocastics Gradient Descend (SGD) & Kaczmarcz; SGD convergence rates & ADAM
Matlab interface for DNN
Construction of DNN: the key steps
Backpropagation and the Chain Rule
Machine Learning examples with Wolfram Mathematica
Convolutional NN + Mathematica examples of 1D convolution
Convolution and 2D filters + Mathematica examples of 2D convolution
Matlab Live Script, Network Designer, Pretrained Net

Lecture notes

G. Strang,
Linear Algebra and Learning from Data,
Wellesley-Cambridge Press

Complex numbers: algebraic and topological properties. Geometric representation of complex numbers: polar coordinates and the complex exponential.
Complex functions with complex variables: continuity and properties, differentiability and first properties. Holomorphic functions: properties and examples of holomorphic and non-holomorphic functions. Cauchy-Riemann equations. The real and imaginary parts of holomorphic functions are harmonic conjugated.
Equations of Cauchy-Riemann: proof. Examples. Sequences and complex series. Properties. Power series with complex values. Abel's theorem and Hadamard's formula.
Proof of Abel's Theorem. Taylor's formula for series of complex powers. The exponential and the trigonometric functions as analytical functions. Basic properties.
Periodicity of the complex exponential function. The complex logarithm: first considerations. The ring of formal powers series with complex coefficients: basic properties. Analytical functions: definition and first properties.
Series of converging powers are analytical within the convergence region. Composition of analytical functions. Theorem of the inverse function.
Inverse by composition of a formal series and its convergence. Complex powers and properties. The binomial series and properties. Consequences of the inverse theorem: the canonical form of an analytic function.
Local properties of analytical functions: open function theorem, invertibility criterion, principle of the maximum local module. The fundamental theorem of algebra. Parameterized curves. A holomorphic function with zero derivative is constant.
The locus of the zeros of a non-constant analytical function is discrete. Analytical continuation of functions defined on open connected sets. Principle of the maximum global module. Integrals in paths: definition and first properties. Examples.
A continuous function in a connected open admits a primitive if and only if its integral along a closed curve is zero. Integration of uniformly converging series of functions. Examples. Local primitive of a holomorphic function.
Local primitive of a holomorphic function. The Goursat theorem. Integral of a holomorphic function along a continuous path.
The homotopical form of the Cauchy Theorem. Global primitive of a holomorphic function in a simply connected domain. Applications to the study of the logarithm.
The integral formula of Cauchy. Cauchy formula for development in series and applications: a holomorphic and analytical function; the theorem of Liouville and the fundamental theorem of algebra.
Integral formula for derivatives. The number of windings of a curve with respect to a point. Curves homologous to 0. The global formula of Cauchy.
Proof of the global Cauchy formula. Examples.
The first homology group of an open set with values ​​in integers. The Cauchy formula for homological invariance. Examples.
Applications of the Cauchy theorem: uniform limit on holomorphic function compacts is holomorphic. Examples. Laurent series.
Series expansion of a holomorphic function in a circular crown in the Laurent series. Isolated singularities and the field of meromorphic functions. Examples. Statement of the classification theorem of isolated singularities and residual theorem: local and global versions.
Proof of the classification theorem of isolated singularities and proof of the residues theorem. The logarithmic derivative and the principle of the argument. Calculation of residues.
Classification of the connected open of C. The Riemann map theorem and the uniformization theorem (without proof). The Riemann sphere as a compactification of the complex plane. The group of linear transformations of the projective line and the linear transformations produced by them. The group of automorphisms of the complex plane.
The lemma of Schwarz and the group of automorphisms of the unitary disc. Elements of global analytical functions and function. The logarithm as a global analytical function.
The n-th rooty as a global analytical function. The bundle of germs of analytical functions and its properties. The Riemann surface associated with a global analytical function.
Examples and properties of Riemann surface. The Riemann surface associated with an algebraic function and properties. Summary and considerations on the course program.

L. V. Ahlfors: Complex Analysis, McGraw-Hill.
S. Lang: Complex analysis, GTM 103.
E. Freitag, R. Busam: Complex Analysis, Springer.

Symplectic geometry and Hamiltonian formalism. Other topics, depending on the interests of the audience

[Z] Zehnder - "Lectures on dynamical systems".

Physical quantities. Intensive and extensive physical quantities. Direct and indirect measurements.
Basic and derived quantities.
Units of measurement. Units of measurement systems. Change of units. Dimensions,
physical principle of homogeneity and dimensional analysis.
Measurement tools. Analogical and Digital Instruments.
Characteristics of the instruments: Range, Threshold, Resolution, Linearity and Sensitivity. Accuracy and Precision.
Uncertainty in measurements. Definition of measurement error. Random errors and
systematic errors. Concept of measurement uncertainty. Causes of uncertainties. Uncertainties of Type
A and Type B.
Graphical analysis of data. Usage of tables and graphs for representation and preliminary analysis
of data without the use of statistical tools. Linear, semi-logarithmic graphs,
Double-logarithmic. Histograms.
Propagation of uncertainties. Uncertainty in indirect measurements. Propagation
of uncertainties for independent quantities. Correlated random variables. Definition of
correlation coefficient. Propagation of uncertainties for correlated quantities.


Laboratory program
- Measurements of fundamental quantities: mass, length, time
- Determination of measurement uncertainty: sensitivity of the instrument,
- Standard deviation in repeated measurements, propagation of uncertainties
- Uncertainty on the average in repeated measurements and dependence on sample size
- Study of the pendulum: verification of the independence of the period from the mass, study of the dependence of the period on the length, measurement of g
- Study of the motion of a cart on the inclined plane, effect of friction, measurement of g
- Static and dynamic study of the elastic constant of a spring
- Measurement of resistances with voltamperometric method, study of a resistive voltage divider
- Study of diffraction
- verification of Snell's law

notes distributed during the classes

1. Atomic theory and structure of the atom. Atoms, molecules, moles; atomic weight and molecular weight. Rutherford model, Bohr model, quantum theory, quantum numbers and energy levels; polyelectronic atoms, periodic system.

2. Chemical bond. Ionic bond. Covalent bond: σ bond and π bond. Polyatomic molecules. Molecular structure. Hybridization and resonance. Molecular orbital. Metallic bond. Intermolecular forces.

3. Nomenclature. Oxides, hydroxides, acids, salts, ions.

4. Chemical reactions. Balancing chemical reactions.

5. States of aggregation. Gaseous state and gas laws.

6. Thermodynamics. Matter, energy, heat. First and second principle. Enthalpy, entropy, free energy.

7. Solid state: ionic, molecular, metallic, covalent solids. Conductors, semiconductors, insulators.

8. Liquid and amorphous. State changes and state diagrams.

9. Solutions. Concentration of solutions. Colligative properties. Electrolyte solutions.

10. Chemical kinetics. Speed ​​of chemical reactions. Speed ​​constant. Influence of temperature on velocity: Arrhenius equation. Catalysts.

11. Chemical equilibrium. Equilibrium constant and speed constants. Constant of equilibrium and free energy. Equilibria in the gas and heterogeneous phase. Le Chatelier's principle. Van’t Hoff equation.

12. Equilibrium in solution. Acid-base equilibria: Acids and bases, pH, dissociation constants, polyprotic acids, hydrolysis, buffers; acid-base titrations, indicators.

13. Precipitation equilibria: solubility and solubility product, common ion effect.

14. Electrochemistry. Batteries, electrode potentials, Nernst equation.

15. Laboratory. Acid-base titrations and pH measurements.

Numerical exercises will be carried out on the topics covered during the lessons.
There will be two laboratory exercises that will take place at CeDiC (Via della Vasca Navale 79).

Shriver & Atkins' Inorganic Chemistry 7th Edition
Periodica Table
Slides online

Introduction to set theory: aggregates and sets, necessity of a theory, ordinals and cardinals, antinomies and paradoxes, main characteristics of axiomatic set theory. Zermelo’s axiomatic set theory and Zermelo-Fraenkel’s axiomatic set theory: preliminaries and conventions, Zermelo’s axioms, the replacement axiom and Zermelo-Fraenkel’s theory, extensions of the language by definition. Ordinals: orders, well-orders and well-foundedness, well-foundedness and induction principle, the ordinal numbers, well-orders and ordinals, ordinal induction (proofs and definitions), diagonal argument and limit ordinals, infinity axiom and ordinal arithmetic, hints on the use of ordinals in proof-theory. Axiom of choice: equivalent formulations (and proof of the equivalence), infinite sets and axiom of choice. Cardinals: equipotent sets and infinite sets, the cardinal numbers, cardinal arithmetic.

Testi: V. Michele Abrusci e Lorenzo Tortora de Falco, Logica. Vol. 2 Incompletezza, teoria assiomatica degli insiemi, Springer, 2018

Evolution equations of Mathematical Physics: transport, wave and heat equations. Introduction to quantum mechanics. Fourier transform

[B] P. Butta', Note del corso di Fisica Matematica
[Cr] W. Craig, A course on Partial Differential Equations
[L1] V. Lubicz, Apppunti di Meccanica Quantistica

Linear Systems
Direst methods: Gaussian elimination. Pivoting strategies. Gaussian elimination as a factorization. Doolittle and Choleshy factorizations. Iterative methods: Jacobi, Gauss-Seidel, SOR, Richardson, and related convergence results. Comparison of direct vs iterative solvers. Stability of algorithms for the solution of linear systems.

Iterative Methods for Scalar Nonlinear Equations
The intermediate zero theorem. The algorithms of bisection, Newton, secants, chords, and related convergence results. (Reference: Chapter 1 excluding Section 1.2.3, and Appendices A.1, A.2)

Approximation of Functions
General approximation strategies. Interpolating polynomial in Lagrange and Newton form. Representation of the interpolation error. Convergence of the interpolating polynomial for analytic functions. Refinement strategies in interpolation: Chebyshev nodes, composite approximations. Error estimates. Hermite polynomial, construction and representation of the error. Least Squares approximations. (Reference: Chapter 5 excluding Section 5.2, and Appendix A.4)

Numerical Integration
General principles of numerical integration. Polya's Theorem on the convergence of interpolatory quadrature formulae. Closed and open Newton-Cotes formulae. Stability results and error estimation. Generalized Newton-Cotes formulae and their convergence. Gaussian quadratures and their convergence. (Reference: Chapter 6)

Laboratory Activity
C language coding of some of the major algorithms, and in particular: Gaussian elimination, iterative methods for linear systems and scalar equations, Lagrange/Newton interpolation with a refinement strategy.

N.B.: References are provided with respect to the course notes.

Roberto Ferretti, "Appunti del corso di Analisi Numerica", available from the course page

Roberto Ferretti, "Esercizi d'esame di Analisi Numerica", available from the course page

Slides of the lessons, available from the course page

Random variables and their distribution, moment generating function, mean variance and covariance.
Random sampling model and statistical model.
Statistics: concept, examples, sufficient statistics.
Point estimators: definition and desired properties, moments, maximum likelihood and Bayes.
Computational methods: Newton-Raphson, EM algorithm
Improving an estimator: Rao-Blackwell, UMVU estimator, full statistic, Lehman-Scheff ́e II and Cramer-Rao
Confidence intervals: intuitive, pivotal quantity, IC for Bayes and asymptotic IC.
Hypothesis testing: likelihood ratio, pivotal quantity test (Z and T test), duality with IC, UMP, Neyman-Pearson and Karlin-Rubin tests.
Non-parametric methods: goodness-of-fit, contingency table, Kolmogorov-Smirnov and ranking tests.
Analysis of variance (ANOVA) and F.
Regression: linear, multiple linear, generalized linear and Logistic / Poisson

Statistical Inference, Casella e Berger, 2nd Edition, Duxbury Advanced Series.

Additional reference:
Luca Leuzzi, Enzo Marinari, Giorgio Parisi
CALCOLO DELLE PROBABILITÀ: un trattatello per principianti volenterosi

Relations and functions
The natural numbers
The ring of integers and polynomials
Residue classes
Groups

G.M. Piacentini Cattaneo, Algebra, un approccio algoritmico, Decibel-Zanichelli, (1996)

I. N. Herstein, Algebra, Editori Riuniti, (2003)

Division, Factorization, Some Elementary Properties of Primes, Some Results and Problems Concerning Primes.
ARITHMETIC FUNCTIONS: The Divisor Function. The Moebius Function. The Euler Function. Dirichlet Convolution
CONGRUENCES: Sets of Residues,Some Interesting Congruences, Some Linear Congruences, Some Polynomial Congruences, Primitive Roots, the Theorem of Gauss.
QUADRATIC RESIDUES: The Legendre Symbol. Quadratic Reciprocity. The Jacobi Symbol.The Distribution of Quadratic Residues.
SUMS OF INTEGER SQUARES: Sums of Two Squares. Number of Representations. Sums of Four Squares. Sums of Three Squares.
ELEMENTARY PRIME NUMBER THEORY: Euclid's Theorem Revisited. The Von Mangoldt Function. Tchebycheff's Theorem. Some Results of Mertens

Chen, W; ELEMENTARY NUMBER THEORY. https://rutherglen.science.mq.edu.au/wchen/lnentfolder/lnent.html
Chowdhury, F.; Chowdhury, M. R. Essentials of Number Theory. Pi Publications, Dhaka, Bangladesh, 2005. ISBN 984-32-2836-7
Hardy, G. H.; Wright, E. M. An introduction to the theory of numbers. Fifth edition. The Clarendon Press, Oxford University Press, New York, 1979. xvi+426 pp. ISBN: 0-19-853170-2; 0-19-853171-0
Davenport, H. Aritmetica superiore. Un'introduzione alla teoria dei numeri. Editore: Zanichelli, 1994. 199 pp. ISBN: 8808091546
Gioia, A. A. The theory of numbers. An introduction. Reprint of the 1970 original. Dover Publications, Inc., Mineola, NY, 2001. xii+207 pp. ISBN: 0-486-41449-3
Rosen, K. H. Elementary number theory and its applications. Fourth edition. Addison-Wesley, Reading, MA, 2000. xviii+638 pp. ISBN: 0-201-87073-8
Tattersall, J. J. Elementary number theory in nine chapters. Cambridge University Press, Cambridge, 1999. viii+407 pp. ISBN: 0-521-58531-7

Part I

Invitation

Fundamental physics as a theory of motion. The revolution of the XX century: quantum mechanics, special and general relativity, quantum field theory. The challenge of quantum gravity.
Basic constants: h, c and G. The cube of theories.

Introduction: the status of physics at the end of the XIX century

Precession of Mercury's perihelion. The discovery of radioactivity. Michelson and Morley and the speed of light. Black body radiation. Photoelectric effect. Compton diffusion. Compton wavelength. De Broglie and matter waves. Davisson and Germer and electron diffraction. Neglected hints from the past: equivalence of inertial and gravitational masses. Action at a distance. Similarities between gravitostatic and electrostatic forces.

Mathematical interlude: Waves.

Part II: Special Relativity

Reference systems and observers. Galilean Relativity. Principles of Newtonian mechanics. Galilean transformations. Maxwell's equations and electromagnetic waves.
The aether hypothesis and Michelson-Morley's experiment. Constancy of c and principles of Special Relativity. Space-time diagrams. Simultaneity. Boosts. c as the maximal signal speed. Length contraction and time dilation. Atmospheric muon lifetime. Invariance of the space-time interval. Minkowski space. Time-like, null and space-like intervals. Proper time. Causal structure of Minkowski space. Composition of velocities. The Doppler effects. The twin paradox. The garage paradox. Time dilation and gravitational time delay. Isometries in Minkowski space: pseudo-orthogonality and Lorentz transformations. Four-vectors: relativistic velocity and acceleration. Relativistic dynamics: action principle. Energy, momentum and conservation of the four-momentum. Dispersion relation. Particles of zero mass. Relativistic force. Covariant formulation of electromagnetism: Maxwell's tensor and inhomogeneous equations. The Lorentz force. Homogeneous Maxwell's equations: the vector potential; gauge invariance and its meaning.

Part III: Quantum Mechanics

Spin and qubits. Stern-Gerlach experiments. Physical states. Spin states: basis and normalization. Global phases. Bras and kets. Principles of QM: states, observables, measures, probabilistic interpretation. Pauli matrices and spin observables. Spectrum of the spin operator along an arbitrary direction. Time evolution. The operator U(t, t_0). Unitarity and its meaning. Schrödinger's equation. Hamiltonian. Time evolution of averages. Classical mechanics and Poisson brackets. Conservation laws. Spin in magnetic field. Compatible and incompatible observables. The uncertainty principle. Two-spin systems. Product states and entangled states. Singlet and triplet states. Observables on composite systems. Pure states and mixed states: the density matrix. Entanglement and density matrix. Tests of entanglement. Waves and particles. Position and momentum operators and their eigenfunctions. Basics of canonical quantization. Free particle Hamiltonian and its spectrum. Quantum Newton's second law. The harmonic oscillator. Creation and annihilation operators. Energy levels. Classically forbidden regions: the tunnel effect. Pathway towards relativistic quantum mechanics.

Mathematical interludes: Complex vector spaces. Scalar product. Hermitian operators. Exterior products and projectors. Completeness relation. Operators for continuous spectra.

-Susskind L and Friedman A, Quantum Mechanics. The Theoretical Minimum (2014)
-Susskind L and Friedman A, Special Relativity and Classical Field Theory. The Theoretical Minimum} (2017)

The course aims to introduce students to the teaching of mathematics in first and second grade secondary schools, through a historical-epistemological approach to the basic concepts of elementary mathematics (arithmetic, geometry, algebra, probability, functions). In particular: the teaching of mathematics and its evolution; numerical systems; Euclid's axioms and postulates; non-Euclidean and locally Euclidean geometries; geometric constructions with ruler and compass and mathematical machines; elements of history of infinitesimal calculus. Outline of national indications.

GIORGIO ISRAEL, ANA MILLÁN GASCA, Pensare in matematica, Zanichelli, 2012.
ANA MILLÁN GASCA, All'inizio fu lo scriba, Mimesis, 2004
ENRICO GIUSTI, Analisi matematica 1, Bollati Boringhieri, 2002

Graphs: basic definitions. Simple and non simple graphs, planarity, connectivity, degree, regularity, incidence and adjacency matrices. Examples of families of graphs. The '' handshaking lemma ''.
Graphs obtained from others: complement, subgraph, cancellation and contraction. Isomorphisms and automorphisms of graphs. Connectivity: paths, cycles. A graph is bipartite if and only if each cycle has equal length.
Connetivity and connected component. Connectivity for sides and vertices. Eulerian and semi-Eulerian graphs.
Euler's theorem: a connected graph is Eulerian if and only if every vertex has an even degree. Hamiltonian graphs. Sufficient conditions to guarantee that a graph is Hamiltonian: the theorems of Ore and Dirac.
the Ore theorem. Trees and forests. The cyclomatic number and the "cutset" rank of a graph.
Fundamental system of cycles and cuts associated with a generating forest. Enumeration of generating forests. The Cayley theorem.
Generating trees: the "greedy" algorithm for the "connector problem". Planar graphs. K3.3 and K5 are not planar. Statement of the theorem of Kuratovski and variations.
Euler's formula for planar graphs. The dual of a planar graph.
Correspondence between cycles and cuts for planar graphs and their dual. Dual abstract. A graph that admits a dual abstract is planar. Colorings: initial considerations and some properties.
Colorings: the 5 colors theorem. Graphs on surfaces: classification of topological surfaces.
Coloring of faces and duality between this problem and the coloring of vertices. Reduction of the proof of the 4-color theorem to the coloring of cubic graph faces. '' The marriage problem ": Hall's theorem.
Hall's theorem in the language of transversals. Criteria of existence of transversal and partial transversivities. Application to the construction of Latin squares. Direct graphs: basic notions and orientability.
The Max-Flow Min-Cut theorem and Menger's theorem.
Complexity of algorithms and applications to the theory of graphs.
Introduction to the theory of matroids: definitions using bases and independent elements. Graphical and cographic matroids, vector matroids and the problem of representability.
Definition of matroid using the cycles and the rank function. Minors of a matroid. Transverse matroids and the Rado Theorem for matroids.
Union of matroids and applications: existence of disjoint bases in a matroid. Duality for matroids and applications to graphic and cographic matroids. Planar matroids and the generalization of Kuratovski's theorem for matroids.
Elements of algebraic graph theory: the incidence matrix and the Laplacian matrix of an oriented graph. The vertex space and the space of edges of a graph. Subspaces of the cycles and subspace of the cuts of a defined oriented graph of the incidence matrix.
Basis for the space of the cycles and for the space of the cuts of a graph. The Riemann-Roch theorem for graphs.
Proof of the "generalized Matrix Tree theorem". The contraction / restriction algorithm for matroids. Examples. The number of acyclical orientations of a graph.
Graph polynomials: the chromatic polynomial, the "reliabiliaty" polynomial. Examples. The polynomial rank of a matroid. Properties and first applications.
Proof of the structure theorem for functions on matroids that satisfy contraction/restriction properties. Their incarnation through the polynomial rank.
Whitey's moves and two isomorphisms for graphs. Isomorphism between graphical matroids implies isomorphism between graphs in case the graphs are 3 connected.
Whitney's Theorem for graphic matroids: sketch of the demonstration. Characterization for minors excluded from binary and regular matroids. The theorem of Seymour.

R. Diestel: Graph theory, Spriger GTM 173.
R. Wilson: Introduction to Graph theory, Prentice Hall.
B. Bollobas: Modern Graph theory, Springer GTM 184.
J. A. Bondy, U.S.R. Murty: Graph theory, Springer GTM 244.
N. Biggs: Algebraic graph theory, Cambridge University Press.
C. D. Godsil, G. Royle: Algebraic Graph theory, Springer GTM 207.
J. G. Oxley: Matroid theory. Oxford graduate texts in mathematics, 3.

Division, Factorization, Some Elementary Properties of Primes, Some Results and Problems Concerning Primes.
ARITHMETIC FUNCTIONS: The Divisor Function. The Moebius Function. The Euler Function. Dirichlet Convolution
CONGRUENCES: Sets of Residues,Some Interesting Congruences, Some Linear Congruences, Some Polynomial Congruences, Primitive Roots, the Theorem of Gauss.
QUADRATIC RESIDUES: The Legendre Symbol. Quadratic Reciprocity. The Jacobi Symbol.The Distribution of Quadratic Residues.
SUMS OF INTEGER SQUARES: Sums of Two Squares. Number of Representations. Sums of Four Squares. Sums of Three Squares.
ELEMENTARY PRIME NUMBER THEORY: Euclid's Theorem Revisited. The Von Mangoldt Function. Tchebycheff's Theorem. Some Results of Mertens

Chen, W; ELEMENTARY NUMBER THEORY. https://rutherglen.science.mq.edu.au/wchen/lnentfolder/lnent.html
Chowdhury, F.; Chowdhury, M. R. Essentials of Number Theory. Pi Publications, Dhaka, Bangladesh, 2005. ISBN 984-32-2836-7
Hardy, G. H.; Wright, E. M. An introduction to the theory of numbers. Fifth edition. The Clarendon Press, Oxford University Press, New York, 1979. xvi+426 pp. ISBN: 0-19-853170-2; 0-19-853171-0
Davenport, H. Aritmetica superiore. Un'introduzione alla teoria dei numeri. Editore: Zanichelli, 1994. 199 pp. ISBN: 8808091546
Gioia, A. A. The theory of numbers. An introduction. Reprint of the 1970 original. Dover Publications, Inc., Mineola, NY, 2001. xii+207 pp. ISBN: 0-486-41449-3
Rosen, K. H. Elementary number theory and its applications. Fourth edition. Addison-Wesley, Reading, MA, 2000. xviii+638 pp. ISBN: 0-201-87073-8
Tattersall, J. J. Elementary number theory in nine chapters. Cambridge University Press, Cambridge, 1999. viii+407 pp. ISBN: 0-521-58531-7

Recalls on the elementary properties of groups. Direct and semi-direct products. Permutation groups and simplicity of alternate groups. Actions on groups. Sylow's theorems. Finitely generated abelian groups, free groups, nilpotent groups and solvable groups. Since this is an advanced course, other topics can also be included upon request of the class.

A. Machì, Gruppi. Una introduzione a idee e metodi della Teoria dei Gruppi, SPRINGER VERLAG (2007).
M. Artin, Algebra, BOLLATI BORINGHIERI (1997).