29 MAY 2023
16:00 - 18:00

Some Remarks on Corced Confession

Link: http://philosophy.ipm.ac.ir/

29 MAY 2023
11:00 - 12:00

Abstract:

Cosmic muons are high-energy particles that constantly bombard the Earth's atmosphere from outer space. These particles are created by cosmic rays colliding with atoms in the upper atmosphere, and are capable of penetrating deep underground and through dense materials such as lead and concrete. This feature makes them an excellent tool for imaging and exploration. In this work we have brief review on the source of the cosmic muons and their properties, then we discuss their application in imaging and at the end we introduce an optimal detector that has been developed in IPM (Institute for Research in Fundamental Sciences) of Iran for imaging.

Based on:
https://doi:10.1088/1742-6596/1596/1/012008

Meeting Place:
Seminar Room, School of Particles and Accelerators, IPM

Link to join virtually:
https://meet.google.com/fnv-dfkk-ghb


Link: https://meet.google.com/fnv-dfkk-ghb

31 MAY 2023
16:00 - 17:00

We discuss two notions of percolation on graphs. The first one is $r$-neighbor bootstrap percolation in which an activation process of the vertices of a given graph is carried out. The process starts with some initially activated vertices and then, in each round, any inactive vertex with at least $r$ active neighbors becomes activated. The second one is the so called graph bootstrap percolation in which we activate the edges of a graph instead of vertices. Starting with some initially activated edges, we activate any inactive edge which creates a new copy of $H$, the pattern or base graph. Two problems, one of combinatorial nature and the other of probabilistic type are reviewed. The minimum size of a set of initially activated vertices leading to the activation of all vertices of a graph $G$ in the $r$-neighbor bootstrap percolation is denoted by $m(G, r)$. Computing $m(G, r)$ is a combinatorial problem. In the second problem, each vertex of $G$ is initially activated with a probability $p$ and the question is to find the probability threshold of activation of all vertices of the graph $G$. We talk about the latest developments on both problems and also the connections between $r$-neighbor bootstrap percolation and graph bootstrap percolation.

Subscribing the Mathematics Colloquium mailing list:
https://groups.google.com/g/ipm-math-colloquium

31 MAY 2023
17:30 - 19:00

I will present joint work with Andrea Ferraguti which makes progress on a conjecture of Andrews and Petsche that classifies abelian dynamical Galois groups over number fields, in the unicritical case. I will explain how to reduce the conjecture to the post-critically finite case and the key tools to handle all unicritical PCF with periodic critical orbit over any number field and all PCF over quadratic number fields. Along the way I will present an earlier rigidity result of ours on the maximal closed subgroup of the automorphism group of a binary rooted tree, which offered us with the main input to translate the commutativity of the Galois image into diophantine equations. I will also overview progress on the tightly related problem of lower bounding arboreal degrees.

Zoom Meeting ID: 856 1386 0958
Passcode: 513992
ICS-File: https://researchseminars.org/seminar/FGC-IPM/ics

31 MAY 2023
13:30 - 15:00

The coefficients of the operators of an effective field theory (EFT) are constrained to satisfy certain inequalities, under the (mild) assumption that the UV completion satisfies general requirements of causality and unitarity. We begin the extension of these ideas to theories where the Lorentz symmetry is spontaneously broken, as it happens in cosmology and condensed matter physics. Constraints are derived using dispersive arguments for the 2-point function of conserved currents and of the stress-energy tensor.


To join the seminar, please click on the following link


https://www.skyroom.online/ch/soa/weekly-seminar