SearcharxivSearch

arXiv subjects

Sungkon Chang

Publications and source records attributed to Sungkon Chang.

8 recordsLinked to original sources

Generalized Zeckendorf expansions of the 2nd order

We generalize Zeckendorf's theorem to second-order linear recurrences of the form $G_{k+2} = gG_{k+1} + hG_{k}$ with arbitrary, coprime initial values $(G_1, G_2)$. We analyze the asymptotic behavior of the count $\#R_G(X)$ of positive integers less than or equal to $X$ that have an expansion under the standard rule of expansions $\mathcal{E}$ associated with the recurrence. Additionally, we provide sufficient conditions under which $G$ has the unique expansion property under the rule of expansions. Finally, we completely characterize the $g$-golden ratio recurrence family when $G_1 = 1$ or $G_2 = 1$. Our approach directly investigates the algebraic structure of the expansions, simplifying and completing previous partial results.

math.NT

The Chung-Graham Expansion

Chung and Graham introduced a method to uniquely represent each positive integer using even-indexed Fibonacci terms. We generalize this result to represent each positive integer using other Fibonacci terms with equally-spaced indices.

math.NT

Benford's Law under Zeckendorf expansion

In the literature, Benford's Law is considered for base-b expansions where b>1 is an integer. In this paper, we investigate the distribution of leading "digits" of a sequence of positive integers under other expansions such as Zeckendorf expansion, and declare what Benford's Law should be under generalized Zeckendorf expansion.

math.NT

Distribution of Zeckendorf expressions

By Zeckendorf's Theorem, every positive integer is uniquely written as a sum of distinct non-adjacent Fibonacci terms. In this paper, we investigate the asymptotic formula of the number of binary expansions $<x$ that have no adjacent terms, and generalize the result to the setting of general linear recurrences with non-negative integer coefficients.

math.NT

The weak converse of Zeckendorf's Theorem

By Zeckendorf's Theorem, every positive integer is uniquely written as a sum of non-adjacent terms of the Fibonacci sequence, and its converse states that if a sequence in the positive integers has this property, it must be the Fibonacci sequence. If we instead consider the problem of finding a monotone sequence with such a property, we call it the weak converse of Zeckendorf's theorem. In this paper, we first introduce a generalization of Zeckendorf conditions, and subsequently, Zeckendorf's theorems and their weak converses for the general Zeckendorf conditions. We also extend the generalization and results to the real numbers in the interval $(0,1)$, and to $p$-adic integers.

math.NT

Quadratic Twists of Elliptic Curves with Small Selmer Rank

Given an elliptic curve E over the rational with no rational 2-torsion points, we prove the existence of a quadratic twist of E for which the 2-Selmer rank is less than or equal to 1. By the author's earlier result, we establish a lower bound on the number of D's for which the twists E(D) have 2-Selmer rank <= 1. We include in the introduction our (brief) opinion about why it is supposed to be hard to push our technique to make the Selmer group trivial.

math.NT

On the arithmetic of twists of superelliptic curves

In this paper, we consider a family of twists of a superelliptic curve over a global field, and obtain results on the distribution of the Mordell-Weil rank of these twists. Our results have applications to the distribution of the number of rational points.

math.NT

Note on the rank of quadratic twists of Mordell equations

14H52 : Elliptic curves Let E be the elliptic curve given by a Mordell equation y^2=x^3-A where A is an integer. For certain A, we use Stoll's formula to compute a lower bound for the proportion of square-free integers D up to X such that the Mordell-Weil rank of the quadratic twist by D is less than 2k, for given non-negative k. We also compute an upper bound for a certain average rank of quadratic twists of E.

math.NT