相关论文: Global index of real polynomials

In this paper we introduce a new approach and obtain new results for the problem of studying polynomial images of affine subspaces of finite fields. We improve and generalise several previous known results, and also extend the range of such…

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

For cluster algebras from surfaces, there is a known formula for cluster variables and F-polynomials in terms of the perfect matchings of snake graphs. If the cluster algebra has trivial coefficients, there is also a known formula for…

In this survey, we remind some fibrations structure theorems (also called Milnor's fibrations) recently proved in the real and complex case, in the local and global settings. We give several Poincar\'e-Hopf type formulae which relates the…

We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…

The supremum of reduction numbers of ideals having principal reductions is expressed in terms of the integral degree, a new invariant of the ring, which is finite provided the ring has finite integral closure. As a consequence, one obtains…

We derive a formula for the Milnor class of scheme-theoretic global complete intersections (with arbitrary singularities) in a smooth variety in terms of the Segre class of its singular scheme. In codimension one the formula recovers a…

In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

The coefficients of twisted Alexander polynomials of a knot induce regular functions of the $SL_2(\mathbb{C})$-character variety. We prove that the function of the highest degree has a finite value at an ideal point which gives a minimal…

We prove Shokurov's global index conjecture for foliations in dimension at most three. This answers a question of the first author, Meng, and Xie in dimension three. The main result of this paper is partially obtained by generative AI,…

We use the famous knot-theoretic consequence of Freedman's disc theorem---knots with trivial Alexander polynomial bound a locally-flat disc in the 4-ball---to prove the following generalization. The degree of the Alexander polynomial of a…

We use topological methods to study various semicontinuity properties of spectra of singular points of plane algebraic curves and of polynomials in two variables at infinity. Using Seifert forms and the Tristram--Levine signatures of links,…

Given cell-average data values of a piecewise smooth bivariate function $f$ within a domain $\Omega$, we look for a piecewise adaptive approximation to $f$. We are interested in an explicit and global (smooth) approach. Bivariate…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

To a complex polynomial function $f$ with arbitrary singularities we associate the number of Morse points in a general linear Morsification $f_{t} := f - t\ell$. We produce computable algebraic formulas in terms of invariants of $f$ for the…

Consider a polynomial $F$ in $m$ variables and a finite point ensemble $S=S_1 \times ... \times S_m$. When given the leading monomial of $F$ with respect to a lexicographic ordering we derive improved information on the possible number of…

For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…

The method of subquotients is developed and used to determine all finite dimensional rank 2 Nichols algebras of diagonal type over an arbitrary field of characteristic zero. Key Words: Hopf algebra, Nichols algebra