Related papers: On the Waring problem for polynomial rings
Let $f_1,\...,f_r$ be polynomials in $n$ variables over a finite field $F$ of cardinality $q$ and characteristic $p$. Let $f_i$ have total degree $d_i$ and define $d=d_1+\...+d_r$. Write $Z$ for the set of common zeros of the $f_i$, over…
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
If $ p_k(a,m,n) $ denotes the number of partitions of $n$ into $k$th powers with a number of parts that is congruent to $ a $ modulo $m,$ then $p_2(0,2,n)\sim p_2(1,2,n)$ and the sign of the difference $p_2(0,2,n)- p_k(1,2,n)$ alternates…
Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…
We study the number of representations of an integer n=F(x_1,...,x_s) by a homogeneous form in sufficiently many variables. This is a classical problem in number theory to which the circle method has been succesfully applied to give an…
Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…
We prove necessary and sufficient conditions for the existence of homogeneous prime elements in normal N-graded rings of dimension two, in terms of rational coefficient Weil divisors on projective curves.
Let $f(x)=x^n+ax^2+bx+c \in \Z[x]$ be an irreducible polynomial with $b^2=4ac$ and let $K=\Q(\theta)$ be an algebraic number field defined by a complex root $\theta$ of $f(x)$. Let $\Z_K$ deonote the ring of algebraic integers of $K$. The…
Let A be a central division algebra over a field F with ind A = n. In computing canonical p-dimension of projective PGL_1(A)-homogeneous varieties, for p prime, we can reduce to the case of generalized Severi-Brauer varieties X_e(A) with…
In this paper, we study a density version of the Waring-Goldbach problem. Suppose that A is a subset of the primes, and the lower density of A in the primes is larger than 1-1/2k. We prove that every sufficiently large natural number n…
In this paper, we will investigate the solvability of the equation $x_1^k + x_2^k + \ldots + x_s^k = n$, $n\in \mathbb{Z}_{p^k}$, $x_1,...,x_s\in \mathcal{A}$, $\mathcal{A}\subseteq \mathbb{Z}_{p^k}$. We will give a upper bound of the…
Given a symbolic power of a homogeneous ideal in a polynomial ring, we study the problem of determining which powers of the ideal contain it. For ideals defining 0-dimensional subschemes of projective space, as an immediate corollary of our…
Let D be a domain with quotient field K and A a D-algebra. We call a polynomial with coefficients in K that maps every element of A to an element of A "integer-valued on A". For commutative A we also consider integer-valued polynomials in…
In this paper we consider the computational complexity of the following problem. Let $f$ be a Boolean polynomial. What value of $f$, 0 or 1, is taken more frequently? The problem is solved in polynomial time for polynomials of degrees 1,2.…
We use the representation theory of Lie algebras and computational linear algebra to determine the simplest nonconstant invariant polynomial in the entries of a general 2 x 2 x 3 array. This polynomial is homogeneous of degree 6 and has 66…
Generalized Mersenne numbers are defined as $M_{p,n} = p^n - p + 1$, where $p$ is any prime and $n$ is any positive integer. Here, we prove that for each pair $(c, p)$ with $c\geq 1$ an integer, there is at most one $M_{p, n}$ of the form…
We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…
Let $1<c<d$ be two relatively prime integers, $g_{c,d}=cd-c-d$ and $\mathbb{P}$ is the set of primes. For any given integer $k \geq 1$, we prove that $$\#\left\{p^k\le g_{c,d}:p\in \mathbb{P}, ~p^k=cx+dy,~x,y\in \mathbb{Z}_{\geqslant0}…
We show that there does not exist a generalised polynomial which vanishes precisely on the set of powers of two. In fact, if $k \geq 2$ is and integer and $g \colon \mathbb{N} \to \mathbb{R}$ is a generalised polynomial such that $g(k^n) =…
For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…