Related papers: The $p$-Adic Valuation Trees for Quadratic Polynom…

We consider stochastic processes with (or without) memory whose evolution is encoded by a finite or infinite rooted tree. The main goal is to compare the entropy rates of a given base process and a second one, to be considered as a…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

Using $p$-adic numbers, we partially categorize the cycles of a sizable class of polynomial dynamical systems. In turn, we prove a few results related to the non-trivial cycles of the $\textit{Collatz map}$ $\text{Col} : \mathbb{Z}_+ \to…

Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

Let $n \ge 2$ be an integer. In this note, we show that the {\it oriented} transition matrices over the field $\mathcal R$ of all real numbers (over the finite field $\mathcal Z_2$ of two elements respectively) of all continuous {\it vertex…

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

We compute the continuous bounded cohomology of the full automorphism groups of regular trees in all positive degrees, with coefficients arising from any irreducible continuous unitary representations. To the author's knowledge, this seems…

Donnay, Garcia and Rouse classified nonsingular quadratic forms $Q$ with integral coefficients and prime numbers $p$ such that the set of quotients of values of $Q$ attained for integer arguments is dense in the field of $p$-adic numbers.…

We study varieties that contain unranked tree languages over all alphabets. Trees are labeled with symbols from two alphabets, an unranked operator alphabet and an alphabet used for leaves only. Syntactic algebras of unranked tree languages…

For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

The arithmetic of the natural numbers can be extended to arithmetic operations on planar binary trees. This gives rise to a non-commutative arithmetic theory. In this exposition, we describe this arithmetree, first defined by Loday, and…

We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…

In the work we have considered p-adic functional series with binomial coefficients and discussed its p-adic convergence. Then we have derived a recurrence relation following with a summation formula which is invariant for rational argument.…

In this paper we construct infinite sequences of monic irreducible polynomials with coefficients in odd prime fields by means of a transformation introduced by Cohen in 1992. We make no assumptions on the coefficients of the first…

The sequence A120986 in the Encyclopedia of Integer Sequences counts ternary trees according to the number of nodes and the number of middle edges. Using a certain substition, the underlying cubic equation can be factored. This leads to an…

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

Let D be a domain with quotient field K and A a D-algebra. We call a polynomial with coefficients in K that maps every element of A to an element of A "integer-valued on A". For commutative A we also consider integer-valued polynomials in…