Sphere Packings, Lattices and Groups
The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Mann, H. B. (1961) · Technometrics · doi:10.1080/00401706.1961.10489978 · Cited by 1,069
The packing number of the double vertex graph of the path graph
Soto, J. M. G., Leaños, J., Ríos-Castro, L. M., & Rivera, L. M. (2018) · Discrete Applied Mathematics · doi:10.1016/j.dam.2018.03.085 · Cited by 25
On the Diagonalization of Quadratic Forms
Lam, T. Y. (1999) · Mathematics Magazine · doi:10.1080/0025570x.1999.11996736 · Cited by 8
Voronoi Cells of Lattices and Quantization Errors
Conway, J. H., & Sloane, N. J. A. (1999) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-6568-7_21 · Cited by 5
Self-citationA Characterization of the Leech Lattice
Conway, J. H. (1988) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2016-7_12 · Cited by 3
Self-citationChiswell, I. (2008) · Springer eBooks · doi:10.1007/978-1-84800-940-0_5 · Cited by 2
Integral lattices and quadratic forms
Degtyarev, A., Itenberg, I., & Kharlamov, V. (2000) · Lecture notes in mathematics · doi:10.1007/bfb0103963 · Cited by 2
On an error-correcting code problemPreprint
Soto, J. M. G., Leaños, J., Ríos-Castro, L. M., et al. (2017) · arXiv (Cornell University) · Cited by 2
Enumeration of Unimodular Lattices
Conway, J. H., & Sloane, N. J. A. (1999) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-6568-7_16 · Cited by 2
Self-citationFinding the Closest Lattice Point
Conway, J. H., & Sloane, N. J. A. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2249-9_20 · Cited by 1
Self-citation
Cited by
Items 201–300 of 905
On separation of minimal Riesz energy points on spheres in Euclidean spaces
Kuijlaars, A. B. J., Saff, E. B., & Sun, X. (2006) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2005.04.074 · Cited by 34
Effective experimental designs for optimizing fish feeds
Ruohonen, K., & Kettunen, J. (2004) · Aquaculture Nutrition · doi:10.1111/j.1365-2095.2004.00277.x · Cited by 34
Polar Codes and Polar Lattices for Independent Fading Channels
Лиу, Л., & Ling, C. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2613109 · Cited by 34
A 2-adic approach to the analysis of cyclic codes
Calderbank, A. R., Li, W.-C. W., & Poonen, B. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.568706 · Cited by 34
$U(1)^m$ modular invariants, N=2 minimal models, and the quantum Hall effectPreprint
Gannon, T. J. (1996) · Cited by 34
Type II Self-Dual Codes over Finite Rings and Even Unimodular Lattices
Dougherty, S. T., Gulliver, T. A., & Harada, M. (1999) · Journal of Algebraic Combinatorics · doi:10.1023/a:1018696102510 · Cited by 33
Mézard, M., & Parisi, G. (2012) · Wiley eBooks · doi:10.1002/9781118202470.ch4 · Cited by 38
Akhtarkavan, E., Majidi, B., & Mandegari, A. (2023) · IEEE Access · doi:10.1109/access.2023.3238575 · Cited by 32
On the value-distribution of Epstein zeta-functions
Steuding, J. (2007) · Publicacions Matemàtiques · doi:10.5565/publmat_pjtn05_12 · Cited by 32
Spatial Lattice Modulation for MIMO Systems
Choi, J., Nam, Y., & Lee, N. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2827325 · Cited by 32
Nonclassical Rotational Inertia of a Supersolid
Aftalion, A., Blanc, X., & Jerrard, R. L. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.135301 · Cited by 31
A modification of the Lloyd algorithm for k-anonymous quantization
Rebollo‐Monedero, D., Forné, J., Segarra, E. P., & Parra‐Arnau, J. (2012) · Information Sciences · doi:10.1016/j.ins.2012.08.022 · Cited by 31
Classification of integral lattices with large class number
Scharlau, R., & Hemkemeier, B. (1998) · Mathematics of Computation · doi:10.1090/s0025-5718-98-00938-7 · Cited by 31
On a class of non-simply connected Calabi–Yau 3-folds
Bouchard, V., & Donagi, R. Y. (2008) · Communications in Number Theory and Physics · doi:10.4310/cntp.2008.v2.n1.a1 · Cited by 34
Beamforming Codebooks for Two Transmit Antenna Systems Based on Optimum Grassmannian Packings
Pitaval, R.-A., Määttänen, H., Schober, K., Tirkkonen, O., & Wichman, R. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165820 · Cited by 30
Thermally enhanced polyolefin composites: fundamentals, progress, challenges, and prospects
Chaudhry, A. U., Mabrouk, A., & Abdala, A. A. (2020) · Science and Technology of Advanced Materials · doi:10.1080/14686996.2020.1820306 · Cited by 34
Schwerdtfeger, P., Burrows, A., & Smits, O. R. (2021) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.1c00012 · Cited by 30
Efficient LBM Visual Simulation on Face-Centered Cubic Lattices
Petkov, K., Qiu, F., Fan, Z. Y., Kaufman, A. E., & Mueller, K. D. (2009) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2009.32 · Cited by 30
Infinitely many hyperbolic Coxeter groups through dimension 19
Allcock, D. (2006) · Geometry & Topology · doi:10.2140/gt.2006.10.737 · Cited by 30
The weight hierarchy of the Kasami codes
Helleseth, T., & Kumar, P. V. (1995) · Discrete Mathematics · doi:10.1016/0012-365x(94)00030-m · Cited by 30
Double Circulant Codes over $$\mathbb{Z}_4 $$ and Even Unimodular Lattices
Calderbank, A. R., & Sloane, N. J. A. (1997) · Journal of Algebraic Combinatorics · doi:10.1023/a:1008639004036 · Cited by 30
Self-citationOptimal shaping properties of the truncated polydisc
Kschischang, F. R., & Pasupathy, S. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.335900 · Cited by 30
Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals. I
Willis, N. P., & Bresler, Y. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.567677 · Cited by 37
Classification of Unitary RCFTs with Two Primaries and Central Charge Less Than 25
Mukhi, S., & Rayhaun, B. C. (2023) · Communications in Mathematical Physics · doi:10.1007/s00220-023-04681-1 · Cited by 45
Tharmalingam, T., Sunley, K., Spearman, M. A., & Butler, M. (2011) · Molecular Biotechnology · doi:10.1007/s12033-011-9401-y · Cited by 31
Faceting and Commensurability in Crystal Structures of Colloidal Thin Films
Ramiro‐Manzano, F., Meseguer, F. J., Bonet, E., & Rodríguez, I. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.028304 · Cited by 29
Successive refinement lattice vector quantization
Mukherjee, D., & Mitra, S. K. (2002) · IEEE Transactions on Image Processing · doi:10.1109/tip.2002.806235 · Cited by 29
Fast Variable Density 3-D Node Generation
van der Sande, K., & Fornberg, B. (2021) · SIAM Journal on Scientific Computing · doi:10.1137/20m1337016 · Cited by 29
Ground state of a large number of particles on a frozen topography
Travesset, A. (2005) · Physical Review E · doi:10.1103/physreve.72.036110 · Cited by 29
Robust low-delay audio coding using multiple descriptions
Schuller, G., Kovačević, J., Masson, F. R., & Goyal, V. K. (2005) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/tsa.2005.853205 · Cited by 29
Space–Time Codes From Structured Lattices
Kumar, K. R., & Caire, G. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2009595 · Cited by 29
Solution of the Coincidence Problem in Dimensions d ≤ 4
Michael Baake, A. (1997) · Springer eBooks · doi:10.1007/978-94-015-8784-6_2 · Cited by 44
Subramaniam, A. D., Gardner, W. R., & Rao, B. D. (2006) · IEEE Transactions on Audio Speech and Language Processing · doi:10.1109/tsa.2005.855839 · Cited by 29
Unshared Secret Key Cryptography
Liu, S., Hong, Y., & Viterbo, E. (2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.2364022 · Cited by 28
New formulations for the Kissing Number Problem
Kucherenko, S. S., Belotti, P., Liberti, L., & Maculan, N. (2007) · Discrete Applied Mathematics · doi:10.1016/j.dam.2006.05.012 · Cited by 28
The modulo-lattice channel: the key feature in precoding schemes
Fischer, R. F. H. (2005) · AEU - International Journal of Electronics and Communications · doi:10.1016/j.aeue.2004.11.028 · Cited by 28
Asymptotics of best-packing on rectifiable sets
Borodachov, S. V., Hardin, D. P., & Saff, E. B. (2007) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-07-08975-7 · Cited by 28
Size of the Dictionary in Matching Pursuit Algorithm
Liu, Q., Wang, Q., & Wu, L. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.837423 · Cited by 28
Efficient quantization for overcomplete expansions in /spl Ropf//sup N/
Beferull‐Lozano, B., & Ortega, A. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.806117 · Cited by 28
Achieving Secrecy Capacity of the Gaussian Wiretap Channel With Polar Lattices
Лиу, Л., Yan, Y., & Ling, C. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2794327 · Cited by 27
Askri, A., & Othman, G. R.-B. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849786 · Cited by 33
Conformal Field Theories with Sporadic Group Symmetry
Bae, J.-B., Harvey, J. A., Lee, K., Lee, S., & Rayhaun, B. C. (2021) · Communications in Mathematical Physics · doi:10.1007/s00220-021-04207-7 · Cited by 40
Zhang, X., & Wu, X. (2023) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52729.2023.00987 · Cited by 50
Deterministic Identification for Molecular Communications Over the Poisson Channel
Salariseddigh, M. J., Jamali, V., Pereg, U., Boche, H., Deppe, C., & Schober, R. (2023) · IEEE Transactions on Molecular Biological and Multi-Scale Communications · doi:10.1109/tmbmc.2023.3324487 · Cited by 34
Holographic description of Narain CFTs and their code-based ensembles
Aharony, O., Dymarsky, A. Y., & Shapere, A. D. (2024) · Journal of High Energy Physics · doi:10.1007/jhep05(2024)343 · Cited by 45
Constraints on CaCO3 precipitation in superabsorbent polymer by aerobic bacteria
Nielsen, S. D., Koren, K., Löbmann, K., Hinge, M., Scoma, A., Kjeldsen, K. U., & Røy, H. (2019) · Applied Microbiology and Biotechnology · doi:10.1007/s00253-019-10215-4 · Cited by 27
Voigt‐Martin, I. G., Zhang, Z. X., Kolb, U., & Gilmore, C. (1997) · Ultramicroscopy · doi:10.1016/s0304-3991(97)00006-5 · Cited by 27
Kählerian K3 surfaces and Niemeier lattices. I
Nikulin, V. V. (2013) · Izvestiya Mathematics · doi:10.1070/im2013v077n05abeh002666 · Cited by 26
Semicoherent search strategy for known continuous wave sources in binary systems
Messenger, C. (2011) · Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields · doi:10.1103/physrevd.84.083003 · Cited by 26
Layering transitions in confined colloidal crystals: The hcp-like phase
Ramiro‐Manzano, F., Bonet, E., Rodríguez, I., & Meseguer, F. J. (2007) · Physical Review E · doi:10.1103/physreve.76.050401 · Cited by 26
Rebollo‐Monedero, D., Forné, J., & Soriano, M. (2011) · Data & Knowledge Engineering · doi:10.1016/j.datak.2011.06.005 · Cited by 28
From sticky-hard-sphere to Lennard-Jones-type clusters
Trombach, L., Hoy, R. S., Wales, D. J., & Schwerdtfeger, P. (2018) · Physical review. E · doi:10.1103/physreve.97.043309 · Cited by 26
A Source Coding Perspective on Node Deployment in Two-Tier Networks
Guo, J., Koyuncu, E., & Jafarkhani, H. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2809737 · Cited by 25
On the MDL principle for i.i.d. sources with large alphabets
Shamir, G. I. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.872846 · Cited by 25
Moore, G. M. (2007) · Springer eBooks · doi:10.1007/978-3-540-30308-4_8 · Cited by 27
Gilmore, C. J., & Bricogne, G. (1997) · Methods in enzymology on CD-ROM/Methods in enzymology · doi:10.1016/s0076-6879(97)77007-1 · Cited by 25
Lattices and dual lattices in optimal experimental design for Fourier models
Bates, R., Riccomagno, E., Schwabe, R., & Wynn, H. P. (1998) · Computational Statistics & Data Analysis · doi:10.1016/s0167-9473(98)00042-5 · Cited by 25
Generating dense packings of hard spheres by soft interaction design
Maimbourg, T., Sellitto, M., Semerjian, G., & Zamponi, F. (2018) · SciPost Physics · doi:10.21468/scipostphys.4.6.039 · Cited by 24
Controlling Collision-Induced Aggregations in a Swarm of Micro Bristle Robots
Hao, Z., Mayya, S., Notomista, G., Hutchinson, S., Egerstedt, M., & Ansari, A. (2022) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3189846 · Cited by 30
Some constructions of spherical 5-designs
Reznick, B. A. (1995) · Linear Algebra and its Applications · doi:10.1016/0024-3795(95)00101-v · Cited by 24
Spectral Extension of the Quantum Group Cotangent Bundle
Isaev, A., & Pyatov, P. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0785-5 · Cited by 24
Topological properties of face-centred cubic lattice
Siddiqui, M. K., Imran, M., & SAEED, M. (2019) · Hacettepe Journal of Mathematics and Statistics · doi:10.15672/hujms.546348 · Cited by 23
Two Conjectures on the Largest Minimum Distances of Binary Self-Orthogonal Codes With Dimension 5
Shi, M., Li, S., & Kim, J.-L. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3250718 · Cited by 23
Duparc, O. H., Larere, A., Lezzar, B., Khalfallah, O., & Paidar, V. (2005) · Journal of Materials Science · doi:10.1007/s10853-005-2680-6 · Cited by 23
Hexagonal Sigma-Delta modulation
Luckjiff, G. A., & Dobson, I. (2003) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/tcsi.2003.815190 · Cited by 23
Tanner graphs for group block codes and lattices: construction and complexity
Banihashemi, A. H., & Kschischang, F. R. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910592 · Cited by 23
Trellis complexity and minimal trellis diagrams of lattices
Banihashemi, A. H., & Blake, I. F. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705562 · Cited by 23
Sandy Soil Microaggregates: Rethinking Our Understanding of Hydraulic Function
Paradiś, A., Brueck, C. L., Meisenheimer, D. E., Wanzek, T. A., & Dragila, M. I. (2017) · Vadose Zone Journal · doi:10.2136/vzj2017.05.0090 · Cited by 24
New Extremal Type II Codes Over ℤ4
Harada, M. (1998) · Designs Codes and Cryptography · doi:10.1023/a:1008254008212 · Cited by 23
High-dimensional points selection strategy for PDEM-based stochastic dynamic analysis of structures
Xu, J., Zhang, Y., & Li, J. (2025) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2025.110849 · Cited by 22
(Continuous) Phase Modulation on the Hypersphere
Sedaghat, M. A., Müller, R. R., & Rachinger, C. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2569091 · Cited by 22
An Efficient SCMA Codebook Design Based on Lattice Theory for Information-Centric IoT
Zhang, X., Han, G., Zhang, D., Zhang, D., & Yang, L. (2019) · IEEE Access · doi:10.1109/access.2019.2938637 · Cited by 24
Stacking the Equiangular Spiral
Agrawal, A., Azabi, Y. O., & Rahman, B. M. A. (2012) · IEEE Photonics Technology Letters · doi:10.1109/lpt.2012.2236309 · Cited by 22
Modular Subgroups, Forms, Curves and Surfaces
Sebbar, A. (2002) · Canadian Mathematical Bulletin · doi:10.4153/cmb-2002-033-1 · Cited by 22
Single-User Tracing and Disjointly Superimposed Codes
Csürös, M., & Ruszinkó, M. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.844097 · Cited by 22
3-D Polarized Modulation: System Analysis and Performance
Henarejos, P., & Pérez-Neira, A. I. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2850814 · Cited by 22
Some recent theoretical results on amorphous packings of hard spheres
Zamponi, F. (2006) · The Philosophical Magazine A Journal of Theoretical Experimental and Applied Physics · doi:10.1080/14786430600838304 · Cited by 22
On viewing block codes as finite automata
Shankar, P., Dasgupta, A., Deshmukh, K., & Rajan, B. S. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00083-x · Cited by 28
Lattice Costa schemes using subspace projection for digital watermarking
Fischer, R. F. H., Tzschoppe, R., & Bäuml, R. (2004) · European Transactions on Telecommunications · doi:10.1002/ett.985 · Cited by 22
Computing proximity drawings of trees in the 3-dimensional space
Liotta, G., & Battista, G. D. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60220-8_66 · Cited by 22
Delikaris‐Manias, S., Vilkamo, J., & Pulkki, V. (2016) · IEEE/ACM Transactions on Audio Speech and Language Processing · doi:10.1109/taslp.2016.2560523 · Cited by 24
Guo, Q., Johansson, T., Mårtensson, E., & Stankovski, P. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-70694-8_12 · Cited by 21
Design of Optimal Noncoherent Constellations for SIMO Systems
Li, S., Zhang, J., & Mu, X. (2019) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2913367 · Cited by 21
Quantum magnetic imaging of iron organelles within the pigeon cochlea
de Gille, R. W., McCoey, J. M., Hall, L. T., Tetienne, J., Malkemper, E. P., Keays, D. A., Hollenberg, L. C. L., & Simpson, D. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2112749118 · Cited by 21
Complex Spherical Designs and Codes
Roy, A., & Suda, S. (2013) · Journal of Combinatorial Designs · doi:10.1002/jcd.21379 · Cited by 21
A lattice without a basis of minimal vectors
Conway, J. H., & Sloane, N. J. A. (1995) · Mathematika · doi:10.1112/s002557930001144x · Cited by 21
Self-citationDistinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks
Blackburn⋆, S. R., Etzion, T., Martin, K. M., & Paterson, M. B. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2050794 · Cited by 21
Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others
Conway, J. H., & Sloane, N. J. A. (1994) · Designs Codes and Cryptography · doi:10.1007/bf01388558 · Cited by 21
Self-citationKLT-Based Adaptive Classified VQ of the Speech Signal
Kim, M., & Kleijn, W. B. (2004) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/tsa.2004.825661 · Cited by 21
Betke, U., Henk, M., & Wills, J. M. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02574046 · Cited by 21
𝐸₈, the most exceptional group
Garibaldi, S. (2016) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1540 · Cited by 20
Polar Lattices for Lossy Compression
Лиу, Л., Shi, J., & Ling, C. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3097965 · Cited by 23
Unitary Space–Time Constellation Analysis: An Upper Bound for the Diversity
Han, G., & Rosenthal, J. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881754 · Cited by 20
Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes
Blackburn⋆, S. R., Etzion, T., Martin, K. M., & Paterson, M. B. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2039046 · Cited by 20
Repulsive particles on a two-dimensional lattice
Watson, G. I. (1997) · Physica A Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(97)00349-x · Cited by 20
Bounds for codes and designs in complex subspaces
Roy, A. (2009) · Journal of Algebraic Combinatorics · doi:10.1007/s10801-009-0170-7 · Cited by 20
Some recent theoretical results on amorphous packings of hard spheres
Zamponi, F. (2006) · HAL · Cited by 20
Determination of discrete sampling grids with optimal topological and spectral properties
Ibáñez, L., Hamitouche, C., & Roux, C. (1996) · Lecture notes in computer science · doi:10.1007/3-540-62005-2_15 · Cited by 20
Controlling the Short-Range Order and Packing Densities of Many-Particle Systems
Salvatore Torquato, A., & Stillinger, F. H. (2002) · The Journal of Physical Chemistry B · doi:10.1021/jp022019p · Cited by 20
Dimensions of spaces of Siegel modular forms of low weight in degree four
Poor, C., & Yuen, D. S. (1996) · Bulletin of the Australian Mathematical Society · doi:10.1017/s0004972700017779 · Cited by 19
Metadata
- Authors
- Conway, J. H., & Sloane, N. J. A.
- Affiliations
- Princeton University (US)
- AT&T (United States) (US)
- ORCID
- Sloane, N. J. A.
- Venue
- Grundlehren der mathematischen Wissenschaften
- Publisher
- Springer New York
- Published
- 1993
- ISSN
- 0072-7830 (ISSN-L)
- OpenAlex
- W4292414116
- Cited by
- 880
- References
- 9
- Citations by year
- 2026: 5 · 2025: 23 · 2024: 32 · 2023: 32 · 2022: 37 · 2021: 26 · 2020: 18 · 2019: 42 · 2018: 31 · 2017: 26 · 2016: 31 · 2015: 30 · 2014: 16 · 2013: 21 · 2012: 24
- FWCI
- 8.76
- Type
- book
- Language
- de
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Grundlehren der mathematischen Wissenschaften (publishedVersion)
- International Linear Collider (submittedVersion)
- Topics
- Physical Sciences › Mathematics › Numerical Analysis › Mathematical Approximation and Integration
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Physical Sciences › Mathematics › Algebra and Number Theory › Analytic Number Theory Research
- Keywords
- sphere packing, lattices, densest packing, Euclidean space, crystallographic groups
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.