{"title":"加法基地:领域变化","authors":"Boris Bukh, Peter van Hintum, Peter Keevash","doi":"arxiv-2409.07442","DOIUrl":null,"url":null,"abstract":"We consider two questions of Ruzsa on how the minimum size of an additive\nbasis $B$ of a given set $A$ depends on the domain of $B$. To state these\nquestions, for an abelian group $G$ and $A \\subseteq D \\subseteq G$ we write\n$\\ell_D(A) \\colon =\\min \\{ |B|: B \\subseteq D, \\ A \\subseteq B+B \\}$. Ruzsa\nasked how much larger can $\\ell_{\\mathbb{Z}}(A)$ be than $\\ell_{\\mathbb{Q}}(A)$\nfor $A\\subset\\mathbb{Z}$, and how much larger can $\\ell_{\\mathbb{N}}(A)$ be\nthan $\\ell_{\\mathbb{Z}}(A)$ for $A\\subset\\mathbb{N}$. For the first question we\nshow that if $\\ell_{\\mathbb{Q}}(A) = n$ then $\\ell_{\\mathbb{Z}}(A) \\le 2n$, and\nthat this is tight up to an additive error of at most $O(\\sqrt{n})$. For the\nsecond question, we show that if $\\ell_{\\mathbb{Z}}(A) = n$ then\n$\\ell_{\\mathbb{N}}(A) \\le O(n\\log n)$, and this is tight up to the constant\nfactor. We also consider these questions for higher order bases. Our proofs use\nsome ideas that are unexpected in this context, including linear algebra and\nDiophantine approximation.","PeriodicalId":501064,"journal":{"name":"arXiv - MATH - Number Theory","volume":"40 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Additive Bases: Change of Domain\",\"authors\":\"Boris Bukh, Peter van Hintum, Peter Keevash\",\"doi\":\"arxiv-2409.07442\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider two questions of Ruzsa on how the minimum size of an additive\\nbasis $B$ of a given set $A$ depends on the domain of $B$. To state these\\nquestions, for an abelian group $G$ and $A \\\\subseteq D \\\\subseteq G$ we write\\n$\\\\ell_D(A) \\\\colon =\\\\min \\\\{ |B|: B \\\\subseteq D, \\\\ A \\\\subseteq B+B \\\\}$. Ruzsa\\nasked how much larger can $\\\\ell_{\\\\mathbb{Z}}(A)$ be than $\\\\ell_{\\\\mathbb{Q}}(A)$\\nfor $A\\\\subset\\\\mathbb{Z}$, and how much larger can $\\\\ell_{\\\\mathbb{N}}(A)$ be\\nthan $\\\\ell_{\\\\mathbb{Z}}(A)$ for $A\\\\subset\\\\mathbb{N}$. For the first question we\\nshow that if $\\\\ell_{\\\\mathbb{Q}}(A) = n$ then $\\\\ell_{\\\\mathbb{Z}}(A) \\\\le 2n$, and\\nthat this is tight up to an additive error of at most $O(\\\\sqrt{n})$. For the\\nsecond question, we show that if $\\\\ell_{\\\\mathbb{Z}}(A) = n$ then\\n$\\\\ell_{\\\\mathbb{N}}(A) \\\\le O(n\\\\log n)$, and this is tight up to the constant\\nfactor. We also consider these questions for higher order bases. Our proofs use\\nsome ideas that are unexpected in this context, including linear algebra and\\nDiophantine approximation.\",\"PeriodicalId\":501064,\"journal\":{\"name\":\"arXiv - MATH - Number Theory\",\"volume\":\"40 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Number Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.07442\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Number Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.07442","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider two questions of Ruzsa on how the minimum size of an additive
basis $B$ of a given set $A$ depends on the domain of $B$. To state these
questions, for an abelian group $G$ and $A \subseteq D \subseteq G$ we write
$\ell_D(A) \colon =\min \{ |B|: B \subseteq D, \ A \subseteq B+B \}$. Ruzsa
asked how much larger can $\ell_{\mathbb{Z}}(A)$ be than $\ell_{\mathbb{Q}}(A)$
for $A\subset\mathbb{Z}$, and how much larger can $\ell_{\mathbb{N}}(A)$ be
than $\ell_{\mathbb{Z}}(A)$ for $A\subset\mathbb{N}$. For the first question we
show that if $\ell_{\mathbb{Q}}(A) = n$ then $\ell_{\mathbb{Z}}(A) \le 2n$, and
that this is tight up to an additive error of at most $O(\sqrt{n})$. For the
second question, we show that if $\ell_{\mathbb{Z}}(A) = n$ then
$\ell_{\mathbb{N}}(A) \le O(n\log n)$, and this is tight up to the constant
factor. We also consider these questions for higher order bases. Our proofs use
some ideas that are unexpected in this context, including linear algebra and
Diophantine approximation.