Approaches to the Skolem Problem
Abstract
The Skolem Problem asks to decide whether a linearly recurrent sequence (LRS) over the rationals has a zero term. It is sometimes considered as the halting problem for linear loops. In this talk we will give an overview of two current approaches to establishing decidability of this problem. First, we observe that the Skolem Problem for LRS with simple characteristic roots is decidable subject to the $p$-adic Schanuel conjecture and the exponential-local-global principle. Next, we define a set $S$ of positive integers such that (i) $S$ has positive lower density and (ii) The Skolem Problem is decidable relative to $S$, i.e., one can effectively determine the set of all zeros of a given LRS that lie in $S$.
The talk is based on joint work with Y. Bilu, F. Luca, J. Ouaknine, D. Pursar, and J. Nieuwveld.
Defining valuations in ordered fields
Abstract
We study the definability of valuation rings in ordered fields (in the language of ordered rings). We show that any henselian valuation ring that is definable in the language of ordered rings is already definable in the language of rings. However, this does not hold when we drop the assumption of henselianity.
This is joint work with Philip Dittmann, Sebastian Krapp and Salma Kuhlmann.
Geometry of memoryless policy optimization in POMDPs
Abstract
We consider the problem of finding the best memoryless stochastic policy for an infinite-horizon partially observable Markov decision process (POMDP) with finite state and action spaces with respect to either the discounted or mean reward criterion. We show that the (discounted) state-action frequencies and the expected cumulative reward are rational functions of the policy, whereby the degree is determined by the degree of partial observability. We then describe the optimization problem as a linear optimization problem in the space of feasible state-action frequencies subject to polynomial constraints that we characterize explicitly. This allows us to address the combinatorial and geometric complexity of the optimization problem using tools from polynomial optimization. In particular, we estimate the number of critical points and use the polynomial programming description of reward maximization to solve a navigation problem in a grid world. The talk is based on recent work with Johannes Müller.
Quantum field theory (QFT) is a natural language for describing quantum physics that obeys special relativity. A modern perspective on QFT is provided by the renormalization group (RG) flow, which is a path defined on the coupling constant space and evolves from the ultraviolet (UV) to the infrared (IR) fixed point. In particular, the theories on the IR fixed point are scale-invariant and most of them are known to be promoted to a conformal field theory (CFT).
Non-branching in RCD(K,N) Spaces
Abstract
On a smooth Riemannian manifold, the uniqueness of a geodesic given initial conditions follows from standard ODE theory. This is known to fail in the setting of RCD(K,N) spaces (metric measure spaces satisfying a synthetic notion of Ricci curvature bounded below) through an example of Cheeger-Colding. Strengthening the assumption a little, one may ask if two geodesics which agree for a definite amount of time must continue on the same trajectory. In this talk, I will show that this is true for RCD(K,N) spaces. In doing so, I will generalize a well-known result of Colding-Naber concerning the Hölder continuity of small balls along geodesics to this setting.
Junior Algebra and Rep Theory social
We will meet to catch up after Easter break, over coffee and biscuits.
A modular construction of unramified p-extensions of Q(N^{1/p})
Abstract
In his 1976 proof of the converse of Herbrand’s theorem, Ribet used Eisenstein-cuspidal congruences to produce unramified degree-p extensions of the p-th cyclotomic field when p is an odd prime. After reviewing Ribet’s strategy, we will discuss recent work with Preston Wake in which we apply similar techniques to produce unramified degree-p extensions of Q(N^{1/p}) when N is a prime that is congruent to -1 mod p. This answers a question posed on Frank Calegari’s blog.