<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>Packings of equal disks in a square torus</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Robert</namePart>
  <namePart type="family">Connelly</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Matthew</namePart>
  <namePart type="family">Funkhouser</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Vivian Zieve</namePart>
  <namePart type="family">Kuperberg</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">c3bac823-112d-11f0-a3f5-c264f852e697</identifier></name>
<name type="personal">
  <namePart type="given">Evan</namePart>
  <namePart type="family">Solomonides</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>














<abstract lang="eng">Packings of equal disks in the plane are known to have density at most
π/
√
12, although this density is never achieved in the square torus, which is what we
call the plane modulo the square lattice. We find packings of disks in a square torus
that we conjecture to be the most dense for certain numbers of packing disks, using
continued fractions to approximate 1/
√
3 and 2 −
√
3. We also define a constant to
measure the efficiency of a packing motived by a related constant due to Markov for
continued fractions. One idea is to use the unique factorization property of Gaussian
integers to prove that there is an upper bound for the Markov constant for grid-like
packings. By way of contrast, we show that an upper bound by Gruber [In many cases
optimal configurations are almost regular hexagonal, vol. 65, pp. 121–145, 1999;Geom
Dedicata 84(1–3):271–320, 2001] for the error for the limiting density of a packing
of equal disks in a planar square, which is on the order of 1/
√
N, is the best possible,
whereas for our examples for the square torus, the error for the limiting density is on
the order of 1/N, where N is the number of packing disks.</abstract>

<originInfo><publisher>Springer Nature</publisher><dateIssued encoding="w3cdtf">2017</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Discrete &amp; Computational Geometry</title></titleInfo>
  <identifier type="issn">0179-5376</identifier>
  <identifier type="eIssn">1432-0444</identifier>
  <identifier type="arXiv">1512.08762</identifier><identifier type="doi">10.1007/s00454-016-9843-x</identifier>
<part><detail type="volume"><number>58</number></detail><detail type="issue"><number>3</number></detail><extent unit="pages">614-642</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<mla>Connelly, Robert, et al. “Packings of Equal Disks in a Square Torus.” &lt;i&gt;Discrete &amp;#38; Computational Geometry&lt;/i&gt;, vol. 58, no. 3, Springer Nature, 2017, pp. 614–42, doi:&lt;a href=&quot;https://doi.org/10.1007/s00454-016-9843-x&quot;&gt;10.1007/s00454-016-9843-x&lt;/a&gt;.</mla>
<short>R. Connelly, M. Funkhouser, V.Z. Kuperberg, E. Solomonides, Discrete &amp;#38; Computational Geometry 58 (2017) 614–642.</short>
<chicago>Connelly, Robert, Matthew Funkhouser, Vivian Zieve Kuperberg, and Evan Solomonides. “Packings of Equal Disks in a Square Torus.” &lt;i&gt;Discrete &amp;#38; Computational Geometry&lt;/i&gt;. Springer Nature, 2017. &lt;a href=&quot;https://doi.org/10.1007/s00454-016-9843-x&quot;&gt;https://doi.org/10.1007/s00454-016-9843-x&lt;/a&gt;.</chicago>
<apa>Connelly, R., Funkhouser, M., Kuperberg, V. Z., &amp;#38; Solomonides, E. (2017). Packings of equal disks in a square torus. &lt;i&gt;Discrete &amp;#38; Computational Geometry&lt;/i&gt;. Springer Nature. &lt;a href=&quot;https://doi.org/10.1007/s00454-016-9843-x&quot;&gt;https://doi.org/10.1007/s00454-016-9843-x&lt;/a&gt;</apa>
<ista>Connelly R, Funkhouser M, Kuperberg VZ, Solomonides E. 2017. Packings of equal disks in a square torus. Discrete &amp;#38; Computational Geometry. 58(3), 614–642.</ista>
<ieee>R. Connelly, M. Funkhouser, V. Z. Kuperberg, and E. Solomonides, “Packings of equal disks in a square torus,” &lt;i&gt;Discrete &amp;#38; Computational Geometry&lt;/i&gt;, vol. 58, no. 3. Springer Nature, pp. 614–642, 2017.</ieee>
<ama>Connelly R, Funkhouser M, Kuperberg VZ, Solomonides E. Packings of equal disks in a square torus. &lt;i&gt;Discrete &amp;#38; Computational Geometry&lt;/i&gt;. 2017;58(3):614-642. doi:&lt;a href=&quot;https://doi.org/10.1007/s00454-016-9843-x&quot;&gt;10.1007/s00454-016-9843-x&lt;/a&gt;</ama>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22198</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-06-29T12:58:50Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-14T11:14:51Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
