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

Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…

This paper is dedicated to providing an introduction into multidimensional integer trigonometry. We start with an exposition of integer trigonometry in two dimensions, which was introduced in 2008, and use this to generalise these integer…

Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…

Let $A$ be an integer matrix, and let $f_A$ be the associated monomial map. We give a connection between the eigenvalues of $A$ and existence of a linear recurrence relation in the sequence of degrees.

Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…

A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.

Given a Sheffer sequence of polynomials, we introduce the notion of an associated sequence called the cognate sequence. We study the relationship between the zeros of this pair of associated sequences and show that in case of an Appell…

In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial $f_0 \in \F_2 [x]$. If $f_0$ is of degree $n = 2^l \cdot m$, where $m$ is odd and $l$ is a non-negative integer,…

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

We show the existence of several infinite monochromatic patterns in the integers obtained as values of suitable symmetric polynomials. The simplest example is the following. For every finite coloring of the natural numbers…

We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We then present a simple application, related to possible correlations between trace…

In this article, we study several probabilistic properties of polynomials defined over the ring of $p$-adic integers under the Haar measure. First, we calculate the probability that a monic polynomial is separable, generalizing a result of…

We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…

Article presents a short investigation into some properties of the Moser polynomials which appear in various problems from algebraic combinatorics. For instance, these polynomials can be used to solve the Generalized Moser's Problem on…

An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…

This article studies separating invariants for the ring of multisymmetric polynomials in $m$ sets of $n$ variables over an arbitrary field $\mathbb{K}$. We prove that in order to obtain separating sets it is enough to consider polynomials…

We explore the possibility of using machine learning to identify interesting mathematical structures by using certain quantities that serve as fingerprints. In particular, we extract features from integer sequences using two empirical laws:…

In this paper we give a new characterization of simple sets of polynomials B with the property that the set of B-multiplier sequences contains all Q-multiplier sequence for every simple set Q. We characterize sequences of real numbers which…

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…

We give an explicit Pieri formula for Macdonald polynomials attached to the root system C_n (with equal multiplicities). By inversion we obtain an explicit expansion for two-row Macdonald polynomials of type C.