Real numbers may have infinitely many digits yet admit short, finite descriptions. Can we recover such a description of an unknown number using only comparisons? This question extends classical integer/rational search to richer representations and connects numerical search with exact query learning.
This talk will focus on automatic reals, whose digits are determined by finite automata. For an unknown real with an s-state representation, we obtain a polynomial-time algorithm using O(s^2) comparisons. For this algorithm, we revisit Angluin’s exact learning model, well known in learning theory, and show how automata-learning techniques can be adapted to identify unknown real numbers using only comparison queries.
If time permits, we will discuss other representations, including algebraic numbers.
This is ongoing joint work with Arvind.
This talk will be on certain new techniques for triangulated categories introduced by Neeman in a series of papers, which have been used to prove various new results and settling multiple open conjectures. We will give a broad overview of these techniques, and illustrate various applications in algebraic geometry. In particular, we will see a representability theorem and its application to a new proof of GAGA theorems, a result on transferring semiorthogonal decompositions, and a result on the non-existence of bounded t-structures for perfect complexes on singular finite-dimensional Noetherian schemes.