Related papers: The Strong Factorial Conjecture

Let ${\mathcal B}=\{b_i \}_{i=1}^\infty$ be a fixed sequence of pairwise distinct elements of a number field $k$. Given the integers $2\leq s \leq r$, assuming a quantitative version of Vojta's conjecture on the bounded degree algebraic…

We provide an alternative exposition of a result due to Schinzel. Fix an integer $k \ge 2$. For almost all choices of positive integers $n_{1} < \cdots < n_{k}$, we show that the polynomial $F(x) = 1 + x^{n_{1}} + \cdots + x^{n_{k}}$,…

The Rearrangement Conjecture states that if two words over $\mathbb{P}$ are Wilf-equivalent in the factor order on $\mathbb{P}^\ast$ then they are rearrangements of each other. We introduce the notion of strong Wilf-equivalence and prove…

It is conjectured that all separable polynomials with integers coefficients, satisfying some local conditions, take infinitely many square free values on integer arguments. But not a single polynomial of degree greater than $3$ is proven to…

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

The L'vov-Kaplansky conjecture states that the image of a multilinear noncommutative polynomial $f$ in the matrix algebra $M_n(K)$ is a vector space for every $n \in {\mathbb N}$. We prove this conjecture for the case where $f$ has degree…

The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…

Some cases of the LFED Conjecture, proposed by the second author [Z3], for certain integral domains are proved. In particular, the LFED Conjecture is completely established for the field of fractions $k(x)$ of the polynomial algebra $k[x]$,…

The present paper is devoted to investigating the two-dimensional real Jacobian conjecture. This conjecture claims that if $F=\left(f,g\right):\mathbb{R}^2\rightarrow \mathbb{R}^2$ is a polynomial map with $\det DF\left(x,y\right)\ne0$ for…

The strong no loop conjecture states that a simple module of finite projective dimension over an artin algebra has no non-zero self-extension. The main result of this paper establishes this well known conjecture for finite dimensional…

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

We consider a continuous family $(f_s)$, $s\in[0,1]$ of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant (or…

Let $K$ be an algebraically closed field of characteristic zero, $\delta$ a nonzero $\mathcal{E}$-derivation of $K[x]$. We first prove that $\operatorname{Im}\delta$ is a Mathieu-Zhao space of $K[x]$ in some cases. Then we prove that LFED…

Let $\lambda (n)$ denote the Liouville function. Complementary to the prime number theorem, Chowla conjectured that \vspace{1mm} \noindent {\bf Conjecture (Chowla).} {\em \begin{equation} \label{a.1} \sum_{n\le x} \lambda (f(n)) =o(x)…

Jedrzejewicz showed that a polynomial map over a field of characteristic zero is invertible, if and only if the corresponding endomorphism maps irreducible polynomials to irreducible polynomials. Furthermore, he showed that a polynomial map…

Let $\mu_n$ be the standard Gaussian measure on $\mathbb{R}^n$ and $X$ be a random vector on $\mathbb{R}^n$ with the law $\mu_n$. U-conjecture states that if $f$ and $g$ are two polynomials on $\mathbb{R}^n$ such that $f(X)$ and $g(X)$ are…

The two-functional conjecture says that if a function f analytic and univalent in the unit disk maximizes Re{L} and Re{M} for two continuous linear functionals L and M, L is not equal to cM for any c>0, then f is a rotation of the Koebe…

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…

In this paper we relate the location of the complex zeros of the reliability polynomial to parameters at which a certain family of rational functions derived from the reliability polynomial exhibits chaotic behaviour. We use this connection…