Related papers: Experimenting with Discrete Dynamical Systems
I present a partly pedagogic discussion of the Gel'fand-Yaglom formula for the functional determinant of a one-dimensional, second order difference operator, in the simplest settings. The formula is a textbook one in discrete…
We study the discrete logarithm problem for the multiplicative group and for elliptic curves over a finite field by using a lifting of the corresponding object to an algebraic number field and global duality. We introduce the…
In 2007, A.I.Aptekarev and his collaborators discovered a sequence of rational approximations to Euler's constant $\gamma$ defined by a linear recurrence. In this paper, we generalize this result and present an explicit construction of…
In [5] I.P. Goulden, D.M. Jackson, and R. Vakil formulated a conjecture relating certain Hurwitz numbers (enumerating ramified coverings of the sphere) to the intersection theory on a conjectural Picard variety. We are going to use their…
Given a rational function of degree at least two defined over a number field k, we study the cardinality of the set of rational iterated preimages. We prove bounds for the cardinality of this set as the rational function varies in certain…
Numerical reasoning over text is a challenging task of Artificial Intelligence (AI), requiring reading comprehension and numerical reasoning abilities. Previous approaches use numerical reasoning programs to represent the reasoning process.…
We survey an area of recent development, relating dynamics to theoretical computer science. We discuss the theoretical limits of simulation and computation of interesting quantities in dynamical systems. We will focus on central objects of…
Suppose $E$ is an elliptic curve over $\mathbb{Q}$ and $\chi$ is a Dirichlet character. We use statistical properties of modular symbols to estimate heuristically the probability that $L(E,\chi,1) = 0$. Via the Birch and Swinnerton-Dyer…
Dirac's approach to gauge symmetries is discussed. We follow closely the steps that led him from his conjecture concerning the generators of gauge transformations {\it at a given time} --to be contrasted with the common view of gauge…
Many safety-critical scientific and engineering systems evolve according to differential-algebraic equations (DAEs), where dynamical behavior is constrained by physical laws and admissibility conditions. In practice, these systems operate…
Interactive theorem provers, like Isabelle/HOL, Coq and Lean, have expressive languages that allow the formalization of general mathematical objects and proofs. In this context, an important goal is to reduce the time and effort needed to…
Experimental mathematics is an experimental approach to mathematics in which programming and symbolic computation are used to investigate mathematical objects, identify properties and patterns, discover facts and formulas and even…
This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…
Reliable uncertainty estimation has become a crucial requirement for the industrial deployment of deep learning algorithms, particularly in high-risk applications such as autonomous driving and medical diagnosis. However, mainstream…
We propose a new method based on machine learning to \emph{play the devil's advocate} and investigate the impact of unknown systematic effects in a quantitative way. This method proceeds by reversing the measurement process and using the…
We introduce Explanatory Learning (EL), a framework to let machines use existing knowledge buried in symbolic sequences -- e.g. explanations written in hieroglyphic -- by autonomously learning to interpret them. In EL, the burden of…
Provability logic concerns the study of modality $\Box$ as provability in formal systems such as Peano arithmetic. Natural, albeit quite surprising, topological interpretation of provability logic has been found in the 1970's by Harold…
In 1987 Serre conjectured that any mod l ("ell", not "1") two-dimensional irreducible odd representation of the absolute Galois group of the rationals came from a modular form in a precise way. We present a generalisation of this conjecture…
The set of special unipotent representations of a semisimple Lie group was defined by Barbasch and Vogan. According to predictions of Arthur (established by Adams, Barbasch, and Vogan), this set is an overlapping union of Arthur packets.…
Researchers have demonstrated state-of-the-art performance in sequential decision making problems (e.g., robotics control, sequential prediction) with deep neural network models. One often has access to near-optimal oracles that achieve…