Random Lattices as Sphere Packings
Explore lattice-sum functions and their applications in sphere packing density, including Siegel's mean value theorem and recent advancements in optimal packing bounds.
Structure Theorems in Boolean Harmonic Analysis - Part II
Explore classical and modern structure theorems in Boolean Function Analysis, focusing on biased hypercube and symmetric group applications.
The Structure of Residuated Lattices
Explore the structure of residuated lattices, from motivating examples to recent research, in this accessible graduate-level seminar on algebraic structures and their applications.
Solving Equations from Combinatorics via Computer Algebra
Explore advanced techniques for solving discrete differential equations in combinatorics using computer algebra, focusing on efficient methods for n=2 cases and recent developments in systems of equations.
Counting Partitions by Genus
Explore set partition counting by genus, focusing on primitive partitions and functional equations to reconstruct all partitions, with emphasis on genus 0-2 cases.
Counting Restricted Set Partitions with Hypergeometrics
Explore advanced set partition counting using hypergeometric functions and generalized Hermite polynomials. Gain insights into restricted Bell numbers and their closed-form expressions.
The Generation Conjecture for Regular Graphs
Explore the generation conjecture for regular graphs, delving into mathematical concepts and theories presented by Søren Eilers from the University of Copenhagen.
Graphs and Groupoids
Odkryj związki między teorią grafów a teorią grupoidów, zgłębiając ich matematyczne podstawy i zastosowania w różnych dziedzinach.
New Morphisms of Graphs
Explore innovative graph morphisms and their applications in mathematics with expert Piotr M. Hajac from IMPAN.
K-tilings of the Aztec Diamond
Explore K-tilings of the Aztec diamond, a fascinating mathematical concept in integrable systems and exactly solvable models.
Finite Point Configurations in Euclidean, Discrete, and Arithmetic Settings
Explore finite point configurations across Euclidean, discrete, and arithmetic spaces. Discover size requirements for subsets containing congruent copies of given configurations, with connections to learning theory.
Old and New Developments on the Erdos-Szekeres Convex Polygon Problem
Explore old and new developments in the Erdos-Szekeres convex polygon problem, gaining insights into this fascinating mathematical challenge.
Elliptic Cohomology and Enumerative Geometry
Explore the intersection of elliptic cohomology and enumerative geometry, focusing on stable envelopes and their role in understanding q-difference equations.
Hypergraph Decompositions and Their Applications
Explore hypergraph decompositions and their applications in combinatorics with Oxford Professor Peter Keevash, known for solving the Existence Conjecture for Combinatorial Designs.
Hypertrees in Combinatorics and Graph Theory
Explore hypertrees with Professor Nati Linial, delving into combinatorics, algorithms, and their applications in computer science and mathematics.
Exponentially Many Graphs Are Determined by Their Spectrum
Explore discrete analogues of Kac's question on "hearing the shape of a drum" and learn about graphs determined by their spectrum in this mathematical seminar.
A Proof of the Erdos-Faber-Lovasz Conjecture
Explore the recent proof of the Erdos-Faber-Lovasz conjecture and its generalization, delving into linear hypergraphs and chromatic index concepts.
A Finite Dimensional Proof of the Verlinde Formula
Explore a purely algebro-geometric proof of the Verlinde formula, examining recurrence relations for curve genus and parabolic points in generalized theta function spaces.
Progression-Free Sets in Arithmetic Sequences
Explore lower and upper bounds for progression-free sets in $\mathbb{Z}_m^n$, examining the polynomial method's application to $r_k(\mathbb{Z}_m^n)$ and related problems.
High-dimensional Statistics and Approximate Message Passing Algorithms - Course 3
Explore high-dimensional statistics and approximate message passing algorithms in this advanced mathematics lecture. Gain insights into cutting-edge research in discrete probability and statistics.
The Number of Random 2-SAT Solutions is Asymptotically Log-Normal
Explore discrete probability and statistics in a month-long program featuring talks, minicourses, and collaborative sessions. Engage with researchers and delve into topics like random 2-SAT solutions.