arXiv subjects
Publications and source records attributed to Ioulia N. Baoulina.
We give a characterization of all pairs $(k,n)$ of positive integers for which the ratio $$ \frac{1^k-2^k+3^k-\dots+(-1)^{n+1} n^k}{1^k-2^k+3^k-\dots+(-1)^{n}(n-1)^k} $$ of two consecutive alternating power sums is an integer.
Let $S_k(m):=\sum_{j=1}^{m-1}j^k$ denote a power sum. In 2011, Kellner proposed the conjecture that for $m>3$ the ratio $S_k(m+1)/S_k(m)$ is never an integer, or, equivalently, that for any positive integer $a$, the equation $aS_k(m)=m^k$ has no solutions in positive integers $k$ and $m$ with $m>3$. In this paper, we show that for many integers $a$ the equation $aT_k(m)=(2m+1)^k$, where $T_k(m):=\sum_{j=1}^m(2j-1)^k$, has no solutions in positive integers $k$ and $m$. This leads us to the conjecture that for $m>1$ the ratio $T_k(m+1)/T_k(m)$ is never an integer.
We explicitly determine the values of reduced cyclotomic periods of order $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. These evaluations are applied to obtain explicit factorizations of the corresponding reduced period polynomials. As another application, the weight distributions of certain irreducible cyclic codes are described.
We give conditions under which the number of solutions of a system of polynomial equations over a finite field F_q of characteristic p is divisible by p. Our setup involves the substitution t_i |-> f_i(t_i) for auxiliary polynomials f_1,...,f_n in F_q[t]. We recover as special cases results of Chevalley-Warning and Morlaye-Joly. Then we investigate higher p-adic divisibilities, proving a result that recovers the Ax-Katz Theorem. We also consider p-weight degrees, recovering work of Moreno-Moreno, Moreno-Castro and Castro-Castro-Velez.
We show that a weaker version of the well-known theorem of Morlaye and Joly on diagonal equations is a simple consequence of a restricted variable version of the Chevalley-Warning theorem. Moreover, we extend the result of Morlaye and Joly to the case of an equation of the form $$b_1D_{m_1}(X_1,a_1)+\dots+b_nD_{m_n}(X_n,a_n)=c,$$ where $D_{m_1}(X_1,a_1),\dots,D_{m_n}(X_n,a_n)$ are Dickson polynomials.
In 2000, J. Shallit introduced a special partial ordering of a subset of positive integers and proposed the problem of finding the set of minimal elements with respect to this ordering. Shallit himself solved this problem for the set of primes and also for the set of composite numbers. In this recreational mathematics note, we compute the minimal sets of a few other arithmetically interesting sets and discuss questions on size and shape of minimal sets in general.
Let $N_q$ be the number of solutions to the equation $$ (a_1^{}x_1^{m_1}+\dots+a_n^{}x_n^{m_n})^k=bx_1^{k_1}\cdots x_n^{k_n} $$ over the finite field $\mathbb F_q=\mathbb F_{p^s}$. Carlitz found formulas for~$N_q$ when $k_1=\dots=k_n=m_1=\dots=m_n=1$, $k=2$, $n=3$ or $4$, $p>2$; and when ${m_1=\dots=m_n=2}$, $k=k_1=\dots=k_n=1$, $n=3$ or $4$, $p>2$. In earlier papers, we studied the above equation with $k_1=\dots=k_n=1$ and obtained some generalizations of Carlitz's results. Recently, Pan, Zhao and Cao considered the case of arbitrary positive integers $k_1,\dots,k_n$ and proved the formula $N_q=q^{n-1}+(-1)^{n-1}$, provided that $\gcd(\sum_{j=1}^n (k_jm_1\cdots m_n/m_j)-km_1\cdots m_n,q-1)=1$. In this chapter, we determine $N_q$ explicitly in some other cases.
Using properties of Gauss and Jacobi sums, we derive explicit formulas for the number of solutions to a diagonal equation of the form $x_1^{2^m}+\dots+x_n^{2^m}=0$ over a finite field of characteristic $p\equiv\pm 3\pmod{8}$. All of the evaluations are effected in terms of parameters occurring in quadratic partitions of some powers of $p$.
We obtain explicit factorizations of reduced period polynomials of degree $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. This extends the results of G. Myerson, who considered the cases $m=1$ and $m=2$, and S. Gurak, who studied the case $m=3$.
Let $S_k(m):=1^k+2^k+\cdots+(m-1)^k$ denote a power sum. In 2011 Bernd Kellner formulated the conjecture that for $m\ge 4$ the ratio $S_k(m+1)/S_k(m)$ of two consecutive power sums is never an integer. We will develop some techniques that allow one to exclude many integers $ρ$ as a ratio and combine them to exclude the integers $3\le ρ\le 1501$ and, assuming a conjecture on irregular primes to be true, a set of density $1$ of ratios $ρ$. To exclude a ratio $ρ$ one has to show that the Erdős-Moser type equation $(ρ-1)S_k(m)=m^k$ has no non-trivial solutions.
We present a simple proof of the well-known fact concerning the number of solutions of diagonal equations over finite fields. In a similar manner, we give an alternative proof of the recent result on generalizations of Carlitz equations. In both cases, the use of character sums is avoided by using an elementary combinatorial argument.