Related papers: A Polya-Vinogradov-type inequality on $\mathbb{Z}[…

In this paper Lyapunov type inequality is developed for hybrid fractional boundary value problem involving the prabhakar fractional derivative.

We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

We give nontrivial bounds for the bilinear sums $$ \sum_{u = 1}^{U} \sum_{v=1}^V \alpha_u \beta_v \mathbf{\,e}_p(u/f(v)) $$ where $\mathbf{\,e}_p(z)$ is a nontrivial additive character of the prime finite field ${\mathbb F}_p$ of $p$…

We prove an endpoint version of the uniform Sobolev inequalities in Kenig-Ruiz-Sogge [8]. It was known that strong type inequalities no longer hold at the endpoints; however, we show that restricted weak type inequalities hold there, which…

Let $S_n$ denote a symmetric group, $\chi$ an irreducible character of $S_n$, and $g\in S_n$ an element which decomposes into $k$ disjoint cycles, where $1$-cycles are included. Then $|\chi(g)|\le k!$, and this upper bound is sharp for…

We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…

In this article, we establish a large sieve inequality for additive characters to moduli in the range of appropriate integer polynomials of degree two. As an application, we derive a weighted zero-density estimate for twists of…

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

We investigate the finite groups $G$ for which $\chi(1)^{2}=|G:Z(\chi)|$ for all characters $\chi \in Irr(G)$ and $|cd(G)|=2$, where $cd(G)=\{\chi(1)| \chi \in Irr(G)\}$. We call such a group a GVZ-group with two character degrees. We…

We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds…

Let $q$ be a prime power. We estimate the number of tuples of degree bounded monic polynomials $(Q_1,\ldots,Q_v) \in (\mathbb{F}_q[z])^v$ that satisfy given pairwise coprimality conditions. We show how this generalises from monic…

Let $p$ be an odd prime. Using I. M. Vinogradov's bilinear estimate, we present an elementary approach to estimate nontrivially the character sum $$ \sum_{x\in H}\chi(x+a),\qquad a\in\Bbb F_p^*, $$ where $H<\Bbb F_p^*$ is a multiplicative…

Let $V$ be a valuation ring of a global field $K$. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $V$, that is, an element of $\text{Int}(V) = \{ f \in K[X] \mid…

Let f be a Hecke-Maass or holomorphic primitive cusp form for $SL(2,\mathbb{Z})$ with Fourier coefficients $\lambda_{f}(n)$. Let $\chi$ be a primitive Dirichlet character of modulus p, where p is a prime number. In this article we prove the…

In this paper, Lyapunov type inequality is establish for fractional boundary value problem involving the k-Prabhakar fractional derivative.

We provide a new characterization of the logarithmic Sobolev inequality.

We obtain an asymptotically sharp error bound in the classical Sudakov-Fernique comparison inequality for finite collections of gaussian random variables. Our proof is short and self-contained, and gives an easy alternative argument for the…

We prove an analogue of the celebrated Hall-Higman theorem, which gives a lower bound for the degree of the minimal polynomial of any semisimple element of prime power order $p^{a}$ of a finite classical group in any nontrivial irreducible…