INTEGRALITY OF AVERAGES OF ROOTS OF UNITY AND PERFECT ISOMETRIES

Abstract We establish a criterion for the integrality of averages of roots of unity and apply it to settle a conjecture regarding the linearity of functions on <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:msub> <mml:mrow> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msub> </mml:math> $\mathbb {Z}_n$ double struck upper Z Subscript n . Specifically, we prove that for any modulus <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>1</mml:mn> </mml:math> $n \ge 1$ n greater than or equals 1 , if <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>f</mml:mi> <mml:mo>:</mml:mo> <mml:msub> <mml:mrow> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msub> <mml:mo stretchy="false" accent="false">→</mml:mo> <mml:msub> <mml:mrow> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msub> </mml:math> $f: \mathbb {Z}_n \to \mathbb {Z}_n$ f colon double struck upper Z Subscript n Baseline right arrow double struck upper Z Subscript n Baseline is a function whose averages <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mo stretchy="false">(</mml:mo> <mml:mrow> <mml:mn>1</mml:mn> </mml:mrow> <mml:mrow> <mml:mrow> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> <mml:munderover> <mml:mo>∑</mml:mo> <mml:mrow> <mml:mi>x</mml:mi> <mml:mo>=</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:munderover> <mml:msup> <mml:mi>ω</mml:mi> <mml:mrow> <mml:mi>f</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mo>+</mml:mo> <mml:mi>b</mml:mi> <mml:mi>x</mml:mi> </mml:mrow> </mml:msup> </mml:math> $({1}{/n}) \sum _{x=0}^{n-1} \omega ^{f(x)+bx}$ left parenthesis 1 slash n right parenthesis sigma summation Underscript x equals 0 Overscript n minus 1 Endscripts omega Superscript f left parenthesis x right parenthesis plus b x (where <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>ω</mml:mi> <mml:mo>=</mml:mo> <mml:msup> <mml:mi>e</mml:mi> <mml:mrow> <mml:mn>2</mml:mn> <mml:mi>π</mml:mi> <mml:mi>i</mml:mi> <mml:mrow> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> </mml:msup> </mml:math> $\omega =e^{2\pi i/n}$ omega equals e Superscript 2 pi i divided by n ) are algebraic integers for all <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>b</mml:mi> <mml:mo>∈</mml:mo> <mml:msub> <mml:mrow> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msub> </mml:math> $b \in \mathbb {Z}_n$</

Authors

Institutions

Publication Details

Journal
Bulletin of the Australian Mathematical Society
Published
2026-06-16
DOI
https://doi.org/10.1017/s0004972726101336
Primary Topic
Analytic Number Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

INTEGRALITY OF AVERAGES OF ROOTS OF UNITY AND PERFECT ISOMETRIES

Chatchawan Panraksa, PORNRAT RUENGROT
Bulletin of the Australian Mathematical Society
Analytic Number Theory Research
article

INTEGRALITY OF AVERAGES OF ROOTS OF UNITY AND PERFECT ISOMETRIES

Chatchawan Panraksa, PORNRAT RUENGROT
article en

Abstract

Abstract We establish a criterion for the integrality of averages of roots of unity and apply it to settle a conjecture regarding the linearity of functions on <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:msub> <mml:mrow> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msub> </mml:math> $\mathbb {Z}_n$ double struck upper Z Subscript n . Specifically, we prove that for any modulus <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>n</mml:mi> <mml:mo>≥</mml:mo> <mml:mn>1</mml:mn> </mml:math> $n \ge 1$ n greater than or equals 1 , if <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>f</mml:mi> <mml:mo>:</mml:mo> <mml:msub> <mml:mrow> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msub> <mml:mo stretchy="false" accent="false">→</mml:mo> <mml:msub> <mml:mrow> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msub> </mml:math> $f: \mathbb {Z}_n \to \mathbb {Z}_n$ f colon double struck upper Z Subscript n Baseline right arrow double struck upper Z Subscript n Baseline is a function whose averages <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mo stretchy="false">(</mml:mo> <mml:mrow> <mml:mn>1</mml:mn> </mml:mrow> <mml:mrow> <mml:mrow> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> <mml:munderover> <mml:mo>∑</mml:mo> <mml:mrow> <mml:mi>x</mml:mi> <mml:mo>=</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:munderover> <mml:msup> <mml:mi>ω</mml:mi> <mml:mrow> <mml:mi>f</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo stretchy="false">)</mml:mo> <mml:mo>+</mml:mo> <mml:mi>b</mml:mi> <mml:mi>x</mml:mi> </mml:mrow> </mml:msup> </mml:math> $({1}{/n}) \sum _{x=0}^{n-1} \omega ^{f(x)+bx}$ left parenthesis 1 slash n right parenthesis sigma summation Underscript x equals 0 Overscript n minus 1 Endscripts omega Superscript f left parenthesis x right parenthesis plus b x (where <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>ω</mml:mi> <mml:mo>=</mml:mo> <mml:msup> <mml:mi>e</mml:mi> <mml:mrow> <mml:mn>2</mml:mn> <mml:mi>π</mml:mi> <mml:mi>i</mml:mi> <mml:mrow> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>n</mml:mi> </mml:mrow> </mml:msup> </mml:math> $\omega =e^{2\pi i/n}$ omega equals e Superscript 2 pi i divided by n ) are algebraic integers for all <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mi>b</mml:mi> <mml:mo>∈</mml:mo> <mml:msub> <mml:mrow> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> <mml:mi>n</mml:mi> </mml:msub> </mml:math> $b \in \mathbb {Z}_n$</

Bulletin of the Australian Mathematical Society
Mahidol University (TH), Hodges University (US)
Openalex Percentile: Top 3%
Analytic Number Theory Research
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.