BEGIN:VCALENDAR

VERSION:2.0

PRODID:-//wp-events-plugin.com//7.4.2//EN

TZID:Asia/Jerusalem

X-WR-TIMEZONE:Asia/Jerusalem
BEGIN:VEVENT

UID:194@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20240228T123000

DTEND;TZID=Asia/Jerusalem:20240228T133000

DTSTAMP:20250109T093657Z

URL:https://math.technion.ac.il/events/classification-of-noncommutative-su
 bvarieties/

SUMMARY:Classification of noncommutative subvarieties
DESCRIPTION:Lecturer:Jeet Sampat (Technion)\n Location:Faculty lounge\, 8th
  floor\n Abstract:\n\nA corollary of Hilbert's Nullstellensatz is that the
  quotient algebras of two\nradical ideals in the ring of (commutative) pol
 ynomials in d complex variables\nare isomorphic to each other if and only 
 if the corresponding varieties are\nisomorphic\, in the sense that there e
 xist polynomial maps between the ddimensional\ncomplex space that restrict
  to mutually inverse bijections between\nthe corresponding varieties. In t
 his talk\, we consider the noncommutative (nc)\nanalogue of the above resu
 lt and answer the following questions:\nWhen are two nc varieties "isomorp
 hic" to each other? What happens if we\nreplace the ring of complex polyno
 mials with some other algebra of complex\nnc functions?\nWe start with a s
 oft introduction to nc function theory and discuss some of the\nproperties
  that general nc functions share. For the main result\, we use a\nremarkab
 le theorem of Ball\, Marx\, and Vinnikov about extending nc functions\noff
  of subvarieties to show that if the ambient space is "nice enough" then t
 wo\nsubvarieties are isomorphic (in the sense that there is a bijective nc
  map\nbetween the subvarieties) if and only if this isomorphism is given b
 y the\nrestriction of an isomorphism between the ambient spaces.\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Faculty lounge\, 8th floor

END:VEVENT
BEGIN:VEVENT

UID:205@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20240313T123000

DTEND;TZID=Asia/Jerusalem:20240313T133000

DTSTAMP:20250109T093658Z

URL:https://math.technion.ac.il/events/the-fractal-properties-of-the-graph
 s-of-weierstrass-functions/

SUMMARY:The fractal properties of the graphs of Weierstrass functions
DESCRIPTION:Lecturer:Haojie Ren (Technion)\n Location:Faculty Lounge 8th fl
 oor Amado\n In this presentation\, we'll start by discussing Weierstrass f
 unctions\, which are the most famous example of continuous nowhere differe
 ntiable functions\, initially introduced by Weierstrass. Following that\, 
 we'll introduce the concept of fractal dimension and illustrate its calcul
 ation using the Cantor set. Then\, we'll briefly review the historical con
 text. Next\, we'll provide a simple proof of the box dimension of its grap
 h\, and finally\, we'll introduce my result joint with Professor Weixiao S
 hen.\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Faculty Lounge 8th floor Amado

END:VEVENT
BEGIN:VEVENT

UID:215@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20240327T123000

DTEND;TZID=Asia/Jerusalem:20240327T133000

DTSTAMP:20250109T093700Z

URL:https://math.technion.ac.il/events/mean-curvature-flow-and-application
 s/

SUMMARY:Mean curvature Flow and Applications
DESCRIPTION:Lecturer:Daniel Goldberg (Technion)\n Location:Faculty Lounge 8
 th floor Amado\n A Hypersurface moving so as to decrease its area in the m
 ost efficient way possible (in the L^2 norm) is said to evolve by Mean Cur
 vature Flow. The Mean Curvature Flow is considered by many to be the most 
 natural equation in extrinsic geometry as it is the L^2 gradient flow of t
 he area functional. In this talk we will introduce the Mean Curvature flow
  by first deriving it as a gradient flow. Subsequently\, we will present i
 ts basic properties including short time well-posedness\, maximum principl
 e\, and some geometric attributes. Finally\, we will show applications of 
 the Mean    Curvature Flow to material science and image processing. j\n
  
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Faculty Lounge 8th floor Amado

END:VEVENT
BEGIN:VEVENT

UID:254@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20240619T133000

DTEND;TZID=Asia/Jerusalem:20240619T143000

DTSTAMP:20250109T093743Z

URL:https://math.technion.ac.il/events/russian-monsters/

SUMMARY:Russian Monsters
DESCRIPTION:Lecturer:Zachary Munro (Technion)\n Location:Faculty Lounge 8th
  floor Amado\n \nWe'll give an accessible introduction to small-cancellati
 on theory and discuss some of the early successes of the theory. These inc
 lude solutions of the word and conjugacy problem for large classes of grou
 ps\, along with the creation of exotic groups related to the Burnside prob
 lem. Examples of this latter type include finitely generated infinite tors
 ion groups\, Tarski monster groups\, Gromov monster groups\, etc.\n\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Faculty Lounge 8th floor Amado

END:VEVENT
BEGIN:VEVENT

UID:279@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20240717T133000

DTEND;TZID=Asia/Jerusalem:20240717T143000

DTSTAMP:20250109T093815Z

URL:https://math.technion.ac.il/events/a-gap-labeling-theorem-for-schrodin
 ger-operators-on-metric-graphs/

SUMMARY:A gap labeling theorem for Schrödinger operators on metric graphs
DESCRIPTION:Lecturer:Gilad Sofer (Technion)\n Location:Faculty Lounge 8th f
 loor Amado\n \n\nGiven a Schrödinger operator on Rn or Zn\, we are often 
 interested in its integrated density of states\, which roughly counts the 
 number of states per unit volume in the system. Special attention is often
  given to the values the integrated density of states attains inside spect
 ral gaps\, which are known as gap labels. These gap labels are also of sig
 nificant physical importance\, as seen in the quantum hall effect\, where 
 they correspond to the possible values of the Hall conductance.\n\nIn this
  talk\, I will discuss an ongoing work with Ram Band\, that focuses on the
  gap labels for Schrödinger operators on complex networks of conductors\,
  known as quantum graphs. We show that the gap labels for such quantum gra
 phs are contained in the image of a naturally defined homomorphism\, which
  depends on both the geometry of the graph\, and the dynamics governing it
 s local structure. This provides a method to compute the possible gap labe
 ls for large families of quantum graphs\, offering new insights into their
  spectral properties and potential applications.\n\n\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Faculty Lounge 8th floor Amado

END:VEVENT
BEGIN:VEVENT

UID:296@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20240731T133000

DTEND;TZID=Asia/Jerusalem:20240731T143000

DTSTAMP:20250109T093817Z

URL:https://math.technion.ac.il/events/sample-compression-and-topological-
 radon-theorem/

SUMMARY:Sample Compression and Topological Radon Theorem
DESCRIPTION:Lecturer:Bogdan Chornomaz (Technion)\n Location:Faculty Lounge 
 8th floor Amado\n \n\n\n\nIf asked\, what mathematical tools are mostly us
 ed in machine learning\, one would probably name statistics\, probability\
 , or combinatorics. So it is especially pleasing when some other tools\, c
 onsidered rather exotic in this area\, find natural applications to ML pro
 blems. In this talk\, I will speak about an application of (a variant of) 
 topological Radon theorem to an old open problem in theoretical machine le
 arning regarding the existence of the so-called sample compression schemes
 .\n\nThe talk is based on the joint work with Zachary Chase\, Steve Hannek
 e\, Shay Moran\, and Amir Yehudayoff.\n\n\n\n\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Faculty Lounge 8th floor Amado

END:VEVENT
BEGIN:VEVENT

UID:304@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20240814T133000

DTEND;TZID=Asia/Jerusalem:20240814T143000

DTSTAMP:20250109T093817Z

URL:https://math.technion.ac.il/events/arithmetic-dynamics/

SUMMARY:Arithmetic Dynamics
DESCRIPTION:Lecturer:Angelot Behajaina (Technion)\n Location:Faculty Lounge
  8th floor Amado\n \n\n\n\n\nArithmetic dynamics is an exciting field that
  blends number theory with dynamical systems. It involves exploring the nu
 mber-theoretic properties of self-maps\, such as those defined by polynomi
 als over the field of rational numbers. In this talk\, I am going to focus
  on the concept of ``Arboreal Galois representations''. This framework off
 ers tools to investigate questions like the density of prime divisors in s
 equences defined by polynomials.\n\n\n\n\n\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Faculty Lounge 8th floor Amado

END:VEVENT
BEGIN:VEVENT

UID:348@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20241204T133000

DTEND;TZID=Asia/Jerusalem:20241204T143000

DTSTAMP:20250109T093839Z

URL:https://math.technion.ac.il/events/learning-under-privacy-connections-
 to-online-learning-and-ramsey-theory/

SUMMARY:Learning Under Privacy: Connections to Online Learning and Ramsey T
 heory
DESCRIPTION:Lecturer:Hilla Schefler (Technion)\n Location:Faculty Lounge 8t
 h floor Amado\n \n\n\n\nDifferential Privacy (DP) is a mathematical framew
 ork for ensuring the privacy of individuals in a dataset. Roughly speaking
 \, it guarantees that privacy is protected in data analysis by ensuring th
 at the output of an analysis does not reveal sensitive information about a
 ny specific individual\, regardless of whether their data is included in t
 he dataset or not.\nIn this talk I will present a recent result regarding 
 the link between DP learning and online learning: Alon\, Livni\, Malliaris
 \, and Moran (2019) showed that for binary classification tasks\, DP learn
 ability implies online learnability. But does this connection extend to mo
 re general scenarios? We answer this positively by developing new Ramsey t
 heorems for trees.\nThis talk is based on joint work with Simone Fioravant
 i\, Steve Hanneke\, Shay Moran\, and Iska Tsubari. No prior knowledge of L
 earning Theory is required.\n\n\n\n\n\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Faculty Lounge 8th floor Amado

END:VEVENT
BEGIN:VEVENT

UID:371@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20250108T133000

DTEND;TZID=Asia/Jerusalem:20250108T143000

DTSTAMP:20250109T093843Z

URL:https://math.technion.ac.il/events/dimension-of-self-similar-fractals-
 on-the-line/

SUMMARY:Dimension of self-similar fractals on the line
DESCRIPTION:Lecturer:Zhou Feng (Technion)\n Location:Faculty Lounge 8th flo
 or Amado\n \n\n\n\n\nSelf-similar sets and measures are an important famil
 y of dynamically-driven fractals\, and it is a fundamental problem in frac
 tal geometry to determine their dimensions. About this problem\, there is 
 a folklore conjecture called the exact overlaps conjecture. In this talk\,
  we will introduce the recent progress on this conjecture in a gentle way\
 , and present our results towards it. This is based on joint work with De-
 Jun Feng.\n\n\n\n\n\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Faculty Lounge 8th floor Amado

END:VEVENT
BEGIN:VEVENT

UID:389@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20250122T133000

DTEND;TZID=Asia/Jerusalem:20250122T143000

DTSTAMP:20250119T093109Z

URL:https://math.technion.ac.il/events/unlikely-phenomena-for-the-fibonacc
 i-sequence/

SUMMARY:Unlikely phenomena for the Fibonacci sequence
DESCRIPTION:Lecturer:Adi Ostrov (Bar Ilan)\n Location:Faculty Lounge 8th fl
 oor Amado\n \n\n\n\n\nWhich polynomials p(x) in Q[x] attain values in the 
 Fibonacci sequence F_n infinitely often?\n\nThe philosophy of unlikely int
 ersections suggests that there should be very few such polynomials\, if an
 y.\n\nIn this lecture I will give the list of all such polynomials and all
  such rational functions.\n\nMoreover\, I will discuss and present results
  for a related problem of reducibility: for which irreducible polynomials 
 P(t\, x) in Q(t)[x] are the specialized polynomials P(F_n\, x) in Q[x] red
 ucible for infinitely many n's?\n\nThis lecture is based on my master's th
 esis under the supervision of Danny Neftin and Eyal Subag\, and on joint w
 ork with Avi Berman and Reyad Abed Elrazik.\n\n\n\n\n\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Faculty Lounge 8th floor Amado

END:VEVENT
BEGIN:VEVENT

UID:436@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20250409T133000

DTEND;TZID=Asia/Jerusalem:20250409T143000

DTSTAMP:20250408T060533Z

URL:https://math.technion.ac.il/events/deep-learning-on-multisets-and-meas
 ures-via-euclidean-embeddings/

SUMMARY:Deep Learning on Multisets and Measures via Euclidean Embeddings
DESCRIPTION:Lecturer:Tal Amir (Technion)\n Location:Amado 619\n \n\n\n\n\nR
 ecent advances in machine learning have focused on non-Euclidean data\, su
 ch as sets\, point clouds\, and graphs. Developing efficient methods to em
 bed these data types into Euclidean space is critical\, as it allows for t
 he direct application of standard machine learning tools such as neural ne
 tworks. In particular\, Euclidean embeddings for more complex structures l
 ike point clouds and graphs typically rely on Euclidean embeddings for mul
 tisets as a fundamental building block.\n\nIn this talk\, I will present t
 wo novel methods for embedding multisets and measures into Euclidean space
 : the first is based on sum-pooled shallow neural networks with carefully 
 chosen activation functions [1]\; the second\, inspired by optimal transpo
 rt\, uses Fourier sampling of projected quantile functions [2]. I will dis
 cuss the theoretical properties of these methods\, including injectivity a
 nd bi-Lipschitzness\, and demonstrate their advantages in practical learni
 ng tasks. Additionally\, I will present two impossibility results: (1) emb
 eddings based on sum-pooling can never be bi-Lipschitz on multisets\, and 
 (2) no embedding can be bi-Lipschitz on distributions.\n\n\nReferences\n\n
 [1] Amir\, T.\, Gortler\, S.\, Avni\, I.\, Ravina\, R.\, &amp\; Dym\, N. (
 2023). Neural injective functions for multisets\, measures and graphs via 
 a finite witness theorem. Advances in Neural Information Processing System
 s\, 36\, 42516-42551.\n\n[2] Amir\, Tal\, and Nadav Dym. Fourier Sliced-Wa
 sserstein Embedding for Multisets and Measures. To appear in the Proceedin
 gs of the International Conference on Learning Representations (ICLR)\, 20
 25.\n\n\n\n\n\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Amado 619

END:VEVENT
BEGIN:VEVENT

UID:465@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20250604T133000

DTEND;TZID=Asia/Jerusalem:20250604T143000

DTSTAMP:20250528T100320Z

URL:https://math.technion.ac.il/events/curves-have-a-finite-number-of-symm
 etries/

SUMMARY:Curves have a finite number of symmetries.
DESCRIPTION:Lecturer:Aleksei Piskunov (Technion)\n Location:8th floor Facul
 ty Lounge\, Amado Bldg\n \n\n\n\n\nHow many symmetries can a curve possess
 ? It turns out that once the (smooth projective) curve is "complicated eno
 ugh"—specifically\, if it has genus at least 2—then its automorphisms 
 group is always finite. In this talk\, I will show a new simple\, but conc
 eptual proof of this fact based on a one-pager by Daniel Litt. I will also
  explain how the same method extends to higher-dimensional cases under mil
 d assumptions.\n\nIt’s a fun example of how geometry puts hard limits on
  symmetries. No special background in algebraic geometry is needed!\n\n\n\
 n\n\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:8th floor Faculty Lounge\, Amado Bldg

END:VEVENT
BEGIN:VEVENT

UID:473@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20250618T133000

DTEND;TZID=Asia/Jerusalem:20250618T143000

DTSTAMP:20250610T082713Z

URL:https://math.technion.ac.il/events/optimal-hardy-weights-for-the-p-dir
 ichlet-integral/

SUMMARY:Optimal Hardy-weights for the p-Dirichlet integral
DESCRIPTION:Lecturer:Yongjun Hou (Technion)\n Location:8th floor Faculty Lo
 unge\, Amado Bldg\n \n\n\n\nIn this talk\, we start with the classical Har
 dy inequality. Then we define the p-Dirichlet integral with a potential an
 d the p-Laplace equation with a potential. We review some fundamental conc
 epts in criticality theory\, such as Hardy-weights\, criticality\, subcrit
 icality\, supercriticality\, null-sequences\, and ground states\, and an A
 gmon-Allegretto-Piepenbrink type theorem. After that\, we present optimal 
 Hardy-weights for the p-Dirichlet integral. We explain part of the proof a
 fter recalling some characterizations of criticality. In the end\, we disc
 uss further extensions including my current work.\n\n\n\n\n\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:8th floor Faculty Lounge\, Amado Bldg

END:VEVENT
BEGIN:VEVENT

UID:591@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20251231T133000

DTEND;TZID=Asia/Jerusalem:20251231T143000

DTSTAMP:20251225T135301Z

URL:https://math.technion.ac.il/events/spectral-gnns-are-incomplete-on-gra
 phs-with-a-simple-spectrum/

SUMMARY:Spectral GNNs are Incomplete on Graphs with a Simple Spectrum
DESCRIPTION:Lecturer:Snir Hordan\n Location:Amado 8th Floor Lounge\n Spectr
 al features are widely incorporated within Graph Neural Networks (GNNs) to
  improve their expressive power\, or their ability to distinguish among no
 n-isomorphic graphs. One popular example is the usage of graph Laplacian e
 igenvectors for positional encoding in MPNNs and Graph Transformers. The e
 xpressive power of such Spectrally-enhanced GNNs (SGNNs) has recently rece
 ived growing attention\, yet current approaches only rely on combinatorial
  isomorphism measures to evaluate these spectral methods\, yielding limite
 d insight. We leverage a well-studied paradigm of classifying graphs by th
 eir largest eigenvalue multiplicity to introduce an expressivity hierarchy
  for SGNNs. We then prove that many SGNNs are incomplete even on graphs wi
 th distinct eigenvalues. To mitigate this deficiency\, we adapt rotation e
 quivariant neural networks to the graph spectra setting to propose a metho
 d to provably improve SGNNs' expressivity on simple spectrum graphs. We em
 pirically verify our theoretical claims via an image classification experi
 ment on the MNIST Superpixel dataset and eigenvector canonicalization on g
 raphs from ZINC.\n\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Amado 8th Floor Lounge

END:VEVENT
BEGIN:VEVENT

UID:608@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20260128T133000

DTEND;TZID=Asia/Jerusalem:20260128T143000

DTSTAMP:20260119T184138Z

URL:https://math.technion.ac.il/events/measure-estimates-coming-from-conve
 rgence-in-the-hausdorff-distance/

SUMMARY:Measure estimates coming from convergence in the Hausdorff distance
DESCRIPTION:Lecturer:Lior Tenenbaum\n Location:Amado 8th floor lounge\n We 
 examine the relationship between convergence in the Hausdorff distance and
  convergence of the associated measures. We introduce a method for estimat
 ing the measure of a compact set that is approximated\, in the Hausdorff d
 istance sense\, by a sequence of compact sets. This is achieved by conside
 ring suitable fattenings of the approximating sets and showing that their 
 measures converge.\nWe then review applications of this result to the stud
 y of operator spectra arising from sequences of periodic approximations\, 
 leading to the construction of spectral covers.\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Amado 8th floor lounge

END:VEVENT
BEGIN:VEVENT

UID:646@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20260520T133000

DTEND;TZID=Asia/Jerusalem:20260520T143000

DTSTAMP:20260510T083816Z

URL:https://math.technion.ac.il/events/zariski-pairs-in-low-degree-conic-l
 ine-arrangements/

SUMMARY:Zariski Pairs in Low-Degree Conic-Line Arrangements
DESCRIPTION:Lecturer:Gal Goren\n Location:\n Abstract:\nWe discuss recent r
 esults concerning the existence and non-existence of Zariski pairs in arra
 ngements consisting of one conic and a small number of lines in the comple
 x projective plane.\nThe talk presents combinatorial and topological metho
 ds for studying such arrangements\, with emphasis on realization spaces an
 d structural restrictions arising in low degrees. In addition\, we describ
 e a systematic approach to generating and analyzing candidate arrangements
  that may be applied more broadly in future investigations.\n 
CATEGORIES:Pizza Seminar,Seminars

END:VEVENT
BEGIN:VEVENT

UID:657@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20260603T133000

DTEND;TZID=Asia/Jerusalem:20260603T143000

DTSTAMP:20260529T124446Z

URL:https://math.technion.ac.il/events/on-spectral-graph-determination/

SUMMARY:On spectral graph determination
DESCRIPTION:Lecturer:Noam Krupnik\n Location:8th floor Lounge\, Amado\n The
  study of spectral graph determination is a fascinating area of research i
 n spectral graph theory and algebraic combinatorics. This field focuses on
  examining the spectral characterization of various classes of graphs\, de
 veloping methods to construct or distinguish cospectral nonisomorphic grap
 hs\, and analyzing the conditions under which a graph's spectrum uniquely 
 determines its structure. This seminar presents an overview of both classi
 cal and recent advancements in these topics\, along with newly obtained re
 sults.\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:8th floor Lounge\, Amado

END:VEVENT
BEGIN:VEVENT

UID:663@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20260617T133000

DTEND;TZID=Asia/Jerusalem:20260617T143000

DTSTAMP:20260614T111700Z

URL:https://math.technion.ac.il/events/algorithmically-adjusting-subgraph-
 counts-of-randomly-sampled-graphs/

SUMMARY:Algorithmically Adjusting Subgraph Counts of Randomly Sampled Graph
 s
DESCRIPTION:Lecturer:Hillel Raz\n Location:8th floor Lounge\n A result of J
 anson and Spencer (1992) establishes\, via a greedy probabilistic construc
 tion\, the existence of graphs whose 3-vertex subgraph counts match exactl
 y the expected counts in the Erd˝os–R´enyi random graph G(n\,p). In th
 is talk\, I will present a general algorithmic framework extending this co
 nstruction to any graphon bounded away from 0 and 1. Graphons arise as lim
 it objects of dense graphs and encode their subgraph densities. By extendi
 ng the original method—here referred to as the Janson–Spencer algorith
 m—we construct finite graphs whose 3-vertex subgraph counts agree exactl
 y with the averages prescribed by the random graph model induced by a give
 n graphon. I will then discuss further applications of this approach to ex
 tremal problems: when a graphon is close to optimizing certain subgraph co
 unts\, the algorithm produces quantitative degeneracy and structural rigid
 ity results. These results provide finite\, explicit analogues of variatio
 nal principles on graphons\, connecting algorithmic constructions with ana
 lytic extremal methods.\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:8th floor Lounge

END:VEVENT
BEGIN:VEVENT

UID:670@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20260715T133000

DTEND;TZID=Asia/Jerusalem:20260715T143000

DTSTAMP:20260709T085241Z

URL:https://math.technion.ac.il/events/rational-portraits-of-quadratic-pol
 ynomials/

SUMMARY:Rational Portraits of Quadratic Polynomials
DESCRIPTION:Lecturer:Adi Zimerman\n Location:Amado 8th Floor Lounge\n Arith
 metic dynamics studies arithmetic questions arising from the iteration of 
 maps.\nIn this expository talk\, I will introduce the subject by surveying
  some known results for the family\n\\[f_c(x)=x^2+c\,\\qquad c\\in\\mathbb
 {Q}.\\]\nThe guiding question will be: what finite rational orbit structur
 es can occur for these maps?\nI will begin with periodic and preperiodic p
 oints\, and explain how they define directed graphs whose isomorphism clas
 ses are called portraits. Along the way\, I will discuss Northcott's theor
 em\, the Uniform Boundedness Conjecture\, and the connection with rational
  points on algebraic curves.\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Amado 8th Floor Lounge

END:VEVENT
BEGIN:VEVENT

UID:671@math.technion.ac.il

DTSTART;TZID=Asia/Jerusalem:20260722T133000

DTEND;TZID=Asia/Jerusalem:20260722T143000

DTSTAMP:20260713T113309Z

URL:https://math.technion.ac.il/events/physics-informed-machine-learning-a
 -birds-eye-overview/

SUMMARY:Physics-informed Machine Learning: A Bird’s Eye Overview
DESCRIPTION:Lecturer:Ofek Aloni\n Location:Amado 8th floor lounge\n AI is u
 ndoubtedly impressive when applied to text and images. Can it work on phys
 ical systems\, governed by Partial Differential Equations (PDEs)? Many are
  interested in the answer to this question\, but it is not a trivial one t
 o unpack. What does it even mean to combine machine learning and PDEs? Wha
 t are the tasks that neural networks can accomplish in this context? In th
 is talk\, I aim to give a bird’s-eye overview of the subjects\, focusing
  less on fine architectural details and more on the overall approach. We w
 ill explore different paradigms for combining ML and PDEs\, highlight prom
 inent works\, and discuss known difficulties and structural limitations. P
 revious familiarity with machine learning is not assumed.\n 
CATEGORIES:Pizza Seminar,Seminars
LOCATION:Amado 8th floor lounge

END:VEVENT

BEGIN:VTIMEZONE

TZID:Asia/Jerusalem

X-LIC-LOCATION:Asia/Jerusalem

BEGIN:STANDARD

DTSTART:20231029T010000

TZOFFSETFROM:+0300

TZOFFSETTO:+0200

TZNAME:IST

END:STANDARD

BEGIN:DAYLIGHT

DTSTART:20240329T030000

TZOFFSETFROM:+0200

TZOFFSETTO:+0300

TZNAME:IDT

END:DAYLIGHT

BEGIN:STANDARD

DTSTART:20241027T010000

TZOFFSETFROM:+0300

TZOFFSETTO:+0200

TZNAME:IST

END:STANDARD

BEGIN:DAYLIGHT

DTSTART:20250328T030000

TZOFFSETFROM:+0200

TZOFFSETTO:+0300

TZNAME:IDT

END:DAYLIGHT

BEGIN:STANDARD

DTSTART:20251026T010000

TZOFFSETFROM:+0300

TZOFFSETTO:+0200

TZNAME:IST

END:STANDARD

BEGIN:DAYLIGHT

DTSTART:20260327T030000

TZOFFSETFROM:+0200

TZOFFSETTO:+0300

TZNAME:IDT

END:DAYLIGHT

END:VTIMEZONE
END:VCALENDAR