相关论文: Around the Chinese Remainder Theorem

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

Necessary and sufficient conditions under which two real functions defined on the real interval can be separated by a polynomial are given. An immediate consequence of the main result is the existence of the polynomial separation of convex…

We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a…

We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a…

We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…

We establish a version "over the ring" of the celebrated Hilbert Irreducibility Theorem. Given finitely many polynomials in $k+n$ variables, with coefficients in $\mathbb Z$, of positive degree in the last $n$ variables, we show that if…

Subresultant of two univariate polynomials is a fundamental object in computational algebra and geometry with many applications (for instance, parametric GCD and parametric multiplicity of roots). In this paper, we generalize the theory of…

We prove the following statement. Let $f\in\mathbb{R}[x_1,\ldots,x_d]$, for some $d\ge 3$, and assume that $f$ depends non-trivially in each of $x_1,\ldots,x_d$. Then one of the following holds. (i) For every finite sets…

We obtain new partial results supporting the spectral set conjecture in dimension 1.

We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," and investigate their properties. In calculating PRS, if there exists the GCD (greatest common divisor) of initial polynomials, we…

In this paper we introduce a version of irreducible Laguerre polynomials in two variables and prove for it a congruence property, which is similar to the one obtained by Carlitz for the classical Laguerre polynomials in one variable.

The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

For Hamiltonian systems with degeneracy of any higher order, we study the persistence of resonant invariant tori, which as some lower-dimensional invariant tori might be elliptic, hyperbolic or of mixed types. Hence we prove a quasiperiodic…

By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…

We study the copolynomials of $n$ variables, i.e. $K$-linear mappings from the ring of polynomials $K[x_1,...,x_n]$ into the commutative ring $K$. We prove an existence and uniqueness theorem for a linear differential equation of infinite…

We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…

We obtain similar types of conclusions as that of Br\"{u}ck [1] for two differential polynomials which in turn radically improve and generalize several existing results. Moreover, a number of examples have been exhibited to justify the…

It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.