首页 > 最新文献

Experimental Mathematics最新文献

英文 中文
Mahler Measure of Families of Polynomials Defining Genus 2 and 3 Curves 定义2和3属曲线的多项式族的马勒测度
IF 0.5 4区 数学 Q2 MATHEMATICS Pub Date : 2021-06-20 DOI: 10.1080/10586458.2021.1926014
Hang Liu, H. Qin
Abstract In this article, we study the Mahler measures of more than 500 families of reciprocal polynomials defining genus 2 and genus 3 curves. We numerically find relations between the Mahler measures of these polynomials with special values of L-functions. We also numerically discover more than 100 identities between Mahler measures involving different families of polynomials defining genus 2 and genus 3 curves. Furthermore, we study the Mahler measures of several families of nonreciprocal polynomials defining genus 2 curves and numerically find relations between the Mahler measures of these families and special values of L-functions of elliptic curves. We also find identities between the Mahler measures of these nonreciprocal families and tempered polynomials defining genus 1 curves. We will explain these relations by considering the pushforward and pullback of certain elements in K 2 of curves defined by these polynomials and applying Beilinson’s conjecture on K 2 of curves. We show that there are two and three explicit linearly independent elements in K 2 of certain families of genus 2 and genus 3 curves, respectively.
摘要本文研究了500多个互反多项式族的马勒测度,这些族定义了2属曲线和3属曲线。我们用数值方法找到了这些多项式的马勒测度与l函数的特殊值之间的关系。我们还在数值上发现了涉及不同多项式族的马勒测度之间的100多个恒等式,这些多项式族定义了格2和格3曲线。在此基础上,我们进一步研究了若干非互易多项式族的Mahler测度,并通过数值方法找到了这些族的Mahler测度与椭圆曲线l函数的特殊值之间的关系。我们还发现了这些非互易族的马勒测度与定义1属曲线的回火多项式之间的恒等式。我们将通过考虑由这些多项式定义的曲线K 2中某些元素的推进和后退,并将Beilinson猜想应用于曲线K 2来解释这些关系。我们证明了在某些2属和3属曲线族的K 2中分别有两个和三个显式线性无关的元素。
{"title":"Mahler Measure of Families of Polynomials Defining Genus 2 and 3 Curves","authors":"Hang Liu, H. Qin","doi":"10.1080/10586458.2021.1926014","DOIUrl":"https://doi.org/10.1080/10586458.2021.1926014","url":null,"abstract":"Abstract In this article, we study the Mahler measures of more than 500 families of reciprocal polynomials defining genus 2 and genus 3 curves. We numerically find relations between the Mahler measures of these polynomials with special values of L-functions. We also numerically discover more than 100 identities between Mahler measures involving different families of polynomials defining genus 2 and genus 3 curves. Furthermore, we study the Mahler measures of several families of nonreciprocal polynomials defining genus 2 curves and numerically find relations between the Mahler measures of these families and special values of L-functions of elliptic curves. We also find identities between the Mahler measures of these nonreciprocal families and tempered polynomials defining genus 1 curves. We will explain these relations by considering the pushforward and pullback of certain elements in K 2 of curves defined by these polynomials and applying Beilinson’s conjecture on K 2 of curves. We show that there are two and three explicit linearly independent elements in K 2 of certain families of genus 2 and genus 3 curves, respectively.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":"32 1","pages":"321 - 336"},"PeriodicalIF":0.5,"publicationDate":"2021-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/10586458.2021.1926014","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41523307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Liquid Tensor Experiment 液体张量实验
IF 0.5 4区 数学 Q2 MATHEMATICS Pub Date : 2021-06-20 DOI: 10.1080/10586458.2021.1926016
P. Scholze
Abstract I propose a formalization challenge. The text below is a slightly edited version of the blog post Xena Project – Liquid Tensor Experiment, and I have kept its informal style.
摘要我提出了一个形式化的挑战。下面的文本是博客文章Xena Project–Liquid Tensor Experiment的一个稍微编辑过的版本,我保留了它的非正式风格。
{"title":"Liquid Tensor Experiment","authors":"P. Scholze","doi":"10.1080/10586458.2021.1926016","DOIUrl":"https://doi.org/10.1080/10586458.2021.1926016","url":null,"abstract":"Abstract I propose a formalization challenge. The text below is a slightly edited version of the blog post Xena Project – Liquid Tensor Experiment, and I have kept its informal style.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":"31 1","pages":"349 - 354"},"PeriodicalIF":0.5,"publicationDate":"2021-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/10586458.2021.1926016","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48045444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
Algorithmic Symplectic Packing 算法辛包装
IF 0.5 4区 数学 Q2 MATHEMATICS Pub Date : 2021-06-18 DOI: 10.1080/10586458.2022.2041135
Greta Fischer, J. Gutt, M. Junger
In this article we explore a symplectic packing problem where the targets and domains are 2n-dimensional symplectic manifolds. We work in the context where the manifolds have first homology group equal to Z, and we require the embeddings to induce isomorphisms between first homology groups. In this case, Maley, Mastrangeli and Traynor [MMT00] showed that the problem can be reduced to a combinatorial optimization problem, namely packing certain allowable simplices into a given standard simplex. They designed a computer program and presented computational results. In particular, they determined the simplex packing widths in dimension four for up to k = 12 simplices, along with lower bounds for higher values of k. We present a modified algorithmic approach that allows us to determine the k-simplex packing widths for up to k = 13 simplices in dimension four and up to k = 8 simplices in dimension six. Moreover, our approach determines all simplex-multisets that allow for optimal packings.
本文研究了目标和域为2n维辛流形的辛堆积问题。我们在流形具有等于Z的第一同调群的情况下工作,并且我们需要嵌入来诱导第一同调组之间的同构。在这种情况下,Maley、Mastrangeli和Traynor[MMT00]表明,该问题可以归结为组合优化问题,即将某些允许的单纯形封装到给定的标准单纯形中。他们设计了一个计算机程序并给出了计算结果。特别地,他们确定了高达k=12的单形在维度4中的单纯形填充宽度,以及k的较高值的下界。我们提出了一种改进的算法方法,允许我们确定高达k=13的维度4和高达k=8的维度6的单形的k-单纯形填充宽度。此外,我们的方法确定了所有允许最优包装的单纯形多集。
{"title":"Algorithmic Symplectic Packing","authors":"Greta Fischer, J. Gutt, M. Junger","doi":"10.1080/10586458.2022.2041135","DOIUrl":"https://doi.org/10.1080/10586458.2022.2041135","url":null,"abstract":"In this article we explore a symplectic packing problem where the targets and domains are 2n-dimensional symplectic manifolds. We work in the context where the manifolds have first homology group equal to Z, and we require the embeddings to induce isomorphisms between first homology groups. In this case, Maley, Mastrangeli and Traynor [MMT00] showed that the problem can be reduced to a combinatorial optimization problem, namely packing certain allowable simplices into a given standard simplex. They designed a computer program and presented computational results. In particular, they determined the simplex packing widths in dimension four for up to k = 12 simplices, along with lower bounds for higher values of k. We present a modified algorithmic approach that allows us to determine the k-simplex packing widths for up to k = 13 simplices in dimension four and up to k = 8 simplices in dimension six. Moreover, our approach determines all simplex-multisets that allow for optimal packings.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2021-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47942757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Universality of Nodal Count Distribution in Large Metric Graphs 大度量图中节点数分布的普适性
IF 0.5 4区 数学 Q2 MATHEMATICS Pub Date : 2021-06-11 DOI: 10.1080/10586458.2022.2092565
Lior Alon, R. Band, G. Berkolaiko
. An eigenfunction of the Laplacian on a metric (quantum) graph has an excess number of zeros due to the graph’s non-trivial topology. This number, called the nodal surplus, is an integer between 0 and the graph’s first Betti number β . We study the distribution of the nodal surplus values in the countably infinite set of the graph’s eigenfunctions. We conjecture that this distribution converges to Gaussian for any sequence of graphs of growing β . We prove this conjecture for several special graph sequences and test it numerically for a variety of well-known graph families. Accurate computation of the distribution is made possible by a formula expressing the nodal surplus distribution as an integral over a high-dimensional torus.
在度量(量子)图上的拉普拉斯算子的本征函数由于图的非平凡拓扑而具有过量的零。这个数字被称为节点盈余,是一个介于0和图的第一个贝蒂数β之间的整数。我们研究了图的本征函数的可数有限集中节点剩余值的分布。我们猜想,对于任何一系列增长β的图,这种分布都收敛于高斯分布。我们对几个特殊的图序列证明了这一猜想,并对各种著名的图族进行了数值检验。通过将节点盈余分布表示为高维环面上的积分的公式,可以精确计算该分布。
{"title":"Universality of Nodal Count Distribution in Large Metric Graphs","authors":"Lior Alon, R. Band, G. Berkolaiko","doi":"10.1080/10586458.2022.2092565","DOIUrl":"https://doi.org/10.1080/10586458.2022.2092565","url":null,"abstract":". An eigenfunction of the Laplacian on a metric (quantum) graph has an excess number of zeros due to the graph’s non-trivial topology. This number, called the nodal surplus, is an integer between 0 and the graph’s first Betti number β . We study the distribution of the nodal surplus values in the countably infinite set of the graph’s eigenfunctions. We conjecture that this distribution converges to Gaussian for any sequence of graphs of growing β . We prove this conjecture for several special graph sequences and test it numerically for a variety of well-known graph families. Accurate computation of the distribution is made possible by a formula expressing the nodal surplus distribution as an integral over a high-dimensional torus.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2021-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48398695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Hard Diagrams of the Unknot 解开结的硬图
IF 0.5 4区 数学 Q2 MATHEMATICS Pub Date : 2021-04-29 DOI: 10.1080/10586458.2022.2161676
Benjamin A. Burton, Hsien-Chih Chang, M. Löffler, Clément Maria, Arnaud de Mesmay, S. Schleimer, E. Sedgwick, J. Spreer
We present three"hard"diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $mathbb{S}^2$. Both examples are constructed by applying previously proposed methods. The proof of their hardness uses significant computational resources. We also determine that no small"standard"example of a hard unknot diagram requires more than one extra crossing for Reidemeister moves in $mathbb{S}^2$.
我们提出解结的三个“硬”图。它们需要(至少)三个额外的交叉点,才能通过Reidemeister在$mathbb{S}^2$中的移动简化为简单的解结图。这两个例子都是通过应用先前提出的方法构建的。它们的硬度证明使用了大量的计算资源。我们还确定,对于硬解结图的小“标准”示例,$mathbb{S}^2$中的Reidemeister移动,不需要超过一次的额外交叉。
{"title":"Hard Diagrams of the Unknot","authors":"Benjamin A. Burton, Hsien-Chih Chang, M. Löffler, Clément Maria, Arnaud de Mesmay, S. Schleimer, E. Sedgwick, J. Spreer","doi":"10.1080/10586458.2022.2161676","DOIUrl":"https://doi.org/10.1080/10586458.2022.2161676","url":null,"abstract":"We present three\"hard\"diagrams of the unknot. They require (at least) three extra crossings before they can be simplified to the trivial unknot diagram via Reidemeister moves in $mathbb{S}^2$. Both examples are constructed by applying previously proposed methods. The proof of their hardness uses significant computational resources. We also determine that no small\"standard\"example of a hard unknot diagram requires more than one extra crossing for Reidemeister moves in $mathbb{S}^2$.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2021-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43372802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Simple Type Theory is not too Simple: Grothendieck’s Schemes Without Dependent Types 简单类型理论不是太简单:没有依赖类型的Grothendieck方案
IF 0.5 4区 数学 Q2 MATHEMATICS Pub Date : 2021-04-19 DOI: 10.1080/10586458.2022.2062073
Anthony Bordg, Lawrence Charles Paulson, Wenda Li
Abstract Church’s simple type theory is often deemed too simple for elaborate mathematical constructions. In particular, doubts were raised whether schemes could be formalized in this setting and a challenge was issued. Schemes are sophisticated mathematical objects in algebraic geometry introduced by Alexander Grothendieck in 1960. In this article we report on a successful formalization of schemes in the simple type theory of the proof assistant Isabelle/HOL, and we discuss the design choices which make this work possible. We show in the particular case of schemes how the powerful dependent types of Coq or Lean can be traded for a minimalist apparatus called locales.
丘奇的简单类型理论通常被认为过于简单,无法进行复杂的数学构造。特别是,有人怀疑在这种情况下能否正式确定各项计划,并提出了一项挑战。方案是代数几何中复杂的数学对象,由Alexander Grothendieck于1960年引入。本文报道了证明助手Isabelle/HOL的简单类型理论中方案的成功形式化,并讨论了使这项工作成为可能的设计选择。在方案的特殊情况下,我们展示了如何将Coq或Lean的强大依赖类型交换为称为locale的极简设备。
{"title":"Simple Type Theory is not too Simple: Grothendieck’s Schemes Without Dependent Types","authors":"Anthony Bordg, Lawrence Charles Paulson, Wenda Li","doi":"10.1080/10586458.2022.2062073","DOIUrl":"https://doi.org/10.1080/10586458.2022.2062073","url":null,"abstract":"Abstract Church’s simple type theory is often deemed too simple for elaborate mathematical constructions. In particular, doubts were raised whether schemes could be formalized in this setting and a challenge was issued. Schemes are sophisticated mathematical objects in algebraic geometry introduced by Alexander Grothendieck in 1960. In this article we report on a successful formalization of schemes in the simple type theory of the proof assistant Isabelle/HOL, and we discuss the design choices which make this work possible. We show in the particular case of schemes how the powerful dependent types of Coq or Lean can be traded for a minimalist apparatus called locales.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":"31 1","pages":"364 - 382"},"PeriodicalIF":0.5,"publicationDate":"2021-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48872374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
On Combinatorics of Voronoi Polytopes for Perturbations of the Dual Root Lattices 对偶根格摄动的Voronoi多面体组合
IF 0.5 4区 数学 Q2 MATHEMATICS Pub Date : 2021-04-16 DOI: 10.1080/10586458.2021.1994488
A. Garber
The Voronoi conjecture on parallelohedra claims that for every convex polytope P that tiles Euclidean d-dimensional space with translations there exists a d-dimensional lattice such that P and the Voronoi polytope of this lattice are affinely equivalent. The Voronoi conjecture is still open for the general case but it is known that some combinatorial restriction for the face structure of P ensure that the Voronoi conjecture holds for P . In this paper we prove that if P is the Voronoi polytope of one of the dual root lattices D∗ d , E∗ 6 , E∗ 7 or E∗ 8 = E8 or their small perturbations, then every parallelohedron combinatorially equivalent to P in strong sense satisfies the Voronoi conjecture.
平行四边形上的Voronoi猜想声称,对于每一个用平移划分欧几里得d维空间的凸多面体P,都存在一个d维格,使得P和这个格的Vorononi多面体是仿射等价的。Voronoi猜想对一般情况仍然是开放的,但已知对P的面结构的一些组合限制确保了Voronoii猜想对P成立。本文证明了如果P是对偶根格D*D、E*6、E*7或E*8=E8或它们的小扰动之一的Voronoi多面体,则在强意义上与P组合等价的每个平行多面体都满足Voronoi猜想。
{"title":"On Combinatorics of Voronoi Polytopes for Perturbations of the Dual Root Lattices","authors":"A. Garber","doi":"10.1080/10586458.2021.1994488","DOIUrl":"https://doi.org/10.1080/10586458.2021.1994488","url":null,"abstract":"The Voronoi conjecture on parallelohedra claims that for every convex polytope P that tiles Euclidean d-dimensional space with translations there exists a d-dimensional lattice such that P and the Voronoi polytope of this lattice are affinely equivalent. The Voronoi conjecture is still open for the general case but it is known that some combinatorial restriction for the face structure of P ensure that the Voronoi conjecture holds for P . In this paper we prove that if P is the Voronoi polytope of one of the dual root lattices D∗ d , E∗ 6 , E∗ 7 or E∗ 8 = E8 or their small perturbations, then every parallelohedron combinatorially equivalent to P in strong sense satisfies the Voronoi conjecture.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2021-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48133149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
An Algorithm to Find Ribbon Disks for Alternating Knots 一种寻找交替结的带状圆盘的算法
IF 0.5 4区 数学 Q2 MATHEMATICS Pub Date : 2021-02-23 DOI: 10.1080/10586458.2022.2158968
Brendan Owens, Frank Swenton
We describe an algorithm to find ribbon disks for alternating knots, and the results of a computer implementation of this algorithm. The algorithm is underlain by a slice link obstruction coming from Donaldson's diagonalisation theorem. It successfully finds ribbon disks for slice two-bridge knots and for the connected sum of any alternating knot with its reverse mirror, as well as for 662,903 prime alternating knots of 21 or fewer crossings. We also identify some examples of ribbon alternating knots for which the algorithm fails to find ribbon disks, though a related search identifies all such examples known. Combining these searches with known obstructions, we resolve the sliceness of all but 3,276 of the over 1.2 billion prime alternating knots with 21 or fewer crossings.
我们描述了一种寻找交替结带盘的算法,以及该算法的计算机实现结果。该算法的基础是来自Donaldson对角化定理的切片链路阻塞。它成功地为切片双桥结和任何交替结与其反向镜像的连接和以及662,903个交叉点小于等于21的素数交替结找到了带盘。我们还确定了一些带状交替结的例子,其中算法无法找到带状磁盘,尽管相关搜索确定了所有已知的此类例子。将这些搜索与已知的障碍物结合起来,我们解决了超过12亿个素数交替结中的3276个,其中21个或更少的交叉点。
{"title":"An Algorithm to Find Ribbon Disks for Alternating Knots","authors":"Brendan Owens, Frank Swenton","doi":"10.1080/10586458.2022.2158968","DOIUrl":"https://doi.org/10.1080/10586458.2022.2158968","url":null,"abstract":"We describe an algorithm to find ribbon disks for alternating knots, and the results of a computer implementation of this algorithm. The algorithm is underlain by a slice link obstruction coming from Donaldson's diagonalisation theorem. It successfully finds ribbon disks for slice two-bridge knots and for the connected sum of any alternating knot with its reverse mirror, as well as for 662,903 prime alternating knots of 21 or fewer crossings. We also identify some examples of ribbon alternating knots for which the algorithm fails to find ribbon disks, though a related search identifies all such examples known. Combining these searches with known obstructions, we resolve the sliceness of all but 3,276 of the over 1.2 billion prime alternating knots with 21 or fewer crossings.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2021-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43721418","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
New Representations for all Sporadic Apéry-Like Sequences, With Applications to Congruences 所有偶发apacry - like序列的新表示及其在同余上的应用
IF 0.5 4区 数学 Q2 MATHEMATICS Pub Date : 2021-02-23 DOI: 10.1080/10586458.2021.1982080
O. Gorodetsky
Sporadic Ap'ery-like sequences were discovered by Zagier, by Almkvist and Zudilin and by Cooper in their searches for integral solutions for certain families of second- and third-order differential equations. We find new representations, in terms of constant terms of powers of Laurent polynomials, for all the 15 sporadic sequences. The new representations in turn lead to binomial expressions for the sequences, which, as opposed to previous expressions, do not involve powers of 8 and powers of 3. We use these to establish the supercongruence $B_{np^k} equiv B_{np^{k-1}} bmod p^{2k}$ for all primes $p ge 3$ and integers $n,k ge 1$, where $B_n$ is a sequence discovered by Zagier and known as Sequence $mathbf{B}$. Additionally, for 14 out of the 15 sequences, the Newton polytopes of the Laurent polynomials used in our representations contain the origin as their only interior integral point. This property allows us to prove that these 14 sporadic sequences satisfy a strong form of the Lucas congruences, extending work of Malik and Straub. Moreover, we obtain lower bounds on the $p$-adic valuation of these 14 sequences via recent work of Delaygue.
Zagier、Almkvist和Zudilin以及Cooper在寻找某些二阶和三阶微分方程族的积分解时发现了零星的类Ap序列。对于所有15个偶发序列,我们发现了用洛朗多项式的常幂项表示的新表示。新的表示反过来导致序列的二项式表达式,与以前的表达式不同,它不涉及8的幂和3的幂。我们用这些来建立所有素数$pge3$和整数$n,kge1$的超余数$B_{np^k}equiv B_{np^{k-1}}bmod p^{2k}$,其中$B_n$是Zagier发现的序列,称为序列$mathbf{B}$。此外,对于15个序列中的14个,在我们的表示中使用的洛朗多项式的牛顿多面体包含原点作为其唯一的内部积分点。这个性质使我们能够证明这14个零星序列满足Lucas同余的强形式,扩展了Malik和Straub的工作。此外,我们通过Delaygue最近的工作获得了这14个序列的$p$adic估值的下界。
{"title":"New Representations for all Sporadic Apéry-Like Sequences, With Applications to Congruences","authors":"O. Gorodetsky","doi":"10.1080/10586458.2021.1982080","DOIUrl":"https://doi.org/10.1080/10586458.2021.1982080","url":null,"abstract":"Sporadic Ap'ery-like sequences were discovered by Zagier, by Almkvist and Zudilin and by Cooper in their searches for integral solutions for certain families of second- and third-order differential equations. We find new representations, in terms of constant terms of powers of Laurent polynomials, for all the 15 sporadic sequences. The new representations in turn lead to binomial expressions for the sequences, which, as opposed to previous expressions, do not involve powers of 8 and powers of 3. We use these to establish the supercongruence $B_{np^k} equiv B_{np^{k-1}} bmod p^{2k}$ for all primes $p ge 3$ and integers $n,k ge 1$, where $B_n$ is a sequence discovered by Zagier and known as Sequence $mathbf{B}$. Additionally, for 14 out of the 15 sequences, the Newton polytopes of the Laurent polynomials used in our representations contain the origin as their only interior integral point. This property allows us to prove that these 14 sporadic sequences satisfy a strong form of the Lucas congruences, extending work of Malik and Straub. Moreover, we obtain lower bounds on the $p$-adic valuation of these 14 sequences via recent work of Delaygue.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2021-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43232337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
The Sn -Equivariant Rational Homology of the Tropical Moduli Spaces Δ2,n 热带模空间的Sn -等变有理同调Δ2,n
IF 0.5 4区 数学 Q2 MATHEMATICS Pub Date : 2021-02-09 DOI: 10.1080/10586458.2020.1870179
Claudia He Yun
Abstract We compute the Sn -equivariant rational homology of the tropical moduli spaces for using a cellular chain complex for symmetric Δ-complexes in Sage.
摘要:本文利用元胞链配合物计算了对称Δ-complexes的热带模空间的Sn -等变有理同调。
{"title":"The Sn -Equivariant Rational Homology of the Tropical Moduli Spaces Δ2,n","authors":"Claudia He Yun","doi":"10.1080/10586458.2020.1870179","DOIUrl":"https://doi.org/10.1080/10586458.2020.1870179","url":null,"abstract":"Abstract We compute the Sn -equivariant rational homology of the tropical moduli spaces for using a cellular chain complex for symmetric Δ-complexes in Sage.","PeriodicalId":50464,"journal":{"name":"Experimental Mathematics","volume":"31 1","pages":"1345 - 1357"},"PeriodicalIF":0.5,"publicationDate":"2021-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/10586458.2020.1870179","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41498224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
期刊
Experimental Mathematics
全部 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