Searcharxiv⌕ Search

arXiv subjects

Poo-Sung Park

Publications and source records attributed to Poo-Sung Park.

16 recordsLinked to original sources
arXiv2026

The Fibonacci numbers are not an additive uniqueness set for multiplicative functions

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence. We show that a multiplicative function $f$ satisfying \[ f(F_n+F_m)=f(F_n)+f(F_m)\qquad(n,m\geq 1) \] need not be the identity function, even when $f$ takes positive integer values. This answers negatively a question posed by Spiro in 1992. The smallest example presented here is obtained from $F_{31}=557\cdot 2417$. We prove the required divisibility equivalence, formulate an abstract prime-signature construction, and give a practical criterion producing further examples. We also describe the AI-assisted search that led to the construction and provide a reproducible certificate checker.

math.NT↗
arXiv2023

On multiplicative functions which are additive on positive cubes

Let $k \geq 3$. If a multiplicative function $f$ satisfies \[ f(a_1^3 + a_2^3 + \cdots + a_k^3) = f(a_1^3) + f(a_2^3) + \cdots + f(a_k^3) \] for all $a_1, a_2, \ldots, a_k \in \mathbb{N}$, then $f$ is the identity function. The set of positive cubes is said to be a $k$-additive uniqueness set for multiplicative functions. But, the condition for $k=2$ can be satisfied by infinitely many multiplicative functions. Besides, if $k \geq 3$ and a multiplicative function $g$ satisfies \[ g(a_1^3 + a_2^3 + \cdots + a_k^3) = g(a_1)^3 + g(a_2)^3 + \cdots + g(a_k)^3 \] for all $a_1, a_2, \ldots, a_k \in \mathbb{N}$, then $g$ is the identity function. However, when $k=2$, there exist three different types of multiplicative functions.

math.NT↗
arXiv2022

Multiplicative functions commutable with binary quadratic forms $x^2 \pm xy + y^2$

If a multiplicative function $f$ is commutable with a quadratic form $x^2+xy+y^2$, i.e., \[ f(x^2+xy+y^2) = f(x)^2 + f(x)\,f(y) + f(y)^2, \] then $f$ is the identity function. In other hand, if $f$ is commutable with a quadratic form $x^2-xy+y^2$, then $f$ is one of three kinds of functions: the identity function, the constant function, and an indicator function for $\mathbb{N}\setminus p\mathbb{N}$ with a prime $p$.

math.NT↗
arXiv2021

Multiplicative functions commutable with sums of squares

Let $k$ be an integer greater than or equal $4$. We show that if a multiplicative function $f$ satisfies \[ f(x_1^2 + x_2^2 + \dots + x_k^2) = f(x_1)^2 + f(x_2)^2 + \dots + f(x_k)^2 \] for all positive integers $x_i$'s, then $f$ is the identity function.

math.NT↗
arXiv2017

Multiplicative functions which are additive on triangular numbers

Fix $k \ge 3$. If a multiplicative function $f$ satisfies \[ f(x_1+x_2+\dots+x_k) = f(x_1) + f(x_2) + \dots + f(x_k) \] for arbitrary positive triangular numbers $x_1, x_2, \dots, x_k$, then $f$ is the identity function. This extends Chung and Phong's work for $k=2$.

math.NT↗
arXiv2017

Additive uniqueness of $\mathtt{PRIMES}-1$ for multiplicative functions

Let $\mathtt{PRIMES}$ be the set of all primes. We show that a multiplicative function which satisfies \[ f(p+q-2) = f(p) + f(q) - f(2) \text{ for }p,q \in \mathtt{PRIMES} \] is one of the following: \begin{enumerate} \item $f$ is the identity function \item $f$ is the constant function with $f(n)=1$ \item $f(n)=0$ for $n \ge2$ unless $n$ is odd and squareful. \end{enumerate} As a consequence, a multiplicative function which satisfies \[ f(a+b) = f(a) + f(b) \text{ for }a,b \in \mathtt{PRIMES}-1 \] is the identity function.

math.NT↗
arXiv2016

$k$-additive uniqueness of the set of squares for multiplicative functions

P. V. Chung showed that there are many multiplicative functions $f$ which satisfy $f(m^2+n^2) = f(m^2)+f(n^2)$ for all positive integers $m$ and $n$. In this article, we show that if more than $2$ squares in the additive condition are involved, then such $f$ is uniquely determined. That is, if a multiplicative function $f$ satisfies \[ f(a_1^2 + a_2^2 + \dotsb + a_k^2) = f(a_1^2) + f(a_2^2) + \dotsb + f(a_k^2) \] for arbitrary positive integers $a_i$, then $f$ is the identity function. In this sense, we call the set of all posotive squares a \emph{$k$-additive uniqueness set} for multiplicative functions.

math.NT↗
arXiv2014

Frobenius numbers of Pythagorean triples

Given relatively prime integers $a_1, \dotsc, a_n$, the Frobenius number $g(a_1, \dotsc, a_n)$ is defined as the largest integer which cannot be expressed as $x_1 a_1 + \dotsb + x_n a_n$ with $x_i$ nonnegative integers. In this article, we give the Frobenius number of primitive Pythagorean triples. That is, \[ g(m^2-n^2, 2mn, m^2+n^2) = (m-1)(m^2-n^2) + (m-1)(2mn) - (m^2 + n^2). \]

math.NT↗
arXiv2009

Even universal binary Hermitian lattices over imaginary quadratic fields

A positive definite even Hermitian lattice is called \emph{even universal} if it represents all even positive integers. We introduce a method to get all even universal binary Hermitian lattices over imaginary quadratic fields $\Q{-m}$ for all positive square-free integers $m$ and we list optimal criterions on even universality of Hermitian lattices over $\Q{-m}$ which admits even universal binary Hermitian lattices.

math.NT↗
arXiv2008

The Fifteen Theorem for Universal Hermitian Lattices over Imaginary Quadratic Fields

We will introduce a method to get all universal Hermitian lattices over imaginary quadratic fields over $\mathbb{Q}(\sqrt{-m})$ for all m. For each imaginary quadratic field $\mathbb{Q}(\sqrt{-m})$, we obtain a criterion on universality of Hermitian lattices: if a Hermitian lattice L represents 1, 2, 3, 5, 6, 7, 10, 13,14 and 15, then L is universal. We call this the fifteen theorem for universal Hermitian lattices. Note that the difference between Conway-Schneeberger's fifteen theorem and ours is the number 13.

math.NT↗
arXiv2008

Binary normal regular Hermitian lattices over imaginary quadratic fields

We call a positive definite Hermitian lattice regular if it represents all integers which can be represented locally by the lattice. We investigate binary regular Hermitian lattices over imaginary quadratic fields $\mathbb{Q}(\sqrt{-m})$ and provide a complete list of the (normal) Hermitian lattices.

math.NT↗
arXiv2008

Simple proofs for universal binary Hermitian lattices

If a positive definite Hermitian lattice represents all positive integers, we call it universal. Several mathematicians, including the author, found 25 universal binary Hermitian lattices. But their ad hoc proofs are complicated. We give simple and unified proofs.

math.NT↗