meetings_spring_2026
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| meetings_spring_2026 [2026/03/07 16:43] – 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.// | //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 |
| - | | February 4 | Getting L∃∀N | Nathan Albin | [[# | + | | February 4 | Getting L∃∀N | Nathan Albin | Kansas State University |
| - | | February 11 | Getting L∃∀Ner | Nathan Albin | [[# | + | | February 11 | Getting L∃∀Ner | Nathan Albin | Kansas State University |
| - | | February 18 | A L∃∀N Handshake | Nathan Albin | [[# | + | | February 18 | A L∃∀N Handshake | Nathan Albin | Kansas State University |
| - | | February 25 | Base Modulus for Matroid Truncation, Strength, and Fractional Arboricity | Huy Truong | [[# | + | | February 25 | Base Modulus for Matroid Truncation, Strength, and Fractional Arboricity | Huy Truong |
| - | | March 4 | Modulus of Families of Lipschitz Chains with Arbitrary Dimension and Codimension | Andrew Jensen | [[# | + | | March 4 | Modulus of Families of Lipschitz Chains with Arbitrary Dimension and Codimension | Andrew Jensen |
| - | | March 11 | + | | March 11 | **NO MEETING** |
| - | | March 18 | **NO MEETING** | //Spring Break// | + | | March 18 | **NO MEETING** | | | | |
| - | | March 25 | + | | March 25 |
| - | | April 1 | | | | | + | | April 1 | **NO MEETING** |
| - | | April 8 | | | | | + | | April 8 | Hamilton-Jacobi Equations on Graphs with Applications to Semi-Supervised Learning and Data Depth |
| - | | April 15 | + | | April 15 |
| - | | April 22 | + | | April 22 |
| - | | April 29 | + | | April 29 |
| - | | May 6 | | | | | + | | May 6 | | | | | |
| ===== Abstracts ===== | ===== Abstracts ===== | ||
| Line 39: | Line 39: | ||
| **" | **" | ||
| 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, | 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, | ||
| + | |||
| + | ==== April 8 ==== | ||
| + | **" | ||
| + | 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' | ||
| + | |||
meetings_spring_2026.1772901815.txt.gz · Last modified: by asjensen
