Related papers: Polyadic integer numbers and finite (m,n)-fields
Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinear balanced symmetric polynomials is an…
We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
Let $n$ be a product of two distinct prime numbers. We construct a triangulated monoidal category having a Grothendieck ring isomorphic to the ring of $n$:th cyclotomic integers.
D-finite functions and P-recursive sequences are defined in terms of linear differential and recurrence equations with polynomial coefficients. In this paper, we introduce a class of numbers closely related to D-finite functions and…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
We develop a general finite-alphabet framework for Euler-type sums based on the notion of a monoidal alphabet. An alphabet of summand letters is called monoidal when it is closed under pointwise multiplication, thereby inducing the usual…
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…
Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.
Riordan matrices are infinite lower triangular matrices corresponding to the certain operators in the space of formal power series. Generalized Euler polynomials ${{g}_{n}}\left( x \right)={{\left( 1-x…
There are three kinds of multiple polylogarithms; complex, finite and symmetric. The dualities for the complex and finite cases are known. In this paper, we present proofs of them via iterated integrals and its symmetric counterpart by a…
For an integral domain $R$, the {\it ring of integer-valued polynomials} over $R$ consists of all polynomials $f(X) \in R[X]$ such that $f(R) \subseteq R$. An interesting case to study is when $R$ is a Dedekind domain, in particular when…
For a polynomial P, we consider the sequence of iterated integrals of ln P(x). This sequence is expressed in terms of the zeros of P(x). In the special case of ln(1 + x^2), arithmetic properties of certain coefficients arising are…
Consider a periodical (in two independent directions) tiling of the plane with polygons (faces). In this article we shall only give examples using squares, regular hexagons, equilateral triangles and parallelograms ("unions" of two…
We define the finite number ring ${\Bbb Z}_n [\sqrt [m] r]$ where $m,n$ are positive integers and $r$ in an integer akin to the definition of the Gaussian integer ${\Bbb Z}[i]$. This idea is also introduced briefly in [7]. By definition,…
Explicit monoid structure is provided for the class of canonical subfield preserving polynomials over finite fields. Some classical results and asymptotic estimates will follow as corollaries.
Consider the Grothendieck group of finite type projective modular representations of the symmetric groups on n letters, or more generally, of its wreath product with a finite group. They form a graded group, with a product defined using…
We generalize $\sigma$-matrices to higher arities using the polyadization procedure proposed by the author. We build the nonderived $n$-ary version of $SU\left( 2\right) $ using cyclic shift block matrices. We define a new function, the…
Given a negative $D>-(\log X)^{\log 2-\delta}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of…