One world numeration seminar
Tuesday April 29, 2025, 2PM, Online
Yan Huang (Chongqing University) The Coincidence of Rényi–Parry Measures for $\beta$-Transformation
One world numeration seminar
Tuesday April 15, 2025, 2PM, Online
James Cumberbatch (Purdue University) Smooth numbers with restricted digits
One world numeration seminar
Tuesday April 1, 2025, 2PM, Online
Meng Wu (Oulun yliopisto) On normal numbers in fractals
Another way to obtain normal numbers from K is by rescaling and translating $K$, then examining the transformed set. A recent nice result by Dayan, Ganguly, and Barak Weiss shows that for any irrational number $t$, for $\mu$-almost all $x \in K$, the product $tx$ is 3-normal.
In this talk, we will discuss these results and their generalizations, including replacing $p$ with an arbitrary beta number and considering more general times-3 invariant measures instead of the Cantor–Lebesgue measure.
One world numeration seminar
Tuesday March 18, 2025, 2PM, Online
Valentin Ovsienko (CNRS, Université de Reims-Champagne-Ardenne) From Catalan numbers to integrable dynamics: continued fractions and Hankel determinants for q-numbers
One world numeration seminar
Tuesday February 18, 2025, 2PM, Online
Neil Macvicar (Queen's University) Intersecting Cantor sets generated by Complex Radix Expansions
One world numeration seminar
Tuesday February 4, 2025, 2PM, Online
Giulia Salvatori (Politecnico di Torino) Continued Fractions, Quadratic Forms, and Regulator Computation for Integer Factorization
In this seminar, we present our algorithm, which is a refinement of Elia's method, along with a precise analysis of its computational cost. Our algorithm is polynomial-time, provided knowledge of a (not too large) multiple of the regulator of $\mathbb{Q}(\sqrt{N})$. The computation of the regulator governs the total computational cost, which is subexponential, and in particular $O(\exp(\frac{3}{\sqrt{8}}\sqrt{\ln N \ln \ln N}))$. This makes our method more efficient than CFRAC and SQUFOF, though less efficient than the General Number Field Sieve.
We identify a broad family of integers to which our method is applicable including certain classes of RSA moduli. Finally, we introduce some promising avenues for refining our method. These span several areas, ranging from Algebraic Number Theory, particularly for estimating the size of the regulator of $\mathbb{Q}(\sqrt{N})$, to Analytic Number Theory, particularly for computing a specific class of $L$-functions.
Joint work with Nadir Murru.
One world numeration seminar
Tuesday January 21, 2025, 2PM, Online
Thomas Garrity (Williams College) Multi-dimensional continued fractions and integer partitions: Using the Natural Extension to create a tree structure on partitions
As we will see, the triangle map gives an almost internal symmetry from the set of integer partitions to itself, which in turn allows the generation of any number of new partition identities.
Further, this allows us to place a tree structure on the space of all integer partitions. (This is joint work with Joe Fox and with Jacob Lehmann Duke). This tree structure allowed us to find the natural extension of the triangle map in any dimension. As with the classical Farey map, the dynamics of this map, in every dimension, has an indifferent fixed point, which in turn can be used to understand the structure of the integer partition tree.
Among the many different types of multi-dimensional continued fractions that exist, for still unknown reasons it appears that the triangle map is the only one that is “partition” compatible.
Thus we use the triangle map (stemming from number theory and dynamics) to understand classical integer partition numbers from combinatorics, and use partition numbers to understand the dynamics of the triangle map.
One world numeration seminar
Tuesday January 7, 2025, 2PM, Online
Jean-Paul Allouche (CNRS, IMJ-PRG, Sorbonne Université) Kolam, Ethnomathematics, and Morphisms