Related papers: A function field variant of Pillai's problem

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

In this paper, we provide an example of the optimal growth model in which there exist infinitely many solutions to the Hamilton-Jacobi-Bellman equation but the value function does not satisfy this equation. We consider the cause of this…

We consider the problem of multiplicity and uniqueness of radial solutions of a nonlinear elliptic equation of the form \begin{eqnarray*} \begin{gathered} \Delta u +f(u)=0,\quad x\in \mathbb{R}^N, N\geq 2, \lim\limits_{|x|\to\infty}u(x)=0.…

We study rational functions over finite fields under PGL-equivalence. We say that $f, g \in \Bbb F_q(X)$ are \emph{equivalent} if there exist $\psi, \phi \in \Bbb F_q(X)$ of degree one such that $g = \psi \circ f \circ \phi$. Most…

In several articles, this author has advocated an alternative approach towards quantum foundation based upon a set of postulates, and based upon the notions of theoretical variables and of accessible theoretical variables. It is shown in…

We resolve the strong Elementary Equivalence versus Isomorphism Problem for finitely generated fields. That is, we show that for every field in this class there is a first-order sentence which characterizes this field within the class up to…

We consider the hardness of approximation of optimization problems from the point of view of definability. For many NP-hard optimization problems it is known that, unless P = NP, no polynomial-time algorithm can give an approximate solution…

For each positive integer $n$ it is shown how to construct a finite collection of multivariable polynomials $\{F_{i}:=F_{i}(t,X_{1},..., X_{\lfloor \frac{n+1}{2} \rfloor})\}$ such that each positive integer whose squareroot has a continued…

Assume that $Au=f,\quad (1)$ is a solvable linear equation in a Hilbert space $H$, $A$ is a linear, closed, densely defined, unbounded operator in $H$, which is not boundedly invertible, so problem (1) is ill-posed. It is proved that the…

We prove a complexity dichotomy for Holant problems on the boolean domain with arbitrary sets of real-valued constraint functions. These constraint functions need not be symmetric nor do we assume any auxiliary functions as in previous…

It is known that the famous Heins Theorem (also known as the de Branges Lemma) about the minimum of two entire functions of minimal type does not extend to functions of finite exponential type. We study in detail pairs of entire functions…

We consider Diophantine inequalities of the kind |f(x)| \le m, where F(X) \in Z[X] is a homogeneous polynomial which can be expressed as a product of d homogeneous linear forms in n variables with complex coefficients and m\ge 1. We say…

Consider a compact Lie group $G$ and a closed Lie subgroup $H<G$. Let $\mathcal M$ be the set of $G$-invariant Riemannian metrics on the homogeneous space $M=G/H$. By studying variational properties of the scalar curvature functional on…

In this paper we obtain explicit estimates and existence results on the number of $\mathbb{F}_q$-rational solutions of certain systems defined by families of diagonal equations over finite fields. Our approach relies on the study of the…

In the context of Hilbert's tenth problem, an outstanding open case is that of complex entire functions in one variable. A negative solution is known for polynomials (by Denef) and for exponential polynomials of finite order (by Chompitaki,…

We consider the problem of determining the maximum number of common zeros in a projective space over a finite field for a system of linearly independent multivariate homogeneous polynomials defined over that field. There is an elaborate…

Using properties of Gauss and Jacobi sums, we derive explicit formulas for the number of solutions to a diagonal equation of the form $x_1^{2^m}+\dots+x_n^{2^m}=0$ over a finite field of characteristic $p\equiv\pm 3\pmod{8}$. All of the…

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…

We prove that if x^m + c*x^n permutes the prime field GF(p), where m>n>0 and c is in GF(p)^*, then gcd(m-n,p-1) > sqrt{p} - 1. Conversely, we prove that if q>=4 and m>n>0 are fixed and satisfy gcd(m-n,q-1) > 2q*(log log q)/(log q), then…

We study the problem of placing effective upper bounds for the number of zeros of solutions of Fuchsian systems on the Riemann sphere. The principal result is an explicit (non-uniform) upper bound, polynomially growing on the frontier of…