LEADER 00839nam0 2200277 450 001 000020541 005 20090212112305.0 010 $a0198533527 100 $a20081212d1979----km-y0itay50------ba 101 0 $aeng 102 $aGB 105 $aa-------001yy 200 1 $aIdeas of space$eEuclidean, non-Euclidean, and relativistic$fJeremy Gray 210 $aOxford$cClarendon press$d1979 215 $aIX, 224 p.$cill.$d23 cm 500 10$aIdeas of space$947530 610 1 $aGeometria non euclidea 610 1 $aGeometria euclidea 676 $a516$v21$9Geometria 700 1$aGray,$bJeremy J.$f<1947- >$053883 801 0$aIT$bUNIPARTHENOPE$c20081212$gRICA$2UNIMARC 912 $a000020541 951 $aG 516 /2$bG 256$cDSA$d2008 951 $aS 516/2$bS A, 1064$cDSA$d2009 996 $aIdeas of space$947530 997 $aUNIPARTHENOPE LEADER 00877nam0-22002891i-450 001 990004261580403321 005 20180607114315.0 010 $a0-19-255345-3 035 $a000426158 035 $aFED01000426158 035 $a(Aleph)000426158FED01 035 $a000426158 100 $a20010730d1974----km-y0itay50------ba 101 0 $aeng 105 $ay-------001ay 200 1 $a<>Vicar of Wakefield$ea tale supposed to be written by himself$fOliver Goldsmith$gedited with an introduction by Arthur Friedman 210 $aOxford$cOxford University Press$d1974 215 $aXXIII, 207 p.$d21 cm 700 1$aGoldsmith,$bOliver$0387015 702 1$aFriedman,$bArthur 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990004261580403321 952 $aP.3 BR.C.2035$fFLFBC 959 $aFLFBC 996 $aVicar of Wakefield$971244 997 $aUNINA LEADER 03538nam 22006495 450 001 9910148853403321 005 20200703045941.0 010 $a9783319465777 024 7 $a10.1007/978-3-319-46577-7 035 $a(CKB)3710000000918166 035 $a(DE-He213)978-3-319-46577-7 035 $a(MiAaPQ)EBC4723625 035 $a(PPN)196322588 035 $a(EXLCZ)993710000000918166 100 $a20161024d2017 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 14$aThe Euclidean Matching Problem /$fby Gabriele Sicuro 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XIV, 136 p. 50 illus., 6 illus. in color.) 225 1 $aSpringer Theses, Recognizing Outstanding Ph.D. Research,$x2190-5053 300 $a"Doctoral Thesis accepted by The University of Pisa, Italy." 311 $a3-319-46576-7 311 $a3-319-46577-5 320 $aIncludes bibliographical references at the end of each chapters. 327 $aIntroduction -- Optimisation, Disorder and Statistical Mechanics -- Euclidean Matching Problems -- Conclusions. 330 $aThis thesis discusses the random Euclidean bipartite matching problem, i.e., the matching problem between two different sets of points randomly generated on the Euclidean domain. The presence of both randomness and Euclidean constraints makes the study of the average properties of the solution highly relevant. The thesis reviews a number of known results about both matching problems and Euclidean matching problems. It then goes on to provide a complete and general solution for the one dimensional problem in the case of convex cost functionals and, moreover, discusses a potential approach to the average optimal matching cost and its finite size corrections in the quadratic case. The correlation functions of the optimal matching map in the thermodynamical limit are also analyzed. Lastly, using a functional approach, the thesis puts forward a general recipe for the computation of the correlation function of the optimal matching in any dimension and in a generic domain. iv>. 410 0$aSpringer Theses, Recognizing Outstanding Ph.D. Research,$x2190-5053 606 $aPhysics 606 $aStatistical physics 606 $aDynamics 606 $aMathematical physics 606 $aMathematical Methods in Physics$3https://scigraph.springernature.com/ontologies/product-market-codes/P19013 606 $aComplex Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/P33000 606 $aMathematical Physics$3https://scigraph.springernature.com/ontologies/product-market-codes/M35000 606 $aStatistical Physics and Dynamical Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/P19090 615 0$aPhysics. 615 0$aStatistical physics. 615 0$aDynamics. 615 0$aMathematical physics. 615 14$aMathematical Methods in Physics. 615 24$aComplex Systems. 615 24$aMathematical Physics. 615 24$aStatistical Physics and Dynamical Systems. 676 $a511.66 700 $aSicuro$b Gabriele$4aut$4http://id.loc.gov/vocabulary/relators/aut$0477932 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910148853403321 996 $aThe Euclidean Matching Problem$92169040 997 $aUNINA