首页 > 最新文献

Discrete Analysis最新文献

英文 中文
A short proof of a conjecture of Erd"os proved by Moreira, Richter and Robertson 一个由Moreira, Richter和Robertson证明的关于Erd猜想的简短证明
IF 1.1 3区 数学 Q2 Mathematics Pub Date : 2019-04-22 DOI: 10.19086/DA.11129
B. Host
We give a short proof of a sumset conjecture of Erdos, recently proved by Moreira, Richter and Robertson: every subset of the integers of positive density contains the sum of two infinite sets. The proof is written in the framework of classical ergodic theory.
给出了最近由Moreira、Richter和Robertson证明的Erdos的一个集猜想的一个简短证明:正密度整数的每一个子集都包含两个无限集的和。这个证明是在经典遍历理论的框架内写成的。
{"title":"A short proof of a conjecture of Erd\"os proved by Moreira, Richter and Robertson","authors":"B. Host","doi":"10.19086/DA.11129","DOIUrl":"https://doi.org/10.19086/DA.11129","url":null,"abstract":"We give a short proof of a sumset conjecture of Erdos, recently proved by Moreira, Richter and Robertson: every subset of the integers of positive density contains the sum of two infinite sets. The proof is written in the framework of classical ergodic theory.","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2019-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47198854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Failure of the trilinear operator space Grothendieck theorem 三线性算子空间Grothendieck定理的失效
IF 1.1 3区 数学 Q2 Mathematics Pub Date : 2018-12-23 DOI: 10.19086/da.8805
J. Briet, C. Palazuelos
We give a counterexample to a trilinear version of the operator space Grothendieck theorem. In particular, we show that for trilinear forms on l∞, the ratio of the symmetrized completely bounded norm and the jointly completely bounded norm is in general unbounded. The proof is based on a non-commutative version of the generalized von Neumann inequality from additive combinatorics.
我们给出了算子空间格罗滕迪克定理的一个三线性版本的反例。特别地,我们证明了对于l∞上的三线性形式,对称完全有界范数与联合完全有界范数之比一般是无界的。该证明是基于可加组合学中广义冯·诺伊曼不等式的非交换版本。
{"title":"Failure of the trilinear operator space Grothendieck theorem","authors":"J. Briet, C. Palazuelos","doi":"10.19086/da.8805","DOIUrl":"https://doi.org/10.19086/da.8805","url":null,"abstract":"We give a counterexample to a trilinear version of the operator space Grothendieck theorem. In particular, we show that for trilinear forms on l∞, the ratio of the symmetrized completely bounded norm and the jointly completely bounded norm is in general unbounded. The proof is based on a non-commutative version of the generalized von Neumann inequality from additive combinatorics.","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2018-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46628535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On an almost all version of the Balog-Szemeredi-Gowers theorem 关于几乎所有版本的巴洛格-塞梅雷迪-高尔斯定理
IF 1.1 3区 数学 Q2 Mathematics Pub Date : 2018-11-26 DOI: 10.19086/DA.9095
X. Shao
We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer'{e}di-Gowers theorem: For any $Kgeq 1$ and $varepsilon > 0$, there exists $delta = delta(K,varepsilon)>0$ such that the following statement holds: if $|A+_{Gamma}A| leq K|A|$ for some $Gamma geq (1-delta)|A|^2$, then there is a subset $A' subset A$ with $|A'| geq (1-varepsilon)|A|$ such that $|A'+A'| leq |A+_{Gamma}A| + varepsilon |A|$. We also discuss issues around quantitative bounds in this statement, in particular showing that when $A subset mathbb{Z}$ the dependence of $delta$ on $epsilon$ cannot be polynomial for any fixed $K>2$.
作为算术去除引理的结果,我们推导出了几乎所有版本的balog - szemer - gowers定理 $Kgeq 1$ 和 $varepsilon > 0$,存在 $delta = delta(K,varepsilon)>0$ 使得下面的语句成立:如果 $|A+_{Gamma}A| leq K|A|$ 对一些人来说 $Gamma geq (1-delta)|A|^2$,那么就有一个子集 $A' subset A$ 有 $|A'| geq (1-varepsilon)|A|$ 这样 $|A'+A'| leq |A+_{Gamma}A| + varepsilon |A|$. 我们还讨论了这个表述中关于数量界限的问题,特别是当 $A subset mathbb{Z}$ 的依赖性 $delta$ on $epsilon$ 不可能是多项式 $K>2$.
{"title":"On an almost all version of the Balog-Szemeredi-Gowers theorem","authors":"X. Shao","doi":"10.19086/DA.9095","DOIUrl":"https://doi.org/10.19086/DA.9095","url":null,"abstract":"We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer'{e}di-Gowers theorem: For any $Kgeq 1$ and $varepsilon > 0$, there exists $delta = delta(K,varepsilon)>0$ such that the following statement holds: if $|A+_{Gamma}A| leq K|A|$ for some $Gamma geq (1-delta)|A|^2$, then there is a subset $A' subset A$ with $|A'| geq (1-varepsilon)|A|$ such that $|A'+A'| leq |A+_{Gamma}A| + varepsilon |A|$. We also discuss issues around quantitative bounds in this statement, in particular showing that when $A subset mathbb{Z}$ the dependence of $delta$ on $epsilon$ cannot be polynomial for any fixed $K>2$.","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2018-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68393490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
On the Lehmer conjecture and counting in finite fields 有限域中的Lehmer猜想与计数
IF 1.1 3区 数学 Q2 Mathematics Pub Date : 2018-10-31 DOI: 10.19086/da.8306
E. Breuillard, P. P. Varj'u
We give a reformulation of the Lehmer conjecture about algebraic integers in terms of a simple counting problem modulo p.
我们用模p的一个简单计数问题重新表述了代数整数的Lehmer猜想。
{"title":"On the Lehmer conjecture and counting in finite fields","authors":"E. Breuillard, P. P. Varj'u","doi":"10.19086/da.8306","DOIUrl":"https://doi.org/10.19086/da.8306","url":null,"abstract":"We give a reformulation of the Lehmer conjecture about algebraic integers in terms of a simple counting problem modulo p.","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2018-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46616963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Logarithmic bounds for Roth's theorem via almost-periodicity 罗斯定理的对数界的概周期性
IF 1.1 3区 数学 Q2 Mathematics Pub Date : 2018-10-30 DOI: 10.19086/da.7884
T. Bloom, Olof Sisask
Logarithmic bounds for Roth's theorem via almost-periodicity, Discrete Analysis 2019:4, 20pp.A central result of additive combinatorics, Roth's theorem, asserts that for every $delta>0$ there exists $N$ such that every subset of ${1,2,dots,N}$ of size at least $delta N$ contains an arithmetic progression of length 3. This is the first non-trivial case of Szemeredi's theorem, proved over 20 years later, which is the corresponding statement for progressions of general length. If we define $rho_k(N)$ to be the minimum real number such that every subset of ${1,2,dots,N}$ of density at least $rho_k(N)$ contains an arithmetic progression of length $k$, then Roth's theorem asserts that $rho_3(N)to 0$ and Szemeredi's theorem asserts that $rho_k(N)to 0$ for all $k$. These results leave open the question of bounds. Roth's proof shows that $rho_3(N)leq C/loglog N$ for an absolute constant $C$. Following a sequence of improvements by Szemeredi, Heath-Brown, Bourgain and Sanders, the current record, due to the first author of this paper, stands at $C(loglog N)^4/log N$. This is tantalizingly close to $1/log N$, which is an important barrier because if one could get past it then one would be able to prove that every set $Asubsetmathbb N$ such that $sum_{xin A}x^{-1}=infty$ contains an arithmetic progression of length 3, which is the first non-trivial case of perhaps the most famous of all conjectures of Erdős.At the time of writing, the problem of beating the log barrier is particularly alive, because there is some evidence that we already have the technology needed to solve it. This evidence comes from a closely related problem, the cap-set problem, which concerns the density that a subset $Asubsetmathbb F_3^n$ must have in order to contain an affine line, which is the natural notion of an arithmetic progression of length 3 in $mathbb F_3^n$. For a long time the best known upper bound was stuck at $Cn^{-1}$, which is also a logarithmic bound, since the cardinality of $mathbb F_3^n$ is $3^n$. Then a few years ago, Michael Bateman and Nets Katz improved the bound to $Cn^{-(1+epsilon)}$ for a small positive $epsilon$, and more recently, in a spectacular development, Jordan Ellenberg and Dion Gijswijt, building on work of Ernie Croot, Seva Lev and Peter Pach, obtained an upper bound of $c^n$ for a constant $c<1$. Ellenberg and Gijswijt used the polynomial method, and it is far from clear whether any analogue of that method can be made to work for Roth's theorem, so there is continued interest in the argument of Bateman and Katz, which involved a delicate analysis of the structure of the set of large Fourier coefficients of a dense set. Could a similar analysis be used to improve the current record for Roth's theorem by a power of $log n$? There are significant difficulties (not least of which is the complexity of the arguments that one would be trying to combine), but there does not appear to be a clear reason to suppose that such a programme cannot be carr
基于准周期的罗斯定理的对数界,离散分析2019:4,20页。加性组合学的一个中心结果,罗斯定理,断言对于每个$delta>0$存在$N$,使得大小至少为$delta N$的${1,2,dots,N}$的每个子集包含长度为3的等比数列。这是20多年后证明的Szemeredi定理的第一个非平凡情况,它是一般长度级数的相应陈述。如果我们定义$rho_k(N)$为最小实数,使得密度至少为$rho_k(N)$的${1,2,dots,N}$的每个子集包含长度为$k$的等比数列,那么Roth定理断言$rho_3(N)to 0$和Szemeredi定理断言$rho_k(N)to 0$对于所有$k$。这些结果留下了边界问题。Roth的证明表明$rho_3(N)leq C/loglog N$对于一个绝对常数$C$。在Szemeredi, Heath-Brown, Bourgain和Sanders的一系列改进之后,目前的记录,由于本文的第一作者,是$C(loglog N)^4/log N$。这与$1/log N$非常接近,这是一个重要的障碍,因为如果能通过它,就能证明每个集合$Asubsetmathbb N$使得$sum_{xin A}x^{-1}=infty$包含一个长度为3的等差数列,这是第一个非平凡的情况,也许是Erdős猜想中最著名的一个。在撰写本文时,突破日志障碍的问题尤其活跃,因为有一些证据表明我们已经拥有解决它所需的技术。这一证据来自一个密切相关的问题,即cap-set问题,它涉及子集$Asubsetmathbb F_3^n$必须具有的密度,以便包含一条仿射线,这是$mathbb F_3^n$中长度为3的等差数列的自然概念。在很长一段时间里,最著名的上界是$Cn^{-1}$,这也是一个对数界,因为$mathbb F_3^n$的基数是$3^n$。几年前,迈克尔·贝特曼(Michael Bateman)和涅茨·卡茨(Nets Katz)将边界改进为$Cn^{-(1+epsilon)}$,得到了一个小的正$epsilon$。最近,乔丹·艾伦伯格(Jordan Ellenberg)和迪翁·吉斯威特(Dion Gijswijt)在厄尼·克罗特(Ernie Croot)、塞瓦·勒夫(Seva Lev)和彼得·帕奇(Peter Pach)的研究基础上,取得了一个惊人的进展,得到了常数$c<1$的上界$c^n$。Ellenberg和Gijswijt使用的是多项式方法,目前还不清楚是否有类似的方法可以适用于Roth的定理,所以人们对Bateman和Katz的论证一直很感兴趣,他们对密集集合的大傅立叶系数集合的结构进行了细致的分析。类似的分析是否可以通过$log n$的幂次来改善罗斯定理的现有记录?存在着重大的困难(其中最重要的是人们将试图结合的论点的复杂性),但似乎没有明确的理由认为这样一个方案不能执行。考虑到这些困难,尽可能了解现有的结果是非常重要的,这也是本文的目的。它没有改进罗斯定理中最著名的界,但它以一种新的方式得到了一个可比较的界(即$(loglog N)^t/log N$形式之一)。证明中使用的主要工具,在桑德斯的证明中也发挥了重要作用,桑德斯的证明是第一个得到这种类型的界的证明,即所谓的几乎周期性,这是由厄尼·克罗特和本文的第二作者首创的一种论证它发生在物理空间中,从而避免了傅里叶分析中某些反复出现的困难。与先前Roth定理的强界证明不同的是,它稍微简单一些,使用傅里叶分析的论证比例要小得多,并且被限制在一个相对标准的步骤。因此,本文为我们提供了一个新的角度来研究这个定理,这将增加找到一些合适的技术组合来打破对数障碍的机会。
{"title":"Logarithmic bounds for Roth's theorem via almost-periodicity","authors":"T. Bloom, Olof Sisask","doi":"10.19086/da.7884","DOIUrl":"https://doi.org/10.19086/da.7884","url":null,"abstract":"Logarithmic bounds for Roth's theorem via almost-periodicity, Discrete Analysis 2019:4, 20pp.\u0000\u0000A central result of additive combinatorics, Roth's theorem, asserts that for every $delta>0$ there exists $N$ such that every subset of ${1,2,dots,N}$ of size at least $delta N$ contains an arithmetic progression of length 3. This is the first non-trivial case of Szemeredi's theorem, proved over 20 years later, which is the corresponding statement for progressions of general length. If we define $rho_k(N)$ to be the minimum real number such that every subset of ${1,2,dots,N}$ of density at least $rho_k(N)$ contains an arithmetic progression of length $k$, then Roth's theorem asserts that $rho_3(N)to 0$ and Szemeredi's theorem asserts that $rho_k(N)to 0$ for all $k$. \u0000\u0000These results leave open the question of bounds. Roth's proof shows that $rho_3(N)leq C/loglog N$ for an absolute constant $C$. Following a sequence of improvements by Szemeredi, Heath-Brown, Bourgain and Sanders, the current record, due to the first author of this paper, stands at $C(loglog N)^4/log N$. This is tantalizingly close to $1/log N$, which is an important barrier because if one could get past it then one would be able to prove that every set $Asubsetmathbb N$ such that $sum_{xin A}x^{-1}=infty$ contains an arithmetic progression of length 3, which is the first non-trivial case of perhaps the most famous of all conjectures of Erdős.\u0000\u0000At the time of writing, the problem of beating the log barrier is particularly alive, because there is some evidence that we already have the technology needed to solve it. This evidence comes from a closely related problem, the cap-set problem, which concerns the density that a subset $Asubsetmathbb F_3^n$ must have in order to contain an affine line, which is the natural notion of an arithmetic progression of length 3 in $mathbb F_3^n$. For a long time the best known upper bound was stuck at $Cn^{-1}$, which is also a logarithmic bound, since the cardinality of $mathbb F_3^n$ is $3^n$. Then a few years ago, Michael Bateman and Nets Katz improved the bound to $Cn^{-(1+epsilon)}$ for a small positive $epsilon$, and more recently, in a spectacular development, Jordan Ellenberg and Dion Gijswijt, building on work of Ernie Croot, Seva Lev and Peter Pach, obtained an upper bound of $c^n$ for a constant $c<1$. Ellenberg and Gijswijt used the polynomial method, and it is far from clear whether any analogue of that method can be made to work for Roth's theorem, so there is continued interest in the argument of Bateman and Katz, which involved a delicate analysis of the structure of the set of large Fourier coefficients of a dense set. Could a similar analysis be used to improve the current record for Roth's theorem by a power of $log n$? There are significant difficulties (not least of which is the complexity of the arguments that one would be trying to combine), but there does not appear to be a clear reason to suppose that such a programme cannot be carr","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2018-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43914564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Approximate lattices and Meyer sets in nilpotent Lie groups 幂零李群中的近似格和Meyer集
IF 1.1 3区 数学 Q2 Mathematics Pub Date : 2018-10-25 DOI: 10.19086/da.11886
S. Machado
We show that uniform approximate lattices in nilpotent Lie groups are subsets of model sets. This extends Y.Meyer's theorem about quasi-crystals in Euclidean spaces. We derive from this structure theorem a characterisation of connected, simply connected, nilpotent Lie groups containing approximate lattices as the groups whose Lie algebra have structure constants lying in $overline{mathbb{Q}}$.
我们证明了幂零李群中的一致近似格是模型集的子集。这扩展了关于欧氏空间中拟晶体的Y.Meyer定理。我们从这个结构定理导出了包含近似格的连通、单连通、幂零李群的特征,这些近似格是李代数的结构常数位于$overline{mathbb{Q}}$中的群。
{"title":"Approximate lattices and Meyer sets in nilpotent Lie groups","authors":"S. Machado","doi":"10.19086/da.11886","DOIUrl":"https://doi.org/10.19086/da.11886","url":null,"abstract":"We show that uniform approximate lattices in nilpotent Lie groups are subsets of model sets. This extends Y.Meyer's theorem about quasi-crystals in Euclidean spaces. We derive from this structure theorem a characterisation of connected, simply connected, nilpotent Lie groups containing approximate lattices as the groups whose Lie algebra have structure constants lying in $overline{mathbb{Q}}$.","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47802879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
Finitely forcible graphons with an almost arbitrary structure 具有几乎任意结构的有限强制图
IF 1.1 3区 数学 Q2 Mathematics Pub Date : 2018-09-16 DOI: 10.19086/DA.12058
D. Král, L. Lov'asz, Jonathan A. Noel, Jakub Sosnovec
A basic result from the theory of quasirandom graphs, due to Andrew Thomason, is that if is a graph with vertices and density , and if the number of 4-cycles in is approximately , then resembles a random graph of the same density. In particular, between any two sets and of vertices the number of edges is approximately . (Here, “approximately” means "to within a small fraction of , so the statement is non-trivial only for sets and that are not too small.)
由Andrew Thomason提出的准随机图理论的一个基本结果是,如果是一个具有顶点和密度的图,并且如果中的4个循环的数量近似,则类似于具有相同密度的随机图。特别地,在任意两个集合和顶点之间,边的数量近似。(这里,“近似”的意思是“在的一小部分内,因此该语句仅对不太小的集合是非平凡的。)
{"title":"Finitely forcible graphons with an almost arbitrary structure","authors":"D. Král, L. Lov'asz, Jonathan A. Noel, Jakub Sosnovec","doi":"10.19086/DA.12058","DOIUrl":"https://doi.org/10.19086/DA.12058","url":null,"abstract":"A basic result from the theory of quasirandom graphs, due to Andrew Thomason, is that if is a graph with vertices and density , and if the number of 4-cycles in is approximately , then resembles a random graph of the same density. In particular, between any two sets and of vertices the number of edges is approximately . (Here, “approximately” means \"to within a small fraction of , so the statement is non-trivial only for sets and that are not too small.)","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2018-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44172926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
On sets defining few ordinary hyperplanes 在定义几个普通超平面的集合上
IF 1.1 3区 数学 Q2 Mathematics Pub Date : 2018-09-01 DOI: 10.19086/da.11949
Aaron Lin, K. Swanepoel
Let P be a set of n points in real projective d-space, not all contained in a hyperplane, such that any d points span a hyperplane. An ordinary hyperplane of P is a hyperplane containing exactly d points of P. We show that if d > 4, the number of ordinary hyperplanes of P is at least 􀀀n􀀀1 d􀀀1 􀀀 Od(nb(d􀀀1)=2c) if n is suciently large depending on d. This bound is tight, and given d, we can calculate the exact minimum number for suciently large n. This is a consequence of a structure theorem for sets with few ordinary hyperplanes: For any d > 4 and K > 0, if n > CdK8 for some constant Cd > 0 depending on d, and P spans at most K 􀀀n􀀀1 d􀀀1 ordinary hyperplanes, then all but at most Od(K) points of P lie on a hyperplane, an elliptic normal curve, or a rational acnodal curve. We also nd the maximum number of (d+1)-point hyperplanes, solving a d-dimensional analogue of the orchard problem. Our proofs rely on Green and Tao's results on ordinary lines, our earlier work on the 3-dimensional case, as well as results from classical algebraic geometry.
设P是实数射影d空间中n个点的集合,并非所有点都包含在超平面中,使得任意d个点张成一个超平面。P的普通超平面是包含P的恰好d个点的超平面。我们证明,如果d > 4,如果n依赖于d足够大,则P的普通超平面的数量至少为􀀀n􀀀1 d􀀀1􀀀Od(nb(d􀀀1)=2c)。这个界是紧的,并且给定d,我们可以计算出足够大的n的精确最小数量。这是一个结构定理对于具有很少普通超平面的集合的结果:对于任意d bbbbbb4和K bb> 0,如果n bb> CdK8对某常数Cd bb> 0依赖于d,且P张成最多K个􀀀n􀀀1 d􀀀1普通超平面,则P的除最多Od(K)个点以外的所有点都在超平面上,或在椭圆法向曲线上,或在有理结曲线上。我们还找到了(d+1)点超平面的最大数目,解决了一个d维的果园问题。我们的证明依赖于格林和陶在普通直线上的结果,我们在三维情况下的早期工作,以及经典代数几何的结果。
{"title":"On sets defining few ordinary hyperplanes","authors":"Aaron Lin, K. Swanepoel","doi":"10.19086/da.11949","DOIUrl":"https://doi.org/10.19086/da.11949","url":null,"abstract":"Let P be a set of n points in real projective d-space, not all contained in a hyperplane, such that any d points span a hyperplane. An ordinary hyperplane of P is a hyperplane containing exactly d points of P. We show that if d > 4, the number of ordinary hyperplanes of P is at least 􀀀n􀀀1 d􀀀1 􀀀 Od(nb(d􀀀1)=2c) if n is suciently large depending on d. This bound is tight, and given d, we can calculate the exact minimum number for suciently large n. This is a consequence of a structure theorem for sets with few ordinary hyperplanes: For any d > 4 and K > 0, if n > CdK8 for some constant Cd > 0 depending on d, and P spans at most K 􀀀n􀀀1 d􀀀1 ordinary hyperplanes, then all but at most Od(K) points of P lie on a hyperplane, an elliptic normal curve, or a rational acnodal curve. We also nd the maximum number of (d+1)-point hyperplanes, solving a d-dimensional analogue of the orchard problem. Our proofs rely on Green and Tao's results on ordinary lines, our earlier work on the 3-dimensional case, as well as results from classical algebraic geometry.","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45284517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Semicontinuity of structure for small sumsets in compact abelian groups 紧阿贝尔群中小sumset结构的半连续性
IF 1.1 3区 数学 Q2 Mathematics Pub Date : 2018-07-04 DOI: 10.19086/da.11089
John T. Griesmer
Semicontinuity of structure for small sumsets in compact abelian groups, Discrete Analysis 2019:18, 46 pp.The well-known Cauchy-Davenport theorem asserts that if $A$ and $B$ are two subsets of a cyclic group of prime order $p$, then $|A+B|geqmin{|A|+|B|-1,p}$. It was generalized to a suitable statement about finite subsets of arbitrary Abelian groups by Martin Kneser: note that if $A$ and $B$ are unions of cosets of a subgroup $H$, then $|A+B|$ can be as small as $|A|+|B|-|H|$, and Kneser's theorem takes account of this. The question of what one can say when the inequalities are sharp was answered by Kemperman, who provided a rather complicated structural characterization.One can ask a corresponding question when $G$ is a compact Hausdorff Abelian topological group with Haar measure $m$. Now we let $A$ and $B$ be $m$-measurable subsets such that $$m_*(A+B)leq m(A)+m(B).$$ Here $m_*$ is the inner $m$-measure, since $A+B$ does not have to be measurable. (Indeed, Sierpinski showed that there are two measure-zero sets $A,B$ of reals such that $A+B$ is not measurable.) Such pairs of sets were characterized by Kneser under the additional assumption that $G$ is connected. An obvious example is where $A$ and $B$ are subintervals of the circle group, and Kneser showed that, roughly speaking, every example is an inverse image of such an example under a surjective $m$-measurable homomorphism. When $G$ is disconnected the characterization of pairs satisfying $m_*(A+B)=m(A)+m(B)$ is more complicated. Building on work of Hamidoune, Rodseth, Serra, and Zemor, Grynkiewicz provided a complete characterization of such pairs for discrete abelian groups $G$. The author of this paper combined Grynkiewicz's and Kneser's proofs to extend this to arbitrary compact Hausdorff abelian groups.The aim of this paper is to prove a stability version of preceding results: this is the meaning of the phrase "semicontinuity of structure" in the title. In other words, the paper is concerned with what happens if $m_*(A+B)leq m(A)+m(B)+delta$ when $delta$ is sufficiently small as a function of $m(A)$ and $m(B)$. One of the main results is the following, which has a similar flavour to the triangle removal lemma. Define $A+_delta B$ to be the set of all "$delta$-popular" elements of $A+B$ -- that is, the set of all $xin G$ such that $m{ain A: x-ain B}geqdelta$. The author shows that for every $epsilon>0$ there exists $delta>0$ such that if $m(A+_delta B)leq m(A)+m(B)+delta$, then there exist approximations $A'$ and $B'$ such that $m(Atriangle A')+m(Btriangle B')
紧阿贝尔群中小sumset结构的半连续性,离散分析2019:18,46页。著名的Cauchy-Davenport定理断言,如果$A$和$B$是素数阶$p$循环群的两个子集,则$|A+B|geqmin{|A|+|B|-1,p}$。Martin Kneer将其推广到关于任意阿贝尔群的有限子集的一个合适的陈述:注意,如果$a$和$B$是子群$H$的陪集的并集,那么$|a+B|$可以小到$|a|+|B|-|H|$,Kneer定理考虑了这一点。当不平等现象尖锐时,人们可以说什么的问题由Kemperman回答,他提供了一个相当复杂的结构特征。当$G$是Haar测度为$m$的紧致Hausdorf-Abelian拓扑群时,可以提出相应的问题。现在我们让$A$和$B$是$m$可测量子集,使得$$m_*(A+B)leqm(A)+m(B).$$这里$m_*$是内部$m$-度量,因为$A+B$不一定是可度量的。(事实上,Sierpinski证明了存在两个实数的测度零集$A,B$,使得$A+B$是不可测量的。)Kneer在$G$是连通的附加假设下对这两对集进行了刻画。一个明显的例子是$A$和$B$是圆群的子区间,Kneer证明,粗略地说,每个例子都是这样一个例子在满射$m$可测量同态下的逆像。当$G$断开时,满足$m_*(A+B)=m(A)+m(B)$的对的特征更加复杂。在Hamidoune、Rodseth、Serra和Zemor的工作基础上,Grynkiewicz为离散阿贝尔群$G$提供了这种对的完整刻画。本文结合Grynkiewicz和Kneer的证明,将其推广到任意紧Hausdorff阿贝尔群。本文的目的是证明先前结果的稳定性版本:这就是标题中短语“结构的半连续性”的含义。换句话说,本文关注的是,当$delta$作为$m(A)$和$m(B)$的函数足够小时,如果$m_*(A+B)leq m(A。主要结果之一如下,它与三角形去除引理具有相似的味道。将$A+_delta B$定义为$A+B$的所有“$delta$-流行”元素的集合,也就是说,G$中所有$x的集合,使得$m{A in A:x-A in B}geqdelta。作者证明,对于每$epsilon>0$,存在$delta>0$,使得如果$m(A+_delta B)leq m(A)+m(B)+delta$,则存在近似值$A'$和$B'$,使得$m(A三角形A')+m。如上所述,由于具有这种更强性质的对$A',B'$已经被分类,这给出了具有较弱性质的对$$A,B$的完整表征。该结果的证明导致对$A,B$的期望分类,其中$m_*(A+B)leq m(A)+m(B)+delta$。由于在证明中使用了超积方法,因此没有提供$delta$对$m(A)$和$m(B)$的显式依赖性。这些结果已经被Tao对连通阿贝尔群$G$证明了,但对不连通群的推广并不简单。Tao的证明恢复了Kneer对连通阿贝尔群的集合$A,B$的$m_*(A+B)leq m(A)+m(B)$的刻画,而本工作使用了在缺乏连通性的情况下这类集合的详细结构作为构建块。
{"title":"Semicontinuity of structure for small sumsets in compact abelian groups","authors":"John T. Griesmer","doi":"10.19086/da.11089","DOIUrl":"https://doi.org/10.19086/da.11089","url":null,"abstract":"Semicontinuity of structure for small sumsets in compact abelian groups, Discrete Analysis 2019:18, 46 pp.\u0000\u0000The well-known Cauchy-Davenport theorem asserts that if $A$ and $B$ are two subsets of a cyclic group of prime order $p$, then $|A+B|geqmin{|A|+|B|-1,p}$. It was generalized to a suitable statement about finite subsets of arbitrary Abelian groups by Martin Kneser: note that if $A$ and $B$ are unions of cosets of a subgroup $H$, then $|A+B|$ can be as small as $|A|+|B|-|H|$, and Kneser's theorem takes account of this. The question of what one can say when the inequalities are sharp was answered by Kemperman, who provided a rather complicated structural characterization.\u0000\u0000One can ask a corresponding question when $G$ is a compact Hausdorff Abelian topological group with Haar measure $m$. Now we let $A$ and $B$ be $m$-measurable subsets such that $$m_*(A+B)leq m(A)+m(B).$$\u0000 \u0000Here $m_*$ is the inner $m$-measure, since $A+B$ does not have to be measurable. (Indeed, Sierpinski showed that there are two measure-zero sets $A,B$ of reals such that $A+B$ is not measurable.) \u0000\u0000Such pairs of sets were characterized by Kneser under the additional assumption that $G$ is connected. An obvious example is where $A$ and $B$ are subintervals of the circle group, and Kneser showed that, roughly speaking, every example is an inverse image of such an example under a surjective $m$-measurable homomorphism. When $G$ is disconnected the characterization of pairs satisfying $m_*(A+B)=m(A)+m(B)$ is more complicated. Building on work of Hamidoune, Rodseth, Serra, and Zemor, Grynkiewicz provided a complete characterization of such pairs for discrete abelian groups $G$. The author of this paper combined Grynkiewicz's and Kneser's proofs to extend this to arbitrary compact Hausdorff abelian groups.\u0000\u0000The aim of this paper is to prove a stability version of preceding results: this is the meaning of the phrase \"semicontinuity of structure\" in the title. In other words, the paper is concerned with what happens if $m_*(A+B)leq m(A)+m(B)+delta$ when $delta$ is sufficiently small as a function of $m(A)$ and $m(B)$. One of the main results is the following, which has a similar flavour to the triangle removal lemma. Define $A+_delta B$ to be the set of all \"$delta$-popular\" elements of $A+B$ -- that is, the set of all $xin G$ such that $m{ain A: x-ain B}geqdelta$. The author shows that for every $epsilon>0$ there exists $delta>0$ such that if $m(A+_delta B)leq m(A)+m(B)+delta$, then there exist approximations $A'$ and $B'$ such that $m(Atriangle A')+m(Btriangle B')<epsilon$ and $m(A'+B')leq m(A')+m(B')$. Since, as was mentioned above, pairs $A',B'$ with this stronger property have been classified, this gives a complete characterization of pairs $A,B$ with the weaker property. \u0000\u0000The proof of this result leads to the desired classification of pairs $A,B$ for which $m_*(A+B)leq m(A)+m(B)+delta$. No explicit dependence of $delta$ on $m(A)$ and $m(B)$ is provided, because ultraproduct","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2018-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43338183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Stronger arithmetic equivalence 更强的算术等价
IF 1.1 3区 数学 Q2 Mathematics Pub Date : 2018-06-24 DOI: 10.19086/da.8654
Shachar Lovett
This paper considers two alternative strengthenings of the notion of arithmetic equivalence, which the author calls local integral equivalence and solvable equivalence. (The latter turns out to be strictly stronger than the former.) They have the advantage of being easier to check than Prasad’s notion, which the author calls integral equivalence. Furthermore, solvable equivalence, which the author shows does not imply integral equivalence, is nevertheless a sufficient condition to imply that the invariants considered by Prasad are equal. This opens the door to easier proofs of Prasad’s result, and lessens the reliance on Scott’s construction: the author finds a generalization of this construction that yields infinitely many examples of solvable equivalence. The paper also contains several examples to clarify the relationships between the various different notions of equivalence. Some of these examples (which are mainly found with the help of a computer) answer open questions from the group theory literature.
本文考虑了算术等价概念的两种强化形式,即局部积分等价和可解等价。(事实证明,后者比前者强得多。)它们的优点是比普拉萨德的概念更容易检验,普拉萨德的概念被作者称为积分等价。此外,可解等价是普拉萨德所考虑的不变量相等的充分条件,尽管作者证明了可解等价并不意味着积分等价。这为普拉萨德的结果的简单证明打开了大门,并减少了对斯科特结构的依赖:作者发现了这种结构的概括,产生了无限多的可解等价的例子。本文还列举了几个例子来阐明各种不同等价概念之间的关系。其中一些例子(主要是在计算机的帮助下找到的)回答了群论文献中的开放性问题。
{"title":"Stronger arithmetic equivalence","authors":"Shachar Lovett","doi":"10.19086/da.8654","DOIUrl":"https://doi.org/10.19086/da.8654","url":null,"abstract":"This paper considers two alternative strengthenings of the notion of arithmetic equivalence, which the author calls local integral equivalence and solvable equivalence. (The latter turns out to be strictly stronger than the former.) They have the advantage of being easier to check than Prasad’s notion, which the author calls integral equivalence. Furthermore, solvable equivalence, which the author shows does not imply integral equivalence, is nevertheless a sufficient condition to imply that the invariants considered by Prasad are equal. This opens the door to easier proofs of Prasad’s result, and lessens the reliance on Scott’s construction: the author finds a generalization of this construction that yields infinitely many examples of solvable equivalence. The paper also contains several examples to clarify the relationships between the various different notions of equivalence. Some of these examples (which are mainly found with the help of a computer) answer open questions from the group theory literature.","PeriodicalId":37312,"journal":{"name":"Discrete Analysis","volume":null,"pages":null},"PeriodicalIF":1.1,"publicationDate":"2018-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47120580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 34
期刊
Discrete Analysis
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1