Zobrazeno 1 - 10
of 2 170
pro vyhledávání: '"CHALOPIN, A."'
The problem of electing a unique leader is central to all distributed systems, including programmable matter systems where particles have constant size memory. In this paper, we present a silent self-stabilising, deterministic, stationary, election a
Externí odkaz:
http://arxiv.org/abs/2408.08775
Local control and mixed dimensions: Exploring high-temperature superconductivity in optical lattices
Autor:
Schlömer, Henning, Lange, Hannah, Franz, Titus, Chalopin, Thomas, Bojović, Petar, Wang, Si, Bloch, Immanuel, Hilker, Timon A., Grusdt, Fabian, Bohrdt, Annabelle
The simulation of high-temperature superconducting materials by implementing strongly correlated fermionic models in optical lattices is one of the major objectives in the field of analog quantum simulation. Here we show that local control and optica
Externí odkaz:
http://arxiv.org/abs/2406.02551
Autor:
Chalopin, Thomas, Bojović, Petar, Bourgund, Dominik, Wang, Si, Franz, Titus, Bloch, Immanuel, Hilker, Timon
Quantum simulations of Hubbard models with ultracold atoms rely on the exceptional control of coherent motion provided by optical lattices. Here we demonstrate enhanced tunability using an optical superlattice in a fermionic quantum gas microscope. W
Externí odkaz:
http://arxiv.org/abs/2405.19322
We prove that any convex geometry $\mathcal{A}=(U,\mathcal{C})$ on $n$ points and any ideal $\mathcal{I}=(U',\mathcal{C}')$ of $\mathcal{A}$ can be realized as the intersection pattern of an open convex polyhedral cone $K\subseteq {\mathbb R}^n$ with
Externí odkaz:
http://arxiv.org/abs/2405.12660
Leader Election is an important primitive for programmable matter, since it is often an intermediate step for the solution of more complex problems. Although the leader election problem itself is well studied even in the specific context of programma
Externí odkaz:
http://arxiv.org/abs/2402.10582
Autor:
Bourgund, Dominik, Chalopin, Thomas, Bojović, Petar, Schlömer, Henning, Wang, Si, Franz, Titus, Hirthe, Sarah, Bohrdt, Annabelle, Grusdt, Fabian, Bloch, Immanuel, Hilker, Timon A.
The relation between d-wave superconductivity and stripes is fundamental to the understanding of ordered phases in cuprates. While experimentally both phases are found in close proximity, numerical studies on the related Fermi-Hubbard model have long
Externí odkaz:
http://arxiv.org/abs/2312.14156
Autor:
Chalopin, Jérémie, Chepoi, Victor
In this note, we prove that finite CAT(0) cube complexes can be reconstructed from their boundary distances (computed in their 1-skeleta). This result was conjectured by Haslegrave, Scott, Tamitegama, and Tan (2023). The reconstruction of a finite ce
Externí odkaz:
http://arxiv.org/abs/2310.04223
Recently, Kirkpatrick et al. [ALT 2019] and Fallat et al. [JMLR 2023] introduced non-clashing teaching and showed it is the most efficient machine teaching model satisfying the Goldman-Mathias collusion-avoidance criterion. A teaching map $T$ for a c
Externí odkaz:
http://arxiv.org/abs/2309.02876
Autor:
Aurore Perrot, Cyrille Hulin, Ariane Boumendil, Hamza Manjra, Antoine Leveque, Carolyne Croizier, Arthur Dony, Mohamad Mohty, Murielle Roussel, Salomon Manier, Frédérique Orsini-Piocelle, Loic Bauschert, Arthur Bobin, Laurent Frenzel, Laure Vincent, Claire Breal, Jean Richard Eveillard, Thomas Gerome, Mourad Tiab, Emilie Chalayer, Rakiba Belkhir, Clara Mariette, Perrine Moyer, Thomas Chalopin, Brieuc Cherel, Lydia Montes, Arthur Coste, Reza Tabrizi, Lionel Karlin, Daniella Robu, Amandine Huguet, Stéphanie Harel, Philippe Moreau
Publikováno v:
Haematologica, Vol 999, Iss 1 (2024)
Not available.
Externí odkaz:
https://doaj.org/article/9864e91acc354bbaad9722e941f391f4
A set $S$ of isometric paths of a graph $G$ is "$v$-rooted", where $v$ is a vertex of $G$, if $v$ is one of the end-vertices of all the isometric paths in $S$. The isometric path complexity of a graph $G$, denoted by $ipco(G)$, is the minimum integer
Externí odkaz:
http://arxiv.org/abs/2301.00278