Upcoming Events

The sum-rank metric is a generalization of the well-known Hamming and rank metrics. In this talk, we introduce two new bounds on the maximal cardinality of the sum-rank-metric code with a given minimum distance. One of the bounds exploits a...

We analyze how strategic customers and providers respond to delay information in a matching system. Using Markovian queueing models and equilibrium analysis, we evaluate three disclosure policies (no information, binary, and occupancy) and identify...

I will use the remarkable Stirling’s formula for N! to introduce the asymptotic analysis of Riemann-Hilbert problems. Then I will describe the kinetic theory of soliton gases. To accomplish this, I will explain by example some integrable nonlinear...

I will discuss the following question independently posed by Clark and Saltman around 2007: Given a central simple algebra A over a field K, is there a a genus 1 curve X over K such that A is split by the function field K(X)? Federico Scavia and I...

Infectious disease transmission models are used to inform public health policies and gain a better understanding of disease dynamics. For them to accomplish these goals effectively it is important that models accurately represent the mechanisms that...

Abstract TBA

We present the patching method, a machinery developed by Harbater–Hartmann–Krashen and various other authors, dedicated to the study of arithmetics of linear algebraic groups over function fields of curves over complete discretely valued field such...

Dietary assessment is crucial for understanding the relationship between diet and health. Yet traditional recall-based methods for tracking diet often face challenges like participant compliance and accurate recall. To address these issues, our lab...

Given a compact set E ⊂ R^d , its distance set is ∆(E) = { |x − y| : x, y ∈ E }, and for y ∈ E, the pinned distance set of E at y is ∆ y (E) = { |x − y| : x ∈ E }. A classical result of Mattila and Sjölin shows that the unpinned distance set ∆(E) has...

The analysis of why a specific MIP instance is infeasible formally can be reduced to computing an Irreducible Infeasible Subset (IIS) of the constraints. Unlike the case of LP, for MIP there is no useful duality that can be employed to facilitate...