{"entities":{"Q6879285":{"pageid":20772268,"ns":120,"title":"Item:Q6879285","lastrevid":75322006,"modified":"2026-04-18T16:40:49Z","type":"item","id":"Q6879285","labels":{"en":{"language":"en","value":"Euclidean algorithms are Gaussian over imaginary quadratic fields"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8140809"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6879285$F66FFC95-400A-4BAB-A376-4F85CC7280EC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4934a83c5fb8aa397207776d8413087d328a52fe","datavalue":{"value":{"text":"Euclidean algorithms are Gaussian over imaginary quadratic fields","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6879285$573F5A6E-3CAE-4A44-ACEF-97ACEEA4C74B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"04e42618da800ed36c247f2aee94295b6e404e81","datavalue":{"value":"10.1112/JLMS.70333","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6879285$818471DE-5B2A-41F0-BFDD-CEA4FA22C50D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6b1e6c2fa567c380ab46a4b0c342907797402fa3","datavalue":{"value":{"entity-type":"item","numeric-id":1419700,"id":"Q1419700"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6879285$A8A1C034-BAD5-4439-9266-373BE673A9BF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c56d7467af78c83367fc4858826d19b30720e035","datavalue":{"value":{"entity-type":"item","numeric-id":2986344,"id":"Q2986344"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6879285$1CF3F1CB-4E17-4E48-8F76-6BDB1FE41FC1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e2e94f9799ee6cb88905dbddea9baacba46dd84e","datavalue":{"value":{"entity-type":"item","numeric-id":405950,"id":"Q405950"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6879285$74400E8F-82C5-4F2F-8F47-16AAEBFBF6AB","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"cd06f03000a68ed41ca657843f37f844031b6943","datavalue":{"value":{"entity-type":"item","numeric-id":6536654,"id":"Q6536654"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6879285$3BE6E63C-7F07-4C73-9A7A-20C2287C0679","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"8626ccbf071a020db90493816e8dc39228fc4cee","datavalue":{"value":{"time":"+2026-01-02T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6879285$EEBFCB9C-8A09-4D0F-A42C-8A9159DC1090","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"14b1e2e72abf70ec4b5f1eed344989fe2862ef39","datavalue":{"value":"It is well known that the Euclidean algorithm can be recorded via a continued fraction (CF). That is \\( {a}/{b}:=[a_1,a_2, \\dots, a_{\\ell}]. \\) For a rational \\(x \\in [0,1]\\cap \\mathbb{Q}\\), we let \\(\\ell(x):=\\ell\\) and call it the length of the continued fraction of \\(x\\). Let \\(\\mathcal{O} \\subset \\mathbb{C}\\) be a discrete ring for which the field of fractions is Euclidean. It is one of the imaginary quadratic fields \\(K_d:=\\mathbb{Q}(\\sqrt{-d})\\) for \\(d=1,2,3,7,11\\). It is found a strict fundamental domain \\( I'_d \\subset \\{z \\in \\mathbb{C} : |z|\\leqslant 1\\}\\) of the translation action of \\(\\mathcal{O}_d\\) on \\(\\mathbb{C}\\) for such \\(K_d\\) and its ring of integers \\(\\mathcal{O}_d\\). An analogue of the Gauss map is defined. It is called the Hurwitz CF map or the nearest integer complex CF map. A dynamical framework for the statistical study of \\(K\\)-rational trajectories based on the transfer operator methods is presented.\\N\\NThe following theorem is one of the main results of the article.\\N\\N\\textbf{Theorem.} Let \\(c : \\mathcal{O} \\to \\mathbb{R}_{\\geqslant 0}\\) be bounded and not cohomologous to zero. The distribution of the total cost \\(C\\) on\\N\\[\\N\\Omega_N := \\left\\{\\frac{a}{b} \\in I : |b|^2 < N \\right\\}\\N\\]\\Nis asymptotically Gaussian, that is, there exist real numbers \\(\\mu(c), \\delta(c)>0\\) such that for any \\(u \\in \\mathbb{R}\\),\\N\\[\\N\\mathbb{P}_N \\left[\\frac{C-\\mu(c) \\log N}{\\delta(c)\\sqrt{\\log N}}\\leqslant u\\right]=\\frac{1}{\\sqrt{2\\pi}} \\int_{-\\infty}^u e^{-\\frac{t^2}{2}} dt +O\\left(\\frac{1}{\\sqrt{\\log N}} \\right)\\N\\]\\Nas \\(N \\to \\infty\\), where \\(\\mathbb{P}_N\\) denotes the uniform probability measure on \\(\\Omega_N\\).The expectation and variance satisfy\\N\\[\\N\\mathbb{E}_N [C|\\Omega_N]=\\mu(c) \\log N+\\mu_1(c)+ O(N^{-\\gamma}),\\N\\]\\N\\[\\N\\mathbb{V}_N [C|\\Omega_N]= \\delta(c) \\log N+\\delta_1(c)+O(N^{-\\gamma}),\\N\\]\\Nfor some \\( \\mu_1(c), \\delta_1(c)\\), and \\(\\gamma>0\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q6879285$FF35E489-BFD3-4BC6-9B0B-34F07B9E4806","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"a02b6451421b7c62c8833d07cf80546c33864bd5","datavalue":{"value":{"entity-type":"item","numeric-id":590236,"id":"Q590236"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6879285$A9DDB618-549E-45FF-8C24-7116D4277143","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"5648d57cf9b82b961864414b7326649c4d02c6a2","datavalue":{"value":"11J70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6879285$038D0271-771C-4E40-B76D-859723D52162","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ded796ece5f27b2ecdda30dbaa787678fc66e6b6","datavalue":{"value":"37C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6879285$525FAEE0-E51E-4346-9C6A-98749CFD1EC7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"06501b652e368cc105ad78a5eac217e38c314cda","datavalue":{"value":"60F05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6879285$F2EC020F-9A7F-40E8-9A92-F8C9538710B8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1c745fe9f9fd950076cb858ccadc78c0e065cb45","datavalue":{"value":"11R04","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6879285$93195327-271C-4011-82ED-B3C9C32C0ECC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"93f96e37eaca2264ee00fca1dd01bab35c6141a7","datavalue":{"value":"8140809","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6879285$66CDE55C-5EFA-41EE-A4C5-6075155ECA92","rank":"normal"}],"P163":[{"mainsnak":{"snaktype":"value","property":"P163","hash":"45fcd4163b5f33e6e8c784f5522d7246c0a1a61e","datavalue":{"value":{"entity-type":"item","numeric-id":57056,"id":"Q57056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6879285$3D670C0E-5458-47CB-ACF6-D678415FF175","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9ad86bb53b74d37af3a4d36e8a96c2c4376ac4b1","datavalue":{"value":"continued fractions","type":"string"},"datatype":"string"},"type":"statement","id":"Q6879285$8548A780-6887-4E68-AB09-0409B5130A4A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"87f0b6cc8cca3d50568cd940adc4f3cc51b078bf","datavalue":{"value":"central limit theorems","type":"string"},"datatype":"string"},"type":"statement","id":"Q6879285$32B752C9-EC15-4E54-906A-2144B34C9DE4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fc7e860b29030f7d7d7722a761fe9974d657a6c7","datavalue":{"value":"algebraic numbers","type":"string"},"datatype":"string"},"type":"statement","id":"Q6879285$A4D24025-FE64-462F-AF45-2D407390B815","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"554ce1904bc7aad8ab28dec67ee5f4a3db655bbe","datavalue":{"value":"dynamical systems","type":"string"},"datatype":"string"},"type":"statement","id":"Q6879285$AEE7B467-2365-43FA-8005-A2BA2CD0C74D","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6879285$8BC181C7-88F4-4170-9A6B-208D79764F8D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Euclidean algorithms are Gaussian over imaginary quadratic fields","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Euclidean_algorithms_are_Gaussian_over_imaginary_quadratic_fields"}}}}}