相关论文: Integer Sequences associated with Integer Monic Po…

In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…

Integer relation algorithms can convert numerical results for Feynman integrals to exact evaluations, when one has reason to suspect the existence of reductions to linear combinations of a basis, with rational or algebraic coefficients.…

In this article, we establish necessary and sufficient conditions for a polynomial of degree $n$ to have exactly $n$ real roots. A complete study of polynomials of degree five is carried out. The results are compared with those obtained…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

We consider ideals in a polynomial ring that are generated by regular sequences of homogeneous polynomials and are stable under the action of the symmetric group permuting the variables. In previous work, we determined the possible…

Using a specific form of the triple product identity, polygonal number identities are stated. Further number identities are examined that can be considered identities related to modular sets of numbers. The identities can be used to give…

We first give a method to get multidimensional Leja sequences by considering intertwining sequences from one-dimensional ones. An application is the existence of explicit Leja sequences for the closed unit polydisc. Next, we deal with some…

We use the concept of the half of a lower-triangular matrix to define a transformation on integer sequences. We explore the properties of this transformation, including in some cases a study of the Hankel transform of the transformed…

The class of self-conjugate-reciprocal irreducible monic (SCRIM) polynomials over finite fields are studied. Necessary and sufficient conditions for monic irreducible polynomials to be SCRIM are given. The number of SCRIM polynomials of a…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

Many important special numbers appear in the expansions of some polynomials in terms of central factorials and vice versa, for example central factorial numbers, degenerate central factorial numbers, and central Lah numbers which are…

Let $\A_0, \A_1, \ldots, \A_n$ be given square matrices of size $m$ with rational coefficients. The paper focuses on the exact computation of one point in each connected component of the real determinantal variety $\{\X \in\RR^n \: :\:…

The conjugation action of the complex orthogonal group on the polynomial functions on $n \times n$ matrices gives rise to a graded algebra of invariant polynomials. A spanning set of this algebra is in bijective correspondence to a set of…

In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

A set of recursive relations satisfied by Selberg-type integrals involving monomial symmetric polynomials are derived, generalizing previously known results. These formulas provide a well-defined algorithm for computing Selberg-Schur…

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…