Related papers: A sharp degree bound in the real Jacobian conjectu…

Let $(P, Q)$ be a pair of Jacobian polynomials. We can show that $ <P, Q>+l+2g(P)-2= 0= <P, [P,Q]>$, where $<f, g>$ is the intersection number of $f, g\in \CC[x, y]$ in the affine plane, $l$ is the number of branch at point at infinity and…

Let C be a generic non-singular curve of genus g defined over a field of characteristic different from 2. We show that for every line bundle on C of degree at most g+1, the natural product map S^2(H^0(L))\to H^0(C,L^2) is injective. We also…

We prove that for a dominant rational self-map $f$ on a quasi-projective variety defined over $\overline{\mathbb{Q}}$, there is a point whose $f$-orbit is well-defined and its arithmetic degree is arbitrarily close to the first dynamical…

Let $\Omega\subset \mathbb{R}^n$ be open and let $\mathcal{R}$ be a partial frame on $\Omega$, that is a set of $m$ linearly independent vector fields prescribed on $\Omega$ ($m\leq n$). We consider the issue of describing the set of all…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

We consider polynomial maps, which we call degree $d$-linear maps, that satisfy the Jacobian condition. We prove that certain infinite families of elements, which appear in the coefficients of the formal inverse of such maps, are in the…

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

For an odd prime $p$, we say $f(X) \in {\mathbb F}_p[X]$ computes square roots in $\mathbb F_p$ if, for all nonzero perfect squares $a \in \mathbb F_p$, we have $f(a)^2 = a$. When $p \equiv 3 \mod 4$, it is well known that $f(X) =…

We obtain sharp upper and lower bounds on a certain four-dimensional Frobenius number determined by a prime pair $(p,q)$, $2<p<q$, including exact formulae for two infinite subclasses of such pairs. Our work is motivated by the study of…

We prove that the number of real intersection points of a real line with a real plane curve defined by a polynomial with at most t monomials is either infinite or does not exceed 6t -7. This improves a result by M. Avendano. Furthermore, we…

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…

We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface $\Sigma$ and integers $\Delta$ and $k$, determine the maximum order $N(\Delta,k,\Sigma)$ of a graph embeddable in $\Sigma$ with maximum degree…

Using an Euclidean approach, we prove a new upper bound for the number of closed points of degree 2 on a smooth absolutely irreducible projective algebraic curve defined over the finite field $\mathbb F\_q$.This bound enables us to provide…

Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…

Consider a finite morphism f:X -> Y of smooth projective varieties over a finite field k. Suppose X is the vanishing locus in projective N-space of at most r forms of degree at most d. We show there is a constant C, depending only on N, r,…

Establishing that a demand mapping is injective is core first step for a variety of methodologies. When a version of the law of demand holds, global injectivity can be checked by seeing whether the demand mapping is constant over any line…

For an integer $k$ at least $2$, and a graph $G$, let $f_k(G)$ be the minimum cardinality of a set $X$ of vertices of $G$ such that $G-X$ has either $k$ vertices of maximum degree or order less than $k$. Caro and Yuster (Discrete…

Let $f$ be a polynomial with integer coefficients whose degree is at least 2. We consider the problem of covering the orbit $\operatorname{Orb}_f(t)=\{t,f(t),f(f(t)),\cdots\}$, where $t$ is an integer, using arithmetic progressions each of…

Given a polynomial $p$, the degree of its Chebyshev's method $C_p$ is determined. If $p$ is cubic then the degree of $C_p$ is found to be $4,6$ or $7$ and we investigate the dynamics of $C_p$ in these cases. If a cubic polynomial $p$ is…

For a finite graph $F$ and a value $p \in [0,1]$, let $I(F,p)$ denote the largest $y$ for which there is a sequence of graphs of edge density approaching $p$ so that the induced $F$-density of the sequence approaches $y$. We show that for…