Related papers: Global index of real polynomials

This paper introduces a systematic approach towards the inverse problem for arboreal Galois representations of finite index attached to quadratic polynomials. Let $F$ be a field of characteristic $\neq 2$, $f\in F[x]$ be monic and quadratic…

We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.

The p-adic valuation of a polynomial can be given by its valuation tree. This work describes the 2-adic valuation tree of the general degree 2 polynomial in 2 variables.

In this article we give an expression of the motivic Milnor fiber at infinity and the motivic nearby cycles at infinity of a polynomial $f$ in two variables with coefficients in an algebraic closed field of characteristic zero. This…

Infinitely many explicit solutions of certain second-order differential equations with an apparent singularity of characteristic exponent -2 are constructed by adjusting the parameter of the multi-indexed Laguerre polynomials.

In this article we analyze the global diffeomorphism property of polynomial maps $F:\mathbb{R}^n\rightarrow\mathbb{R}^n$ by studying the properties of the Newton polytopes at infinity corresponding to the sum of squares polynomials…

We initiate a classification of complex polynomials f of degree d having the top Betti number of the general fibre close to the maximum. We find a range in which the polynomial must have isolated singularities and another range where it may…

We describe an effective method for computing the topological degree of continuous functions $R:S^2 \to S^2$, where $S^2$ is the Riemann sphere. Our approach generalizes the degree formula for rational functions of complex polynomials,…

Global sensitivity analysis is a powerful set of ideas and heuristics for understanding the importance and interplay between uncertain parameters in a computational model. Such a model is characterized by a set of input parameters and an…

We present several upper bounds for the height of global residues of rational forms on an affine variety. As a consequence, we deduce upper bounds for the height of the coefficients in the Bergman-Weil trace formula. We also present upper…

Let $(f, g)$ be a pair of complex analytic functions on a singular analytic space $X$. We give ``the correct'' definition of the relative polar curve of $(f, g)$, and we give a very formal generalization of L\^e's attaching result, which…

We give a new algorithmic method of detection of atypical values for 2-variables real polynomial functions with emphasis on the effectivity.

We use the notion of Milnor fibres of the germ of a meromorphic function and the method of partial resolutions for a study of topology of a polynomial map at infinity (mainly for calculation of the zeta-function of a monodromy). It gives…

We study the existence of Milnor fibration on a big enough sphere at infinity for a mixed polynomial $f: \bR^{2n} \to \bR^2$. By using strong non-degeneracy condition, we prove a counterpart of N\'emethi and Zaharia's fibration theorem. In…

Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…

In the paper we provide some polynomial identities for finite-dimensional algebras. A list of well known single polynomial identities is exposed and the classification of all $2$-dimensional algebras with respect to these identities is…

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

In this paper we present an algorithm that computes the genus of a global function field. Let F/k be function field over a field k, and let k0 be the full constant field of F/k. By using lattices over subrings of F, we can express the genus…

The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…