Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Untitled

In course

PHYS-702: Advanced Quantum Field Theory

The course builds on the course QFT1 and QFT2 and develops in parallel to the course on Gauge Theories and the SM. ...

Instructors (5)

Xiang Zhao

Riccardo Rattazzi

Riccardo Rattazzi was born in Novara (Italy) in 1964. He studied physics at the University of Pisa, where he received the Laurea cum laude in 1987, and at the Scuola Normale Superiore where he received the Diploma in Scienze and carried out graduate research in theoretical physics. After having been a post-doctoral research associate at the Lawrence Berkeley Laboratory, at Rutgers University and at CERN, in 1998 Riccardo obtained a permanent research position at the Istituto Nazionale di Fisica Nucleare in Pisa. From 2001 to 2006 he was a staff member at the Theory Division of CERN. In 2006 he was appointed professor of physics at EPFL.

Brando Bellazzini

Alexander Monin

Jiaxin Qiao

Official source

https://mediaspace.epfl.ch/media/0_gyo7nn0z

Related concepts (32)

Constraint programming

Constraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer science, and operations research. In constraint programming, users declaratively state the constraints on the feasible solutions for a set of decision variables. Constraints differ from the common primitives of imperative programming languages in that they do not specify a step or sequence of steps to execute, but rather the properties of a solution to be found.

Σ-algebra

In mathematical analysis and in probability theory, a σ-algebra (also σ-field) on a set X is a nonempty collection Σ of subsets of X closed under complement, countable unions, and countable intersections. The ordered pair is called a measurable space. The σ-algebras are a subset of the set algebras; elements of the latter only need to be closed under the union or intersection of finitely many subsets, which is a weaker condition.

Constraint logic programming

Constraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is . In this clause, is a constraint; A(X,Y), B(X), and C(Y) are literals as in regular logic programming. This clause states one condition under which the statement A(X,Y) holds: X+Y is greater than zero and both B(X) and C(Y) are true.

Σ-finite measure

In mathematics, a positive (or signed) measure μ defined on a σ-algebra Σ of subsets of a set X is called a finite measure if μ(X) is a finite real number (rather than ∞), and a set A in Σ is of finite measure if μ(A) < ∞. The measure μ is called σ-finite if X is a countable union of measurable sets each with finite measure. A set in a measure space is said to have σ-finite measure if it is a countable union of measurable sets with finite measure. A measure being σ-finite is a weaker condition than being finite, i.

Isometry

In mathematics, an isometry (or congruence, or congruent transformation) is a distance-preserving transformation between metric spaces, usually assumed to be bijective. The word isometry is derived from the Ancient Greek: ἴσος isos meaning "equal", and μέτρον metron meaning "measure". Given a metric space (loosely, a set and a scheme for assigning distances between elements of the set), an isometry is a transformation which maps elements to the same or another metric space such that the distance between the image elements in the new metric space is equal to the distance between the elements in the original metric space.

Related lectures (30)

A Conjecture of Erdös: Proof by Moreira, Richter and Robertson

Presents a short proof of a conjecture by Erdös, exploring related questions and detailed proof of the proposition.

Dynamical Approaches to Spectral Theory of Operators

Explores ergodic theory, spectral operators, and almost periodic factors in dynamical systems and spectral theory.

Scaling & Renormalization in Statistical Mechanics

Explores scaling and renormalization in statistical mechanics, emphasizing critical points and invariant properties.

Determinantal Point Processes and Extrapolation

Covers determinantal point processes, sine-process, and their extrapolation in different spaces.

Molecular dynamics under constraints