{"id":905,"date":"2025-08-19T11:52:35","date_gmt":"2025-08-19T15:52:35","guid":{"rendered":"https:\/\/sites.nd.edu\/mgsa\/?page_id=905"},"modified":"2025-12-12T13:14:28","modified_gmt":"2025-12-12T18:14:28","slug":"fall-2025","status":"publish","type":"page","link":"https:\/\/sites.nd.edu\/mgsa\/graduate-student-seminar\/fall-2025\/","title":{"rendered":"Fall 2025"},"content":{"rendered":"\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" id=\"block-75665e41-133f-4a6c-b40e-837b907b52b6\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"tan-ozalp-abstract\">09\/05\/2025 &#8211; Tan \u00d6zalp: Friedman\u2019s Borel diagonalization theorem<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> Do logicians just use Cantor\u2019s diagonal argument over and over again? Well, sometimes they prove they can\u2019t.<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"fuxiang-yang-abstract\">09\/12\/2025 &#8211; Fuxiang Yang: The Fundamental Theorem of Symmetric Functions<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> Let the symmetric group $\\mathfrak{S}n$ act on the polynomial ring $\\mathbb{Z}[x_1,\\dots,x_n]$ by permuting the variables. The ring of symmetic functions $\\Lambda_n$ defined by $\\Lambda_n = \\mathbb{Z}[x_1,\\dots,x_n]^{\\mathfrak{S}_n}$ is a well-studied object in Combinatorics. Define the $r$-th elementary symmetric function $e_r$ to be [e_r = \\sum{i_1 &lt; \\cdots &lt; i_r} x_{i_1}\\cdots x_{i_r}.] We will show that $\\Lambda_n = \\mathbb{Z}[e_1,\\dots,e_n]$.<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"gavin-dooley-abstract\">09\/19\/2025 &#8211; Gavin Dooley: The structure of the Turing degrees<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> Some mathematical problems can be solved by an algorithm, but others cannot. Among those that cannot, some of them are &#8220;more&#8221; noncomputable than others, an idea that is made formal by the notion of &#8220;relative&#8221; computability. Relative computability induces a degree structure on the set of mathematical problems. What does this structure look like?<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"jaziel-torres-abstract\">09\/26\/2025 &#8211; Jaziel Torres: When Mathematicians Collide: The Calculus Wars and the Battle for the Foundations<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> The history of mathematics is not only a story of theorems and discoveries, but also of rivalries that shaped its trajectory. This talk recounts two of the most famous feuds in mathematical history: the priority dispute between Isaac Newton and G.W. Leibniz over the invention of calculus, and the foundational quarrel between David Hilbert and L.E.J. Brouwer over formalism versus intuitionism.<\/p>\n\n\n\n<p class=\"wp-block-paragraph\">We will see how questions of intellectual credit, personal rivalry, and philosophical conviction ignited controversies that spilled beyond mathematics into institutions, reputations, and national pride. From Newton\u2019s behind-the-scenes maneuvers in the Royal Society against Leibniz, to Hilbert\u2019s decisive expulsion of Brouwer from the editorial board of&nbsp;<em>Mathematische Annalen<\/em>, these conflicts reveal how power and personality can shape the development of mathematics.<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"jason-mitrovich-abstract\">10\/03\/2025 &#8211; Jason Mitrovich: A Measure Theoretic Characterization of Commutativity<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> What is the probability that two group elements commute? If $G$ is Abelian then every element commutes with every other element so it&#8217;s 100%. What happens when $G$ is not Abelian? In 1968 Erd\u0151s and Tur\u00e1n showed that for finite groups the probability is bounded by 62.5%. Moreover, they conclude that this percentage is sharp i.e. it cannot be improved. Shortly after in 1973, Gustafson extended this result to compact Hausdorff topological groups. In this talk, we will first explore some examples before stating Gustafson&#8217;s generalization. Since Gustafson&#8217;s statement relies on the Haar measure, we will take a moment to review the key ideas around the Haar measure before giving a sketch of the proof. After seeing an application or two, we will state (without proof) a result from Guralnick and Wilson from 2000 further linking these probability type theorems to other group theoretic properties. <\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"nonacademic-jobs-abstract\">10\/10\/2025 &#8211; Panel: Nonacademic jobs<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> This seminar will be a panel discussion featuring some former &nbsp;Notre Dame students &nbsp;in mathematics who are currently working in a job outside of academia, or in academia but not as a math professor. <\/p>\n\n\n\n<div class=\"wp-block-group is-vertical is-layout-flex wp-container-core-group-is-layout-4fc3f8e1 wp-block-group-is-layout-flex\">\n<p class=\"wp-block-paragraph\">The panelists will include: <\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Jeremy Mann (Notre Dame PhD, 2019, Data Scientist) <\/p>\n\n\n\n<p class=\"wp-block-paragraph\">John Siratt (Notre Dame PhD, 2024, Public Sector Researcher) <\/p>\n\n\n\n<p class=\"wp-block-paragraph\">Danny Orton (Notre Dame PhD, 2019, Arcfield, Technical Specialist, Physicist)<\/p>\n<\/div>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"yuyan-he-abstract\">10\/17\/2025 &#8211; Yuyan He: From small doubling to small \u201cn-pling\u201d<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> For a given finite subset A of an abelian group, the Pl\u00fcnnecke\u2013Ruzsa inequality bounds the size of nA-mA in terms of |A+A|\/|A|. I will state several theorems where the inequality played an important role, and give Petridis\u2019 simplified version of the original proofs which keeps the use of the Pl\u00fcnnecke graph, but eliminates the tensor product trick.<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"fuxiang-yang-abstract\">10\/24\/2025 &#8211; FALL BREAK: NO TALK<\/h2>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"katherine-novey-abstract\">10\/31\/2025 &#8211; Katherine Novey: Failure of Ordinary TQFTs to Distinguish Homotopy Type<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> Topological Quantum Field Theories (TQFTs) provide manifold invariants. There has been significant work done over the past couple of decades investigating the sensitivity of these invariants and which manifolds they distinguish, but this question remains largely open. Work by David Reutter and Chris Schommer-Pries has shown that ordinary TQFTs can distinguish stable diffeomorphism classes of closed, connected, even-dimensional manifolds subject to certain finiteness conditions. In particular, simply connected, closed, smooth $6$-manifolds with finite $\\pi_2$ are diffeomorphic if and only if they cannot be distinguished by ordinary TQFTs. The question of whether or not &nbsp;this result holds for all simply connected $6$-manifolds was open. I will show that the answer to this question is no by presenting a pair of simply connected $6$-manifolds with infinite $\\pi_2$ that are indistinguishable by ordinary TQFTs. This counter-example can be extended to show that ordinary TQFTs cannot distinguish the homotopy type of simply-connected closed manifolds in all dimensions $\\geq 6$ and non simply-connected closed $5$-manifolds. Along the way, I will discuss bordisms with various structures and present a new bordism category of &#8220;formally smooth&#8221; manifolds required to build the counter example referenced above.<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"sam-heard-abstract\">11\/07\/2025 &#8211; Sam Heard: What is a Cluster Algebra?<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> In this talk, we will illustrate an example of a cluster algebra: the coordinate ring of the Grassmannian $\\mathbf{Gr}_k(m)$ (the set of k-dimensional subspaces of $\\mathbb{C}^m$).We will use this example to motivate the definition of a cluster algebra, as well as general properties of cluster algebras and connections to total positivity.<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"pengkun-huang-abstract\">11\/14\/2025 &#8211; Pengkun Huang: Finite Extensions of Q_p<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> Let p be a prime number. We can filter the ring of integers by powers of p, and equip the ring of integer by the p-adic topology. Fortunately, Z is not complete with respect to this topology, so we can do a completion and get the p-adic integer. In this talk, we will build up p-adic integers by the Witt vectors. They are harder than the usual constructions, and we&#8217;re doing in this way not only because mathematicians just like to make things harder, we will see this turns out to be helpful in understanding a class of finite extensions of Q_p.<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"khoi-nguyen-abstract\">11\/21\/2025 &#8211; Khoi Nguyen: (Not WIRED) 4 levels of Caclculus of Variations in Geometry<\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> One of the most elegant ideas in math is the idea of optimization of a function. The tools of carrying out this procedure are manifold (pun intended), one of which is the calculus of variation. Mimicking the famous WIRED 5 level series, I will attempt to explain this idea in 4 levels that (hopefully) is easily understandable.<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"chase-bender-abstract\">11\/28\/2025 &#8211; THANKSGIVING BREAK: NO TALK<\/h2>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"fuxiang-yang-abstract\">12\/05\/2025 &#8211; NO TALK<\/h2>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"harrison-gimenez-abstract\">12\/12\/2025 &#8211; Harrison Gimenez: Coxeter n-cubes <\/h2>\n\n\n\n<p class=\"wp-block-paragraph\"><strong>Abstract:<\/strong> Given a Coxeter system\u00a0(W,S) and element w of W, the left inversion set of w is the set of positive roots that are mapped to negative roots by the inverse of w. Coxeter squares are commutative square diagrams whose edges describe how left inversion sets are mapped\u00a0\u00a0to other left inversion sets by\u00a0\u00a0elements of W. We investigate properties of higher dimensional analogues of Coxeter squares called Coxeter n-cubes, which are hyper-cubical diagrams the two-dimensional faces of which are Coxeter squares. In the symmetric groups, we describe\u00a0\u00a0relationships between Coxeter n-cubes, full binary trees with n+1 leaves, and bigrassmannian permutations.<br><\/p>\n","protected":false},"excerpt":{"rendered":"<p>09\/05\/2025 &#8211; Tan \u00d6zalp: Friedman\u2019s Borel diagonalization theorem Abstract: Do logicians just use Cantor\u2019s diagonal argument over and over again? Well, sometimes they prove they can\u2019t. 09\/12\/2025 &#8211; Fuxiang Yang: The Fundamental Theorem of Symmetric Functions Abstract: Let the symmetric group $\\mathfrak{S}n$ act on the polynomial ring $\\mathbb{Z}[x_1,\\dots,x_n]$ by permuting the variables. The ring of [&hellip;]<\/p>\n","protected":false},"author":5114,"featured_media":0,"parent":55,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-905","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/sites.nd.edu\/mgsa\/wp-json\/wp\/v2\/pages\/905","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.nd.edu\/mgsa\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.nd.edu\/mgsa\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.nd.edu\/mgsa\/wp-json\/wp\/v2\/users\/5114"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.nd.edu\/mgsa\/wp-json\/wp\/v2\/comments?post=905"}],"version-history":[{"count":29,"href":"https:\/\/sites.nd.edu\/mgsa\/wp-json\/wp\/v2\/pages\/905\/revisions"}],"predecessor-version":[{"id":1095,"href":"https:\/\/sites.nd.edu\/mgsa\/wp-json\/wp\/v2\/pages\/905\/revisions\/1095"}],"up":[{"embeddable":true,"href":"https:\/\/sites.nd.edu\/mgsa\/wp-json\/wp\/v2\/pages\/55"}],"wp:attachment":[{"href":"https:\/\/sites.nd.edu\/mgsa\/wp-json\/wp\/v2\/media?parent=905"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}