Thomas Fernique
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Thomas Fernique has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
Amir Hashemi
Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, Iran
1 shared publication- Carole Porrier
LIPN, Université Sorbonne Paris Nord, Villetaneuse, France
1 shared publication - Ilya Galanov
LIPN, CNRS & University Paris 13, France
1 shared publication - Mathieu Sablik
Université Paul Sabatier, France
1 shared publication Nicolas Bédaride
Aix Marseille Université, CNRS, Centrale Marseille, I2M, UMR 7373, Marseille, France
1 shared publication- Nicolas Bédaride
UMR Aix Marseille Université CNRS Centrale Marseille I2M 7373 13453 Marseille France
1 shared publication
Latest Publications
- 6 August 2024
- Published by Elsevier in Computational Geometry
- Vol. 124-125
Packing unequal disks in the Euclidean plane
- 6 August 2024
- Published by Elsevier in Computational Geometry
- Vol. 124-125
Packing unequal disks in the Euclidean plane
- 29 October 2022
- Published by Springer Nature
- p. 574-589
A General Approach to Ammann Bars for Aperiodic Tilings
- 29 October 2022
- Published by Springer Nature
- p. 574-589
A General Approach to Ammann Bars for Aperiodic Tilings
- 18 October 2022
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 194
Density of binary disc packings: Playing with stoichiometry
- 18 October 2022
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 194
Density of binary disc packings: Playing with stoichiometry
- Open Access
Density of binary disc packings: lower and upper bounds
We provide, for any $r\in (0,1)$, lower and upper bounds on the maximal density of a packing in the Euclidean plane of discs of radius $1$ and $r$. The lower bounds are mostly folk, but the upper bounds improve the best previously known ones for any $r\in[0.11,0.74]$. For many values of $r$, this gives a fairly good idea of the exact maximum density. In particular, we get new intervals for $r$ which does not allow any packing more dense that the hexagonal packing of equal discs.Open AccessDensity of binary disc packings: lower and upper bounds
We provide, for any $r\in (0,1)$, lower and upper bounds on the maximal density of a packing in the Euclidean plane of discs of radius $1$ and $r$. The lower bounds are mostly folk, but the upper bounds improve the best previously known ones for any $r\in[0.11,0.74]$. For many values of $r$, this gives a fairly good idea of the exact maximum density. In particular, we get new intervals for $r$ which does not allow any packing more dense that the hexagonal packing of equal discs. - 19 May 2022
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 33 (2) , 235-246
Density of Binary Disc Packings: Lower and Upper Bounds
We provide, for any , lower and upper bounds on the maximal density of a packing in the Euclidean plane of discs of radius 1 and r. The lower bounds are mostly folk, but the upper bounds improve the best previously known ones for any . For many values of r, this gives a fairly good idea of the exact maximum density. In particular, we get new intervals for r which does not allow any packing more dense that the hexagonal packing of equal discs.- 19 May 2022
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 33 (2) , 235-246
Density of Binary Disc Packings: Lower and Upper Bounds
We provide, for any , lower and upper bounds on the maximal density of a packing in the Euclidean plane of discs of radius 1 and r. The lower bounds are mostly folk, but the upper bounds improve the best previously known ones for any . For many values of r, this gives a fairly good idea of the exact maximum density. In particular, we get new intervals for r which does not allow any packing more dense that the hexagonal packing of equal discs.- 23 January 2022
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 67 (3) , 787-810
Density of Binary Disc Packings: The Nine Compact Packings
- 23 January 2022
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 67 (3) , 787-810
Density of Binary Disc Packings: The Nine Compact Packings
- 16 January 2020
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 66 (2) , 613-635
Compact Packings of the Plane with Three Sizes of Discs
- 16 January 2020
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 66 (2) , 613-635
Compact Packings of the Plane with Three Sizes of Discs
- Open Access
- 1 January 2020
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1458 (1) , 012001
Local growth of planar rhombus tilings
This paper is motivated by the issue of quasicrystal growth. It describes a simple local algorithm which appears to grow an infinite family of aperiodic tilings. Starting from a seed, tiles are added one by one at randomly chosen sites. A tile is added only if there is only one way to do this so that no forbidden local configuration is created. This algorithm rapidly grows large round-shaped patterns, up to a proportion of missing tiles which can be made arbitrarily small by taking a large enough seed.
- 1 January 2020
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1458 (1) , 012001
Open AccessLocal growth of planar rhombus tilings
This paper is motivated by the issue of quasicrystal growth. It describes a simple local algorithm which appears to grow an infinite family of aperiodic tilings. Starting from a seed, tiles are added one by one at randomly chosen sites. A tile is added only if there is only one way to do this so that no forbidden local configuration is created. This algorithm rapidly grows large round-shaped patterns, up to a proportion of missing tiles which can be made arbitrarily small by taking a large enough seed.
- 10 October 2019
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 65 (4) , 1287-1295
Compact Packings of Space with Two Sizes of Spheres
- 10 October 2019
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 65 (4) , 1287-1295
Compact Packings of Space with Two Sizes of Spheres
- 5 April 2018
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 39 (12) , 3322-3346
Weak colored local rules for planar tilings
A linear subspace $E$ of $\mathbb{R}^{n}$ hascolored local rulesif there exists a finite set of decorated tiles whose tilings are digitizations of $E$ . The local rules areweakif the digitizations can slightly wander around $E$ . We prove that a linear subspace has weak colored local rules if and only if it is computable. This goes beyond previous results, all based on algebraic subspaces. We prove an analogous characterization for sets of linear subspaces, including the set of all the linear subspaces of $\mathbb{R}^{n}$ .- 5 April 2018
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 39 (12) , 3322-3346
Weak colored local rules for planar tilings
A linear subspace $E$ of $\mathbb{R}^{n}$ hascolored local rulesif there exists a finite set of decorated tiles whose tilings are digitizations of $E$ . The local rules areweakif the digitizations can slightly wander around $E$ . We prove that a linear subspace has weak colored local rules if and only if it is computable. This goes beyond previous results, all based on algebraic subspaces. We prove an analogous characterization for sets of linear subspaces, including the set of all the linear subspaces of $\mathbb{R}^{n}$ .