相关论文: Fibers of Polynomial Mappings Over Rn

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.

We consider the problem of testing, for a given set of planar regions $\cal R$ and an integer $k$, whether there exists a convex shape whose boundary intersects at least $k$ regions of $\cal R$. We provide a polynomial time algorithm for…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

Given a family of varieties over the projective line, we study the density of fibres that are everywhere locally soluble in the case that components of higher multiplicity are allowed. We use log geometry to formulate a new sparsity…

We consider the problem of enumeration of maps from plurifibered varieties.

We study linear functions on the space of $n \times n$ matrices over a field which preserve or strongly preserve each of Green's equivalence relations ($\mathcal{L}$, $\mathcal{R}$, $\mathcal{H}$ and $\mathcal{J}$) and the corresponding…

We explore the connection between cyclotomic mapping permutation polynomials and permutation polynomials of the form $x^rf(x^{\frac{q-1}{l}})$ over finite fields. We present a new necessary and a new sufficient condition to verify…

We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…

Inspired by work done for systems of polynomial exponential equations, we study systems of equations involving the modular $j$ function. We show general cases in which these systems have solutions, and then we look at certain situations in…

We prove several results on the multiplier spectrum of polynomials. We provide a detailed proof of the theorem stating that the multiplier spectrum morphism is generically injective on the moduli space of polynomials. We obtain a…

The purpose of this paper is to describe the images of multilinear polynomials of arbitrary degree on the strictly upper triangular matrix algebra.

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

In this article, we introduce the notion of periodic de Rham bundles over smooth complex curves. We prove that motivic de Rham bundles over smooth complex curves are periodic. We conjecture that irreducible periodic de Rham bundles over…

We present a surprisingly short proof that for any continuous map $f : \mathbb{R}^n \rightarrow \mathbb{R}^m$, if $n>m$, then there exists no bound on the diameter of fibers of $f$. Moreover, we show that when $m=1$, the union of small…

We find monodromy formulas for line arrangements which are fibered with respect to the projection from one point. We use them to find $0$-dimensional translated components in the first characteristic variety of the arrangement $\mathcal…

We complete the study of birational geometry of Fano fiber spaces $\pi\colon V\to {\mathbb P}^1$, the fiber of which is a Fano double hypersurface of index 1. For each family of these varieties we either prove birational rigidity or produce…

In this paper, we give lower bounds for the homology of the fibers of a map to a manifold. Using new sheaf theoretic methods, we show that these lower bounds persist over whole open sets of the manifold, and that they are stable under…

We present various constructions of sequences of polynomials satisfying the Binomial Theorem in finite characteristic based on the theory of additive polynomials. Various actions on these constructions are also presented. It is an open…

We consider several characterizations of $\mathbb R$-linear mappings. In particular, we give a characterization of linear mappings whose range is $\geq$ 2 dimensional, in terms of preservation of lines (and contraction of lines to a point)…