Related papers: Classification of polynomials from C^2 to C with o…

This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…

We construct, at each point of a Riemannian C_0-space, a polynomial in one variable whose coefficients are polynomial functions on the tangent space. For a homogeneous Riemannian C_0-space (for instance, a G.O. space) these…

We determine the exact complexity of classifying compact metric spaces up to homeomorphism. More precisely, the homeomorphism relation on compact metric spaces is Borel bi-reducible with the complete orbit equivalence relation of Polish…

We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…

In different areas of discrete mathematics, a certain type of polynomials, having coefficients in a field K of finite characteristic, has been considered. The form and the degree of these polynomials, here called projective, are simply…

For a smooth manifold M, we define a topological space X(k,M), and show that polynomial functors O(M)--> C of degree <= k from the poset of open subsets of M to a simplicial model category can be classified be a version of linear functors…

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…

In this article, we study critical points (zeros of derivative) of random polynomials. Take two deterministic sequences $\{a_n\}_{n\geq1}$ and $\{b_n\}_{n\geq1}$ of complex numbers whose limiting empirical measures are same. By choosing…

We provide an effective classification of postcritically finite polynomials as dynamical systems by means of Hubbard Trees. This can be viewed as an application of the results developed in part 1 (Stony Brook IMS 1993/5).

In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…

A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that…

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…

For each countable ordinal $\alpha$, we introduce an ideal $conv_\alpha$ and use it to characterize the class of all compact countable spaces which are homeomorphic to the space $\omega^{\alpha}\cdot n+1$ with the order topology. The…

One deals with arbitrary reduced free divisors in a polynomial ring over a field of characteristic zero, by stressing the ideal theoretic and homological behavior of the corresponding singular locus. A particular emphasis is given to both…

The relationship between a polynomial's zeros and factors is well known. If a is a zero of f(x) then (x-a) is a factor of f(x). In this paper, we generalize this idea to polynomials of two variables and with real coefficients. We consider…

We investigate different approaches to transform a given binomial into a monomial via blowing up appropriate centers. In particular, we develop explicit implementations in {\sc Singular}, which allow to make a comparison on the basis of…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…

This paper investigates defining equations for secant varieties of the variety of reducible polynomials, which geometrically encode the notions of strength and slice rank of homogeneous polynomials. We present three main results. First, we…

Define a subset of the complex plane to be a Rolle's domain if it contains (at least) one critical point of every complex polynomial P such that P(-1)=P(1). Define a Rolle's domain to be minimal if no proper subset is a Rolle's domain. In…