• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    Integers

    Integers

    JournalISSN 1867-0652eISSN 1867-0652

    年发文量

    研究主题

    论文(1113)

    排序
    1ON THE FAMILY OF ELLIPTIC CURVES X + 1/X + Y + 1/Y + T = 0.
    Abhishek Juyal,Dustin Moody

    We study various properties of the family of elliptic curves x+1/x+y+1/y+t = 0, which is isomorphic to the Weierstrass curve E t : Y 2 = X ( X 2 + ( t 2 4 - 2 ) X + 1 ) . . This equation arises from the study of the Mahler measure of polynomials. We show that the rank of E t ( Q ¯ ( t ) ) is 0 and the torsion subgroup of E t ( Q ( t ) ) is isomorphic to Z ∕ 4 Z . Over the rational field Q we obtain infinite subfamilies of ranks (at least) one and two, and find specific instances of Et with rank 5 and 6. We also determine all possible torsion subgroups of E t ( Q ) and conclude with some results regarding integral points in arithmetic progression on Et .

    2021
    引用
    AI阅读
    加入学术空间
    2Invariant Measures for 2-Dimensional Maps and Associated Rényi Maps
    Fritz Schweiger
    2021
    引用
    AI阅读
    加入学术空间
    3Representation Numbers of Spinor Regular Ternary Quadratic Forms
    Zafer Selçuk Aygin,Greg Doyle,Florian Münkel,Lerna Pehlivan,Kenneth S. Williams
    2021
    引用
    AI阅读
    加入学术空间
    4Parity palindrome compositions
    George E. Andrews,Greg Simay
    2021引用:3
    引用
    AI阅读
    加入学术空间
    5Arithmetic Progressions in Sumsets of Sparse Sets
    Noga Alon,Ryan Alweiss,Yang P. Liu,Anders Martinsson,Shyam Narayanan

    A set of positive integers $A \subset \mathbb{Z}_{>0}$ is \emph{log-sparse} if there is an absolute constant $C$ so that for any positive integer $x$ the sequence contains at most $C$ elements in the interval $[x,2x)$. In this note we study arithmetic progressions in sums of log-sparse subsets of $\mathbb{Z}_{>0}$. We prove that for any log-sparse subsets $S_1, \dots, S_n$ of $\mathbb{Z}_{>0},$ the sumset $S = S_1 + \cdots + S_n$ cannot contain an arithmetic progression of size greater than $n^{(1+o(1))n}.$ We also show that this is nearly tight by proving that there exist log-sparse sets $S_1, \dots, S_n$ such that $S_1 + \cdots + S_n$ contains an arithmetic progression of size $n^{(1-o(1)) n}.$

    2021引用:1
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 1113 篇论文

    高被引作者

    作者引用发文
    Takashi Agoh24310
    Steven J Miller23011
    Florian Luca19014
    James A. Sellers18511
    Helmut Prodinger17810
    Pieter Moree1723
    Lenny Jones1719
    Tamas K Lengyel1688
    Kevin A. Broughan1417
    Carl Pomerance1417

    高产作者

    作者引用发文
    Florian Luca19014
    Steven J Miller23011
    James A. Sellers18511
    Helmut Prodinger17810
    Takashi Agoh24310
    Lenny Jones1719
    Tamas K Lengyel1688
    Carl Pomerance1417
    Kevin A. Broughan1417
    Melvyn B. Nathanson967

    相关期刊

    The Art of Discrete and Applied Mathematics
    Ars Mathematica Contemporanea
    Australasian Journal of Combinatorics
    Journal Of Combinatorial Designs
    Contributions to Discrete Mathematics
    Journal of Integer Sequences
    Fibonacci Quarterly
    Elemente Der Mathematik
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS
    Enumerative combinatorics and applications