Related papers: A binary tree representation for the 2-adic valuat…
We analyze properties of the 2-adic valuations of an integer sequence that originates from an explicit evaluation of a quartic integral. We also give a combinatorial interpretation of the valuations of this sequence. Connections with the…
The p-adic valuation of a polynomial can be given by its valuation tree. This work describes the 2-adic valuation tree of the general degree 2 polynomial in 2 variables.
Properties of 2-adic valuation sequences for general quadratic polynomials with integer coefficients are determined directly from the coefficients. These properties include boundedness or unboundedness, periodicity, and valuations at…
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
The study of prime divisibility plays a crucial role in number theory. The $p$-adic valuation of a number is the highest power of a prime, $p$, that divides that number. Using this valuation, we construct $p$-adic valuation trees to…
We give the trace representation of a family of binary sequences derived from Euler quotients by determining the corresponding defining polynomials. Trace representation can help us producing the sequences efficiently and analyzing their…
Knowledge representation and reasoning in law are essential to facilitate the automation of legal analysis and decision-making tasks. In this paper, we propose a new approach based on legal science, specifically legal taxonomy, for…
This paper investigates the p-adic valuation trees of degree-2 and degree-3 polynomials in two variables over any prime p, building upon prior research outlined in [14].
The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack…
A decision tree looks like a simple directed acyclic computational graph, where only the leaf nodes specify the output values and the non-terminals specify their tests or split conditions. From the numerical perspective, we express decision…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…
A sequence of coefficients that appeared in the evaluation of a rational integral has been shown to be unimodal. An alternative proof is presented.
In this paper, we develop 2-dimensional algebraic theory which closely follows the classical theory of modules. The main results are giving definitions of 2-module and the representation of 2-ring. Moreover, for a 2-ring $\cR$, we prove…
Following Poupard's study of strictly ordered binary trees with respect to two parameters, namely, "end of minimal chain" and "parent of maximum leaf" a true Tree Calculus is being developed to solve a partial difference equation system and…
We obtain a closed-form expression for the Wiener index of binomial trees. We outline efficient algorithms for computing the Wiener indices of Fibonacci and binary Fibonacci trees.
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
We examine the behavior of the sequences of $p$-adic valuations of quadratic polynomials with integer coefficients for an odd prime $p$ through tree representations. Under this representation, a finite tree corresponds to a periodic…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
Ge, Rusjan, and Zweifel (J. Stat. Phys. 59, 1265 (1990)) introduced a binary tree which represents all the periodic windows in the chaotic regime of iterated one-dimensional unimodal maps. We consider the scaling behavior in a modified tree…
We apply the theory of branches in Bruhat-Tits trees, developed in previous works by the second author and others, to the study of two dimensional representations of finite groups over the ring of integers of a number field. We provide a…