相关论文: Almost Bijective Parametrization of Copositive Uni…

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

We consider elliptic partial differential equations with diffusion coefficients that depend affinely on countably many parameters. We study the summability properties of polynomial expansions of the function mapping parameter values to…

Let $(K,v)$ be a henselian valued field. Let $\mathbb{P}^{dless}\subset K[x]$ be the set of monic, irreducible polynomials which are defectless and have degree greater than one. For a certain equivalence relation $\,\approx\,$ on…

Let $R$ be a polynomial ring over a field. We describe the extremal rays and the facets of the cone of local cohomology tables of finitely generated graded $R$-modules of dimension at most two. Moreover, we show that any point inside the…

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…

The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…

If, for a subset S of Z^k, we compare the conditions of being parametrizable (a) by a single k-tuple of polynomials with integer coefficients, (b) by a single k-tuple of integer-valued polynomials and, (c) by finitely many k-tuples of…

Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.

Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to polynomials with the complex coefficients. For a given pair of polynomials and a…

Highly localized kernels constructed by orthogonal polynomials have been fundamental in recent development of approximation and computational analysis on the unit sphere, unit ball and several other regular domains. In this work we first…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

We observe that the characteristic polynomial of a linearly perturbed semidefinite matrix can be used to give the convergence rate of alternating projections for the positive semidefinite cone and a line. As a consequence, we show that such…

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

We propose a definition of directional multivariate subexponential and convolution equivalent densities and find a useful characterization of these notions for a class of integrable and almost radial decreasing functions. We apply this…

We derive formulas for characterizing bounded orthogonally additive polynomials in two ways. Firstly, we prove that certain formulas for orthogonally additive polynomials derived in \cite{Kusa} actually characterize them. Secondly, by…

The purpose of this paper is to relate the variety parameterizing completely decomposable homogeneous polynomials of degree $d$ in $n+1$ variables on an algebraically closed field, called $\Split_{d}(\PP n)$, with the Grassmannian of $n-1$…

Establishing explicit formulas of coderivatives with respect to a set of the normal cone mapping to a polyhedron, the solution set of a variational inequalities system, is one of the main goals of this paper. By using our coderivative…

In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in $d$ dimensions, where $d$ can be arbitrary. This method is simple, and relies only…

In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…