~~NOCACHE~~
/* DO NOT EDIT THIS FILE             */

[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday December 10, 2024, 1:30PM, Online\\
**Ali Messaoudi** (Universidade Estadual Paulista) //Adding machine, automata and Julia sets//
<button type="link" size="xs" collapse="b28-4389">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4389" collapsed="true">
<well size="sm">
A stochastic adding machine (defined by P.R. Killeen and T.J. Taylor) is a Markov chain whose states are natural integers, which models the process of adding the number 1 but where there is a probability of failure in which a carry is not performed when necessary. In this lecture, we will talk about dynamical, spectral and probabilistic properties of extensions for the stochastic adding machine and their connections with other topics as Julia sets, Automata and Dynamical Systems on Banach spaces.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday November 26, 2024, 2PM, Online\\
**Haojie Ren** (Technion) //The dimension of Bernoulli convolutions in $\mathbb{R}^d$//
<button type="link" size="xs" collapse="b28-4390">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4390" collapsed="true">
<well size="sm">
For $(\lambda_{1},\dots,\lambda_{d})=\lambda\in(0,1)^{d}$ with $\lambda_{1}>\cdots>\lambda_{d}$,
denote by $\mu_{\lambda}$ the Bernoulli convolution associated to
$\lambda$. That is, $\mu_{\lambda}$ is the distribution of the random
vector $\sum_{n\ge0}\pm\left(\lambda_{1}^{n},\dots,\lambda_{d}^{n}\right)$,
where the $\pm$ signs are chosen independently and with equal weight.
Assuming for each $1\le j\le d$ that $\lambda_{j}$ is not a root
of a polynomial with coefficients $\pm1,0$, we prove that the dimension
of $\mu_{\lambda}$ equals $\min\{ \dim_{L}\mu_{\lambda},d\} $,
where $\dim_{L}\mu_{\lambda}$ is the Lyapunov dimension. This is a joint work with Ariel Rapaport.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday November 12, 2024, 2PM, Online\\
**Florian Luca** (Stellenbosch University) //On a question of Douglass and Ono//
<button type="link" size="xs" collapse="b28-4391">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4391" collapsed="true">
<well size="sm">
It is known that the partition function $p(n)$ obeys Benford's law in any integer base $b\ge 2$. A similar result was obtained by Douglass and Ono for the plane partition function $\text{PL}(n)$ in a recent paper. In their paper, Douglass and Ono asked for an explicit version of this result. In particular, given an integer base $b\ge 2$ and string $f$ of digits in base $b$ they asked for an explicit value $N(b,f)$ such that there exists $n\le N(b,f)$ with the property that $\text{PL}(n)$ starts with the string $f$ when written in base $b$. In my talk, I will present an explicit value for $N(b,f)$ both for the partition function $p(n)$ as well as for the plane partition function $\text{PL}(n)$.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday October 29, 2024, 2PM, Online\\
**Victor Shirandami** (University of Manchester) //Probabilistic Effectivity in the Subspace Theorem and the Distribution of Algebraic Projective Points//
<button type="link" size="xs" collapse="b28-4392">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4392" collapsed="true">
<well size="sm">
The celebrated Roth’s theorem in Diophantine Approximation determines the degree to which an algebraic number may be approximated by rationals. A corollary of this theorem yields a transcendence criterion for real numbers based off of their decimal expansion. This theorem, and its broad generalisation due to Schmidt, famously suffers from ineffectivity. This motivates one to address this issue in the probabilistic context, whereby one makes progress in the direction of effectivity in an appropriately defined probabilistic regime. From this analysis is derived an analogue of Khintchine's theorem for algebraic numbers, answering a question of Beresnevich, Bernick, and Dodson on a density version of Waldschmidt’s conjecture.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday October 15, 2024, 2PM, Online\\
**Steven Robertson** (University of Manchester) //Low Discrepancy Digital Hybrid Sequences and the t-adic Littlewood Conjecture//
<button type="link" size="xs" collapse="b28-4393">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4393" collapsed="true">
<well size="sm">
The discrepancy of a sequence measures how quickly it approaches a uniform distribution. Given a natural number $d$, any collection of one-dimensional so-called low discrepancy sequences $\{S_i : 1 \le i \le d\}$ can be concatenated to create a $d$-dimensional hybrid sequence $(S_1, . . . , S_d)$. Since their introduction by Spanier in 1995, many connections between the discrepancy of a hybrid sequence and the discrepancy of its component sequences have been discovered. However, a proof that a hybrid sequence is capable of being low discrepancy has remained elusive. In this talk, an explicit connection between Diophantine approximation over function fields and two dimensional low discrepancy hybrid sequences is provided. 

Specifically, it is shown that any counterexample to the so-called $t$-adic Littlewood Conjecture ($t$-LC) can be used to create a low discrepancy digital Kronecker-Van der Corput sequence.  Such counterexamples to $t$-LC are known explicitly over a number of finite fields by, on the one hand, Adiceam, Nesharim and Lunnon, and on the other, by Garrett and the Robertson. All necessary concepts will be defined in the talk.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday October 1, 2024, 2PM, Online\\
**Dong Han Kim** (Dongguk University) //Uniform Diophantine approximation on the Hecke group $H_4$//
<button type="link" size="xs" collapse="b28-4394">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4394" collapsed="true">
<well size="sm">
Dirichlet's uniform approximation theorem is a fundamental result in Diophantine approximation that gives an optimal rate of approximation.
We study uniform Diophantine approximation properties on the Hecke group $H_4$ in terms of the Rosen continued fractions.
For a given real number $\alpha$, the best approximations are convergents of the Rosen continued fraction and the dual Rosen continued fraction of $\alpha$.
We give analogous theorems of Dirichlet uniform approximation and the Legendre theorem with optimal constants.
This is joint work with Ayreena Bakhtawar and Seul Bee Lee.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday September 17, 2024, 2PM, Online\\
**Simon Kristensen** (Aarhus Universitet) //On the distribution of sequences of the form $(q_n y)$//
<button type="link" size="xs" collapse="b28-4395">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4395" collapsed="true">
<well size="sm">
The distribution of sequences of the form $(q_n y)$ with $(q_n)$ a sequence of integers and $y$ a real number have attracted quite a bit of attention, for instance due to their relation to inhomogeneous Littlewood type problems. In this talk, we will provide some results on the Lebesgue measure and Hausdorff dimension on the set of points in the unit interval approximated to a certain rate by points from such a sequence. A feature of our approach is that we obtain estimates even in the case when the sequence $(q_n)$ grows rather slowly. This is joint work with Tomas Persson.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday June 18, 2024, 2PM, Online\\
**Noy Soffer Aranov** (Technion) //Escape of Mass of the Thue Morse Sequence//
<button type="link" size="xs" collapse="b28-4396">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4396" collapsed="true">
<well size="sm">
One way to study the distribution of quadratic number fields is through the evolution of continued fraction expansions. In the function field setting, it was shown by de Mathan and Teullie that given a quadratic irrational $\Theta$, the degrees of the periodic part of the continued fraction of $t^n\Theta$ are unbounded. Paulin and Shapira improved this by proving that quadratic irrationals exhibit partial escape of mass. Moreover, they conjectured that they must exhibit full escape of mass. We show that the Thue Morse sequence is a counterexample to their conjecture. In this talk we shall discuss the technique of proof as well as the connection between escape of mass in continued fractions, Hecke trees, and number walls. This is part of ongoing work joint with Erez Nesharim.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday May 21, 2024, 2PM, Online\\
**Gaétan Guillot** (Université Paris-Saclay) //Approximation of linear subspaces by rational linear subspaces//
<button type="link" size="xs" collapse="b28-4397">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4397" collapsed="true">
<well size="sm">
We elaborate on a problem raised by Schmidt in 1967: rational approximation of linear subspaces of $\mathbb{R}^n$. In order to study the quality approximation of irrational numbers by rational ones, one can introduce the exponent of irrationality of a number. We can then generalize this notion in the framework of vector subspaces for the approximation of a subspace by so-called rational subspaces.
After briefly introducing the tools for constructing this generalization, I will present the different possible studies of this object. Finally I will explain how we can construct spaces with prescribed exponents.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday May 7, 2024, 2PM, Online\\
**Tom Kempton** (University of Manchester) //The Dynamics of the Fibonacci Partition Function//
<button type="link" size="xs" collapse="b28-4398">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4398" collapsed="true">
<well size="sm">
The Fibonacci partition function $R(n)$ counts the number of ways of representing a natural number $n$ as the sum of distinct Fibonacci numbers. For example, $R(6)=2$ since $6=5+1$ and $6=3+2+1$. An explicit formula for $R(n)$ was recently given by Chow and Slattery. In this talk we express $R(n)$ in terms of ergodic sums over an irrational rotation, which allows us to prove lots of statements about the local structure of $R(n)$.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday April 23, 2024, 2PM, Online\\
**Shunsuke Usuki** (Kyoto University) //On a lower bound of the number of integers in Littlewood's conjecture//
<button type="link" size="xs" collapse="b28-4399">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4399" collapsed="true">
<well size="sm">
Littlewood's conjecture is a famous and long-standing open problem which states that, for every $(\alpha,\beta) \in \mathbb{R}^2$, $n\|n\alpha\|\|n\beta\|$ can be arbitrarily small for some integer $n$.
This problem is closely related to the action of diagonal matrices on $\mathrm{SL}(3,\mathbb{R})/\mathrm{SL}(3,\mathbb{Z})$, and a groundbreaking result was shown by Einsiedler, Katok and Lindenstrauss from the measure rigidity for this action, saying that Littlewood's conjecture is true except on a set of Hausdorff dimension zero.
In this talk, I will explain about a new quantitative result on Littlewood's conjecture which gives, for every $(\alpha,\beta) \in \mathbb{R}^2$ except on sets of small Hausdorff dimension, an estimate of the number of integers $n$ which make $n\|n\alpha\|\|n\beta\|$ small. The keys for the proof are the measure rigidity and further studies on behavior of empirical measures for the diagonal action.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday March 26, 2024, 2PM, Online\\
**Nikita Shulga** (La Trobe University) //Radical bound for Zaremba’s conjecture//
<button type="link" size="xs" collapse="b28-4400">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4400" collapsed="true">
<well size="sm">
Zaremba's conjecture states that for each positive integer $q$, there exists a coprime integer $a$, smaller than $q$, such that partial quotients in the continued fraction expansion of $a/q$ are bounded by some absolute constant. Despite major breakthroughs in the recent years, the conjecture is still open. In this talk I will discuss a new result towards Zaremba's conjecture, proving that for each denominator, one can find a numerator, such that partial quotients are bounded by the radical of the denominator, i.e. the product of distinct prime factors. This generalizes the result by Niederreiter and improves upon some results of Moshchevitin-Murphy-Shkredov.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday March 12, 2024, 2PM, Online\\
**Joël Ouaknine** (Max Planck Institute for Software Systems) //The Skolem Landscape//
<button type="link" size="xs" collapse="b28-4401">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4401" collapsed="true">
<well size="sm">
The Skolem Problem asks how to determine algorithmically whether a given linear recurrence sequence (such as the Fibonacci numbers) has a zero. It is a central question in dynamical systems and number theory, and has many connections to other branches of mathematics and computer science. Unfortunately, its decidability has been open for nearly a century! In this talk, I will present a survey of what is known on the Skolem Problem and related questions, including recent and ongoing developments.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday January 30, 2024, 2PM, Online\\
**Cathy Swaenepoel** (IMJ-PRG) //Reversible primes//
<button type="link" size="xs" collapse="b28-4402">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4402" collapsed="true">
<well size="sm">
The properties of the digits of prime numbers and various other
sequences of integers have attracted great interest in recent years.
For any positive integer $k$, we denote by $\overleftarrow{k}$ the
reverse of $k$ in base 2, defined by $\overleftarrow{k} = \sum_{j=0}^{n-1} \varepsilon_j\,2^{n-1-j}$ where $k = \sum_{j=0}^{n-1} \varepsilon_{j} \,2^j$ with $\varepsilon_j \in \{0,1\}$, $j\in\{0, \ldots, n-1\}$, $ \varepsilon_{n-1} = 1$. A natural question is to estimate the number
of primes $p\in \left[2^{n-1},2^n\right)$ such that
$\overleftarrow{p}$ is prime.  We will present a result which provides
an upper bound of the expected order of magnitude. Our method is based
on a sieve argument and also allows us to obtain a strong lower bound
for the number of integers $k$ such that $k$ and $\overleftarrow{k}$
have at most 8 prime factors (counted with multiplicity). We will also
present an asymptotic formula for the number of integers
$k\in \left[2^{n-1},2^n\right)$ such that $k$ and $\overleftarrow{k}$
are squarefree.

This is a joint work with Cécile Dartyge, Bruno Martin,
Joël Rivat and Igor Shparlinski.
</well>
</collapse>


[[en:seminaires:numeration:index|One world numeration seminar]]\\
Tuesday January 16, 2024, 2PM, Online\\
**Karma Dajani** (Universiteit Utrecht) //Alternating N-continued fraction expansions//
<button type="link" size="xs" collapse="b28-4403">{{icon>info-circle?lg&color=#777}}</button>\\
<collapse id="b28-4403" collapsed="true">
<well size="sm">
We introduce a family of maps generating continued fractions where the digit 1 in the numerator is replaced cyclically by some given non-negative integers $(N_1, \dots, N_m)$. We prove the convergence of the given algorithm, and study the underlying dynamical system generating such expansions. We prove the existence of a unique absolutely continuous invariant ergodic measure. In special cases, we are able to build the natural extension and give an explicit expression of the invariant measure. For these cases, we formulate a Doeblin-Lenstra type theorem. For other cases we have a more implicit expression that we conjecture gives the invariant density. This conjecture is supported by simulations. For the simulations we use a method that gives us a smooth approximation in every iteration. This is joint work with Niels Langeveld.
</well>
</collapse>