Least zero of pairs of additive cubic equations

Abstract An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms (1) <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mo>{</m:mo> <m:mtable columnspacing="0pt" rowspacing="0pt"> <m:mtr> <m:mtd columnalign="right"> <m:mi>F</m:mi> </m:mtd> <m:mtd columnalign="left"> <m:mrow> <m:mrow> <m:mi/> <m:mo>=</m:mo> <m:mrow> <m:mrow> <m:msub> <m:mi>c</m:mi> <m:mn>1</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mn>1</m:mn> <m:mn>3</m:mn> </m:msubsup> </m:mrow> <m:mo>+</m:mo> <m:mrow> <m:msub> <m:mi>c</m:mi> <m:mn>2</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mn>2</m:mn> <m:mn>3</m:mn> </m:msubsup> </m:mrow> <m:mo>+</m:mo> <m:mi mathvariant="normal">⋯</m:mi> <m:mo>+</m:mo> <m:mrow> <m:msub> <m:mi>c</m:mi> <m:mi>n</m:mi> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mi>n</m:mi> <m:mn>3</m:mn> </m:msubsup> </m:mrow> </m:mrow> <m:mo>=</m:mo> <m:mn>0</m:mn> </m:mrow> <m:mo>,</m:mo> </m:mrow> </m:mtd> </m:mtr> <m:mtr> <m:mtd columnalign="right"> <m:mi>G</m:mi> </m:mtd> <m:mtd columnalign="left"> <m:mrow> <m:mrow> <m:mi/> <m:mo>=</m:mo> <m:mrow> <m:mrow> <m:msub> <m:mi>d</m:mi> <m:mn>1</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mn>1</m:mn> <m:mn>3</m:mn> </m:msubsup> </m:mrow> <m:mo>+</m:mo> <m:mrow> <m:msub> <m:mi>d</m:mi> <m:mn>2</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mn>2</m:mn> <m:mn>3</m:mn> </m:msubsup> </m:mrow> <m:mo>+</m:mo> <m:mi mathvariant="normal">⋯</m:mi> <m:mo>+</m:mo> <m:mrow> <m:msub> <m:mi>d</m:mi> <m:mi>n</m:mi> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mi>n</m:mi> <m:mn>3</m:mn> </m:msubsup> </m:mrow> </m:mrow> <m:mo>=</m:mo> <m:mn>0</m:mn> </m:mrow> <m:mo>,</m:mo> </m:mrow> </m:mtd> </m:mtr> </m:mtable> </m:mrow> </m:math> \displaystyle{}\left\{\begin{aligned} \displaystyle{}F&amp;\displaystyle=c_{1}x_{1% }^{3}+c_{2}x_{2}^{3}+\cdots+c_{n}x_{n}^{3}=0,\\ \displaystyle G&amp;\displaystyle=d_{1}x_{1}^{3}+d_{2}x_{2}^{3}+\cdots+d_{n}x_{n}^% {3}=0,\\ \end{aligned}\right. under the “ M -good” condition for <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi>n</m:mi> <m:mo>≥</m:mo> <m:mn>16</m:mn> </m:mrow> </m:math> {n\geq 16} , where <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:msub> <m:mi>c</m:mi> <m:mn>1</m:mn> </m:msub> <m:mo>,</m:mo> <m:mi mathvariant="normal">…</m:mi> <m:mo>,</m:mo> <m:msub> <m:mi>c</m:mi> <m:mi>n</m:mi> </m:msub> </m:mrow> </m:math> {c_{1},\dots,c_{n}} and <m:math xmlns:m="http://www.w3.org/1

Authors

Institutions

Publication Details

Journal
Forum Mathematicum
Published
2026-02-19
DOI
https://doi.org/10.1515/forum-2025-0367
Primary Topic
Meromorphic and Entire Functions
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Least zero of pairs of additive cubic equations

Hongze Li, Yixiu Xiao
Forum Mathematicum
Meromorphic and Entire Functions
article

Least zero of pairs of additive cubic equations

Hongze Li, Yixiu Xiao
article en

Abstract

Abstract An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms (1) <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mo>{</m:mo> <m:mtable columnspacing="0pt" rowspacing="0pt"> <m:mtr> <m:mtd columnalign="right"> <m:mi>F</m:mi> </m:mtd> <m:mtd columnalign="left"> <m:mrow> <m:mrow> <m:mi/> <m:mo>=</m:mo> <m:mrow> <m:mrow> <m:msub> <m:mi>c</m:mi> <m:mn>1</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mn>1</m:mn> <m:mn>3</m:mn> </m:msubsup> </m:mrow> <m:mo>+</m:mo> <m:mrow> <m:msub> <m:mi>c</m:mi> <m:mn>2</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mn>2</m:mn> <m:mn>3</m:mn> </m:msubsup> </m:mrow> <m:mo>+</m:mo> <m:mi mathvariant="normal">⋯</m:mi> <m:mo>+</m:mo> <m:mrow> <m:msub> <m:mi>c</m:mi> <m:mi>n</m:mi> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mi>n</m:mi> <m:mn>3</m:mn> </m:msubsup> </m:mrow> </m:mrow> <m:mo>=</m:mo> <m:mn>0</m:mn> </m:mrow> <m:mo>,</m:mo> </m:mrow> </m:mtd> </m:mtr> <m:mtr> <m:mtd columnalign="right"> <m:mi>G</m:mi> </m:mtd> <m:mtd columnalign="left"> <m:mrow> <m:mrow> <m:mi/> <m:mo>=</m:mo> <m:mrow> <m:mrow> <m:msub> <m:mi>d</m:mi> <m:mn>1</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mn>1</m:mn> <m:mn>3</m:mn> </m:msubsup> </m:mrow> <m:mo>+</m:mo> <m:mrow> <m:msub> <m:mi>d</m:mi> <m:mn>2</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mn>2</m:mn> <m:mn>3</m:mn> </m:msubsup> </m:mrow> <m:mo>+</m:mo> <m:mi mathvariant="normal">⋯</m:mi> <m:mo>+</m:mo> <m:mrow> <m:msub> <m:mi>d</m:mi> <m:mi>n</m:mi> </m:msub> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>x</m:mi> <m:mi>n</m:mi> <m:mn>3</m:mn> </m:msubsup> </m:mrow> </m:mrow> <m:mo>=</m:mo> <m:mn>0</m:mn> </m:mrow> <m:mo>,</m:mo> </m:mrow> </m:mtd> </m:mtr> </m:mtable> </m:mrow> </m:math> \displaystyle{}\left\{\begin{aligned} \displaystyle{}F&amp;\displaystyle=c_{1}x_{1% }^{3}+c_{2}x_{2}^{3}+\cdots+c_{n}x_{n}^{3}=0,\\ \displaystyle G&amp;\displaystyle=d_{1}x_{1}^{3}+d_{2}x_{2}^{3}+\cdots+d_{n}x_{n}^% {3}=0,\\ \end{aligned}\right. under the “ M -good” condition for <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi>n</m:mi> <m:mo>≥</m:mo> <m:mn>16</m:mn> </m:mrow> </m:math> {n\geq 16} , where <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:msub> <m:mi>c</m:mi> <m:mn>1</m:mn> </m:msub> <m:mo>,</m:mo> <m:mi mathvariant="normal">…</m:mi> <m:mo>,</m:mo> <m:msub> <m:mi>c</m:mi> <m:mi>n</m:mi> </m:msub> </m:mrow> </m:math> {c_{1},\dots,c_{n}} and <m:math xmlns:m="http://www.w3.org/1

Forum Mathematicum
Shanghai Jiao Tong University (CN)
Openalex Percentile: Top 98%
Meromorphic and Entire Functions
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.