<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:media="http://search.yahoo.com/mrss/" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Discrete Analysis</title>
    <link>https://discreteanalysisjournal.com/</link>
    <description>Discrete Analysis is a mathematical journal with an emphasis on areas of mathematics that are broadly related to additive combinatorics.</description>
    <language>en</language>
    <atom:link href="https://discreteanalysisjournal.com/feed" rel="self" type="application/rss+xml"/>
    <item>
      <media:content type="image/jpeg" url="https://s3.amazonaws.com/production.scholastica/article/165253/medium/photo-1445294211564-3ca59d999abd?1784455258"/>
      <title>Composite Ramsey theorems via trees</title>
      <pubDate>Mon, 27 Jul 2026 08:01:21 +0000</pubDate>
      <description>A method is developed for using Ramsey theorems to deduce more powerful Ramsey theorems. The method has many consequences and is used to solve several open problems.</description>
      <guid>https://doi.org/10.19086/da.165253</guid>
      <link>https://discreteanalysisjournal.com/article/165253-composite-ramsey-theorems-via-trees</link>
    </item>
    <item>
      <media:content type="image/jpeg" url="https://s3.amazonaws.com/production.scholastica/article/165216/medium/photo-1724251638777-d859425204fc?1784289862"/>
      <title>Convex geometry and the Erdős-Ginzburg-Ziv problem</title>
      <pubDate>Tue, 21 Jul 2026 08:15:07 +0000</pubDate>
      <description>For each fixed d, the Erdős-Ginzburg-Ziv constant of the dth power of the cyclic group of order p is determined asymptotically as p tends to infinity.</description>
      <guid>https://doi.org/10.19086/da.165216</guid>
      <link>https://discreteanalysisjournal.com/article/165216-convex-geometry-and-the-erdos-ginzburg-ziv-problem</link>
    </item>
    <item>
      <media:content type="image/jpeg" url="https://s3.amazonaws.com/production.scholastica/article/165102/medium/photo-1772663042999-f2d61d02b7be?1784108756"/>
      <title>Possible Sizes of Sumsets</title>
      <pubDate>Thu, 16 Jul 2026 09:38:00 +0000</pubDate>
      <description>For each h and for sufficiently large k, the set of possible cardinalities of the h-fold sumset hA, when A is a set of size k, is determined.</description>
      <guid>https://doi.org/10.19086/da.165102</guid>
      <link>https://discreteanalysisjournal.com/article/165102-possible-sizes-of-sumsets</link>
    </item>
    <item>
      <media:content type="image/jpeg" url="https://s3.amazonaws.com/production.scholastica/article/154623/medium/photo-1729447804226-266bd97de0c5?1766098134"/>
      <title>Efficiently stable presentations from error-correcting codes</title>
      <pubDate>Thu, 16 Jul 2026 09:34:00 +0000</pubDate>
      <description>A group presentation is constructed that has few generators and relations and that has a stability property that provides a key step in the proof that MIP*=RE.</description>
      <guid>https://doi.org/10.19086/da.154623</guid>
      <link>https://discreteanalysisjournal.com/article/154623-efficiently-stable-presentations-from-error-correcting-codes</link>
    </item>
    <item>
      <media:content type="image/jpeg" url="https://s3.amazonaws.com/production.scholastica/article/154329/medium/photo-1662655558718-38d19217c23a?1765630163"/>
      <title>A question of Erdős and Graham on Egyptian fractions</title>
      <pubDate>Fri, 19 Dec 2025 11:24:43 +0000</pubDate>
      <description>A sharp lower bound is obtained for the number of ways of representing a rational number as an Egyptian fraction with denominators at most n.</description>
      <guid>https://doi.org/10.19086/da.154329</guid>
      <link>https://discreteanalysisjournal.com/article/154329-a-question-of-erdos-and-graham-on-egyptian-fractions</link>
    </item>
    <item>
      <media:content type="image/jpeg" url="https://s3.amazonaws.com/production.scholastica/article/145807/medium/photo-1593358187406-fb1ccc698573?1760080808"/>
      <title>Stability of ranks under field extensions</title>
      <pubDate>Wed, 17 Dec 2025 09:55:08 +0000</pubDate>
      <description>This paper studies how the analytic and partition rank of a tensor can change when the underlying field is extended.</description>
      <guid>https://doi.org/10.19086/da.145807</guid>
      <link>https://discreteanalysisjournal.com/article/145807-stability-of-ranks-under-field-extensions</link>
    </item>
    <item>
      <media:content type="image/jpeg" url="https://s3.amazonaws.com/production.scholastica/article/144978/medium/photo-1708919268838-dc1632c87df7?1759233332"/>
      <title>Universally Optimal Periodic Configurations in the Plane</title>
      <pubDate>Fri, 10 Oct 2025 06:58:53 +0000</pubDate>
      <description>Certain natural configurations are universally optimal with respect to the hexagonal lattice, which lends support to the conjecture that they all are.</description>
      <guid>https://doi.org/10.19086/da.144978</guid>
      <link>https://discreteanalysisjournal.com/article/144978-universally-optimal-periodic-configurations-in-the-plane</link>
    </item>
    <item>
      <media:content type="image/jpeg" url="https://s3.amazonaws.com/production.scholastica/article/145198/medium/bread.jpg?1759906760"/>
      <title>Slice rank and analytic rank for trilinear forms</title>
      <pubDate>Thu, 09 Oct 2025 07:37:10 +0000</pubDate>
      <description>An elementary proof is given of the fact that the slice rank of a tensor of rank 3 is bounded above by a constant times its analytic rank.</description>
      <guid>https://doi.org/10.19086/da.145198</guid>
      <link>https://discreteanalysisjournal.com/article/145198-slice-rank-and-analytic-rank-for-trilinear-forms</link>
    </item>
    <item>
      <media:content type="image/jpeg" url="https://s3.amazonaws.com/production.scholastica/article/145176/medium/photo-1593761409915-b31897fbe6e6?1759680107"/>
      <title>A polynomial Freiman-Ruzsa inverse theorem for function fields</title>
      <pubDate>Wed, 08 Oct 2025 07:03:31 +0000</pubDate>
      <description>A function-field variant of Marton's conjecture, otherwise known as the polynomial Freiman Ruzsa theorem for finite fields, is formulated and proved.</description>
      <guid>https://doi.org/10.19086/da.145176</guid>
      <link>https://discreteanalysisjournal.com/article/145176-a-polynomial-freiman-ruzsa-inverse-theorem-for-function-fields</link>
    </item>
    <item>
      <media:content type="image/jpeg" url="https://s3.amazonaws.com/production.scholastica/article/145175/medium/photo-1476842321362-f5bb3a58ab25?1759659137"/>
      <title>Color avoidance for monotone paths</title>
      <pubDate>Tue, 07 Oct 2025 08:14:37 +0000</pubDate>
      <description>The number of vertices needed to guarantee a colour-avoiding tight monotone path in every r-coloured complete k-uniform hypergraph is exponentially smaller than the number needed for a monochromatic path.</description>
      <guid>https://doi.org/10.19086/da.145175</guid>
      <link>https://discreteanalysisjournal.com/article/145175-color-avoidance-for-monotone-paths</link>
    </item>
  </channel>
</rss>
