On the rational approximation to linear combinations of powers

Abstract For a complex number x , <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mrow> <m:mo>∥</m:mo> <m:mi>x</m:mi> <m:mo>∥</m:mo> </m:mrow> <m:mo>:=</m:mo> <m:mrow> <m:mi>min</m:mi> <m:mo>⁡</m:mo> <m:mrow> <m:mo stretchy="false">{</m:mo> <m:mrow> <m:mrow> <m:mo stretchy="false">|</m:mo> <m:mrow> <m:mi>x</m:mi> <m:mo>-</m:mo> <m:mi>m</m:mi> </m:mrow> <m:mo stretchy="false">|</m:mo> </m:mrow> <m:mo>:</m:mo> <m:mrow> <m:mi>m</m:mi> <m:mo>∈</m:mo> <m:mi>ℤ</m:mi> </m:mrow> </m:mrow> <m:mo stretchy="false">}</m:mo> </m:mrow> </m:mrow> </m:mrow> </m:math> {\|x\|:=\min\{|x-m|:m\in\mathbb{Z}\}} . Let <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi>k</m:mi> <m:mo>≥</m:mo> <m:mn>1</m:mn> </m:mrow> </m:math> {k\geq 1} be an integer, and let K be a number field. Let <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:msub> <m:mi>α</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>α</m:mi> <m:mi>k</m:mi> </m:msub> </m:mrow> </m:math> {\alpha_{1},\dots,\alpha_{k}} be algebraic numbers with <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mrow> <m:mo stretchy="false">|</m:mo> <m:msub> <m:mi>α</m:mi> <m:mi>i</m:mi> </m:msub> <m:mo stretchy="false">|</m:mo> </m:mrow> <m:mo>≥</m:mo> <m:mn>1</m:mn> </m:mrow> </m:math> {|\alpha_{i}|\geq 1} and let <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mi>d</m:mi> <m:mi>i</m:mi> </m:msub> </m:math> {d_{i}} denotes the degree of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mi>α</m:mi> <m:mi>i</m:mi> </m:msub> </m:math> {\alpha_{i}} for <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mn>1</m:mn> <m:mo>≤</m:mo> <m:mi>i</m:mi> <m:mo>≤</m:mo> <m:mi>k</m:mi> </m:mrow> </m:math> {1\leq i\leq k} . Set <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi>d</m:mi> <m:mo>=</m:mo> <m:mrow> <m:msub> <m:mi>d</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>d</m:mi> <m:mi>k</m:mi> </m:msub> </m:mrow> </m:mrow> </m:math> {d=d_{1}+\cdots+d_{k}} . In this article, we show that if the inequality <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mn>0</m:mn> <m:mo>&lt;</m:mo> <m:mrow> <m:mo>∥</m:mo> <m:mrow> <m:mrow> <m:msub> <m:mi>λ</m:mi> <m:mn>1</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:mi>q</m:mi> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>α</m:mi> <m:mn>1</m:mn> <m:mi>n</m:mi>

Authors

Institutions

Publication Details

Journal
Forum Mathematicum
Published
2025-12-27
DOI
https://doi.org/10.1515/forum-2024-0441
Primary Topic
Mathematical functions and polynomials
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the rational approximation to linear combinations of powers

Veekesh Kumar, Gorekh Prasad
Forum Mathematicum
Mathematical functions and polynomials
article

On the rational approximation to linear combinations of powers

Veekesh Kumar, Gorekh Prasad
article en

Abstract

Abstract For a complex number x , <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mrow> <m:mo>∥</m:mo> <m:mi>x</m:mi> <m:mo>∥</m:mo> </m:mrow> <m:mo>:=</m:mo> <m:mrow> <m:mi>min</m:mi> <m:mo>⁡</m:mo> <m:mrow> <m:mo stretchy="false">{</m:mo> <m:mrow> <m:mrow> <m:mo stretchy="false">|</m:mo> <m:mrow> <m:mi>x</m:mi> <m:mo>-</m:mo> <m:mi>m</m:mi> </m:mrow> <m:mo stretchy="false">|</m:mo> </m:mrow> <m:mo>:</m:mo> <m:mrow> <m:mi>m</m:mi> <m:mo>∈</m:mo> <m:mi>ℤ</m:mi> </m:mrow> </m:mrow> <m:mo stretchy="false">}</m:mo> </m:mrow> </m:mrow> </m:mrow> </m:math> {\|x\|:=\min\{|x-m|:m\in\mathbb{Z}\}} . Let <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi>k</m:mi> <m:mo>≥</m:mo> <m:mn>1</m:mn> </m:mrow> </m:math> {k\geq 1} be an integer, and let K be a number field. Let <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:msub> <m:mi>α</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>α</m:mi> <m:mi>k</m:mi> </m:msub> </m:mrow> </m:math> {\alpha_{1},\dots,\alpha_{k}} be algebraic numbers with <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mrow> <m:mo stretchy="false">|</m:mo> <m:msub> <m:mi>α</m:mi> <m:mi>i</m:mi> </m:msub> <m:mo stretchy="false">|</m:mo> </m:mrow> <m:mo>≥</m:mo> <m:mn>1</m:mn> </m:mrow> </m:math> {|\alpha_{i}|\geq 1} and let <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mi>d</m:mi> <m:mi>i</m:mi> </m:msub> </m:math> {d_{i}} denotes the degree of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mi>α</m:mi> <m:mi>i</m:mi> </m:msub> </m:math> {\alpha_{i}} for <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mn>1</m:mn> <m:mo>≤</m:mo> <m:mi>i</m:mi> <m:mo>≤</m:mo> <m:mi>k</m:mi> </m:mrow> </m:math> {1\leq i\leq k} . Set <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi>d</m:mi> <m:mo>=</m:mo> <m:mrow> <m:msub> <m:mi>d</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>d</m:mi> <m:mi>k</m:mi> </m:msub> </m:mrow> </m:mrow> </m:math> {d=d_{1}+\cdots+d_{k}} . In this article, we show that if the inequality <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mn>0</m:mn> <m:mo>&lt;</m:mo> <m:mrow> <m:mo>∥</m:mo> <m:mrow> <m:mrow> <m:msub> <m:mi>λ</m:mi> <m:mn>1</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:mi>q</m:mi> <m:mo>⁢</m:mo> <m:msubsup> <m:mi>α</m:mi> <m:mn>1</m:mn> <m:mi>n</m:mi>

Forum MathematicumVol. 38(4)
Indian Institute of Technology Dharwad (IN)
Openalex Percentile: Top 23%
Mathematical functions and polynomials
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.