English
Related papers

Related papers: Recursive Polynomial Remainder Sequence and its Su…

200 papers

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

Classical Analysis and ODEs · Mathematics 2024-04-15 Mikhail Chernyavsky , Andrei Lebedev , Yurii Trubnikov

Sylvester showed that the partition of an integer into a set of positive integers can be represented as a sum of the polynomial term and quasiperiodic components called the Sylvester waves. The wave itself is a weighted sum of the…

Number Theory · Mathematics 2026-03-09 Boris Y. Rubinstein

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…

Statistics Theory · Mathematics 2016-06-06 E. Di Nardo

Consider estimating the G-formula for the counterfactual mean outcome under a given treatment regime in a longitudinal study. Bang and Robins provided an estimator for this quantity that relies on a sequential regression formulation of this…

Methodology · Statistics 2018-05-18 Alexander R. Luedtke , Oleg Sofrygin , Mark J. van der Laan , Marco Carone

We classify all self-reciprocal polynomials arising from reversed Dickson polynomials over $\mathbb{Z}$ and $\mathbb{F}_p$, where $p$ is prime. As a consequence, we also obtain coterm polynomials arising from reversed Dickson polynomials.

Combinatorics · Mathematics 2016-06-27 Neranga Fernando

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

Number Theory · Mathematics 2014-07-02 Ryul Kim , Ok-Hyon Song , Hyon-Chol Ri

A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…

Number Theory · Mathematics 2017-12-15 M. N. Huxley , M. C. Lettington , K. M. Schmidt

Using a simple recurrence relation we give a new method to compute Jones polynomials of closed braids: we find a general expansion formula and a rational generating function for Jones polynomials. The method is used to estimate degree of…

Geometric Topology · Mathematics 2010-02-22 Barbu Berceanu , Abdul Rauf Nizami

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

Number Theory · Mathematics 2011-12-30 Vladimir Shevelev , Peter J. C. Moses

We provide a complete description of the ideal that serves as the resultant ideal for n univariate polynomials of degree d. We in particular describe a set of generators of this resultant ideal arising as maximal minors of a set of…

Commutative Algebra · Mathematics 2025-01-14 Austin Conner , Mateusz Michalek , Michael Schindler , Balazs Szendroi

In this work we generalize primitive recursion in order to construct a hierarchy of terminating total recursive operators which we refer to as {\em leveled primitive recursion of order $i$}($\mathbf{PR}_{i}$). Primitive recursion is…

Logic in Computer Science · Computer Science 2018-01-04 David Cerna

We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…

Number Theory · Mathematics 2011-06-23 Mohamed El Bachraoui

Principal component regression (PCR) is a simple, but powerful and ubiquitously utilized method. Its effectiveness is well established when the covariates exhibit low-rank structure. However, its ability to handle settings with noisy,…

Machine Learning · Computer Science 2021-05-20 Anish Agarwal , Devavrat Shah , Dennis Shen , Dogyoon Song

In this paper we revisit the greatest common right divisor (GCRD) extraction from a set of polynomial matrices $P_i(\lambda)\in \F[\la]^{m_i\times n}$, $i=1,\ldots,k$ with coefficients in a generic field $\F$, and with common column…

Numerical Analysis · Mathematics 2022-11-02 Vanni Noferini , Paul Van Dooren

We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…

Combinatorics · Mathematics 2007-05-23 J. M. Brunat , C. Krattenthaler , A. Lascoux , A. Montes

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

Number Theory · Mathematics 2025-06-04 Ritesh Dwivedi , Rohit Yadav

On a space of stable maps, the psi classes are modified by subtracting certain boundary divisors. The top products of modified psi classes, usual psi classes, and classes pulled back along the evaluation maps are called twisted descendants;…

Algebraic Geometry · Mathematics 2007-05-23 Joachim Kock

Partial Least Square (PLS) is a dimension reduction method used to remove multicollinearities in a regression model. However contrary to Principal Components Analysis (PCA) the PLS components are also choosen to be optimal for predicting…

Statistics Theory · Mathematics 2014-05-26 Mélanie Blazère , Fabrice Gamboa , Jean-Michel Loubes

We consider linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, $q$-hypergeometric products or their mixed…

Symbolic Computation · Computer Science 2017-05-02 Johannes Middeke , Carsten Schneider

The generalized sequence of numbers is defined by W_{n}=pW_{n-1}+qW_{n-2} with initial conditions W_{0}=a and W_{1}=b for a,b,p,q\inZ and n\geq2, respectively. Let W_{n}=circ(W_{1},W_{2},...,W_{n}). The aim of this paper is to establish…

Numerical Analysis · Mathematics 2012-02-07 Durmuş Bozkurt