English
Related papers

Related papers: Computational Euclid

200 papers

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

Logic in Computer Science · Computer Science 2019-07-19 Mario Carneiro

In this article, we pursue our investigation of the connections between the theory of computation and hydrodynamics. We prove the existence of stationary solutions of the Euler equations in Euclidean space, of Beltrami type, that can…

Analysis of PDEs · Mathematics 2023-06-16 Robert Cardona , Eva Miranda , Daniel Peralta-Salas

A unifying approach to software and hardware design generated by ideas of Idempotent Mathematics is discussed. The so-called idempotent correspondence principle for algorithms, programs and hardware units is described. A software project…

Quantum Physics · Physics 2016-09-08 G. L. Litvinov , V. P. Maslov , A. Ya. Rodionov

There are two schools of "measurement-only quantum computation". The first ([11]) using prepared entanglement (cluster states) and the second ([4]) using collections of anyons, which according to how they were produced, also have an…

Quantum Physics · Physics 2021-01-29 Michael Freedman , Modjtaba Shokrian-Zini , Zhenghan Wang

Topological integral transforms have found many applications in shape analysis, from prediction of clinical outcomes in brain cancer to analysis of barley seeds. Using Euler characteristic as a measure, these objects record rich geometric…

Computational Geometry · Computer Science 2024-05-06 Vadim Lebovici , Steve Oudot , Hugo Passe

At any point of a surface in the four-dimensional Euclidean space we consider the geometric configuration consisting of two figures: the tangent indicatrix, which is a conic in the tangent plane, and the normal curvature ellipse. We show…

Differential Geometry · Mathematics 2009-05-28 Georgi Ganchev , Velichka Milousheva

We introduce a new method of generating Computer Aided Design (CAD) profiles via a sequence of simple geometric constructions including curve offsetting, rotations and intersections. These sequences start with geometry provided by a…

Machine Learning · Computer Science 2026-01-15 Siyi Li , Joseph G. Lambourne , Longfei Zhang , Pradeep Kumar Jayaraman , Karl. D. D. Willis

This paper explores hierarchical clustering in the case where pairs of points have dissimilarity scores (e.g. distances) as a part of the input. The recently introduced objective for points with dissimilarity scores results in every tree…

Machine Learning · Computer Science 2020-09-01 Benjamin Moseley , Yuyan Wang

Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound $C$, there are finitely many diagrams of size at most $C$. Given a NET map $F$ presented by a diagram of size at…

Dynamical Systems · Mathematics 2018-12-05 William Floyd , Walter Parry , Kevin M. Pilgrim

We present a systematic, algebraically based, design methodology for efficient implementation of computer programs optimized over multiple levels of the processor/memory and network hierarchy. Using a common formalism to describe the…

Mathematical Software · Computer Science 2008-03-18 Lenore R. Mullin , James E. Raynolds

We re-derive Thales, Pythagoras, Apollonius, Stewart, Heron, al Kashi, de Gua, Terquem, Ptolemy, Brahmagupta and Euler's theorems as well as the inscribed angle theorem, the law of sines, the circumradius, inradius and some angle bisector…

General Mathematics · Mathematics 2023-01-31 Martin Buysse

We study the problem of searching for a target at some unknown location in $\mathbb{R}^d$ when additional information regarding the position of the target is available in the form of predictions. In our setting, predictions come as…

Computational Geometry · Computer Science 2025-04-08 Sergio Cabello , Panos Giannopoulos

According to the Church-Turing Thesis (CTT), effective formal behaviours can be simulated by Turing machines; this has naturally led to speculation that physical systems can also be simulated computationally. But is this wider claim true,…

Quantum Physics · Physics 2008-11-10 Mike Stannett

Some of the basic concepts of topology are explored through known physics problems. This helps us in two ways, one, in motivating the definitions and the concepts, and two, in showing that topological analysis leads to a clearer…

Other Condensed Matter · Physics 2016-11-09 Somendra M Bhattacharjee

In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula…

Quantum Physics · Physics 2007-05-23 Vladan Pankovic , Milan Predojevic

Geometric algebra is the natural outgrowth of the concept of a vector and the addition of vectors. After reviewing the properties of the addition of vectors, a multiplication of vectors is introduced in such a way that it encodes the famous…

General Mathematics · Mathematics 2018-02-23 Sergio Ramos Ramirez , Jose Alfonso Juarez Gonzalez , Garret Sobczyk

In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes.…

Information Theory · Computer Science 2015-09-21 João E. Strapasson , Cristiano Torezzan

The 2-point correlation function of the galaxy spatial distribution is a major cosmological observable that enables constraints on the dynamics and geometry of the Universe. The Euclid mission aims at performing an extensive spectroscopic…

Cosmology and Nongalactic Astrophysics · Physics 2025-08-13 Euclid Collaboration , S. de la Torre , F. Marulli , E. Keihänen , A. Viitanen , M. Viel , A. Veropalumbo , E. Branchini , D. Tavagnacco , F. Rizzo , J. Valiviita , V. Lindholm , V. Allevato , G. Parimbelli , E. Sarpa , Z. Ghaffari , A. Amara , S. Andreon , N. Auricchio , C. Baccigalupi , M. Baldi , S. Bardelli , A. Basset , D. Bonino , M. Brescia , J. Brinchmann , A. Caillat , S. Camera , V. Capobianco , C. Carbone , J. Carretero , S. Casas , F. J. Castander , M. Castellano , G. Castignani , S. Cavuoti , A. Cimatti , C. Colodro-Conde , G. Congedo , C. J. Conselice , L. Conversi , Y. Copin , F. Courbin , H. M. Courtois , M. Crocce , A. Da Silva , H. Degaudenzi , G. De Lucia , A. M. Di Giorgio , J. Dinis , F. Dubath , C. A. J. Duncan , X. Dupac , S. Dusini , M. Farina , S. Farrens , F. Faustini , S. Ferriol , N. Fourmanoit , M. Frailis , E. Franceschi , P. Franzetti , M. Fumana , S. Galeotta , K. George , W. Gillard , B. Gillis , C. Giocoli , P. Gómez-Alvarez , B. R. Granett , A. Grazian , F. Grupp , L. Guzzo , S. V. H. Haugan , W. Holmes , F. Hormuth , A. Hornstrup , S. Ilić , K. Jahnke , M. Jhabvala , B. Joachimi , S. Kermiche , A. Kiessling , M. Kilbinger , B. Kubik , M. Kunz , H. Kurki-Suonio , S. Ligori , P. B. Lilje , I. Lloro , G. Mainetti , D. Maino , E. Maiorano , O. Mansutti , O. Marggraf , K. Markovic , M. Martinelli , N. Martinet , R. Massey , S. Maurogordato , E. Medinaceli , S. Mei , M. Melchior , Y. Mellier , M. Meneghetti , E. Merlin , G. Meylan , M. Moresco , B. Morin , L. Moscardini , E. Munari , C. Neissner , S. -M. Niemi , C. Padilla , S. Paltani , F. Pasian , K. Pedersen , W. J. Percival , V. Pettorino , S. Pires , G. Polenta , M. Poncet , L. Pozzetti , F. Raison , A. Renzi , J. Rhodes , G. Riccio , E. Romelli , M. Roncarelli , E. Rossetti , R. Saglia , Z. Sakr , A. G. Sánchez , D. Sapone , B. Sartoris , P. Schneider , T. Schrabback , M. Scodeggio , A. Secroun , E. Sefusatti , G. Seidel , M. Seiffert , S. Serrano , C. Sirignano , G. Sirri , L. Stanco , J. Steinwagner , C. Surace , P. Tallada-Crespí , A. N. Taylor , I. Tereno , R. Toledo-Moreo , F. Torradeflot , A. Tsyganov , I. Tutusaus , L. Valenziano , T. Vassallo , Y. Wang , J. Weller , A. Zacchei , G. Zamorani , E. Zucca , A. Biviano , M. Bolzonella , E. Bozzo , C. Burigana , M. Calabrese , D. Di Ferdinando , J. A. Escartin Vigo , R. Farinelli , F. Finelli , L. Gabarra , J. Gracia-Carpio , S. Matthew , N. Mauri , A. Mora , A. Pezzotta , M. Pöntinen , V. Scottez , P. Simon , A. Spurio Mancini , M. Tenti , M. Wiesmann , Y. Akrami , I. T. Andika , S. Anselmi , M. Archidiacono , F. Atrio-Barandela , A. Balaguera-Antolinez , D. Bertacca , M. Bethermin , A. Blanchard , L. Blot , H. Böhringer , S. Borgani , M. L. Brown , S. Bruton , R. Cabanac , A. Calabro , B. Camacho Quevedo , G. Cañas-Herrera , A. Cappi , F. Caro , C. S. Carvalho , T. Castro , K. C. Chambers , F. Cogato , S. Contarini , A. R. Cooray , O. Cucciati , S. Davini , F. De Paolis , G. Desprez , A. Díaz-Sánchez , S. Di Domizio , H. Dole , S. Escoffier , A. G. Ferrari , P. G. Ferreira , A. Finoguenov , A. Fontana , K. Ganga , J. García-Bellido , T. Gasparetto , V. Gautard , E. Gaztanaga , F. Giacomini , F. Gianotti , G. Gozaliasl , A. Gregorio , M. Guidi , C. M. Gutierrez , A. Hall , S. Hemmati , H. Hildebrandt , J. Hjorth , A. Jimenez Muñoz , S. Joudaki , J. J. E. Kajava , Y. Kang , V. Kansal , D. Karagiannis , C. C. Kirkpatrick , S. Kruk , M. Lattanzi , A. M. C. Le Brun , S. Lee , J. Le Graet , L. Legrand , M. Lembo , J. Lesgourgues , T. I. Liaudat , A. Loureiro , J. Macias-Perez , M. Magliocchetti , F. Mannucci , R. Maoli , J. Martín-Fleitas , C. J. A. P. Martins , L. Maurin , R. B. Metcalf , M. Miluzio , P. Monaco , C. Moretti , G. Morgante , C. Murray , S. Nadathur , K. Naidoo , A. Navarro-Alsina , S. Nesseris , K. Paterson , L. Patrizii , A. Pisani , V. Popa , D. Potter , P. Reimberg , I. Risso , P. -F. Rocci , M. Sahlén , A. Schneider , M. Schultheis , D. Sciotti , E. Sellentin , M. Sereno , A. Silvestri , L. C. Smith , K. Tanidis , C. Tao , N. Tessore , G. Testera , R. Teyssier , S. Toft , S. Tosi , A. Troja , M. Tucci , C. Valieri , D. Vergani , G. Verza , P. Vielzeuf , N. A. Walton

This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…

Quantum Physics · Physics 2015-04-08 Keisuke Fujii

We describe in detail a general strategy for implementing a conditional geometric phase between two spins. Combined with single-spin operations, this simple operation is a universal gate for quantum computation, in that any unitary…

Quantum Physics · Physics 2015-06-26 A. Ekert , M. Ericsson , P. Hayden , H. Inamori , J. A. Jones , D. K. L. Oi , V. Vedral
‹ Prev 1 8 9 10 Next ›