<?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>No‐(k+1)‐in‐line problem for large constant k</title></titleInfo>


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


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

<name type="personal">
  <namePart type="given">Aleksandr</namePart>
  <namePart type="family">Grebennikov</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">776468ec-50b0-11ef-861e-96ad19e894f3</identifier></name>
<name type="personal">
  <namePart type="given">Matthew Alan</namePart>
  <namePart type="family">Kwan</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">5fca0887-a1db-11eb-95d1-ca9d5e0453b3</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-4003-7567</description></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">MaKw</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>

<name type="corporate">
  <namePart></namePart>
  <identifier type="local">GradSch</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>





<name type="corporate">
  <namePart>Randomness and structure in combinatorics</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">How many points can be placed in an 𝑛 × 𝑛 grid sothat every (affine) line contains at most 𝑘 points? Weprove that for 𝑛 ⩾ 𝑘 ⩾ 1037 the maximum number ofpoints is exactly 𝑘𝑛. Our proof builds on the recent workof Kovács, Nagy and Szabó (who proved an analogousresult when 𝑘 is at least about √𝑛 log 𝑛), incorporat-ing ideas of Jain and Pham. Using the same approach,we also obtain new bounds for higher-dimensionalextensions of this problem</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2026_BulletinLondonMathSoc_Grebennikov.pdf">https://research-explorer.ista.ac.at/download/23123/23139/2026_BulletinLondonMathSoc_Grebennikov.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Wiley</publisher><dateIssued encoding="w3cdtf">2026</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Bulletin of the London Mathematical Society</title></titleInfo>
  <identifier type="issn">0024-6093</identifier>
  <identifier type="eIssn">1469-2120</identifier><identifier type="doi">10.1112/blms.70510</identifier>
<part><detail type="volume"><number>58</number></detail><detail type="issue"><number>10</number></detail>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ama>Grebennikov A, Kwan MA. No‐(k+1)‐in‐line problem for large constant k. &lt;i&gt;Bulletin of the London Mathematical Society&lt;/i&gt;. 2026;58(10). doi:&lt;a href=&quot;https://doi.org/10.1112/blms.70510&quot;&gt;10.1112/blms.70510&lt;/a&gt;</ama>
<ista>Grebennikov A, Kwan MA. 2026. No‐(k+1)‐in‐line problem for large constant k. Bulletin of the London Mathematical Society. 58(10), e70510.</ista>
<mla>Grebennikov, Aleksandr, and Matthew Alan Kwan. “No‐(K+1)‐in‐line Problem for Large Constant K.” &lt;i&gt;Bulletin of the London Mathematical Society&lt;/i&gt;, vol. 58, no. 10, e70510, Wiley, 2026, doi:&lt;a href=&quot;https://doi.org/10.1112/blms.70510&quot;&gt;10.1112/blms.70510&lt;/a&gt;.</mla>
<apa>Grebennikov, A., &amp;#38; Kwan, M. A. (2026). No‐(k+1)‐in‐line problem for large constant k. &lt;i&gt;Bulletin of the London Mathematical Society&lt;/i&gt;. Wiley. &lt;a href=&quot;https://doi.org/10.1112/blms.70510&quot;&gt;https://doi.org/10.1112/blms.70510&lt;/a&gt;</apa>
<short>A. Grebennikov, M.A. Kwan, Bulletin of the London Mathematical Society 58 (2026).</short>
<ieee>A. Grebennikov and M. A. Kwan, “No‐(k+1)‐in‐line problem for large constant k,” &lt;i&gt;Bulletin of the London Mathematical Society&lt;/i&gt;, vol. 58, no. 10. Wiley, 2026.</ieee>
<chicago>Grebennikov, Aleksandr, and Matthew Alan Kwan. “No‐(K+1)‐in‐line Problem for Large Constant K.” &lt;i&gt;Bulletin of the London Mathematical Society&lt;/i&gt;. Wiley, 2026. &lt;a href=&quot;https://doi.org/10.1112/blms.70510&quot;&gt;https://doi.org/10.1112/blms.70510&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>23123</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-10-12T13:57:47Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-10-14T08:41:00Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
