Differences

This shows you the differences between two versions of the page.

--- meetings_spring_2026 [2026/02/25 14:52] – asjensen
+++ meetings_spring_2026 [2026/04/07 13:58] (current) – asjensen
@@ Line 2: / Line 2: @@
 //All meetings take place on Wednesdays, 2:30 - 3:30 pm in Burt Hall 204 unless otherwise noted.//
-^ Date ^ Meeting Title ^ Speaker ^ Abstract ^
+^ Date ^ Meeting Title ^ Speaker ^ University ^ Abstract ^
-| February 4   | Getting L∃∀N | Nathan Albin | [[#february_4|Abstract]] |
+| February 4   | Getting L∃∀N | Nathan Albin | Kansas State University | [[#february_4|Abstract]] |
-| February 11  | Getting L∃∀Ner | Nathan Albin | [[#february_11|Abstract]] |
+| February 11  | Getting L∃∀Ner | Nathan Albin | Kansas State University | [[#february_11|Abstract]] |
-| February 18  | A L∃∀N Handshake | Nathan Albin | [[#february_18|Abstract]] |
+| February 18  | A L∃∀N Handshake | Nathan Albin | Kansas State University | [[#february_18|Abstract]] |
-| February 25  | Base Modulus for Matroid Truncation, Strength, and Fractional Arboricity | Huy Truong | [[#february_18|Abstract]] |
+| February 25  | Base Modulus for Matroid Truncation, Strength, and Fractional Arboricity | Huy Truong | Kansas State University | [[#february_25|Abstract]] |
-| March 4      |  |  |  |
+| March 4      | Modulus of Families of Lipschitz Chains with Arbitrary Dimension and Codimension | Andrew Jensen | Kansas State University | [[#march_4|Abstract]] |
-| March 11     |  |  |  |
+| March 11     | **NO MEETING** |  |  |  |
-| March 18     | **NO MEETING** | //Spring Break// |  |
+| March 18     | **NO MEETING** | | | |
-| March 25     |  |  |  |
+| March 25     | **NO MEETING** |  | | |
-| April 1      |  |  |  |
+| April 1      | **NO MEETING** |  | | |
-| April 8      |  |  |  |
+| April 8      | Hamilton-Jacobi Equations on Graphs with Applications to Semi-Supervised Learning and Data Depth  | Andrew Jensen | Kansas State University | [[#april_8_|Abstract]] |
-| April 15     |  |  |  |
+| April 15     |  |  | | |
-| April 22     |  |  |  |
+| April 22     |  |  | | |
-| April 29     |  |  |  |
+| April 29     |  |  | | |
-| May 6        |  |  |  |
+| May 6        |  |  | | |
 ===== Abstracts =====
@@ Line 35: / Line 35: @@
 **"Base Modulus for Matroid Truncation, Strength, and Fractional Arboricity", Huy Truong**\\
 In previous work, we studied the p-modulus of the family of all bases of a matroid and showed that it recovers several classical concepts in matroid theory, including strength, fractional arboricity, and principal partitions. These results generalize corresponding concepts for spanning trees in graphs. Due to computational constraints, one may impose a bound on the number of elements sampled from a base. For instance, when exploring a tree, we may stop at forests with $t$ edges. Such objects are captured by matroid truncations. In this paper, we study the modulus of matroid truncations and determine the universal density for every truncation of a given matroid. As a consequence, we show that the truncation modulus serves as an approximation of the original matroid modulus.
+==== March 4 ====
+**"Modulus of Families of Lipschitz Chains with Arbitrary Dimension and Codimension", Andrew Jensen**\\
+Recently, Lohvansuu (2023) introduced the p-modulus for families of k-dimensional Lipschitz chains and their dual families of (n-k)-dimensional chains. While he established an upper bound for the duality of these families on Lipschitz cubes, the corresponding lower bound remained an open question. Subsequently, Kangasniemi and Prywes (2025) developed dMod, a related notion of modulus based on differential forms, and successfully established a full duality result. In this talk, I will explore the implications of these developments and discuss related open problems.
+==== April 8 ====
+**"Hamilton-Jacobi Equations on Graphs with Applications to Semi-Supervised Learning and Data Depth", Andrew Jensen**\\
+We will be reading through a paper by Jeff Calder and Mahmood Ettehad discussing how the p-Eikonal Equation on graphs allows one to recover distances on graphs, and in particular p -> infinity recovers shortest-path graph distance. The authors then apply the finding in machine learning contexts. I will briefly share an overview of the paper's results, then the remaining portion of the meeting will be a group discussion on the paper. You can find the paper at https://arxiv.org/abs/2202.08789.