相关论文: Apparent Singularities of Linear Difference Equati…

We show that Ore operators can be desingularized by calculating a least common left multiple with a random operator of appropriate order. Our result generalizes a classical result about apparent singularities of linear differential…

We contribute to the exceptional APN conjecture by showing that no polynomial of degree m = 2 r (2 {\ell} + 1) where gcd(r, {\ell}) 2, r 2, {\ell} 1 with a nonzero second leading coefficient can be APN over infinitely many extensions of the…

Let f(x) be a differentiable function on the real line R, and let P be a point not on the graph of f(x). Define the illumination index of P to be the number of distinct tangents to the graph of f which pass thru P. We prove that if f '' is…

We provide an explicit formula for the coefficient polynomials of a Hermite diagonal differential operator. The analysis of the zeros of these coefficient polynomials yields the characterization of generalized Hermite multiplier sequences…

A method of generating differential operators is used to solve the spectral problem for a generalisation of the Sylvester-Kac matrix. As a by-product, we find a linear differential operator with polynomial coefficients of the first order…

Given $k \ge 2$ polynomials in $d \ge 1$ variables with coefficients in a field of characteristic $0$, such that no two are linearly dependent, we show that for any integer $r$ greater than $\max\left\{k {k-1 \choose 2}, 2\right\}$, the…

We consider orthogonal polynomials with respect to a linear differential operator $$\mathcal{L}^{(M)}=\sum_{k=0}^{M}\rho_{k}(z)\frac{d^k}{dz^k}, $$ where $\{\rho_k\}_{k=0}^{M}$ are complex polynomials such that $deg[\rho_k]\leq k, 0\leq k…

We show that if a real trigonometric polynomial has few real roots, then the trigonometric polynomial obtained by writing the coefficients in reverse order must have many real roots. This is used to show that a class of random trigonometric…

Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…

Let S be a complex smooth projective surface and L be a line bundle on S. For any given collection of isolated topological or analytic singularity types, we show the number of curves in the linear system |L| with prescribed singularities is…

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…

We use some basic properties of binomial and Stirling numbers to prove that the Euler characteristic is, essentially, the unique numerical topological invariant for compact polyhedra which can be expressed as a linear combination of the…

We present an algorithm which, given a linear recurrence operator $L$ with polynomial coefficients, $m \in \mathbb{N}\setminus\{0\}$, $a_1,a_2,\ldots,a_m \in \mathbb{N}\setminus\{0\}$ and $b_1,b_2,\ldots,b_m \in \mathbb{K}$, returns a…

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

We describe the explicit form of a left greatest common divisor and a least common multiple of solutions of a solvable linear matrix equation over a commutative elementary divisor domain. We prove that these left greatest common divisor and…

It is a well-known fact that the first and last non-trivial coefficients of the characteristic polynomial of a linear operator are respectively its trace and its determinant. This work shows how to compute recursively all the coefficients…

In this article, we focus on the characteristic polynomial of a graph containingloops, but without multiple edges. We present a relationship between thecharacteristic polynomial of a graph with loops and the graph obtained byremoving all…

We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether…

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.