相关论文: Around the Chinese Remainder Theorem

We study distribution of zeros of a complex polynomial whose coefficients has been modified. We give a new proof of the theorem of Rubinstein, and with similar method we prove a new theorem that is not generalization of the previous…

This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…

We give a simple proof of an explicit formula for Kerov polynomials. This formula is closely related to a formula of Goulden and Rattan.

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

We extend to several variables an earlier result of ours, according to which an entire function of one variable of sufficiently small exponential type, having all derivatives of even order taking integer values at two points, is a…

Let $s,t$ be natural numbers, and fix an $s$-core partition $\sigma$ and a $t$-core partition $\tau$. Put $d=\gcd(s,t)$ and $m= lcm(s,t)$, and write $N_{\sigma, \tau}(k)$ for the number of $m$-core partitions of length no greater than $k$…

We prove strict unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. The proof is based on the combinatorics of certain Young tableaux and the semigroup property of Kronecker coefficients of S_n representations.

Given two polynomials $P(\underline x)$, $Q(\underline x)$ in one or more variables and with integer coefficients, how does the property that they are coprime relate to their values $P(\underline n), Q(\underline n)$ at integer points…

We prove a four dimensional version of the Bernstein Theorem, with complex polynomials being replaced by quaternionic polynomials. We deduce from the theorem a quaternionic Bernstein's inequality and give a formulation of this last result…

We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

We prove a variant of the so-called bilinear embedding theorem for operators in divergence form with complex coefficients and with nonnegative locally integrable potentials, subject to mixed boundary conditions, and acting on arbitrary open…

In this article, we prove a decomposition theorem on differential polynomials of theta functions of high level.

Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…

This paper constitutes a first attempt to do analysis with skew polynomials. Precisely, our main objective is to develop a theory of residues for skew rational functions (which are, by definition, the quotients of two skew polynomials). We…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.

We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

We give a simple formula for the exact exponent in the remainder term of the main Gelfond's digit theorem in the binary case.