Related papers: A linear independence criterion for certain infini…

Let $G=\{e^{tA}:t\in\mathbb{R}\}$ be a closed one-parameter subgroup of the general linear group of matrices of order $n$ acting on $\mathbb{R}^{n}$ by matrix-vector multiplications. We assume that all eigenvalues of $A$ are rationally…

We establish a law of the iterated logarithm (LIL) for the set of real numbers whose $n$-th partial quotient is bigger than $\alpha_n$, where $(\alpha_n)$ is a sequence such that $\sum 1/\alpha_n$ is finite. This set is shown to have…

Let $C_n(q)$ be the number of ideals of codimension $n$ of $\mathbb{F}_q\left[x, y, x^{-1}, y^{-1} \right]$, where $\mathbb{F}_q$ is the finite field with $q$ elements. Kassel and Reutenauer [KasselReutenauer2015A] proved that $C_n(q)$ is a…

Let $F_q$ be a finite field of characteristic $p=2,3$. We give the number of irreducible polynomials $x^m+a_{m-1}x^{m-1}+...+a_0\in\F_q[x]$ with $a_{m-1}$ and $a_{m-3}$ prescribed for any given $m$ if $p=2$, and with $a_{m-1}$ and $a_1$…

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…

Let $a,b,c$ be non-zero integers and $f(x)=ax^n+bx^m+c$ be a trinomial of degree $n$. We surveyed the irreducibility criteria of $f(x)$ over rational numbers.

If $A$ is in the $p$-Schatten class on $\mathbb{R}^n$, $1\leq p \leq \frac{4n}{2n-1}$, then the quantum translates of $A$ are linearly independent. Moreover, there exists a non-zero operator in the $p$-Schatten class on $\mathbb{R}^n$,…

Given a polynomial $p$ with no zeros in the polydisk, or equivalently the poly-upper half-plane, we study the problem of determining the ideal of polynomials $q$ with the property that the rational function $q/p$ is bounded near a boundary…

In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…

This paper is devoted to the study of independent spaces of q-polymatroids. With the aid of an auxiliary q-matroid it is shown that the collection of independent spaces satisfies the same properties as for q-matroids. However, in contrast…

We study a function field version of a classical problem concerning square-free values of polynomials evaluated at primes. We show that for a square-free polynomial $f\in \mathbb{F}_q[t][x]$, there is a limiting density as $n\to \infty$ of…

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

Let $p$ be a prime, let $d \geq 1$ be an integer and $A$ be the algebra of square matrices of size $d$ over the field of order $p$. Let $P, Q \in A[x_1, \dots x_n]$ be polynomials in $n$ indeterminates with coefficients in $A$, such that…

Let $L(x)$ be any $q$-linearized polynomial with coefficients in $\mathbb{F}_q$, of degree $q^n$. We consider the Galois group of $L(x)+tx$ over $\mathbb{F}_q(t)$, where $t$ is transcendental over $\mathbb{F}_q$. We prove that when $n$ is a…

We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…

Let $V$ denote an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. For an $m$-dimensional $\mathbb{F}_q$-subspace $U$ of $V$ assume that $\dim_q \left(\langle {\bf v}\rangle_{\mathbb{F}_{q^n}} \cap U\right) \geq 2$ for each non zero vector…

Given a prime number $l$ and a finite set of integers $S=\{a_1,...,a_m\}$ we find out the exact degree of the extension $\mathbb{Q}(a_1^{\frac{1}{l}},...,a_m^{\frac{1}{l}})/\mathbb{Q}$. We give an algorithm to compute this degree and then…

We introduce a finite difference and $q$-difference analogues of the Asymptotic Iteration Method of Ciftci, Hall, and Saad. We give necessary, and sufficient condition for the existence of a polynomial solution to a general linear…

The famous result of Lindemann and Weierstrass says that if $a_{1},a_{2},\ldots,a_{n}$ are distinct algebraic numbers, then $e^{a_{1}},e^{a_{2}},\ldots,e^{a_{n}}$ are linearly independent complex numbers over the field…

Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…