SearcharxivSearch

arXiv subjects

Aram Tangboonduangjit

Publications and source records attributed to Aram Tangboonduangjit.

6 recordsLinked to original sources

Fixed points and exact periods of Chebyshev polynomials modulo odd prime powers

Passing from a prime modulus to a higher prime power can change both the lengths and the number of cycles of a polynomial map. We determine these changes for Chebyshev polynomials $T_n$ modulo $p^k$, for every degree $n\ge2$, every odd prime $p$, and every $k\ge1$. The results apply whether or not $T_n$ permutes the residue classes. We give explicit formulas for the number of fixed points, all possible cycle lengths, and the number of cycles of each length. The fixed-point formula involves four greatest common divisors and a correction specific to $p=3$. We explain this exception by showing how distinct rational fixed points become congruent modulo $3$. When $p\mid n$, each cycle modulo $p$ corresponds to exactly one cycle of the same length modulo every $p^k$. When $p\nmid n$, we determine how many cycles arise from each cycle modulo $p$ and when longer cycles first appear. The proofs combine the classical relation between Chebyshev polynomials and power maps with $p$-adic arithmetic.

math.NT

Arndt and Carlitz Compositions

Carlitz considered integer compositions in which adjacent parts must be unequal. Arndt recently initiated the study of restricted compositions based on conditions applied to certain pairs of parts rather than to individual parts. Here, we combine and generalize these notions, establishing enumeration results using both combinatorial proofs and generating functions. Motivations for our generalizations include the gap-free compositions studied by Hitczenko and Knopfmacher and the Rogers-Ramanujan integer partitions.

math.CO

Water Cells in Compositions of 1s and 2s

Mansour and Shattuck introduced the notion of water cells for integer compositions in 2018. We focus on compositions with parts restricted to 1 and 2 and consider the array of counts for such compositions of $n$ with $k$ water cells, establishing generating functions for the columns and diagonal sums, recurrences within the array in the spirit of Pascal's lemma, and connections to other restricted compositions. Most of our proofs are combinatorial, but we also make connections to Riordan arrays.

math.CO

Arndt and De Morgan Integer Compositions

In 2013, Joerg Arndt recorded that the Fibonacci numbers count integer compositions where the first part is greater than the second, the third part is greater than the fourth, etc. We provide a new combinatorial proof that verifies his observation using compositions with only odd parts as studied by De Morgan. We generalize the descent condition to establish families of recurrence relations related to two types of compositions: those made of any odd part and certain even parts, and those made of any even part and certain odd parts. These generalizations connect to compositions studied by Andrews and Viennot. New tools used in the combinatorial proofs include two permutations of compositions and a statistic based on the signed pairwise difference between parts.

math.CO

Determinants Containing Powers of Generalized Fibonacci Numbers

We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These studies have led us to discover a fundamental identity of determinant involving powers of linear polynomials. Finally, we discuss the determinants of matrices whose entries are products of the generalized Fibonacci numbers.

math.CO