The theory of stable polynomials features a key notion called
proper position, which generalizes interlacing of real roots to
higher dimensions. I will show how a Lorentzian analog of proper
position connects the structure of spaces of Lorentzian...
One way to define a matroid is via its base polytope. From
this point of view, some matroid invariants easily have geometric
interpretations: e.g., the number of bases is the number of
vertices of the polytope. It turns out that most
interesting...
We will present recent applications of enumerative algebra to
the study of stationary states in physics. Our point of departure
are classical Newtonian differential equations with nonlinear
potential. It turns out that the study of their stationary...
The Bergelson conjecture from 1996 asserts that the multilinear
polynomial ergodic averages with commuting transformations converge
pointwise almost everywhere in any measure-preserving system. This
problem was recently solved affirmatively for...
We show that skein valued counts of open holomorphic curves in a
symplectic Calabi-Yau 3-fold with Maslov zero Lagrangian boundary
condition are invariant under deformations and discuss applications
(Ooguri-Vafa conjecture and simple recursion...
Hindman’s Theorem states that whenever the natural numbers are
finitely coloured there exists an infinite sequence all of whose
finite sums are the same colour. By considering just powers of 2,
this immediately implies the corresponding result for...
On general grounds one expects that global symmetries are absent
in quantum gravity. We discuss some aspects of this issue, focusing
on the recently proposed Swampland Cobordism Conjecture, and
related conjectures connected with completeness of the...
The Prékopa-Leindler inequality (PL) and its strengthening, the
Borell-Brascamp-Lieb inequality, are functional extensions of the
Brunn-Minkowski inequality from convex geometry, which itself
refines the classical isoperimetric inequality. These...
Q1: A fundamental result in coding theory, known as the Plotkin
bound, suggests that a binary code can tolerate up to ¼ fraction of
adversarial corruptions. Can we design codes that handle more
errors if we allow interaction between the sender and...
A Richardson variety R in a cominuscule Grassmannian is defined
by a skew diagram of boxes. If this diagram has several connected
components, then R is a product of smaller Richardson varieties
given by the components. I will show that the Picard...
