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:27@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20230420T143000 DTEND;TZID=Asia/Jerusalem:20230420T153000 DTSTAMP:20250109T093501Z URL:https://math.technion.ac.il/events/graduation-seminar-tom-yotam/ SUMMARY:MSc Graduation Seminar - Measurement Simplification in POMDP with Performance Guarantees DESCRIPTION:Lecturer:Tom Yotam\n Location:ZOOM\n MSc Graduation Seminar - M easurement Simplification in POMDP with Performance Guarantees\nAdvisor: A ssociate Professor Vadim Indelman\nAbstract:\nPOMDP planning is at the hea rt of any autonomous system acting with imperfect information. The cost of solving the POMDP planning problem is exponential in the action and obser vation spaces\, thus rendering it unfeasible for many online systems. We p ropose a novel approach to efficient decision making\, by simplifying the observation space. We formulate analytical bounds on the expected informa tion-theoretic reward\, for the most general belief distributions. These b ounds are then used to plan efficiently while keeping performance guarant ees. We propose a specific variant of these bounds for Gaussian beliefs a nd show performance improvement of at least a factor of 4.\n\n \;\n\n& nbsp\;\n\n \;\n https://technion.zoom.us/j/97808802863?pwd=aVRUZ3UvOGZ aajlFRnU2T3FiNnlxdz09 CATEGORIES:Graduation Seminars,Seminars LOCATION:ZOOM END:VEVENT BEGIN:VEVENT UID:71@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20230515T143000 DTEND;TZID=Asia/Jerusalem:20230515T153000 DTSTAMP:20250109T093504Z URL:https://math.technion.ac.il/events/m-sc-graduation-seminar-eneralizati on-of-shelah-and-spencer-0-1-laws-to-multi-parameter-random-simplicial-com plexes/ SUMMARY:M.Sc. graduation seminar: eneralization of Shelah and Spencer 0-1 L aws to Multi- Parameter Random Simplicial Complexes.  DESCRIPTION:Lecturer:עידן חן\n Location:אמאדו 814 \n תואר : מגיסטר\n מנחה : פרופ"ח רון רוזנטל\n כותרת\n Generalization of Shelah and Spencer 0-1 Laws to Multi - Parameter Random Simplicial Complexes\nאבסטרקט\nThe Erdős-Rényi model G(n\, p)\, i s a random graph on n vertices\, where each edge is added independently\nw ith probability p = p(n). Zero-one laws for random graphs and in particula r for G(n\, p) have\nbeen extensively studied since the appearance of rand om graph models. In particular\, two striking\nresults regarding the behav iour of first-order logic properties in the Erdős-Rényi model are:\n1. I n 1969 Glebski˘ı\, Kogan\, Liogon’ki˘ı\, Talanov and independently i n 1976 Fagin proved that for\np which is independent of n (fixed)\, every first order logic property of G(n\, p) is either true\nasymptotically almo st surely or false asymptotically almost surely.\n2. In 1988 Shelah and Sp encer extended the above zero-one law into the case where p = n−α for\n any irrational α.\nIn this talk we will discuss generalizations of such z ero-one laws to random simplicial complexes of\narbitrary dimension and sh ow that analogue statements hold.78/87\nThe talk is based on my master the sis under the supervision of 14on Rosenthal\n CATEGORIES:Graduation Seminars,Seminars LOCATION:אמאדו 814 END:VEVENT BEGIN:VEVENT UID:70@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20230521T013000 DTEND;TZID=Asia/Jerusalem:20230521T023000 DTSTAMP:20250109T093504Z URL:https://math.technion.ac.il/events/m-sc-graduation-seminar-the-bogomol ov-gieseker-inequality-for-surfaces-with-rational-double-points/ SUMMARY:M.Sc. Graduation Seminar - The Bogomolov-Gieseker Inequality for S urfaces with Rational Double Points DESCRIPTION:Lecturer:אלן סורני\n Location:אמאדו 814 \n סמי נר סיום מאסטר של אלן סורני\nמנחים ד"ר הווא רד נואר ופרופח דני נפטין\nThe Bogomolov-Gieseker Inequ ality for Surfaces with Rational Double Points  כותרת\nאבסטרק ט\nThe Bogomolov-Gieseker inequality for smooth projective surfaces in ch aracteristic zero is the inequality $\\mathrm{ch}_1\\left({\\mathcal{E}\\r ight)^2 - 2 \\mathrm{ch}_0\\left(\\mathcal{E}\\right) . \\mathrm{ch}_2\\le ft(\\mathcal{E}\\right) \\geq 0$\, where $\\mathcal{E}$ is a slope semista ble coherent sheaf.  The inequality has many applications including the b oundedness of the moduli space of semistable sheaves\, explicit restrictio n theorems for stable sheaves\, and the existence of Bridgeland stability conditions which have been applied to solve many classical problems in alg ebraic geometry.  In this talk we give an algebraic proof of the Bogomolo v-Gieseker inequality on projective surfaces with at worst rational double point singularities. Such singular points are of particular interest as t hey are the possible canonical singularities of surfaces\, i.e. those sing ularities arising in running the minimal model program on surfaces.\n CATEGORIES:Graduation Seminars,Seminars LOCATION:אמאדו 814 END:VEVENT BEGIN:VEVENT UID:74@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20230529T143000 DTEND;TZID=Asia/Jerusalem:20230529T153000 DTSTAMP:20250109T093505Z URL:https://math.technion.ac.il/events/on-block-rank-of-matrice-graduation -seminar/ SUMMARY:M.Sc. Graduation Seminar: On Blocky rank of matrices DESCRIPTION:Lecturer:Daniel Avraham \n Location:Amado 719\n  \;\n\nAdvi sor:  Prof. Amir Yehudayoff\n\nAbstract:\n\nIn circuit complexity theory we classify Boolean functions according to the size of the\n\nBoolean circ uits that computes them. We are going to talk about a new matrix rank call ed\n\nthe "Blocky rank" which was defined not long ago and show how we can achieve a lower\n\nbound on the size of 2-depth circuit that computes a f unction f by finding lower bound on\n\nthe Blocky rank. We will also discu ss about general properties of this rank and computes the\n\nrank for a Li near threshold function\, which is a basic operator in our circuits. The I nner\n\nproduct function was studied before in the context of circuit size and by using the blocky\n\nrank we improve the known result.\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 719 END:VEVENT BEGIN:VEVENT UID:78@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20230601T123000 DTEND;TZID=Asia/Jerusalem:20230601T133000 DTSTAMP:20250109T093526Z URL:https://math.technion.ac.il/events/minimally-ramified-dihedral-extensi ons-over-fqt-graduation-seminar/ SUMMARY:Minimally Ramified Dihedral Extensions Over Fq(T) - Graduation Semi nar DESCRIPTION:Lecturer:Tal Shahaf \n Location:Amado 814 \n טל שחף\nתו אר: מגיסטר\n MINIMALLY RAMIFIED DIHEDRAL EXTENSIONS OVER Fq(T)\n מנחים : פרופ' אמריטוס סון יעקב\, פרופ"ח נפט ין דני\nאבסטרקט מצורף\nתאריך ההרצאה: יום ח מישי\, 1 ביוני 2023 בשעה 13:00 \, בנין אמדו 814\n\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:92@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20230622T113000 DTEND;TZID=Asia/Jerusalem:20230622T123000 DTSTAMP:20250109T093529Z URL:https://math.technion.ac.il/events/dynamic-and-numeric-aspects-of-pois son-brackets-invariants-graduation-seminar/ SUMMARY:Dynamic and Numeric Aspects of Poisson Brackets Invariants - Gradua tion seminar DESCRIPTION:Lecturer:Itamar Rosenfeld Rauch\n Location:Amadao 719 \n  שם : איתמר רוזנפלד ראוך\nתואר : דוקטורט\nמנחה : ד"ר חנבסקי מיכאל\nמועד: 22/6\, באמאדו 719 בשע ה 11:30\n \;\n\nDynamic and Numeric Aspects of Poisson Brackets Invar iants\n\nAbstract:\n\nThe Poisson brackets of smooth functions\, {F\, G}\, measure the conservation of F along Hamiltonian trajectories of G. The $C ^0$-semicontinuity of the Poisson brackets was proven in 2010 by Entov and Polterovich\, a surprising fact considering they involve the first deriva tives of F\, and G. In this talk I will discuss this $C^0$-robustness phen omenon and show how certain variational problems involving the supremum no rm of the Poisson brackets give rise to dynamically flavored invariants. G iven time\, I will comment on a numeric experiment to calculate one such i nvariant.\n\n \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amadao 719 END:VEVENT BEGIN:VEVENT UID:106@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20230725T120000 DTEND;TZID=Asia/Jerusalem:20230725T130000 DTSTAMP:20250109T093530Z URL:https://math.technion.ac.il/events/analysis-of-stability-and-accuracy- of-permutation-invariant-embedding-schemes-graduation-seminar/ SUMMARY:Analysis of Stability and Accuracy of Permutation Invariant Embeddi ng Schemes - Graduation Seminar DESCRIPTION:Lecturer:Ravina Ravina \n Location:Amado 814\n Advisor: Nadav D ym\n\nAbstract is attached\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:110@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20230801T100000 DTEND;TZID=Asia/Jerusalem:20230801T110000 DTSTAMP:20250109T093531Z URL:https://math.technion.ac.il/events/computational-methods-for-harmonic- mappings-and-its-uniqueness-master-graduation-seminar/ SUMMARY:Computational Methods for Harmonic Mappings and its Uniqueness - Ma ster graduation seminar DESCRIPTION:Lecturer:Terry Wallace\n Location:ZOOM\n Advisor: Professor Eme ritus Bshouty Daoud\n\n \;\n\nTitle: Computational Methods for Harmoni c Mappings and its Uniqueness\n\n \;\n\nAbstract\; The well-known Rie mann Mapping Theorem (RMT) for analytic mappings states the existence\n\na nd uniqueness of conformal mappings between two simply connected domains. The existence of  RMT for\n\nharmonic mappings with specific dilatation h olds whereas  the uniqueness is wide open. Given a harmonic mapping\n\nbe tween the unit disk  and a polygonal domain\, we determine its uniqueness using a computational method.\n\n \;\n https://gtiit.zoom.us/j/996709 93599?pwd=Rml2WVRsNEFYOGNTc3o4NW1sRXM0UT09 CATEGORIES:Graduation Seminars,Seminars LOCATION:ZOOM END:VEVENT BEGIN:VEVENT UID:113@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20230928T140000 DTEND;TZID=Asia/Jerusalem:20230928T150000 DTSTAMP:20250109T093531Z URL:https://math.technion.ac.il/events/almost-universal-quadratic-forms-an d-special-cubic-fourfolds-msc-graduation-seminar/ SUMMARY:Almost-Universal Quadratic Forms and Special Cubic Fourfolds - MSc Graduation Seminar DESCRIPTION:Lecturer:Elad Gal\n Location:Amado 719\n The representability o f natural numbers by sums of squares is a beautiful and rich question in n umber theory with a long history.  It naturally lead to the question of r epresenting natural numbers by other positive definite quadratic forms and the famous recent 15 and 290 Theorems.  In this talk we begin by discuss ing some of this story with an aim to understanding what kinds of subsets of the natural numbers can be the image of a positive definite quadratic f orm.  We will the discuss the main ideas going into our main theorem\, wh ich in this language\, is a statement about how well\, or efficiently\, th e Hassett subset can be described as the image of a positive-definite quad ratic form\, namely that the minimal rank of a quadratic form supporting i t is four.  Here the Hassett subset is the set of natural numbers d large r than 8 and congruent to 0 or 2 modulo 6.  Our interest in this question for this particular subset is motivated by a question about moduli spaces of cubic fourfolds in algebraic geometry.  When rephrased in algebraic g eometry terms\, we will explain how our result about quadratic forms prove s that the intersection all the Hassett divisors C_d for d in (you guessed it!) the Hassett subset has dimension 16.  Time permitting\, we will exp lain why this interesting for other question in algebraic geometry.\n\nAdv isor: Dr. Howard Nuer\n\n \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 719 END:VEVENT BEGIN:VEVENT UID:114@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20231101T113000 DTEND;TZID=Asia/Jerusalem:20231101T123000 DTSTAMP:20250109T093531Z URL:https://math.technion.ac.il/events/%d7%91%d7%a0%d7%99%d7%95%d7%aa-%d7% 97%d7%93%d7%a9%d7%95%d7%aa-%d7%91%d7%aa%d7%95%d7%a8%d7%94-%d7%a1%d7%a4%d7% a7%d7%98%d7%a8%d7%9c%d7%99%d7%aa-%d7%a9%d7%9c-%d7%92%d7%a8%d7%a4%d7%99%d7% 9d-%d7%a1%d7%9e/ SUMMARY:בניות חדשות בתורה ספקטרלית של גרפים - סמינר סיום דוקטורט DESCRIPTION:Lecturer:סולימאן חמוד \n Location:אמאדו 719\n שם הסטודנט :סולימאן חמוד\nמנחה: פרופסור א בי ברמן\nתואר: דוקטורט\nכותרת ההרצאה: בניו ת חדשות בתורה ספקטרלית של גרפים\nתאריך הה רצאה: 1/11/23 בשעה 11:30 \, באמדו 719\nתקציר : לגרף קשורות מספר מטריצות – מטריצת השכנות\, הל פלסיאן\, הלפלסיאן ללא סימנים\, הלפלסיאן ה מנורמל\nאם גרפים רגולרים הם קוספקטרלים ב יחס לאחת המטריצות אז הן קוספקטרלים ביחס לכל הארבע. בהרצאה נתאר בניות של זוגות גרפ ים לא רגולרים\,\nלא איזומורפיים שהם קוספק טרלים ביחס לארבע המטריצות\n CATEGORIES:Graduation Seminars,Seminars LOCATION:אמאדו 719 END:VEVENT BEGIN:VEVENT UID:143@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240117T140000 DTEND;TZID=Asia/Jerusalem:20240117T150000 DTSTAMP:20250109T093607Z URL:https://math.technion.ac.il/events/formation-and-characterization-of-s ynthetic-rna-protein-granules/ SUMMARY:Formation and characterization of synthetic RNA-protein granules DESCRIPTION:Lecturer:נאור גרניק\n Location:אולם 100 בפקול טה לביוטכנולוגיה ומזון\n Liquid-solid transition\, als o known as gelation\, is a specific form of phase separation in which mole cules cross-link to form a highly interconnected compartment with solid – like dynamical properties. Here\, we utilize RNA hairpin coat-protein binding sites to form synthetic RNA based gel-like granules via liquid-sol id phase transition. We show both in-vitro and in-vivo that hairpin contai ning synthetic long non-coding RNA (slncRNA) molecules granulate into brig ht localized puncta. We further demonstrate that upon introduction of the coat-proteins\, less-condensed gel-like granules form with the RNA creatin g an outer shell with the proteins mostly present inside the granule. More over\, by tracking puncta fluorescence signals over time\, we detected add ition or shedding events of slncRNA-CP nucleoprotein complexes. Consequent ly\, our granules constitute a genetically encoded storage compartment for protein and RNA with a programmable controlled release profile that is de termined by the number of hairpins encoded into the RNA. Our findings have important implications for the potential regulatory role of naturally occ urring granules and for the broader biotechnology field.\nתואר: מגי סטר\nשם המנחה: רועי עמית\n \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:אולם 100 בפקולטה לביוטכנולוגיה ומזון END:VEVENT BEGIN:VEVENT UID:168@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240208T133000 DTEND;TZID=Asia/Jerusalem:20240208T143000 DTSTAMP:20250109T093609Z URL:https://math.technion.ac.il/events/specialization-of-galois-groups-and -related-low-genus-phenomena-graduation-seminar/ SUMMARY:Specialization of Galois groups and related low-genus phenomena - G raduation Seminar DESCRIPTION:Lecturer:Tali Monderer \n Location:Amado 814\n \n\n\n\n\n\nGive n an irreducible bivariate polynomial f(t\,x) with rational coefficients\, what groups H appear as the Galois group of f(t'\,x) for infinitely many rationals t'? A key step in the investigation of this question\, and many others relating to specialization and reducibility\, lies in determining t he subcoverings of genus 0 and 1 of the corresponding Galois cover of the projective line. We determine\, for several families of Galois covers of l arge degree\, the low genus subcovers\; and describe applications to the s pecialization problem described above and to the Davenport-Lewis-Schinzel problem regarding reducibility of curves given by the equation h(x)=g(y).& nbsp\;\n\nAdvisor: Prof. Danny Neftin\n\n\n\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:179@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240212T160000 DTEND;TZID=Asia/Jerusalem:20240212T170000 DTSTAMP:20250109T093655Z URL:https://math.technion.ac.il/events/approximation-of-diagonally-invaria nt-measure-by-tori-measures-graduation-seminar/ SUMMARY:Approximation of Diagonally Invariant Measure by Tori Measures - Gr aduation Seminar DESCRIPTION:Lecturer:Yuval Yifrach\n Location:Amado 815\n We consider the f amily of periodic measures for the full diagonal action on the space of un imodular lattices. This family is important and natural due to its tight r elation to class groups in number fields. We show that many natural famili es of measures on the space of lattices can be approximated using this fam ily (in the weak sense). E.g.\, in our work we show that for any 0<\;c\\ leq 1\, the measure cm_{X_n} can be approximated this way\, where m_{X_n} denotes the Haar probability measure on X_n. Moreover\, we show that non e rgodic measures can be approximated. Our proof is based on the equidistrib ution of Hecke neighbors and on constructions of special number fields. We will discuss the results\, alternative ways to attack the problem\, and o ur method of proof.\n\nThis talk is based on a joint work with Omri Solan. \n\nAdvisor: Prof. Uri Shapira\n https://technion.zoom.us/j/99968891639 CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 815 END:VEVENT BEGIN:VEVENT UID:180@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240215T143000 DTEND;TZID=Asia/Jerusalem:20240215T153000 DTSTAMP:20250109T093656Z URL:https://math.technion.ac.il/events/projective-bridgeland-semistable-mo duli-spaces-on-quotient-stacks-graduation-seminar/ SUMMARY:Projective Bridgeland Semistable Moduli Spaces on Quotient Stacks - Graduation Seminar DESCRIPTION:Lecturer:טל בן יהודה\n Location:אמדו 814\n Moduli spaces are fundamental objects of interest across mathematics and physics. These spaces parametrize isomorphism classes of algebro-geometric objects \, which come about frequently as solutions to classification problems. In algebraic geometry\, of special interest are moduli spaces of coherent sh eaves on smooth projective varieties. A fruitful approach to studying thes e moduli spaces is via Fourier-Mukai transforms on the bounded derived cat egory D^b(CohX)\, built as the category of complexes of coherent sheaves o n X\, up to quasi-isomorphism. But these autoequivalences do not always ta ke sheaves to sheaves.  Enter Bridgeland's stability conditions - these c onditions\, whose origins began in string theory\, allow us to apply autoe quivalences freely and use our intuition from classical stability. Under s uitable assumptions\, for each stability condition and each numerical clas s\, moduli spaces of stable objects in D^b(X) for an algebraic variety X\, exist as proper algebraic spaces. This formalism includes many previously studied moduli spaces such as moduli spaces of Giesker or slope-stable sh eaves.\n\n \;\n\nFor most applications of Bridgeland stability\, one n eeds projective coarse moduli spaces of Bridgeland semistable objects. One problematic aspect of Bridgeland stability is showing that the proper alg ebraic spaces above are in fact projective varieties. Many varieties come about as quotients of covering varieties by the action of some group G. We prove the following conjecture - Let X be a smooth projective variety\, a nd G a finite cyclic group acting on X. Assume X carries projective Bridge land semistable moduli spaces\, meaning for numerical class v and \\sigma \\in Stab(X) (a stability condition) the set M_\\sigma(v) of \\sigma-semis table objects of type v is such a projective moduli space\, then the quoti ent stack [X/G] has projective Bridgeland semistable moduli spaces as well . This is helpful to show projectivity in a range of cases\, as well as ma king a step towards finding a general construction of such moduli spaces.\ nתואר : מגיסטר\nמנחה : ד"ר נואר צבי יעקב\n CATEGORIES:Graduation Seminars,Seminars LOCATION:אמדו 814 END:VEVENT BEGIN:VEVENT UID:191@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240226T160000 DTEND;TZID=Asia/Jerusalem:20240226T170000 DTSTAMP:20250109T093657Z URL:https://math.technion.ac.il/events/covering-radii-in-positive-characte ristic-graduation-seminar/ SUMMARY:Covering Radii in Positive Characteristic - Graduation Seminar DESCRIPTION:Lecturer:נוי סופר אהרונוב\n Location:אמדו 919 \n A fascinating question in geometry of number pertains to the covering r adius of lattice with respect to an interesting function. For example\, gi ven a convex body C and a lattice L in R^d\, it is interesting to ask what is the infimal r ≥ 0 such that L + rC = R^d. Another interesting coveri ng radius is the multiplicative covering radius\, which connects to dynami cs due to its invariance under the diagonal group. It was conjectured by M inkowski that the multiplicative covering radius is bounded above by 2^{ -d} and that this upper bound is obtained only on AZ^d. In this talk I wil l discuss surprising results pertaining to covering radii in the positive characteristic setting and discover several surprising results. Some of m y results include explicitly connecting between the covering radii with re spect to convex bodies and successive minima and proving a positive charac teristic analogue of Minkowski’s function.\n \;\nשם : נוי סו פר אהרונוב\nתואר : דוקטורט\nמנחה : פרופ' או רי שפירא\n CATEGORIES:Graduation Seminars,Seminars LOCATION:אמדו 919 END:VEVENT BEGIN:VEVENT UID:195@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240228T130000 DTEND;TZID=Asia/Jerusalem:20240228T140000 DTSTAMP:20250109T093657Z URL:https://math.technion.ac.il/events/network-formation-for-learning-grad uation-seminar/ SUMMARY:Network Formation for Learning - Graduation Seminar DESCRIPTION:Lecturer:Lior Sasson\n Location:Room 527 Bloomfield Building\, הפקולטה למדעי הנתונים וההחלטות\n We study a net work formation interaction in which the formatted network serves the agent s to form beliefs about an unknown state via the DeGroot naive learning pr ocess. Consequently\, the value of the network captures the ability of the network to aggregate information. We focus on the notion of \\textit{stab le networks} in which agents do not want to create or erase any of their l inks.\nWe precisely characterize the costs for which a stable network exis ts. Whenever a stable network exists\, either the cycle network\, the line network\, or the empty network is stable. We further provide structural p roperties for every stable network: in every stable network\, the degree o f any two vertices differs by at most one. As a corollary we get that any  stable network aggregates information well and a price of anarchy upper bound is provided.\n\nAdvisor: Prof. Udi Yariv\n\n\n\n\n\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Room 527 Bloomfield Building\, הפקולטה למדעי הנתו נים וההחלטות END:VEVENT BEGIN:VEVENT UID:200@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240306T133000 DTEND;TZID=Asia/Jerusalem:20240306T143000 DTSTAMP:20250109T093658Z URL:https://math.technion.ac.il/events/many-valued-modal-logic-graduation- seminar/ SUMMARY:Many-Valued Modal Logic - Graduation Seminar DESCRIPTION:Lecturer:עמיר קרניאל \n Location:אמאדו 814 + ז ום \n Modal logic is a kind of logic used to represent statements about necessity and possibility. It is used in computer science to reason about concepts such as uncertainty and time-dependent properties\, for example i n formal verification and in knowledge representation.\n\n \;\n\nMany- valued logic is a logic in which there are more than two truth values. It is used\, for example\, to represent partial or inconsistent information i n databases and in information retrieval systems.\n\n \;\n\nWe combine the two concepts in a general and comprehensive way. Specifically\, given any finite ordered set of truth values and any set of connectives\, we de fine two main kinds of many-valued modal logics\, formulated in a certain syntax called Gentzen's sequent calculus\, and prove their soundness and s trong completeness with respect to certain kinds of Kripke semantics.\n\n& nbsp\;\n\nAdditionally\, we show results such as logic extensions\, finite model property\, strong decidability\, duality via negation and relation to intuitionistic logics.\n\n \;\nמנחה :פרופ' אמריטוס קמינסקי מיכאל \, מדעי המחשב\n https://technion.zoom.u s/j/4520047073 CATEGORIES:Graduation Seminars,Seminars LOCATION:אמאדו 814 + זום END:VEVENT BEGIN:VEVENT UID:220@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240331T143000 DTEND;TZID=Asia/Jerusalem:20240331T153000 DTSTAMP:20250109T093700Z URL:https://math.technion.ac.il/events/title-chaotic-dynamics-in-the-rossl er-system/ SUMMARY:Title - Chaotic dynamics in the Rössler system DESCRIPTION:Lecturer:ערן אגרא \n Location:אמדו 814 \n Originally introduced in 1974 by O.E. Rössler\, the Rössler system is one of the m ost famous examples of chaotic flows\, being generated by a stretch-and-fo ld mechanism. Despite being (arguably) the least non-linear flow one can t hink of\, the Rössler system is known to be rich in nonlinear phenomena - for example: spiral homoclinic bifurcations\, stability windows and peri od-doubling routes to chaos to name a few. In this talk we state and prove a topological criterion for the existence of complex dynamics for the Rö ssler system\, which include infinitely many periodic trajectories. Time permitting\, we will characterize the topology of these periodic trajector ies\, prove their persistence under perturbations - as well as discuss th eir possible bifurcations and how it all relates to the well-known Rössle r attractor. \n \;\nמנחה: ד"ר טלי פינסקי\n \n \n CATEGORIES:Graduation Seminars,Seminars LOCATION:אמדו 814 END:VEVENT BEGIN:VEVENT UID:224@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240403T143000 DTEND;TZID=Asia/Jerusalem:20240403T153000 DTSTAMP:20250109T093740Z URL:https://math.technion.ac.il/events/boolean-functions-on-some-permutati on-groups-graduation-seminar/ SUMMARY:Boolean functions on some permutation groups- Graduation Seminar DESCRIPTION:Lecturer:יהונתן שפיגלמן \n Location:אמאדו 814 \n Abstract Attached\nAdvisor - Prof. Yuval Filmus\n\n \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:אמאדו 814 END:VEVENT BEGIN:VEVENT UID:225@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240403T143000 DTEND;TZID=Asia/Jerusalem:20240403T153000 DTSTAMP:20250109T093740Z URL:https://math.technion.ac.il/events/boolean-functions-on-some-permutati on-groups-degree-1-graduation-seminar/ SUMMARY:Boolean functions on some permutation groups Degree 1 - Graduation Seminar DESCRIPTION:Lecturer:יהונתן שפיגלמן\n Location:אמאדו 814 \n Abstract  attached\n\nAdvisor: Prof. Yuval Filmus\n CATEGORIES:Graduation Seminars,Seminars LOCATION:אמאדו 814 END:VEVENT BEGIN:VEVENT UID:229@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240515T143000 DTEND;TZID=Asia/Jerusalem:20240515T153000 DTSTAMP:20250109T093741Z URL:https://math.technion.ac.il/events/topology-of-random-two-dimensional- posets-graduation-seminar/ SUMMARY:Topology of random two-dimensional posets - Graduation Seminar DESCRIPTION:Lecturer:עומר מויאל \n Location:814 אמאדו\n Rando m simplicial complexes are one generalization of random graphs. In this se minar we will consider the model of 'permutations complexes'\, a simplicia l complex obtained from a random permutations. More precisely\, let \\pi b e a permutation of length n. Our model is the order complex of the partial order induced by \\pi on the set [n].\nWe will discuss various topologica l properties of this complex\, including homological dimension and homotop y type. Our main result is that w.h.p. the complex is r-connected for r=lo g(n)/loglog(n) . We will also show that the complex contains an octahedral sphere of dimension c\\sqrt(n)\, and give an upper bound and a new lower bound on c.\n CATEGORIES:Graduation Seminars,Seminars LOCATION:814 אמאדו END:VEVENT BEGIN:VEVENT UID:236@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240520T123000 DTEND;TZID=Asia/Jerusalem:20240520T133000 DTSTAMP:20250109T093741Z URL:https://math.technion.ac.il/events/diophantine-approximation-formal-la urent-series-and-hankel-matrices-graduation-seminar/ SUMMARY:Diophantine approximation\, formal Laurent series and Hankel Matric es - Graduation Seminar DESCRIPTION:Lecturer:Matan Ivgi\n Location:Amado 814\n Diophantine approxim ation in function fields gives rise to many combinatorial questions. One i nteresting question is the computation of the Hausdorff dimension of the s et of badly approximable formal Laurent series. Those series are tightly c onnected to Hankel matrices with specific properties. I will talk about th is connection and how I used it in order to solve this question.\n\nAdviso r: Erez Nesharim\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:238@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240521T120000 DTEND;TZID=Asia/Jerusalem:20240521T130000 DTSTAMP:20250109T093741Z URL:https://math.technion.ac.il/events/connectedness-of-random-simplicial- complexes-based-on-steiner-systems-graduation-seminar/ SUMMARY:Connectedness of Random Simplicial Complexes Based on Steiner Syste ms - Graduation Seminar DESCRIPTION:Lecturer:Alexander Shleyfman\n Location:Amad0 719 \n The $\\mat hcal{I}(n\, k)$ is a generative model of random almost $k$-regular graphs\ , where graphs are constructed  from $k$ randomly permuted perfect matchi ngs on the vertex set $[n]$. We show that the likelihood of a graph $G$ dr awn from $ \\mathcal{I}(n\, k)$ being disconnected is bounded by $O(n^{-k+ 2})$.\n\nBased on this observation\, we establish a threshold property for hypergraph connectedness within almost $k$-regular $d$-dimensional comple xes\, as introduced by Abu-Fraiha (2016). Specifically\, these complexes a re almost surely hypergraph connected when $k >\; d+1$\, while the proba bility of disconnection decreases with $k$ for $k \\leq d$.\n\nAdditionall y\, we demonstrate that for random 2-dimensional simplicial complexes (the model for general $d$ was introduced by Lubotzky\, Luria\, and Rosenthal (2019))\, where the 1-cells are bounded by a degree of $k$\, the complex i s almost surely homologically connected over $\\mathbb{Z}_2$ when $k=371$. \n\nAdvisor: Prof. Roy Meshulam\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amad0 719 END:VEVENT BEGIN:VEVENT UID:243@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240606T113000 DTEND;TZID=Asia/Jerusalem:20240606T123000 DTSTAMP:20250109T093742Z URL:https://math.technion.ac.il/events/new-simple-lattices-in-products-of- davis-complexes/ SUMMARY:New simple lattices in products of Davis complexes DESCRIPTION:Lecturer:Michal Amir (Technion)\n Location:Amado 814\n Burger & amp\; Mozes constructed simple groups which act geometrically on products of regular trees. In this talk I will present new examples of simple group s which act geometrically on products of a regular tree and two-dimensiona l Davis complexes.\nJoint work with Nir Lazarovich.\n CATEGORIES:Geometry and Topology Seminar,Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:250@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240612T100000 DTEND;TZID=Asia/Jerusalem:20240612T110000 DTSTAMP:20250109T093743Z URL:https://math.technion.ac.il/events/geometric-properties-of-harmonic-an d-quasiregular-mappings-graduation-seminar/ SUMMARY:Geometric Properties of Harmonic and Quasiregular Mappings - Gradua tion Seminar DESCRIPTION:Lecturer:Jie Huang\n Location:ZOOM\n Harmonic and quasiregular mappings are the generalization of conformal mappings and analytic functio ns in the plane. It is natural to extend the theories of analytic function s and conformal mappings to harmonic and quasiregular cases. In this thesi s\, we consider questions of their geometry properties and boundary behavi or.\n\nFor the first part\, we study the univalency of linear combinations of two harmonic quasiregular mappings with fixed analytic functions which are $M$-linearly connected. In addition\, we consider the relation of bi- Lipschitz of the linear combinations and the fixed function.\n\nFor the se cond part\, we generalize the Lipschiz property of the analytic Bloch func tion under the pseudo-hyperbolic metric to consider the harmonic Bloch and harmonic Bloch-type cases.\n\nFor the third part\, we consider the bounda ry Schwarz lemma for harmonic mappings having zero of order $p$.\n\nFor th e fourth part\, we investigate Lindel\\"{o}f and Koebe type boundary behav ior results for bounded quasiregular mappings in $n$-dimensional Euclidean spaces. Furthermore\, the existence of non-tangential limits at a boundar y point is considered.\n\nFor the last part\, we use different methods to study the uniqueness of harmonic mappings obtained by the construction of Sheil-Small\, and give the proof of a special case.\n\n \;\n\n\n\nMain Advisor\nAssociate Professor Anti Hermanni Rasila\n\n\nAssociate Advisor\ nProfessor Emeritus Bshouty Daoud\n\n\n\n https://gtiit.zoom.us/j/98269133 489?pwd=xciDTCBDbGmZDjznIAoOSsaf8k0TmW.1 CATEGORIES:Graduation Seminars,Seminars LOCATION:ZOOM END:VEVENT BEGIN:VEVENT UID:251@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240618T113000 DTEND;TZID=Asia/Jerusalem:20240618T123000 DTSTAMP:20250109T093743Z URL:https://math.technion.ac.il/events/chemical-distance-for-the-level-set s-of-the-gaussian-free-field/ SUMMARY:Chemical Distance for the Level Sets of the Gaussian Free Field DESCRIPTION:Lecturer:Tal Peretz\n Location:\n Consider the Gaussian free fi e\\\n CATEGORIES:Graduation Seminars,Probability Seminar,Seminars END:VEVENT BEGIN:VEVENT UID:252@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240618T113000 DTEND;TZID=Asia/Jerusalem:20240618T123000 DTSTAMP:20250109T093743Z URL:https://math.technion.ac.il/events/chemical-distance-for-the-level-set s-of-the-gaussian-free-field-graduation-seminar/ SUMMARY:Chemical Distance for the Level Sets of the Gaussian Free Field - G raduation Seminar DESCRIPTION:Lecturer:Tal Peretz\n Location:Meyer building\, room 861\n Advi sor: Associate Prof. Ron Rosenthal \n CATEGORIES:Graduation Seminars,Probability Seminar,Seminars LOCATION:Meyer building\, room 861 END:VEVENT BEGIN:VEVENT UID:249@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240620T143000 DTEND;TZID=Asia/Jerusalem:20240620T153000 DTSTAMP:20250109T093744Z URL:https://math.technion.ac.il/events/symplectic-and-kahler-type-embeddin gs-of-ellipsoids-graduation-seminar/ SUMMARY:Symplectic and Kähler-type embeddings of ellipsoids-Graduation Sem inar DESCRIPTION:Lecturer:Mark Gudiev \n Location:ZOOM\n In their paper "Symplec tic packings and algebraic geometry"\, McDuff and Polterovich showed that the existence of a symplectic embedding of a disjoint union of balls into a symplectic manifold $M$ of the same dimension is equivalent to the exist ence of a symplectic form on the complex blow-up $\\tilde{M}$ of $M$ which lies in a certain cohomological class and satisfies a certain additional property.\n\n \;\n\nOne can consider symplectic embeddings which addit ionally respect some complex structure on $M$. A symplectic embedding is c alled Kähler-type if it is holomorphic with respect to some integrable co mplex structure compatible with the symplectic form. Recently Entov and Ve rbitsky studied properties of the space of Kähler-type embeddings and pro ved a similar criterion for the existence of such embeddings using techniq ues of complex geometry.\n\n \;\n\nIn my talk I will present generaliz ations of these results to the case of symplectic and Kähler-type embeddi ngs of disjoint unions of ellipsoids\, and will apply them to study such e mbeddings into specific target manifolds.\n\nAdvisor: Prof. Michael Entov\ n https://technion.zoom.us/j/99694784046 CATEGORIES:Geometry and Topology Seminar,Graduation Seminars,Seminars LOCATION:ZOOM END:VEVENT BEGIN:VEVENT UID:256@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240627T123000 DTEND;TZID=Asia/Jerusalem:20240627T133000 DTSTAMP:20250109T093745Z URL:https://math.technion.ac.il/events/determining-the-nef-cone-of-the-hil bert-scheme-of-n-points-on-a-bielliptic-surface-via-bridgeland-stability-g raduation-seminar/ SUMMARY:Determining the nef cone of the Hilbert scheme of n points on a bie lliptic surface via Bridgeland stability - Graduation Seminar DESCRIPTION:Lecturer:Elizaveta Nesterova\n Location:Amado 814 \n Since Brid geland introduced his definition of stability conditions in 2002\, they ha ve been used to solve various problems in algebraic geometry.  Any Bridge land stability condition gives us a moduli problem and associates to any C hern character a moduli space\, which for surfaces is known to be an algeb raic space.  For the Chern character of a Gieseker semi stable sheaf on a surface\, some special Bridgeland stability conditions (those in the so-c alled Gieseker chamber) give back the classical moduli space of semistabl e coherent sheaves constructed by Gieseker and Maruyama.  Varying the sta bility conditions allows us to study the relationships between various mod uli spaces of Bridgeland semi stable objects on surfaces.  For example\, one often obtains birational maps between moduli spaces using wall-crossi ng methods in the space of Bridgeland stability conditions\, in particular the natural nef divisor on the moduli space define by. A. Bayer and E. Ma crì.\n\nThus far\, these techniques have not been used to study moduli sp aces associated to bielliptic surfaces.\n\nIn this talk\, we discuss how u sing wall-crossing techniques along with some other insights allows us to determine the nef cone of the moduli space of stable sheaves of Chern clas s (1\, 0\, -n)\, which corresponds to the Hilbert scheme of n points.  Mo reover\, we determine the birational surgery that gives the first minimal model beyond the boundary of the nef cone.\n\nAdvisor: Dr. Howard Nuer\n\n  \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:284@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240717T120000 DTEND;TZID=Asia/Jerusalem:20240717T130000 DTSTAMP:20250109T093815Z URL:https://math.technion.ac.il/events/ctl-verification-and-synthesis-usin g-existential-horn-clauses/ SUMMARY:CTL* Verification and Synthesis using Existential Horn Clauses DESCRIPTION:Lecturer:Mishel Carelli\n Location:ZOOM\n This work proposes a novel approach for automatic verification and synthesis of infinite-state reactive programs with respect to CTL* specifications\, based on translati on to Existential Horn Clauses (EHCs).\n\nCTL* is a powerful temporal logi c\, which subsumes the temporal logics LTL and CTL\, both widely used in s pecification\, verification\, and synthesis of complex systems.\n\nEHCs wi th its solver E-HSF\, is an extension of Constrained Horn Clauses\, which includes existential quantification as well as the power of handling well- foundedness.\n\nWe develop the translation system Trans\, which\, given a verification problem consisting of a program P and a specification φ\, bu ilds a set of EHCs which is satisfiable iff P satisfies φ.\n\nWe also dev elop a synthesis algorithm that\, given a program with holes in conditions and assignments\, fills the holes so that the synthesized program satisfi es the given CTL* specification.\n\nWe prove that our verification and syn thesis algorithms are both sound and relative complete. Finally\, we prese nt case studies to demonstrate the applicability of our algorithms for CTL * verification and synthesis\n\n \;\n\nAdvisor: Prof. Orna Grimberg\n https://technion.zoom.us/j/97342052061?pwd=ehWd1mTlkvaV8yZfCuvfDk8xpf8Qwn. 1 CATEGORIES:Graduation Seminars,Seminars LOCATION:ZOOM END:VEVENT BEGIN:VEVENT UID:283@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240718T134500 DTEND;TZID=Asia/Jerusalem:20240718T144500 DTSTAMP:20250109T093815Z URL:https://math.technion.ac.il/events/homological-connections-between-gln qp-and-slnc/ SUMMARY:Homological connections between GLn(Qp) and sln(C) DESCRIPTION:Lecturer:Rida Saabna\n Location:Amado 814\n We will discuss the connections between the homological properties of the representation theo ry of the general linear group over a p-adic field and the representation theory of the complex semisimple Lie algebra sln(C). We use the Arakawa-Su zuki functors\, a family of exact functors from the BGG category O of sln( C) to the category of finite dimensional modules over the degenerate affin e Hecke algebra\, to extract new homological results in the setting of the general linear group from known results in the theory of the category O.\ n\nAdvisor: Dr. Maxim Gurevich\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:282@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240718T141500 DTEND;TZID=Asia/Jerusalem:20240718T151500 DTSTAMP:20250109T093815Z URL:https://math.technion.ac.il/events/highest-weight-category-for-represe ntations-of-borel-subalgebras/ SUMMARY:Highest weight category for representations of Borel subalgebras. DESCRIPTION:Lecturer:Lila Nechaev\n Location:Amado 814\n Highest weight cat egories are useful for studying the derived category of a nonsemisimple ab elian category. They were introduced after developments for the BGG catego ry O and modular representations of symmetric groups. I will recall and ad vertise this notion and show that certain natural representations of Borel subalgebras for classical Lie algebras and the Lie superalgebra osp(1|2n) admit a highest weight structure.\n\nAdvisor: Dr. Maxim Gurevich\n\n  \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:294@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240805T123000 DTEND;TZID=Asia/Jerusalem:20240805T133000 DTSTAMP:20250109T093817Z URL:https://math.technion.ac.il/events/irrationality-measure-functions/ SUMMARY:Irrationality measure functions DESCRIPTION:Lecturer:Viktoria Rudykh (Technion)\n Location:Amado 814\n For a real number x we define irrationality measure function as Ψ_x(t) = min_ {1≤q≤t} ||qx||\, where ||x|| is the distance to the nearest integer. K an and Moshchevitin proved that for any x and y with x±y∉Z the differen ce of two irrationality measure functions Ψ_x(t)-Ψ_y(t) changes its sign infinitely many times as t↑∞. Later\, Moshchevitin showed that there exists a constant C>\;0 such that |Ψ_x(t)-Ψ_y(t)|≥ C min{Ψ_x(t)\,Ψ _y(t)} for infinitely many t. It was also shown that C is optimal when bot h numbers are equal to the golden ratio up to a Möbius transformation wit h integer coefficients. We prove that this constant can be significantly i mproved when one of the numbers is not the golden ratio up to a Möbius tr ansformation with integer coefficients. This is a joint work with Nikita S hulga from La Trobe University. We will also give a generalisation of Kan- Moshchevitin Theorem for $n >\; 2$ functions\n CATEGORIES:Graduation Seminars,Groups, Dynamics and Related Topics,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:301@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240812T113000 DTEND;TZID=Asia/Jerusalem:20240812T123000 DTSTAMP:20250109T093817Z URL:https://math.technion.ac.il/events/the-isomorphism-problem-for-analyti c-discs-and-the-embedding-dimension-for-complete-pick-spaces-2/ SUMMARY:The isomorphism problem for analytic discs and the embedding dimens ion for complete Pick spaces DESCRIPTION:Lecturer:Mikhail Mironov\n Location:Amado 719\n The talk is dev oted to two related problems.\n\nThe isomorphism problem for analytic disc s:\nSuppose V is the unit disc D embedded in the d-dimensional unit ball B d and at- tached to the unit sphere. Consider the subspace HV of the Drury -Arveson space\, which consists of functions on V and its multiplier algeb ra MV = Mult(HV ). The isomorphism problem is the question whether V1 ∼= V2 is equivalent to MV1 ∼= MV2 . We discuss what is known for V without self-crossings on the boundary and consider what happens when there are s elf-crossings.\n\nThe embedding dimension for complete Pick spaces:\nA The orem of J. Agler and J. E. McCarthy states that any complete Pick space ca n be realized as HV \, for some V in Bd\, where d can be infinite. The sma llest such d is called the embedding dimension. Given a complete Pick spac e can we find its em- bedding dimension? Can we at least determine if it i s finite or infinite? We look into this problem for radial spaces on the u nit disc D\, prove a general result and provide answers for classes of suc h spaces\, e.g.\, the weighted Hardy spaces.\n\nAdvisor: Prof. Orr Shalit\ n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 719 END:VEVENT BEGIN:VEVENT UID:309@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240822T113000 DTEND;TZID=Asia/Jerusalem:20240822T123000 DTSTAMP:20250109T093818Z URL:https://math.technion.ac.il/events/arithmeticity-in-hyperbolic-3-manif olds-graduation-seminar/ SUMMARY:Arithmeticity in Hyperbolic 3-manifolds - Graduation Seminar DESCRIPTION:Lecturer:Yoav Sandner\n Location:Amado 919\n The talk will disc uss the definition and known examples of cusped arithmetic 3 manifolds\, a nd some methods of proving arithmeticity. Then\, we will discuss a new exa mple of an arithmetic 3-manifold\, that arises as a complement of closed g eodesics in the unit tangent bundle of a hyperbolic surface.\n\nAdvisor: D r. Tali Pinsky\n\n \;\n CATEGORIES:Geometry and Topology Seminar,Graduation Seminars,Seminars LOCATION:Amado 919 END:VEVENT BEGIN:VEVENT UID:306@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240825T130000 DTEND;TZID=Asia/Jerusalem:20240825T140000 DTSTAMP:20250109T093818Z URL:https://math.technion.ac.il/events/majorization-in-quantum-information -theory-graduation-seminar/ SUMMARY:Majorization in Quantum Information Theory - Graduation Seminar DESCRIPTION:Lecturer:Guy Shemesh \n Location:zoom\n Majorization is a well- studied partial order in information theory and matrix analysis\, known fo r its versatility and broad applications. In recent years\, it has become increasingly significant in quantum information theory as well. This talk will explore generalizations of this partial order\, specifically to joint probability distributions and classical channels. We will also discuss ho w these concepts extend to the quantum realm\, leading to profound results . In particular\, we will present our recent findings on the inherent nega tivity of quantum channel entropy and offer new insights into the relation ship between quantum channels and bipartite correlated systems.\n\nAdvisor : Prof. Gilad Gour\n https://technion.zoom.us/j/6414831815 CATEGORIES:Graduation Seminars,Seminars LOCATION:zoom END:VEVENT BEGIN:VEVENT UID:311@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240909T140000 DTEND;TZID=Asia/Jerusalem:20240909T150000 DTSTAMP:20250109T093819Z URL:https://math.technion.ac.il/events/pieclam-a-universal-graph-autoencod er-based-on-overlapping-inclusive-and-exclusive-communities-graduation-sem inar/ SUMMARY:PieClam: A Universal Graph Autoencoder Based on Overlapping Inclusi ve and Exclusive Communities- Graduation Seminar DESCRIPTION:Lecturer:Daniel Zilberg \n Location:Amado 814 \n In this talk w e introduce PieClam\, a new way to analyze and understand complex graphs b y grouping together nodes of similar connectivity in communities\, where c ommunity membership is continuous and there are overlaps between different communities. Unlike previous methods\, which only consider communities wi th strong inclusive connectivity\, we introduce the concept of exclusive c ommunities which indicate strong disconnection between nodes. By incorpora ting exclusive communities in our model\, we prove that PieClam can approx imate any graph with a constant number of communities that depends only on the required precision. This property is not satisfied if one only uses i nclusive communities\, as is done in traditional methods.\nExperiments sho w strong performance approximating synthetic graphs and the model is compe titive with state of the art models in identifying anomalous nodes within graphs.\n\nAdvisor: Dr. Ron Levie\n\n \;\n\n \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:312@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20240926T140000 DTEND;TZID=Asia/Jerusalem:20240926T150000 DTSTAMP:20250109T093819Z URL:https://math.technion.ac.il/events/fixed-and-periodic-points-of-the-in tersection-body-operator/ SUMMARY:Fixed and Periodic Points of the Intersection Body Operator- Gradua tion Seminar DESCRIPTION:Lecturer:שחר שבלמן\n Location:Amado 617\n  \;\n\nTh e intersection body IK of a star-body K in Rn was introduced by E.\nLutwak following the work of H. Busemann\, and plays a central role in the dual\ nBrunn-Minkowski theory. We show that when n ≥ 3\, I2K = cK iff K is a c entered\nellipsoid\, and hence IK = cK iff K is a centered Euclidean ball\ , answering\nlong-standing questions by Lutwak\, Gardner\, and Fish–Naza rov–Ryabogin–Zvavitch.\nTo this end\, we recast the iterated intersect ion body equation as an Euler-\nLagrange equation for a certain volume fun ctional under radial perturbations\,\nderive new formulas for the volume o f IK\, and introduce a continuous version\nof Steiner symmetrization for L ipschitz star-bodies\, which yields a useful radial\nperturbation exactly when n ≥ 3.\n\n \;\n\nמנחים : פרופ'  מילמן עמנוא ל ופרופ' יהודיוף אמיר\n https://technion.zoom.us/j/993942 05638 CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 617 END:VEVENT BEGIN:VEVENT UID:300@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20241222T010000 DTEND;TZID=Asia/Jerusalem:20241222T020000 DTSTAMP:20250109T093841Z URL:https://math.technion.ac.il/events/the-isomorphism-problem-for-analyti c-discs-and-the-embedding-dimension-for-complete-pick-spaces/ SUMMARY:The isomorphism problem for analytic discs and the embedding dimens ion for complete Pick spaces DESCRIPTION:Lecturer:\n Location:\n \n CATEGORIES:Graduation Seminars,Seminars END:VEVENT BEGIN:VEVENT UID:375@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250115T123000 DTEND;TZID=Asia/Jerusalem:20250115T133000 DTSTAMP:20250109T092953Z URL:https://math.technion.ac.il/events/mixing-time-for-powers-of-random-el ements/ SUMMARY:Uniform L-infinity mixing time for powers of random elements of com pact Lie groups DESCRIPTION:Lecturer:Saar Bader (Technion)\n Location:Amado 814\n Eric Rain s proved surprising results about the distribution of Xp where X is a Haar -distributed random element of a compact Lie group and p is a natural numb er. For example\, when X is a random unitary matrix of size n\, the eigenv alues of Xp are distributed like the eigenvalues of p independent random u nitary matrices of sizes ≈ n/p. We use these results to prove bounds on the Fourier coefficients of the distribution of Xp. As an application\, we prove a dimension-independent mixing result. Namely\, we show that for ev ery p there is some natural t\, such that the product of t independent ran dom p-powers in every compact connected Lie group is approximately uniform (measured in the L∞-distance).\n CATEGORIES:Graduation Seminars,Groups, Dynamics and Related Topics,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:388@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250115T140000 DTEND;TZID=Asia/Jerusalem:20250115T150000 DTSTAMP:20250113T061558Z URL:https://math.technion.ac.il/events/the-next-generation-cayleynet/ SUMMARY:The Next Generation CayleyNet DESCRIPTION:Lecturer:Yuanchen Zhou \n Location:Amado 8th floor - Meetings r oom \n Graph Neural Networks (GNNs) extend deep learning techniques to non -Euclidean domains\, designed specifically to process node\, edge\, and st ructural information in graph-structured data. Spectral Graph Neural Netwo rks (Spectral GNNs) leverage the spectral decomposition of the graph Lapla cian to extract both global and local features in the frequency domain. Bu ilding upon the foundational CayleyNet framework\, we propose the Next Gen eration CayleyNet. Our model introduces the second spectral zoom parameter a； the original spectral zoom parameter h determines the extent of spec tral magnification\, controlling the resolution of the target frequency ba nd\, while the newly introduced a defines the focal point within the spect rum. Through the synergistic use of these parameters\, the model enables m ulti-scale feature extraction and enhances its capability for localized sp ectral analysis. Additionally\, we explore alternative numerical implement ations of the Cayley shift operator\, including the Lanczos method\, which facilitates the storage of eigen decomposition results. This capability i s particularly advantageous for large-scale graphs\, as it allows efficien t reuse of spectral information during filtering.\n\nAdvisor: Dr. Ron Levi e\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 8th floor - Meetings room END:VEVENT BEGIN:VEVENT UID:398@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250213T100000 DTEND;TZID=Asia/Jerusalem:20250213T110000 DTSTAMP:20250206T110757Z URL:https://math.technion.ac.il/events/list-online-classification/ SUMMARY:List online classification DESCRIPTION:Lecturer:Iska Tsubari\n Location:Amado 719\n We study multiclas s online prediction where the learner can predict using a list of multiple labels (as opposed to just one label in the traditional setting). We char acterize learnability in this model using the b-ary Littlestone dimension . This dimension is a variation of the classical Littlestone dimension wit h the difference that binary mistake trees are replaced with (k+1)-ary mi stake trees\, where k is the number of labels in the list. In the agnost ic setting\, we explore different scenarios depending on whether the compa rator class consists of single-labeled or multi-labeled functions and its tradeoff with the size of the lists the algorithm uses. We find that it is possible to achieve negative regret in some cases and provide a complete characterization of when this is possible. As part of our work\, we adapt classical algorithms such as Littlestone's SOA and Rosenblatt's Perceptron to predict using lists of labels. We also establish combinatorial results for list-learnable classes\, including an list online version of the Saue r-Shelah-Perles Lemma. We state our results within the framework of patter n classes -- a generalization of hypothesis classes which can represent ad aptive hypotheses (i.e. functions with memory)\, \nand model data-dependen t assumptions such as linear classification with margin\nAssociate prof. S hay Moran :Advisor\n\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 719 END:VEVENT BEGIN:VEVENT UID:399@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250217T130000 DTEND;TZID=Asia/Jerusalem:20250217T140000 DTSTAMP:20250216T075229Z URL:https://math.technion.ac.il/events/generalization-expressivity-and-uni versality-of-graph-neural-networks-on-attributed-graphs/ SUMMARY:Generalization\, Expressivity\, and Universality of Graph Neural Ne tworks on Attributed Graphs DESCRIPTION:Lecturer:Levi Rauchwerger\n Location:Amado 814 \n We analyze th e universality and generalization of graph neural networks (GNNs) on attri buted graphs\, i.e.\, with node attributes. To this end\, we propose pseud ometrics over the space of all attributed graphs that describe the fine-gr ained expressivity of GNNs. Namely\, GNNs are both Lipschitz continuous wi th respect to our pseudometrics and can separate attributed graphs that ar e distant in the metric. Moreover\, we prove that the space of all attribu ted graphs is relatively compact with respect to our metrics. Based on the se properties\, we prove a universal approximation theorem for GNNs and ge neralization bounds for GNNs on any data distribution of attributed graphs . The proposed metrics compute the similarity between the structures of at tributed  graphs via a hierarchical optimal transport between computation trees. Our work extends and unites previous approaches which either deriv ed theory only for graphs with no attributes\, derived compact metrics und er which GNNs are continuous but without separation power\, or derived met rics under which GNNs are continuous and separate points but the space of graphs is not relatively compact\, which prevents universal approximation and generalization analysis.\n\nAdvisor: Dr. Ron Levie\, Prof. Stefanie Je gelka\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:397@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250304T140000 DTEND;TZID=Asia/Jerusalem:20250304T150000 DTSTAMP:20250204T092252Z URL:https://math.technion.ac.il/events/landscapes-evolutionary-dynamics-on -degenerate-flat-landscapes/ SUMMARY:Landscapes Evolutionary Dynamics on Degenerate Flat Landscapes DESCRIPTION:Lecturer:Razi Fachareldeen\n Location: NBRL seminar room (Fisch bach 430) \, ECE faculty\n Recent experimental studies have revealed surpr ising properties of biological fitness landscapes\, characterized by highl y connected\, degenerate manifolds of high-fitness states rather than isol ated peaks separated by fitness valleys. These findings challenge traditio nal theoretical frameworks and bear striking similarities to the loss land scapes encountered in deep learning\, where stochastic gradient descent (S GD) effectively navigates complex\, high-dimensional spaces and exhibits i mplicit regularization towards flat minima. Here\, we investigate these pa rallels by comparing different optimization strategies on a simplified lan dscape with a flat\, degenerate optimal manifold. We analyze the dynamics of SGD\, Natural Evolutionary Strategy (NES)\, and population-based evolut ionary algorithms with mutation and selection. Our results demonstrate tha t evolutionary dynamics\, like SGD\, displays implicit regularization by p referentially exploring flat regions in degenerate high-fitness landscapes . This finding suggests fundamental principles underlying optimization in both artificial and biological systems\, with important implications for u nderstanding evolutionary robustness\, biological degeneracy\, and the rol e of high dimensionality in facilitating adaptive processes. Our comparati ve analysis\nbridges the gap between machine learning optimization and evo lutionary dynamics\, offering insights into how different systems navigate complex fitness landscapes.\nAdvisor : Prof Naama Brenner\n CATEGORIES:Graduation Seminars,Seminars LOCATION: NBRL seminar room (Fischbach 430) \, ECE faculty END:VEVENT BEGIN:VEVENT UID:400@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250312T133000 DTEND;TZID=Asia/Jerusalem:20250312T143000 DTSTAMP:20250306T080504Z URL:https://math.technion.ac.il/events/deformations-of-reproducing-kernel- hilbert-spaces-on-homogeneous-varieties/ SUMMARY:Deformations of reproducing kernel Hilbert spaces on homogeneous va rieties DESCRIPTION:Lecturer:Yasin Watted\n Location:Amado 619 and zoom\n We study the relationships between a subvariety of the open unit ball in the comple x d-dimensional space C^d\, the reproducing kernel Hilbert space (RKHS) ob tained by restricting the Drury-Arveson space to the variety\, and its mul tiplier algebra.\nDavidson\, Ramsey\, and Shalit showed that given two sub varieties\, one is the image of the other under an automorphism of the bal l if and only if the RKHSs corresponding to the varieties are isometricall y isomorphic as RKHSs\, and this holds if and only if their multiplier alg ebras are isometrically isomorphic as multiplier algebras.\nWe demonstrate that whenever two such RKHSs are close to being isometrically isomorphic\ , their multiplier algebras are close to being isometrically isomorphic as well. In this case\, the underlying varieties are close to being automorp hically equivalent. For homogeneous varieties satisfying some additional c onditions\, we show that if one variety is close to being the image of the other under a unitary\, then the RKHSs are close to being isometrically i somorphic as RKHSs.\n https://us02web.zoom.us/j/89193473512 CATEGORIES:Graduation Seminars,Noncommutative Analysis Seminar,Seminars LOCATION:Amado 619 and zoom END:VEVENT BEGIN:VEVENT UID:404@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250312T143000 DTEND;TZID=Asia/Jerusalem:20250312T152000 DTSTAMP:20250303T162208Z URL:https://math.technion.ac.il/events/roy-deutch/ SUMMARY:Roy Deutch (Technion) — Topological Patterns in Trivalent Trees DESCRIPTION:Lecturer:Roy Deutch\n Location:814 Amado\n A trivalent tree is an undirected tree where the degree of every internal vertex is three. We consider "topological subtrees''\, which are the trivalent trees induced f rom a subset of k out of the n leaves\, by taking the minimal subtree that spans them and suppressing any vertex of degree two. These subtrees appea r in several applications and algorithmic problems\, such as in Phylogenet ics. Specifically\, we consider the "subtree density'' which is the normal ized number of copies of a given subtree with k leaves in a trivalent tree with n leaves.\n\n\n\nThe talk will discuss extremal questions\, such as what is the maximum possible density of a fixed subtree asymptotically as n tends to infinity\, as well as probabilistic questions on subtree densit ies in large random trivalent trees. We introduce a new framework to discu ss the above problems\, a limit object for trivalent trees\, called treeon .\n\n\n\nAdvisor: Chaim Even-Zohar\n CATEGORIES:Combinatorics Seminar,Graduation Seminars,Seminars LOCATION:814 Amado END:VEVENT BEGIN:VEVENT UID:410@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250325T120000 DTEND;TZID=Asia/Jerusalem:20250325T130000 DTSTAMP:20250323T062412Z URL:https://math.technion.ac.il/events/deep-learning-for-data-driven-analy sis-of-retinal-microvasculature-in-major-ophthalmic-and-systemic-diseases/ SUMMARY:Deep Learning for Data-Driven Analysis of Retinal Microvasculature in Major Ophthalmic and Systemic Diseases DESCRIPTION:Lecturer:Jonathan Fhima\n Location:Faculty of Biomedical Engine ering main auditorium.\n Cardiovascular disease (CVD) remains one of the l eading causes of mortality worldwide. Early detection and prevention of CV D are crucial for improving patient outcomes and reducing healthcare costs . Since the early 20th century\, researchers have identified retinal vascu lar abnormalities as potential biomarkers for CVD. The retinal vasculature can be non-invasively assessed using digital fundus images (DFIs)\, which are easily acquired with fundus cameras. This approach enables efficient analysis of retinal abnormalities\, positioning the eye as a window into v ascular health.\n\nRecent advancements in deep learning have provided powe rful tools to automate and standardize retinal measurements\, offering unp recedented opportunities to analyze large-scale DFI databases and study co rrelations between ophthalmic as well as systemic health diseases and reti nal vasculature.\n\nThis doctoral research focuses on four key computer vi sion-based pillars relevant to the analysis of retinal microvasculature in large DFI datasets:1) Development of an open-source vasculature biomarker computation toolbox\; 2) Deep learning-based retinal vessel segmentation\ ; 3) Enhancement of retinal vessel segmentation out-of-distribution genera lization using generative AI\; 4) Investigation of vasculature variation w ithin a large glaucomatous cohort.\n\nAs part of the first pillar\, we rev iewed the scientific literature and identified retinal microvascular bioma rkers which were shown to be associated with CVD endpoints. This resulted in the development of an open-source\, automated\, and reproducible Python toolbox computing 16 vasculature biomarkers based on blood vessel segment ations. In particular\, we introduce new algorithmic methods to estimate t ortuosity and branching angles.\n\nThe second pillar explored the developm ent of deep learning algorithm for the automated segmentation of blood ves sel from DFIs in order to provide automated and reproducible input for ret inal microvascular biomarkers extraction. We developed and annotated the L euven-Haifa dataset\, comprising 240 DFIs with ground truth blood vessel s egmentations. Our deep learning model\, LUNet\, achieved a DICE score of 8 3.3\, significantly outperforming previously deep learning models and achi eving performance comparable to a human medical graduate annotator. Howeve r\, we observed limited generalization capability\, with performance dropp ing to an average DICE score of 77.0 when evaluated on external datasets.\ n\nThe third pillar addressed the challenge of generalization in medical i mage segmentation. We proposed Retinal Layout Aware Diffusion (RLAD)\, a n ovel conditional diffusion model that generates new images while preservin g similar vascular structures. RLAD was used to generate additional traini ng data\, leading to increased generalization performance. Additionally\, we collected and published a novel composite dataset from diverse sources\ , totaling 586 DFIs with ground truth blood vessel segmentation. With our newly introduced model\, the average DICE score on external datasets impro ved to 80.7. Furthermore\, our model exhibited robust capability in segmen ting out-of-distribution retinal fundus images such as those captured usin g portable devices\, low-quality imaging systems\, or ultra-wide fields of view—achieving a DICE score of 72.5 compared to 61.1 for the best bench mark.\n\nThe fourth pillar leveraged the previously developed tools to con duct a large-scale blood vessel analysis study\, examining blood vessel va riations within a glaucomatous cohort versus a healthy control group. In t otal\, 32\,000 images were analyzed\, providing robust insights into retin al vascular differences between the two groups. In particular\, the analys is revealed significant independent similarities in retinal vascular geome try alterations associated with both advanced age and glaucoma. These find ings suggest a potential mechanism of accelerated vascular aging in patien ts with glaucoma.\n\nThis thesis presents important advancements in the an alysis of retinal microvasculature by developing robust and automated comp utational tools and methodologies. Overall\, this work highlights the tran sformative potential of deep learning in retinal microvasculature analysis \, offering clinicians and researchers powerful tools for vascular health assessment\, enhancing segmentation generalization\, and enabling large-sc ale studies with direct implications for translational medical research.\n \nSupervised by Associate Prof. Joachim A. Behar and Assistant Prof. Moti Freiman\n\nZoom link: https://technion.zoom.us/j/92105308309\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Faculty of Biomedical Engineering main auditorium. END:VEVENT BEGIN:VEVENT UID:411@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250401T133000 DTEND;TZID=Asia/Jerusalem:20250401T143000 DTSTAMP:20250327T061753Z URL:https://math.technion.ac.il/events/dynamical-and-spectral-defects-in-a pproximations-of-substitution-systems/ SUMMARY:Dynamical and spectral defects in approximations of substitution sy stems DESCRIPTION:Lecturer:Lior Tenenbaum\n Location:Amado 814\n abstract is atta ched as a file\, as well as a zoom link.\n\nzoom passcode: 081307\n https: //technion.zoom.us/j/94515734619?pwd=u2tRcV2OHCIdcwR9S3k1Mv5dkHaK8X.1 CATEGORIES:Graduation Seminars,PDE and Applied Mathematics,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:444@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250507T133000 DTEND;TZID=Asia/Jerusalem:20250507T143000 DTSTAMP:20250427T154530Z URL:https://math.technion.ac.il/events/the-library-of-integer-relations-an d-constants/ SUMMARY:The Library of Integer Relations and Constants DESCRIPTION:Lecturer:Itay Beit-Halachmi\n Location:Faculty Lounge\, 8th flo or\, Amado \n In this talk\, we present recent developments in experimenta l mathematics within the Ramanujan Machine project\, specializing in autom ated conjecture generation in number theory\, in particular involving cont inued fractions. Specifically\, we present recent conjectures found\, incl uding a generalization of a famous result by Ramanujan\, and present the s earch algorithm employed in finding them. The search algorithm employs a n ew heuristic for the likelihood of a conjecture to be true\, based on avai lable numerical data\, and this heuristic will be explored in the talk. W e will also present the convergence model used when evaluating continued f ractions\, and the recent efforts in making these findings and algorithms open to the public.\nAdvisor: Prof. Ido Kaminer\n\n \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Faculty Lounge\, 8th floor\, Amado END:VEVENT BEGIN:VEVENT UID:474@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250625T140000 DTEND;TZID=Asia/Jerusalem:20250625T150000 DTSTAMP:20250618T102717Z URL:https://math.technion.ac.il/events/structure-and-flexibility-in-multi- task-neural-activity/ SUMMARY:Structure and Flexibility in Multi-Task Neural Activity DESCRIPTION:Lecturer:Elia Turner \n Location:Zoom / Fishbach 430 \n In thi s seminar\, the representation and differentiation of multiple tasks in ne ural systems will be examined\, drawing on both theoretical models and exp erimental data. The presentation will begin with a brief overview of previ ous work on recurrent neural networks and structural representations of co mputation\, followed by recent analyses of population calcium imaging data . The focus is on two complementary themes: the relationship between anato mical neurons and functional network structure\, and the temporal dynamics of trial-to-trial activity across tasks. Through a range of geometric\, s tatistical\, and structure-aware analyses\, the investigation explores the extent to which neural activity patterns repeat\, generalize\, or reorgan ize in response to task context. This ongoing work seeks to uncover invari ant substructures and context-specific modulations that support flexible    computation in the brain\n \;\nAdvisor : Prof.  Omri Barak\n http s://technion.zoom.us/j/94309093376 CATEGORIES:Graduation Seminars,Seminars LOCATION:Zoom / Fishbach 430 END:VEVENT BEGIN:VEVENT UID:481@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250707T133000 DTEND;TZID=Asia/Jerusalem:20250707T143000 DTSTAMP:20250702T075217Z URL:https://math.technion.ac.il/events/iwahori-spherical-whittaker-functio ns/ SUMMARY:Iwahori Spherical Whittaker Functions DESCRIPTION:Lecturer:Markos Karameris \n Location:zoom\n Advisor: Prof. Mos he Baruch\n\n \;\n\nAbstract is attached\n https://technion.zoom.us/j/ 95541453620 CATEGORIES:Graduation Seminars,Seminars LOCATION:zoom END:VEVENT BEGIN:VEVENT UID:485@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250716T143000 DTEND;TZID=Asia/Jerusalem:20250716T153000 DTSTAMP:20250713T062344Z URL:https://math.technion.ac.il/events/probabilistic-construction-of-propo rtional-edge-colorings/ SUMMARY:Probabilistic Construction of Proportional Edge Colorings DESCRIPTION:Lecturer:\n Location:Amado 817\n The abstract is attached\n\nAd visor: Dr. Chaim Zohar\n\n \;\n\n \;\n CATEGORIES:Combinatorics Seminar,Graduation Seminars,Seminars LOCATION:Amado 817 END:VEVENT BEGIN:VEVENT UID:486@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250716T143000 DTEND;TZID=Asia/Jerusalem:20250716T152000 DTSTAMP:20250713T164841Z URL:https://math.technion.ac.il/events/hillel-raz/ SUMMARY:Hillel Raz (Technion) -- Probabilistic Construction of Proportional Edge Colorings DESCRIPTION:Lecturer:Hillel Raz\n Location:814 Amado\n A recurring theme in the study of various combinatorial structures and their applications is l ooking at the frequencies of small substructures occurring in them. A clas sical example of such a quantity is #H\, the number of copies of H that oc cur as an induced subgraph in the random graph G(n\,p)\, where each two of the n vertices are connected by an edge independently with probability p. It was discovered by Janson (1995) that the distribution of #H in G(n\,p) has variance Θ(n^(2|H|-2)) and coverages to a normal distribution under proper normalization\, apart from some special degenerate cases. In these degenerate cases\, all subgraphs of size three occur in H exactly in propo rtion to their average frequencies in G(n\, p). The question of existence of such proportional graphs is nontrivial. Janson and Spencer (1992) showe d that proportional graphs exist for any rational p and all sufficiently l arge n satisfying some modulo conditions.\n\n\n\nIn this talk\, We extend the notion of proportionality to edge-colorings of the complete graph with any number of colors\, rather than two. We give a probabilistic construct ion of proportional edge-colorings with respect to random models where eve ry edge is independently assigned a random color according to some rationa l probability vector\, extending the result on graphs by Janson and Spence r. The extension both contains new ideas related to many colors\, and prov ides new elements streamlining the existing r=2 proof. The idea of this co nstruction is algorithmic\, and we find an explicit minimal example of an 81-vertex proportional 3-coloring via a computer search which follows a si milar approach.\n\n\n\nMSc seminar\;  Advisor: Chaim Even-Zohar\n CATEGORIES:Combinatorics Seminar,Graduation Seminars,Seminars LOCATION:814 Amado END:VEVENT BEGIN:VEVENT UID:495@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250907T143000 DTEND;TZID=Asia/Jerusalem:20250907T153000 DTSTAMP:20250902T054847Z URL:https://math.technion.ac.il/events/using-smoothing-functions-to-obtain -guarantees-on-the-tightness-of-global-solutions-attained-by-algorithms-fo r-non-convex-optimization-2/ SUMMARY:Using Smoothing Functions to Obtain Guarantees on the Tightness of Global solutions Attained by Algorithms for Non-Convex Optimization DESCRIPTION:Lecturer:Chen Zakaim\n Location:Amado 814\n In this talk\, we w ill discuss the problem of maximizing a convex function – a problem know n to be NP-Hard.\nWhen the objective function and the constraints are twic e differentiable\, there exists a known algorithm that solves the problem. \n\nThe novelty of my thesis is in developing an approach that also works when the twice-differentiability assumption does not hold — for example\ , in the case of a function that is the sum of convex functions.\nNon-smoo thness is addressed by approximating the function from above and below wit h particular smooth functions.\n\nFurthermore\, we show that the method ca n be extended to functions that are not necessarily twice differentiable\, and even to problems that are not convex\, by representing them as a diff erence of two convex functions (DC programming).\n\nAdvisor: Prof. Aharon Ben-Tal\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:497@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20250915T123000 DTEND;TZID=Asia/Jerusalem:20250915T133000 DTSTAMP:20250908T163658Z URL:https://math.technion.ac.il/events/on-the-bound-of-the-dimension-of-gl obal-sections-of-sheaves-on-k3-surfaces/ SUMMARY:On the bound of the dimension of global sections of sheaves on K3 s urfaces DESCRIPTION:Lecturer:Abed Elhamed Darawshi (Technion)\n Location:Technion\, Amado building\, room 814 \n Inspired by work done for the case of the pr ojective plane and using the theory of stable and semistable sheaves\, we prove the existence of a bound on the dimension of the global sections on K3 surfaces and as a corollary we prove the emptiness of the Brill-Noether loci\, B^r\, under some condition on r.\n CATEGORIES:Algebra Seminar,Graduation Seminars,Seminars LOCATION:Technion\, Amado building\, room 814 END:VEVENT BEGIN:VEVENT UID:503@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20251019T113000 DTEND;TZID=Asia/Jerusalem:20251019T123000 DTSTAMP:20251015T085100Z URL:https://math.technion.ac.il/events/brunn-minkowski-inequality-in-the-f irst-heisenberg-group/ SUMMARY:Brunn Minkowski Inequality in the First Heisenberg Group DESCRIPTION:Lecturer:Ira Isakovich \n Location:Amado 617 \n Seminar abstrac t\n Associate Prof. Liran Rotem - Advisor\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 617 END:VEVENT BEGIN:VEVENT UID:519@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20251026T130000 DTEND;TZID=Asia/Jerusalem:20251026T140000 DTSTAMP:20251022T064041Z URL:https://math.technion.ac.il/events/on-the-structure-of-statistical-lea rning-problems/ SUMMARY:On the structure of statistical learning problems DESCRIPTION:Lecturer:Daniel Carmon\n Location:Amado 617 \n Statistical lear ning theory aims to understand when and why learning from random observati ons is possible. Classical theory explains learnability using uniform conv ergence arguments\, which apply whenever the problem has a finite\, suitab ly defined dimension. While this picture is satisfactory in textbook setup s\, it has considerable gaps both in theory and in practice.\nWe resolve t wo such theoretical gaps in our work\, showing that arguments beyond the u niform convergence paradigm are needed to understand the learnability phen omenon. Our first contribution is to prove a tight upper bound for the sam ple complexity of empirical risk minimizers when the learning problem is c onvex\, a well-studied model in the literature. Our second contribution pr ovides a correct characterization of multiclass learnability: (i) we prove that a dimensionality notion by Daniely-Shalev-Swartz is indeed correct f or this setup\, and (ii) use a recently developed topological construction by Januszkiewicz and Świątkowski to supply a counterexample\, proving t he insufficiency of several widely conjectured dimensionality notions. Our third contribution is to analyze graphs inspired by these topological con structions\, and show that they exhibit nontrivial guarantees as small-set expanders\, a structure of ongoing interest in computational complexity t heory.\n\nAdvisor: Prof. Amir Yehudayoff\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 617 END:VEVENT BEGIN:VEVENT UID:499@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20251027T140000 DTEND;TZID=Asia/Jerusalem:20251027T150000 DTSTAMP:20251015T055712Z URL:https://math.technion.ac.il/events/short-range-oversquashing/ SUMMARY:Short-Range Oversquashing DESCRIPTION:Lecturer:Yakov Mishayev\n Location:Amado 814\n Message Passing Neural Networks (MPNNs) are widely used for learning on\n\ngraphs\, but th eir ability to process long-range information is limited by the\n\nphenome non of oversquashing. This limitation has led some researchers to\n\nadvoc ate Graph Transformers as a better alternative\, whereas others suggest th at\n\nit can be mitigated within the MPNN framework\, using virtual nodes or other\n\nrewiring techniques.\n\nIn this work\, we demonstrate that ove rsquashing is not limited to long-range\n\ntasks\, but can also arise in s hort-range problems. This observation allows us\n\nto disentangle two dist inct mechanisms underlying oversquashing: (1) the bot-\n\ntleneck phenomen on\, which can arise even in low-range settings\, and (2) the\n\nvanishing gradient phenomenon\, which is closely associated with long-range\n\ntask s.\n\nWe further show that the short-range bottleneck effect is not captur ed by existing\n\nexplanations for oversquashing\, and that adding virtual nodes does not resolve it.\n\nIn contrast\, transformers do succeed in su ch tasks\, positioning them as the more\n\ncompelling solution to oversqua shing\, compared to specialized MPNNs.\n\n \;\n\nAdvisor: Dr. Nadav Dy m\n\n \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:529@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20251112T130000 DTEND;TZID=Asia/Jerusalem:20251112T140000 DTSTAMP:20251111T111645Z URL:https://math.technion.ac.il/events/understanding-signal-propagation-in -gnns-via-observables/ SUMMARY:Understanding Signal Propagation in GNNs Via Observables DESCRIPTION:Lecturer:Eden Nagar \n Location:Amad0 619 \n Graph neural netwo rks often diffuse information rather than routing it to specific targets\, leading to oversmoothing and oversquashing. This seminar introduces an ob servable based framework inspired by quantum mechanics to directly measure and control signal routing in graphs. We define a signal routing measure via feature location observables\, prove why standard spectral GNNs with r eal valued signals cannot move signal centers\, and propose the Schröding er GNN: a unitary\, complex-modulated architecture that induces directiona l momentum while preserving energy and norms.\nAdvisor: Dr. Ron Levie\n \ n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amad0 619 END:VEVENT BEGIN:VEVENT UID:538@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20251202T113000 DTEND;TZID=Asia/Jerusalem:20251202T123000 DTSTAMP:20251109T101315Z URL:https://math.technion.ac.il/events/mean-field-theory-of-the-h02l-model -on-the-complete-graph/ SUMMARY:Mean field theory of the H^(0|2l) model on the complete graph DESCRIPTION:Lecturer:Evyatar Sharoni \n Location:Mayer 861\n In this talk\, we present a method for calculating the partition function of the H^{0|2l } sigma model on the complete graph K_N in the limit N \\to \\infty. We be gin with a brief introduction to spin models on the complete graph\, follo wed by low-dimensional examples of the model for l = 1\, 2. We then introd uce the Berezin integral and explain how the partition function can be rep resented in this formalism. After that\, we will describe the techniques u sed to study the model in different temperature regimes: supercritical\, s ubcritical\, and at the critical temperature. Finally\, we will show that this model undergoes a continuous (second-order) phase transition and disc uss potential directions for future research.\n\nAdvisor: Nicholas Crawfor d\n\n \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Mayer 861 END:VEVENT BEGIN:VEVENT UID:569@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20251207T113000 DTEND;TZID=Asia/Jerusalem:20251207T123000 DTSTAMP:20251127T111547Z URL:https://math.technion.ac.il/events/the-domain-of-rsd-characterization- by-efficiency-symmetry-and-strategy-proofness/ SUMMARY:The Domain of RSD Characterization by Efficiency\, Symmetry\, and S trategy-Proofness DESCRIPTION:Lecturer:Maor Ben-Zaquen\n Location:Bloomfield 424\n Given a se t of n individuals with strict preferences over m indivisible objects\, th e Random Serial Dictatorship (RSD) mechanism is a method for allocating ob jects to individuals in a way that is efficient\, fair\, and incentive-com patible. A random order of individuals is first drawn\, and each individua l\, following this order\, selects their most preferred available object. The procedure continues until either all objects have been assigned or all individuals have received an object.\n\nRSD is widely recognized for its application in fair allocation problems involving indivisible goods\, such as school placements and housing assignments. Despite its extensive use\, a comprehensive axiomatic characterization has remained incomplete. For t he balanced case n=m=3\, Bogomolnaia and Moulin have shown that RSD is uni quely characterized by Ex-Post Efficiency\, Equal Treatment of Equals\, an d Strategy-Proofness. The possibility of extending this characterization t o larger markets had been a long-standing open question\, which Basteck an d Ehlers recently answered in the negative for all markets with n\,m>\;= 5.\n\nThis work completes the picture by identifying exactly for which pai rs (n\,m) these three axioms uniquely characterize the RSD mechanism and f or which pairs they admit multiple mechanisms. In the latter cases\, we co nstruct explicit alternatives satisfying the axioms and examine whether au gmenting the set of axioms could rule out these alternatives.\n\nAdvisor: Prof. Ron Holzman\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Bloomfield 424 END:VEVENT BEGIN:VEVENT UID:595@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260113T123000 DTEND;TZID=Asia/Jerusalem:20260113T133000 DTSTAMP:20260105T082419Z URL:https://math.technion.ac.il/events/bi-lipschitz-neural-representation- of-continuous-anti-symmetric-functions/ SUMMARY:Bi-Lipschitz Neural Representation of Continuous Anti-Symmetric Fun ctions DESCRIPTION:Lecturer:Matan Mizrachi \n Location:Amado 232\n Motivated by ap plications in simulating quantum many-body systems\, we propose a new univ ersal ansatz construction framework\, along with a new universal ansatz\, for approximating antisymmetric functions\, while taking a different appro ach to any proposed ansatz. Each of these approaches possesses advantages over previous alternative ansatzs\; the first approach utilizes a bi-Lipsc hitz embedding with respect to a naturally defined metric\, followed by a highly modular framework for constructing an anti-symmetrizing projection\ , which could further generalizes the bi-Lipschitz ansatz we construct pri orly. As a result\, we can obtain quantitative approximations for Lipschit z continuous antisymmetric functions. Moreover\, we provide preliminary ex perimental evidence of the improved performance of these ansatzes for lear ning antisymmetric functions.\n\n \;\n\nAdvisor: Dr. Nadav Dym\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 232 END:VEVENT BEGIN:VEVENT UID:605@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260118T160000 DTEND;TZID=Asia/Jerusalem:20260118T170000 DTSTAMP:20260115T122145Z URL:https://math.technion.ac.il/events/decoupling-theorems-via-chi-squared -divergences/ SUMMARY:Decoupling Theorems via Chi-Squared Divergences DESCRIPTION:Lecturer:Cherut Shriki\n Location:Amado 814 \n We introduce a b road family of quantum Chi-Squared divergences and use it to prove a decou pling theorem. Additionally\, we demonstrate an operational application of this theorem by deriving a bound on entanglement distillation.\n\nAdvisor : Prof. Gilad Gour\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:509@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260121T143000 DTEND;TZID=Asia/Jerusalem:20260121T152000 DTSTAMP:20260119T080550Z URL:https://math.technion.ac.il/events/noam-feinstein/ SUMMARY:Noam Feinstein (Technion) -- Improved Constructions for Ramsey Mult iplicities DESCRIPTION:Lecturer:Noam Feinstein \n Location:814 Amado\n The Ramsey mult iplicity c(t) is the limit as n tends to infinity of the smallest possible number of monochromatic t-cliques in a red/blue edge-coloring of the comp lete graph Kn\, normalized by (n choose t). Disproving a conjecture by Erd ős (1962)\, Thomason (1989) showed that c(4) is smaller than 1/32\, the v alue obtained from a random graph G(n\,1/2)\, but the exact value remains unknown. A recent work by Parczyk et al. (2024) has used local search heur istics on Cayley graphs\, and with considerable computational effort has g iven the so-far best known upper bound on c(4)\, and also on c(5). Introdu cing new methods and ideas\, we provide randomized constructions that impr ove these bounds\, showing c(4) <\; 0.030139 and c(5) <\; 0.001652. Ou r constructions are more structured\, symmetric\, and human-friendly than the previous ones\, paving the way for potential further progress on this longstanding problem and related questions.\n\nMSc advisor: Chaim Even Zoh ar\n\n \;\n\n \;\n CATEGORIES:Combinatorics Seminar,Graduation Seminars,Seminars LOCATION:814 Amado END:VEVENT BEGIN:VEVENT UID:600@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260122T113000 DTEND;TZID=Asia/Jerusalem:20260122T123000 DTSTAMP:20260108T153226Z URL:https://math.technion.ac.il/events/a-unified-framework-for-knot-invari ants-using-dimer-models-and-spin-structures/ SUMMARY:A Unified Framework for Knot Invariants using Dimer Models and Spin Structures DESCRIPTION:Lecturer:Lee-Tohar Schlagman-Holzer\n Location:Amado 919\n The dimer model\, which is the study of perfect matchings on graphs\, is ubiqu itous in mathematical physics\, exhibiting deep connections to algebraic g eometry\, statistical mechanics and quantum computation. In this talk\, we first survey this landscape and then apply this rich theory to construct a unified framework for knot polynomials.\n\nFocusing on the Alexander and Jones polynomials\, we show that the computational distinction between th em manifests in the topology of the underlying graph. We conclude by demon strating how spin structures can be used to derive explicit determinantal formulas for these invariants\, offering a geometric perspective on their structure.\n CATEGORIES:Geometry and Topology Seminar,Graduation Seminars,Seminars LOCATION:Amado 919 END:VEVENT BEGIN:VEVENT UID:601@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260122T113000 DTEND;TZID=Asia/Jerusalem:20260122T123000 DTSTAMP:20260111T070507Z URL:https://math.technion.ac.il/events/a-unified-framework-for-knot-invari ants-using-dimer-models-and-spin-structures-2/ SUMMARY:A Unified Framework for Knot Invariants using Dimer Models and Spin Structures DESCRIPTION:Lecturer:Lee-Tohar Schlagman-Holzer\n Location:Amado 919\n The dimer model\, which is the study of perfect matchings on graphs\, is ubiqu itous in mathematical physics\, exhibiting deep connections to algebraic g eometry\, statistical mechanics and quantum computation. In this talk\, we first survey this landscape and then apply this rich theory to construct a unified framework for knot polynomials.\n\nFocusing on the Alexander and Jones polynomials\, we show that the computational distinction between th em manifests in the topology of the underlying graph. We conclude by demon strating how spin structures can be used to derive explicit determinantal formulas for these invariants\, offering a geometric perspective on their structure.\n\nAdvisor: Prof. Michael Polyak\n\n \;\n\n \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 919 END:VEVENT BEGIN:VEVENT UID:590@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260122T133000 DTEND;TZID=Asia/Jerusalem:20260122T143000 DTSTAMP:20251224T084807Z URL:https://math.technion.ac.il/events/instabilities-in-nanofluid-layers/ SUMMARY:Instabilities in nanofluid layers DESCRIPTION:Lecturer:Raj Gandhi\n Location:Lady Davis Building\, Auditorium 250\n Advisers: Professor Alexander Oron and Professor Alexander Nepomnya shchy\nAbstract is attached\n\nSeminar-abstract-Raj-Gandhi-220126\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Lady Davis Building\, Auditorium 250 END:VEVENT BEGIN:VEVENT UID:611@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260126T140000 DTEND;TZID=Asia/Jerusalem:20260126T150000 DTSTAMP:20260125T091401Z URL:https://math.technion.ac.il/events/the-correlation-between-germline-va riants-and-mutational-signature-activity/ SUMMARY:The Correlation Between Germline Variants and Mutational Signature Activity DESCRIPTION:Lecturer:Alon Ravid\n Location:Biotechnology and food eng. buil ding room 300 \n Investigating the interplay between common germline varia tion and somatic mutational processes is key to understanding cancer etiol ogy. To this end\, we sought to discover germline variants that regulate t he activity of these signatures\, designating them Signature Quantitative Trait Loci (SigQTL). Because individual common variants are expected to ha ve modest effects on mutational processes\, large cohorts are required to detect such associations. While current panel sequencing datasets have a s ufficient sample size\, they also have little information per-sample\, lim iting our ability to identify the originating processes of the somatic mut ations.  We introduce GroupSig\, a method that enables inferring the acti vity of mutational signatures across samples by stratifying them by genoty pes. We apply GroupSig to ~35\,000 tumor samples sequenced using targeted panels. We identified 11 SigQTLs\, of which 5 were validated in an indepen dent cohort. Our findings demonstrate that common germline variation contr ibutes to inter-individual differences in the activity of mutational proce sses. Furthermore\, GroupSig provides a robust framework to systematically analyze features associated with mutational signature activity using pane l sequencing data.\n\nAdvisor: Dr. Yosef Marvuka\n\n \;\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Biotechnology and food eng. building room 300 END:VEVENT BEGIN:VEVENT UID:621@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260326T110000 DTEND;TZID=Asia/Jerusalem:20260326T120000 DTSTAMP:20260322T125511Z URL:https://math.technion.ac.il/events/investigating-the-impact-of-immune- boosting-on-epidemiological-outcomes-and-control/ SUMMARY:Investigating the Impact of Immune Boosting on Epidemiological Outc omes and Control DESCRIPTION:Lecturer:Zohar Rom \n Location:zoom\n Mathematical models are e ssential for shaping vaccination strategies\, but traditional SIR framewor ks often oversimplify vaccine-induced immunity as a static value. In reali ty\, an individual's immune state is dynamically shaped by their unique hi story of pathogen exposures. Crucially\, silent exposures to a pathogen ca n lead to "immune boosting\," reinforcing immunity without causing symptom atic infection. Because a primed immune system responds to lower antigen d oses\, even these sub-clinical exposures trigger this effect. While the bi ological mechanisms of immune boosting are well-documented\, and recent p ertussis studies highlight its significance\, its broader epidemiological consequences remain largely unexplored. Therefore\, this work focuses on e valuating the population-level impact of immune boosting on overall vaccin e effectiveness.\n\nIn this work\, we employ analytical and numerical meth ods to explore the impact of immune boosting on population-level vaccine e ffectiveness (VE). Our results demonstrate that immune boosting significan tly alters epidemic outcomes\, revealing dynamics that diverge from classi cal expectations. We find that in regimes with weak or no boosting\, VE in creases with vaccine coverage due to standard indirect protection. However \, we identify a critical threshold where VE remains constant regardless o f coverage. Most notably\, under strong boosting conditions\, a paradoxica l crossover occurs where increased vaccine coverage actually reduces vacci ne effectiveness. Furthermore\, under high transmission rates\, population -level VE becomes entirely independent of coverage. We elucidate these cou nterintuitive findings by disentangling the direct and indirect effects of vaccination and utilizing an approximation model that isolates the role o f multiple exposures in maintaining vaccine protection.\n\nAdvisor: Prof. Nir Gavish\n https://technion.zoom.us/j/96572097402 CATEGORIES:Graduation Seminars,Seminars LOCATION:zoom END:VEVENT BEGIN:VEVENT UID:622@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260330T133000 DTEND;TZID=Asia/Jerusalem:20260330T143000 DTSTAMP:20260326T171852Z URL:https://math.technion.ac.il/events/mullins-nonlinear-grooving-solution s/ SUMMARY:Mullins’ nonlinear grooving solutions DESCRIPTION:Lecturer:Rawan Tarabeh\n Location:zoom\n The problem of thermal grooving was first proposed by Mullins in 1957. Mullins\nconsidered the m orphological evolution of thin solid surfaces\, namely solid films\,\nand focused primarily on the exterior surface motion with surface diffusion as the\ndominant mass transport process. By assuming a small slope approxima tion\, the\nproblem can be reduced to a linear surface diffusion problem. Mullins showed\nthat there exist self-similar solutions for the linearized problem. In the present\nstudy\, we prove the existence and uniqueness of a self-similar solution for the\noriginal nonlinear Mullins’ problem fo r sufficiently small values of the contact\nangle β. We do so by studying a reduced linear ODE system\, which allows us\nto understand the asymptot ic behavior of the solutions for the corresponding\nlinear homogeneous ope rator\, and then we prove existence of a unique solution\nto the nonlinear problem in closed form by iterations in an appropriate Banach\nspace.\nAd visor: Prof. Amy Novick-Cohen\n\n \;\n\n \;\n https://technion.zoo m.us/j/98140816947 CATEGORIES:Graduation Seminars,PDE and Applied Mathematics,Seminars LOCATION:zoom END:VEVENT BEGIN:VEVENT UID:626@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260415T133000 DTEND;TZID=Asia/Jerusalem:20260415T143000 DTSTAMP:20260331T113542Z URL:https://math.technion.ac.il/events/collective-variable-guided-engineer ing-of-the-free-energy-surface-of-a-small-peptide/ SUMMARY:Collective Variable-Guided Engineering of the Free-Energy Surface o f a Small Peptide DESCRIPTION:Lecturer:\n Location:\n Engineering the free-energy surfaces (F ES) of proteins and peptides is central to controlling conformational ense mbles and their responses to perturbations. However\, predicting how chemi cal modifications such as point mutations reshape the FES and shift confor mational equilibria remains challenging\, particularly in data-scarce sett ings. Building on the Collective Variables for Free Energy Surface Tailori ng (CV-FEST) framework\, we develop a computational approach that leverage s short\, unbiased molecular dynamics trajectories to guide mutation analy sis. Using the ten-residue β - hairpin CLN025 and a systematic library of its single-point mutants\, we apply Harmonic Linear Discriminant Analysis (HLDA) to extract collective variables from the conformational data. We f ind that the HLDA eigenvector learned solely from short wild-type trajecto ries provides residue-level insight into the propensity of mutations at sp ecific positions to thermodynamically stabilize or destabilize the folded state. Extending this analysis\, we show that shifts in the leading HLDA e igenvalue across mutants\, a measure of changes in separability between th e conformational ensembles along the HLDA coordinate\, correlate strongly with mutation-induced changes in the free-energy difference between states \, as reflected in melting temperatures. Benchmarked against Replica Excha nge Molecular Dynamics simulations\, these findings suggest a promising an d computationally affordable route toward guiding the engineering of biomo lecular free-energy landscapes.\nAdvisor: Prof. Dan Mendels\nDepartment of Chemical Engineering\, Technion-Israel Institute for Technology\n https:/ /technion.zoom.us/j/92278627599 CATEGORIES:Graduation Seminars,Seminars END:VEVENT BEGIN:VEVENT UID:623@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260415T143000 DTEND;TZID=Asia/Jerusalem:20260415T152000 DTSTAMP:20260413T193623Z URL:https://math.technion.ac.il/events/dmitrii-kolupaev/ SUMMARY:Dmitrii Kolupaev (Technion) -- Patterns in Random Chord Diagrams (Z OOM) DESCRIPTION:Lecturer:Dmitrii Kolupaev\n Location:https://technion.zoom.us/j /96651491256\n A chord diagram is a perfect matching on 2n points arranged on a circle\, equivalently a partition of {1\,...\,2n} into n two-element chords. Suppose a chord diagram of size n is chosen uniformly at random f rom the (2n-1)!! possibilities. Any subset of k chords induces one of (2k- 1)!! possible patterns\, and we study the joint distribution of the number of occurrences of each pattern for large n.\n\n\n\nWe show that this vect or of pattern counts exhibits diverse scaling behaviors with n in differen t directions\, and we characterize the corresponding subspaces of differen t orders of magnitude\, using tools from the representation theory of the symmetric group and algebras of words. To leading order\, the distribution of pattern counts is multivariate normal and supported on a k(2k-3)-dimen sional subspace. We explicitly describe and diagonalize its covariance mat rix for every k. We also relate this spectral decomposition to the spectru m of a dynamical process on k-chord diagrams in which\, at each step\, one endpoint of a chord is relocated to a uniformly random position.\n\n\n\nM Sc advisor: Chaim Even-Zohar\n https://technion.zoom.us/j/96651491256 CATEGORIES:Combinatorics Seminar,Graduation Seminars,Seminars LOCATION:https://technion.zoom.us/j/96651491256 END:VEVENT BEGIN:VEVENT UID:619@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260415T153000 DTEND;TZID=Asia/Jerusalem:20260415T162000 DTSTAMP:20260326T212134Z URL:https://math.technion.ac.il/events/noam-krupnik/ SUMMARY:Noam Krupnik (Technion) -- On Spectral Graph Determination and Tran sitivity of Gilbert Graphs DESCRIPTION:Lecturer:Noam Krupnik \n Location:\n The study of spectral grap h determination is a central and fascinating topic in spectral graph theor y and algebraic combinatorics.\nThis area investigates the spectral charac terization of various classes of graphs\, develops methods for constructin g and distinguishing cospectral nonisomorphic graphs\, and analyzes the co nditions under which the spectrum of a graph uniquely determines its struc ture.\nIn the first part of the seminar\, we present both classical result s and recent advances in spectral graph determination.\n\n\n\n\nThe study of graph symmetries and different notions of transitivity is also of funda mental interest in algebraic graph theory. In the second part of the talk\ , we examine transitivity properties of Gilbert graphs and their complemen ts\, and discuss the main ideas underlying these results.\n\n\n\n\n\n\n\nM Sc advisors: Avi Berman\, Igal Sason\n\n\n https://technion.zoom.us/j/2158 319819 CATEGORIES:Combinatorics Seminar,Graduation Seminars,Seminars END:VEVENT BEGIN:VEVENT UID:661@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260604T113000 DTEND;TZID=Asia/Jerusalem:20260604T123000 DTSTAMP:20260531T084848Z URL:https://math.technion.ac.il/events/geometric-construction-of-knot-and- link-invariants/ SUMMARY:Geometric construction of knot and link invariants DESCRIPTION:Lecturer:Polina Zakorko\n Location:Amado 919\n We introduce geo metric formulas for several low degree knot and link invariants\, expressi ng\nthem as signed counts of certain quadrisecants\, i.e.\, lines meeting the link in four points.\n\nWe start by describing a simple unified constr uction using maps of configuration spaces and\nelementary intersection the ory. By building a compactification modeled on the Fulton–MacPherson\nco nstruction\, we interpret these invariants directly as certain intersectio n numbers.\n\nWe then switch to an intriguing geometric interpretation for signs of quadrisecants. It turns\nout that the signs are determined by cr oss-ratios of the four intersection points and their\ntangent lines (ident ifying the locus of sign changes as certain hyperboloids of one sheet).\n\ nIf time permits\, in the end we will briefly discuss a graph complex gove rning these formulas\nand conjectural formulas for higher degree invariant s\n\nAdvisor: Prof. Michael Polyak\n CATEGORIES:Geometry and Topology Seminar,Graduation Seminars,Seminars LOCATION:Amado 919 END:VEVENT BEGIN:VEVENT UID:659@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260608T133000 DTEND;TZID=Asia/Jerusalem:20260608T143000 DTSTAMP:20260601T080424Z URL:https://math.technion.ac.il/events/title-the-dry-ten-martini-problem-f or-sturmian-graphs/ SUMMARY:The Dry Ten Martini Problem for Sturmian Graphs DESCRIPTION:Lecturer:Gilad Sofer\n Location:Amado 509\n “Are all gaps the re?” - a question originally posed by Mark Kac for the Almost-Mathieu op erator and later termed the Dry Ten Martini Problem by Simon - asks whethe r all gap labels predicted by the Gap Labelling Theorem are attained by th e integrated density of states. For the Almost-Mathieu operator and for St urmian Hamiltonians\, this problem has been resolved in many regimes\, wit h all allowed gaps shown to be open.\nIn this talk\, we introduce a geomet ric analogue of this problem for operators on dynamically defined graphs g enerated by Sturmian subshifts. Here the aperiodicity is encoded not in a potential\, but in the underlying geometric structure. We compute the corr esponding gap labels explicitly and show that\, in contrast to the classic al Sturmian Hamiltonians\, not all allowed gaps are open. Moreover\, the c ollection of attained gap labels depends on arithmetic properties of the S turmian frequency.\nThe missing gaps come from a geometric mechanism: the local structure of the graph produces flat bands\, leading to unattained g ap labels.\nBased on joint work with Ram Band.\n\nAdvisor: Associate Prof. Ram Band\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 509 END:VEVENT BEGIN:VEVENT UID:667@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260714T133000 DTEND;TZID=Asia/Jerusalem:20260714T143000 DTSTAMP:20260630T060220Z URL:https://math.technion.ac.il/events/optimal-hardy-weights-for-the-finsl er-p-dirichlet-integral/ SUMMARY:Optimal Hardy-weights for the Finsler p-Dirichlet integral DESCRIPTION:Lecturer:Yongjun Hou\n Location:Amado 814\n Advisor: Prof. Pinc hover Yehuda\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:674@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260723T113000 DTEND;TZID=Asia/Jerusalem:20260723T123000 DTSTAMP:20260717T044743Z URL:https://math.technion.ac.il/events/invariant-random-subgroups-and-metr ics-on-moduli-spaces-of-riemann-surfaces/ SUMMARY:Invariant Random Subgroups and Metrics on Moduli Spaces of Riemann Surfaces DESCRIPTION:Lecturer:Polina Leonchik (Technion)\n Location:Amado 919\n An i nvariant random subgroup is a conjugation-invariant probability measure on the space of closed subgroups of a given group. Such measures may be view ed as a common generalization of normal subgroups and lattices.\nEvery fin ite-area hyperbolic surface determines an invariant random subgroup of the group of orientation-preserving isometries of the hyperbolic plane. In th is way\, the moduli space of the surface embeds into the space of invarian t random subgroups. Taking the closure of its image produces a compactific ation known as the IRS compactification. Krifka proved that there is a con tinuous finite-to-one map from the augmented moduli space onto this compac tification.\nThe main goal of the talk is to construct metrics on the modu li space of the once-punctured torus using the invariant-random-subgroup a pproach. We will then discuss their behaviour when a simple closed geodesi c is pinched and compare the resulting asymptotic estimates with those for the classical Weil--Petersson metric.\n CATEGORIES:Geometry and Topology Seminar,Graduation Seminars,Seminars LOCATION:Amado 919 END:VEVENT BEGIN:VEVENT UID:677@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260803T130000 DTEND;TZID=Asia/Jerusalem:20260803T140000 DTSTAMP:20260730T044813Z URL:https://math.technion.ac.il/events/two-stories-from-the-abelian-sandpi le-model-the-square-lattice-and-the-cylinder/ SUMMARY:Two Stories from the Abelian Sandpile Model: The Square Lattice and the Cylinder. DESCRIPTION:Lecturer:Denis Rakhmankin\n Location:Amado 719\n Abstract\n\nAd visor: Associate Prof. Ron Rosenthal\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 719 END:VEVENT BEGIN:VEVENT UID:680@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260813T140000 DTEND;TZID=Asia/Jerusalem:20260813T150000 DTSTAMP:20260811T064548Z URL:https://math.technion.ac.il/events/snir-hordan/ SUMMARY:יכולות ומגבלות של מודלי למידה עמוקה גיאומטרית DESCRIPTION:Lecturer:Snir Hordan \n Location:Amado 509\n Geometric machine learning is a subfield of machine learning that aims to unify our understa nding of models that respect the symmetries of structured data such as gra phs and point clouds. We ask whether such models are complete\, that is\, able to separate every pair of inputs that are not equivalent under these symmetries. For point clouds\, we formulate complete geometric variants of the Weisfeiler-Leman (WL) graph-isomorphism tests and construct a continu ous point-cloud network that provably separates all point clouds up to per mutations and rigid motions. We further introduce WeLNet\, an architecture that universally approximates all continuous functions equivariant to per mutations\, rotations\, and translations\, runs in at most cubic time\, an d attains state-of-the-art results on N-body dynamics prediction. For grap hs\, we prove that spectral graph neural networks\, and in fact the entire WL hierarchy\, are incomplete on graphs with a simple spectrum\, a class on which isomorphism is decidable in cubic time. As a remedy\, we introduc e PRiSM\, the first provably complete canonicalization of simple spectrum eigendecompositions\, which yields universal approximation on this class a nd outperforms existing canonicalizations on molecular benchmarks.\n\nתק ציר בעברית:\n\nלמידת מכונה גיאומטרית הוא ת חום העוסק במודלים המכבדים את הסימטריות ש ל נתונים בעלי מבנה גיאומטרי\, כגון גרפים ועננֵי נקודות. אנו שואלים האם מודלים כאל ה הם שלמים\, כלומר האם ביכולתם להפריד בין כל שני קלטים שאינם שקולים תחת סימטריות א לה. עבור ענני נקודות\, אנו מנסחים גרסאות ג יאומטריות שלמות של מבחני האיזומורפיזם ש ל ויספיילר-לימן ובונים רשת רציפה לענני נ קודות המפרידה באופן מוכח בין כל זוג ענני נקודות עד כדי תמורות ופעולות אוקלידאות ( סיבוב\, שיקוף והזזה). בנוסף\, אנו מציגים את WeLNet\, ארכיטקטורה המקרבת באופן אוניברסלי כל פונקציה רציפה שהיא אקוויווריאנטית לת מורות\, לסיבובים ולהזזות\, פועלת בזמן ריצ ה קובי לכל היותר\, ומשיגה תוצאות שיא בחיז וי דינמיקה של N גופים. עבור גרפים\, אנו מוכ יחים שרשתות נוירונים גרפיות ספקטרליות\, ולמעשה היררכיית ויספיילר-לימן כולה\, אינ ן שלמות על גרפים בעלי ספקטרום פשוט\, מחלק ה שעבורה ניתן להכריע איזומורפיזם בזמן הת לוי במספר הקודקודים בגרף בחזקת שלוש. כתי קון\, אנו מציגים את PRiSM\, הקנוניזציה הראשו נה של פירוקים ספקטרליים בעלי ספקטרום פשו ט\, המובילה לקירוב אוניברסלי על מחלקה זו ועולה בביצועיה על קנוניזציות קיימות במט לות שונות על דטא מולקולרי.\n\n \;\n\nAdvisor: Dr. Nadav Dym\n https://technion.zoom.us/j/4856506130 CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 509 END:VEVENT BEGIN:VEVENT UID:679@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260816T143000 DTEND;TZID=Asia/Jerusalem:20260816T153000 DTSTAMP:20260806T071000Z URL:https://math.technion.ac.il/events/a-coupled-surface-diffusion-and-mea n-curvature-flow-problem-steady-states-and-stability-2/ SUMMARY:A Coupled Surface Diffusion and Mean Curvature Flow Problem - Stead y States and Stability  DESCRIPTION:Lecturer:Daniel Goldberg \n Location:\n Advisor: Prof. Amy Novi ck- Cohen\n\nabstract\n CATEGORIES:Graduation Seminars,Seminars END:VEVENT BEGIN:VEVENT UID:681@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260819T123000 DTEND;TZID=Asia/Jerusalem:20260819T130000 DTSTAMP:20260812T051234Z URL:https://math.technion.ac.il/events/topology-and-geometry-of-moduli-spa ces-of-semistable-sheaves-on-bielliptic-surfaces/ SUMMARY:Topology and geometry of moduli spaces of semistable sheaves on bie lliptic surfaces DESCRIPTION:Lecturer:Aleksei Piskunov\n Location:Faculty Lounge 8th floor \ n Moduli spaces are geometric spaces whose points parametrize other mathem atical objects\, and they provide a useful way of studying families of obj ects simultaneously. In this talk\, I will discuss moduli spaces of semist able sheaves on bielliptic surfaces\, a class of complex algebraic surfac es closely related to products of elliptic curves.\nI will first introduce the basic geometric ideas behind these moduli spaces and explain how\, fo r sheaves supported on curves\, they can be viewed as families of compacti fied Jacobians associated with a linear system of curves on the surface. I will then describe some of the topological properties of these spaces obt ained in my recent work\, including computations of their first two Betti numbers and information about their fundamental groups. Finally\, I will d iscuss the fibers of their Albanese maps and explain how\, in certain case s\, these fibers are closely related to Calabi–Yau varieties.\nNo prior knowledge of moduli spaces or algebraic geometry beyond basic familiarity with complex geometry will be assumed.\n\nAdvisor: Associate Prof. Howard Nuer\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Faculty Lounge 8th floor END:VEVENT BEGIN:VEVENT UID:682@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260819T130000 DTEND;TZID=Asia/Jerusalem:20260819T133000 DTSTAMP:20260812T051653Z URL:https://math.technion.ac.il/events/10843/ SUMMARY:On reciprocal characters and the quantum affine Schur-Weyl duality DESCRIPTION:Lecturer:Angelina Vargulevich\n Location:Faculty lounge 8th flo or \n Characters of symmetric groups and of the general linear group are t ied together by Schur–Weyl duality. I will explain this classical  picture and show how it survives the quantum affine generalizat ion.\n\nFor quantum affine algebras there is a natural notion of character \, the q-character of Frenkel-Reshetikhin\, which records the dimensions o f certain weight spaces. Together with my advisor Maxim Gurevich\, we con struct a new invariant on the affine Hecke algebra side\, which we call th e reciprocal character. Under quantum affine Schur–Weyl duality it corre sponds to the dominant part of the q-character. It also admits a natural  interpretation in the representation theory of p-adic groups.\n\n Additionally\, we discovered that the dominant part of the q-character cor responds to monomial bases in Lusztig's algebra\, through Ariki's  categorification.\n\nAdvisor: Associate prof. Maxim Gurevich\n\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Faculty lounge 8th floor END:VEVENT BEGIN:VEVENT UID:684@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260823T133000 DTEND;TZID=Asia/Jerusalem:20260823T143000 DTSTAMP:20260813T070857Z URL:https://math.technion.ac.il/events/machine-education-in-data-sparse-ph ysical-systems/ SUMMARY:Machine Education in Data-Sparse Physical Systems DESCRIPTION:Lecturer:Ofek Aloni\n Location:Auditorium of the Water Researc h Institute\n Artificial intelligence (AI) relies on mathematical models t hat map input data to output labels\, necessitating pre-labeled datasets f or training. The increasing complexity of AI architectures has escalated d ata requirements\, which pose significant challenges\, particularly in phy sical and environmental systems where data collection is resource-intensiv e. However\, these domains also present the opportunity to integrate under lying physical laws to reduce data demands and model complexity - a paradi gm known as Machine Education. Instead of relying solely on data-driven le arning\, machine education incorporates physical insights into AI models\, enabling more efficient solutions with less data.\nTwo complementary mach ine education approaches will be presented. First\, a hybrid physics-machi ne learning pipeline for reconstruction of dense physical fields from spar se measurements. It couples Radial Basis Function (RBF) reconstruction wit h a Neural Network (NN) correction and a Partial Differential Equation (PD E) solver\, so that the numerical solver itself is embedded directly in th e training loop of the learned component. Notably\, the NN is trained with out assuming availability of examples of the fully-resolved field. This is made possible by implementing the PDE solver so that it is end-to-end dif ferentiable\, allowing gradients to be backpropagated through the solver d uring training.\nSecond\, a Fourier-based synthetic time series generation technique\, which produces signals preserving the mean\, variance\, and a utocorrelation of original datasets\, facilitating robust data augmentatio n when real observations are limited.\n\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Auditorium of the Water Research Institute END:VEVENT BEGIN:VEVENT UID:683@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260902T100000 DTEND;TZID=Asia/Jerusalem:20260902T110000 DTSTAMP:20260813T063914Z URL:https://math.technion.ac.il/events/planning-domain-adaptation-by-visio n-language-models/ SUMMARY:Planning Domain Adaptation by Vision-Language Models DESCRIPTION:Lecturer:Michael Navat \n Location:Cooper 3rd floor \n Recent w ork shows that VLMs and AI-agents fail to acheive\nstate-of-the-art planni ng capabiliteis such as symbolic plan-\nner’s. On the other hand\, it ha s been demostrated that VLMs\ncan overcome the strict requirement of symbo lic planners\nfor formal domain model description\, since VLMs can ap-\npl y common-sense without formal descriptions. We present\nNAPC1\, a new neur o-symbolic method for generic adapta-\ntion of planning domain using VLMs. We demonstrate NAPC\nwith Neil robot2\, in real-world lab\, showing it ca n adapt to un-\nforeseen situation. We also show that the method reaches t he\nstate-of-the-arm planning capabilities of symbolic planners.\n \;\ n\nAdvisor: Prof. Erez Karpas\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Cooper 3rd floor END:VEVENT BEGIN:VEVENT UID:686@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260903T110000 DTEND;TZID=Asia/Jerusalem:20260903T120000 DTSTAMP:20260902T074239Z URL:https://math.technion.ac.il/events/improving-fine-grained-expressivity -of-graph-neural-networks/ SUMMARY:Improving Fine-Grained Expressivity of Graph Neural Networks DESCRIPTION:Lecturer:Yonatan Sverdlov \n Location:\n Graph neural networks are commonly analyzed through their ability to distinguish non-isomorphic graphs. In this talk\, I will study two complementary aspects of this ques tion\, moving from binary expressivity to quantitative separation.\nFirst\ , I will consider message-passing neural networks for geometric graphs. Fo r generic node positions\, we characterize exactly which sparse geometric graphs can be identified by invariant and equivariant architectures. We sh ow that invariant models can identify precisely the generically globally r igid graphs\, whereas equivariant models can identify every connected grap h. We also present EGenNet\, an equivariant architecture that generically achieves this maximal expressive power.\n\nIn the second part\, I will arg ue that distinguishability alone is not sufficient: two graphs may receive different representations while being mapped arbitrarily close to one ano ther. Motivated by long-range message-passing tasks\, we introduce FSW-GNN \, which uses bi-Lipschitz multiset embeddings for neighborhood aggregatio n. We construct a pseudometric whose zero set coincides with 1-WL equivale nce and show that FSW-GNN is both 1-WL equivalent and bi-Lipschitz with re spect to this metric. Empirically\, this improved quantitative separation leads to substantially better performance on long-range graph tasks.\n\n&n bsp\;\n\nAdvisor: Dr. Nadav Dym\n https://technion.zoom.us/j/91808240538 CATEGORIES:Graduation Seminars,Seminars END:VEVENT BEGIN:VEVENT UID:688@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20260923T123000 DTEND;TZID=Asia/Jerusalem:20260923T133000 DTSTAMP:20260908T074342Z URL:https://math.technion.ac.il/events/theory-for-interpreting-the-reading s-of-a-stiffnessometer-a-superconducting-stiffness-meter-device/ SUMMARY:Theory for interpreting the readings of a stiffnessometer – a sup erconducting stiffness meter device DESCRIPTION:Lecturer:Amitai Alperin \n Location:Amado 814\n This thesis inv estigates the electromagnetic response of thin-film type-II superconductor s as measured by a Stiffnessometer. While this device provides a highly se nsitive probe of superconducting phase stiffness\, extracting fundamental material properties from its readings requires overcoming significant theo retical and computational challenges. Specifically\, standard analytical a pproximations and commercial finite-element solvers fail to accurately res olve the highly non-linear Ginzburg-Landau equations in the extreme ultra- thin ring limit. To address this gap\, this work develops a dedicated nume rical framework based on the one-dimensional Squared-Operator Method (SOM) . By generating continuous\, artifact-free theoretical universal curves\, this customized approach successfully bridges the gap between the physical experimental response and the mathematical model. Ultimately\, this robus t framework want to provides the necessary tools for accurately decoding S tiffnessometer data\, enabling the precise extraction of critical supercon ducting length scales\, primarily the Pearl length (Λ) and the coherence length (ξ).\n\nJoint work with Amit Keren\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VEVENT UID:687@math.technion.ac.il DTSTART;TZID=Asia/Jerusalem:20261013T123000 DTEND;TZID=Asia/Jerusalem:20261013T133000 DTSTAMP:20260902T082543Z URL:https://math.technion.ac.il/events/online-planning-in-constrained-pomd p/ SUMMARY:Online Planning in Constrained POMDP DESCRIPTION:Lecturer:Ori Kachanov \n Location:Amado 814\n Partially Observa ble Markov Decision Processes (POMDPs) provide a general framework for seq uential decision-making under uncertainty\, where an agent must act withou t direct access to the underlying state. We ask how such decision-making c an be extended to settings where actions and trajectories must satisfy saf ety\, resource\, and operational constraints. We study constrained POMDPs\ , with a particular focus on online planning in continuous state and actio n spaces\, and examine how constraints can be incorporated into Monte Carl o Tree Search methods.\n\n \;\n\nAdvisor: Prof.  Vadim Indelman\n CATEGORIES:Graduation Seminars,Seminars LOCATION:Amado 814 END:VEVENT BEGIN:VTIMEZONE TZID:Asia/Jerusalem X-LIC-LOCATION:Asia/Jerusalem BEGIN:DAYLIGHT DTSTART:20230324T030000 TZOFFSETFROM:+0200 TZOFFSETTO:+0300 TZNAME:IDT END:DAYLIGHT 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