相关论文: A method for proving polynomial enumeration formul…
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…
We investigate the computational problem of determining whether a bivariate polynomial with non-negative coefficients and no constant term can attain a prime value. While classical conjectures such as Bouniakowsky's provide necessary…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We prove formulas for the Bernoulli numbers by using the Newton-Girard identities to evaluate the Riemann zeta function at positive even integers. To do this, we define a sequence of positive integers, a sequence of polynomials, and a…
Given a first-order sentence, a model-checking computation tests whether the sentence holds true in a given finite structure. Data provenance extracts from this computation an abstraction of the manner in which its result depends on the…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
We give a short proof of the well-known Knuth's old sum and provide some generalizations. Our approach utilizes the binomial theorem and integration formulas derived using the Beta function. Several new polynomial identities and…
Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…
By using a general formalism, we expose a simplified proof of the convergence of the B\'ezier polynomials attached to a continuous function defined in arbitrary dimensional simplex. We obtain an error estimate that contains the error in…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
A spectral factorization theorem is proved for polynomial rank-deficient matrix-functions. The theorem is used to construct paraunitary matrix-functions with first rows given.
In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…
We define the Bernoulli polynomials with a $q$ parameter in terms of $r$-Whitney numbers of the second kind. Some algebraic properties and combinatorial identities of these polynomials are given. Also, we obtain several relations between…
In order to verify programs or hybrid systems, one often needs to prove that certain formulas are unsatisfiable. In this paper, we consider conjunctions of polynomial inequalities over the reals. Classical algorithms for deciding these not…
We develop a nonstandard approach to exploring polynomials associated with peaks and runs of permutations. With the aid of a context-free grammar, or a set of substitution rules, one can perform a symbolic calculus, and the computation…
We give combinatorial proofs for some identities involving binomial sums that have no closed form.
Two evaluation formulas are derived for the Jack superpolynomials. The evaluation formulas are expressed in terms of products of fillings of skew diagrams. One of these formulas is nothing but the evaluation formula of the Jack polynomials…
The aim of this paper is to represent any polynomial in terms of the degenerate Frobenius-Euler polynomials and more generally of the higher-order degenerate Frobenius-Euler polynomials. We derive explicit formulas with the help of umbral…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
For the class of polynomial quadrature rules we show that conveniently chosen bases allow to compute both the weights and the theoretical error expression of a $n$-point rule via the undetermined coefficients method. As an illustration, the…