Related papers: Linear independence of powers for polynomials
This note presents an analytic technique for proving the linear independence of certain small subsets of real numbers over the rational numbers. The applications of this test produce simple linear independence proofs for the subsets of…
The $k$-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than $k$. A graph is called $k$-partially walk-regular if the number of closed walks of a given length $l\le k$, rooted at a vertex…
Given a natural number $n \geq 2$, an integer $k$ and for a judiciously chosen $l = l(n)$ we give necessary and sufficient conditions for the polynomial $f_{n,k} = \big( \sum_{i=1}^{l} x_{i}^{n} \big) - k$ to have roots modulo every…
Let $K$ be a field of characteristic $0$, and let $k \geq 2$ be an integer. We prove that every $K$-linear bijection $f \colon K[X] \to K[X]$ strongly preserving the set of $k$-free polynomials (or the set of polynomials with a $k$-fold…
Let L be a linear difference operator with polynomial coefficients. We consider singularities of L that correspond to roots of the trailing (resp. leading) coefficient of L. We prove that one can effectively construct a left multiple with…
We propose a coefficient that measures the dependence among large values for spatial processes of maxima. Its main properties are: a) $k$ locations can be taken into account; b) it takes values in $[0,1]$ and higher values indicate stronger…
Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…
It is known that the weight (that is, the number of nonzero coefficients) of a univariate polynomial over a field of characteristic zero is larger than the multiplicity of any of its nonzero roots. We extend this result to an appropriate…
Let $q$ be a prime power and $n$ and $r$ be positive integers. It is well known that the linearized binomial $L_r(x)=x^{q^r}+ax\in\mathbb{F}_{q^n}[x]$ is a permutation polynomial if and only if $(-1)^{n/d}a^{{(q^n-1)}/{(q^{d}-1)}}\neq 1$…
We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting…
Let $I$ be an arbitrary nonzero squarefree monomial ideal of dimension $d$ in a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_n]$. Let $\mu$ be the number of associated primes of $S/I$ of dimension $d$. We prove that the multiplicity of…
In this article, we show a new general linear independence criterion related to values of $G$-functions, including the linear independence of values at algebraic points of contiguous hypergeometric functions, which is not known before. Let…
In this manuscript we provide a new polynomial pattern. This pattern allows to find a polynomial expansion of the form \[x^{2m+1} = \sum_{k=1}^{x}\sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r,\] where $x,m\in\mathbb{N}$ and $\mathbf{A}_{m,r}$…
What is the maximum possible value of the lead coefficient of a degree $d$ polynomial $Q(x)$ if $|Q(1)|,|Q(2)|,\ldots,|Q(k)|$ are all less than or equal to one? More generally we write $L_{d,[x_k]}(x)$ for what we prove to be the unique…
We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…
Let $K$ be a field, and let $\Aut \,K^2$ be the group of polynomial automorphisms of $K^2$. We investigate which subgroups are linear or not. In characteristic zero, there are small nonlinear subgroups and some big linear subgroups. When…
This paper provides the first criteria for the linear independence of multiple polylogarithm values over algebraic number fields. In particular, we derive novel results regarding the linear independence of products of polylogarithms at…
We obtain a necessary and sufficient condition for the linear independence of solutions of differential equations for hyperlogarithms. The key fact is that the multiplier (i.e. the factor $M$ in the differential equation $dS=MS$) has only…