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

In this paper, we consider sequences of polynomials that satisfy differential--difference recurrences. Our interest is motivated by the fact that polynomials satisfying such recurrences frequently appear as generating polynomials of integer…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

We give a first-order definition of key polynomials, we show the links with previous definitions, that it is relevant to study key degrees, and to use a kind of valuations that we call partially multiplicative. We also prove or reprove…

We consider quotients of the group algebra of the $3$-string braid group $B_3$ by $p$-th order generic polynomial relations on the elementary braids. In cases $p=2,3,4,5$ these quotient algebras are finite dimensional. We give…

Let $K$ be a number field, let $v$ be a finite place of $K$, let $f\in K[z]$ be a degree $d\geqslant2$ polynomial with $v|d$, and let $a\in K$. We show that if $f$ is postcritically bounded and has potential good reduction with respect to…

We study how the $\ell$-adic valuation of the number of spanning trees varies in regular abelian $\ell$-towers of multigraphs. We show that for an infinite family of regular abelian $\ell$-towers of bouquets, the behavior of the $\ell$-adic…

In this paper we present and analyse a construction of irreducible polynomials over odd prime fields via the transforms which take any polynomial $f \in \mathbf{F}_p[x]$ of positive degree $n$ to $\left(\frac{x}{k} \right)^n \cdot…

In this paper we give an algorithm to calculate the coefficients of the p-adic expansion of a rational numbers, and we give a method to decide whether this expansion is periodic or ultimately periodic.

We provide necessary and sufficient conditions on the unimodality of a convolution of two sequences of binomial coefficients preceded by a finite number of ones. These convolution sequences arise as as rank sequences of posets of…

We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…

We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. These invariants are motivated by random destruction processes such as the random cutting model or site…

A graph is odd if all of its vertices have odd degrees. In particular, an odd spanning tree in a connected graph is a spanning tree in which all vertices have odd degrees. In this paper we establish a unified technique to enumerate odd…

We show that for each positive integer $a$ there exist only finitely many prime numbers $p$ such that $a$ appears an odd number of times in the period of continued fraction of $\sqrt{p}$ or $\sqrt{2p}$. We also prove that if $p$ is a prime…

The arithmetic partial derivative (with respect to a prime $p$) is a function from the set of integers that sends $p$ to 1 and satisfies the Leibniz rule. In this paper, we prove that the $p$-adic valuation of the sequence of higher order…

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

We introduce a new spatial data structure for high dimensional data called the \emph{approximate principal direction tree} (APD tree) that adapts to the intrinsic dimension of the data. Our algorithm ensures vector-quantization accuracy…

In this paper we investigate the following related problems: (A) the separation of $p$-adic roots of integer polynomials of a fixed degree and bounded height; and (B) counting integer polynomials of a fixed degree and bounded height with…

We generalize Schwenk's result that almost all trees contain any given limb to trees with positive integer vertex weights. The concept of characteristic polynomial is extended to such weighted trees and we prove that the proportion of…

We present a binary tree that describes the 2-adic valuation of a sequence of coefficients arising from the evaluation of a rational integral.