相关论文: A note on polynomial maps having fibers of maximal…
Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
The type C_n full root polytope is the convex hull in R^n of the origin and the points e_i-e_j, e_i+e_j, 2e_k for 1 <= i < j <= n, k \in [n]. Given a graph G, with edges labeled positive or negative, associate to each edge e of G a vector…
We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…
Self-maps everywhere defined on the projective space $\P^N$ over a number field or a function field are the basic objects of study in the arithmetic of dynamical systems. One reason is a theorem of Fakkruddin \cite{Fakhruddin} (with…
A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…
In this note, we consider a complete intersection $X=\{x\in \mathbb{R}^n : f_1(x)= \ldots = f_m(x)=0\}, n>m$ and study its Euclidean distance degree in terms of the mixed volume of the Newton polytopes. We show that if the Newton polytopes…
In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…
Many interesting classes of maps from homotopical algebra can be characterised as those maps with the right lifting property against certain sets of maps (such classes are sometimes referred to as cofibrantly generated). In a more…
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…
Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let…
We introduce the theory of local and global monodromies of polynomials in cohomology groups in various geometric situations, focusing on its relations with toric geometry and motivic Milnor fibers, and moreover in the modern languages of…
The totally-real embeddability of any $2k$-dimensional compact manifold $M$ into $\mathbb C^n$, $n\geq 3k$, has several consequences: the genericity of polynomially convex embeddings of $M$ into $\mathbb C^n$, the existence of $n$ smooth…
The Fine interior $F(P)$ of a $d$-dimensional lattice polytope $P \subset {\Bbb R}^d$ is the set of all points $y \in P$ having integral distance at least $1$ to any integral supporting hyperplane of $P$. We call a lattice polytope…
A tight map is a map with some of its vertices marked, such that every vertex of degree $1$ is marked. We give an explicit formula for the number $N_{0,n}(d_1,\ldots,d_n)$ of planar tight maps with $n$ labeled faces of prescribed degrees…
In this work, under a mild assumption, we give the classification of the complete polynomial vector fields in two variables up to algebraic automorphisms of $\C^2$. The general problem is also reduced to the study of the combinatorics of…
In the paper, we first classify all polynomial maps of the form $H=(u(x,y),v(x,y,z), h(x,y))$ in the case that $JH$ is nilpotent and $(\deg_yu,\deg_yh)\leq 3$, $H(0)=0$. Then we classify all polynomial maps of the form…
Whitney type examples of maps $f\in C^k(\real^m,\real^n)$ for a maximal possible real $k$, and multidimensional space-filling curves with special properties are constructed.
We consider a closed convex set $C$ in a separable, infinite-dimensional Hilbert space and endow the set $\mathcal{N}(C)$ of nonexpansive self-mappings on $C$ with the topology of pointwise convergence. We introduce the notion of a somewhat…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…