相关论文: Finiteness for Arithmetic Fewnomial Systems

We study monic univariate polynomials whose coefficients are analytic functions of a real variable and whose roots lie in a specified analytic curve. These include characteristic polynomials of unitary and hermitian matrices whose entries…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

Let $K$ be a finite extension of $\mathbb{Q}_p$, and let $f_1(z),\ldots, f_m(z) \in K[[z]]$ such that, for every $1 \leq i \leq m$, $f_i(z)$ is a solution of a differential operator $\mathcal{L}_i \in E_p[d/dz]$, where $E_p$ is the field of…

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

A 1993 result of Alon and F\"uredi gives a sharp upper bound on the number of zeros of a multivariate polynomial over an integral domain in a finite grid, in terms of the degree of the polynomial. This result was recently generalized to…

Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…

We prove that the roots of a smooth monic polynomial with complex-valued coefficients defined on a bounded Lipschitz domain $\Omega$ in $\mathbb R^m$ admit a parameterization by functions of bounded variation uniformly with respect to the…

We generalize two main theorems of matching polynomials of undirected simple graphs, namely, real-rootedness and the Heilmann-Lieb root bound. Viewing the matching polynomial of a graph $G$ as the independence polynomial of the line graph…

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of…

Let $K$ be a number field or a function field. Let $f\in K(x)$ be a rational function of degree $d\geq 2$, and let $\beta\in\mathbb{P}^1(K)$. For all $n\in\mathbb{N}\cup\{\infty\}$, the Galois groups…

Let~$E$ be a Hilbertian field of characteristic~$0$. R.W.K. Odoni conjectured that for every positive integer~$n$ there exists a polynomial~$f\in E[X]$ of degree~$n$ such that each iterate~$f^{\circ{k}}$ of~$f$ is irreducible and the Galois…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

For R(z, w) rational with complex coefficients, of degree at least 2 in w, we show that the number of rational functions f(z) solving the difference equation f(z+1)=R(z, f(z)) is finite and bounded just in terms of the degrees of R in the…

Let $L(X)$ be a monic $q$-linearized polynomial over $F_q$ of degree $q^n$, where $n$ is an odd prime. Recently Gow and McGuire showed that the Galois group of $L(X)/X-t$ over the field of rational functions $F_q(t)$ is $GL_n(q)$ unless…

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…

If for any k the k-th coefficient of a polynomial I(G;x)is equal to the number of stable sets of cardinality k in graph G, then it is called the independence polynomial of G (Gutman and Harary, 1983). A graph G is very well-covered…

We study the regularity of the roots of complex univariate polynomials whose coefficients depend smoothly on parameters. We show that any continuous choice of the roots of a $C^{n-1,1}$-curve of monic polynomials of degree $n$ is locally…

Let $P^{k}(n,p) $ be the set of all real polynomial map germs $f = ( f_1 , ..., f_p ) : (\mathbb{R}^{n},0) \rightarrow (\mathbb{R}^{p},0)$ with degree of $f_1 , ...,f_p$ less than or equal to $ k \in \mathbb{N}$. The main result of this…