相关论文: Inequalities associated with the root sequences of…

The famous Szemer\'{e}di-Trotter theorem states that any arrangement of $n$ points and $n$ lines in the plane determines $O(n^{4/3})$ incidences, and this bound is tight. In this paper, we prove the following Tur\'an-type result for…

Recently, a relation between Schreier-type sets and Tur\'{a}n graphs was discovered. In this note, we give a combinatorial proof and obtain a generalization of the relation. Specifically, for $p, q\ge 1$, let $$\mathcal{A}_q :=…

Inequalities are important features in the context of sequences of numbers and polynomials. The Bessenrodt--Ono inequality for partition numbers and Nekrasov--Okounkov polynomials has only recently been discovered. In this paper we study…

An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n \geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} \alpha \right)_{n\geq 1}$ is uniformly distributed modulo one for…

In this paper, we use Sakai's geometric framework to explore the profound interconnection between recurrence coefficients of the semiclassical Laguerre weight $w(x)=x^{\lambda}\mathrm{e}^{-x^2+sx}$, $x\in\mathbb{R}^+$, $\lambda>-1$,…

In this article we take a probabilistic look at H\"older's inequality, considering the ratio of terms in the classical H\"older inequality for random vectors in $\mathbb{R}^n$. We prove a central limit theorem for this ratio, which then…

The linearization coefficient $\mathcal{L}(L_{n_1}(x)\dots L_{n_k}(x))$ of classical Laguerre polynomials $L_n(x)$ is known to be equal to the number of $(n_1,\dots,n_k)$-derangements, which are permutations with a certain condition.…

A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…

Let $X$ be an integrable discrete random variable over $\{0, 1, 2, \ldots\}$ with $\mathbb{P}(X = i + 1) \leq \mathbb{P}(X = i)$ for all $i$. Then for any integer $a \geq 1$, $\mathbb{P}(X \leq a) \leq \mathbb{E}[X] / (2a - 1)$. Let $W$ be…

Let $r\ge k\ge 2$ be fixed positive integers. Let $\varrho_{r,k}$ denote the characteristic function of the set of $r$-tuples of positive integers with $k$-wise relatively prime components, that is any $k$ of them are relatively prime. We…

We propose a characterization of a $p$-Laplace higher eigenvalue based on the inverse iteration method with balancing the Rayleigh quotients of the positive and negative parts of solutions to consecutive $p$-Poisson equations. The approach…

This paper is devoted to a new first order Taylor-like formula where the corresponding remainder is strongly reduced in comparison with the usual one which appears in the classical Taylor's formula. To derive this new formula, we introduce…

Assume that $\{a_{n};\,n\geq0\}$ is a sequence of positive numbers and $\sum a_{n}^{\,-1}<\infty$. Let $\alpha_{n}=ka_{n}$, $\beta_{n}=a_{n}+k^{2}a_{n-1}$ where $k\in(0,1)$ is a parameter, and let $\{P_{n}(x)\}$ be an orthonormal polynomial…

In this paper, We study the asymptotics of the leading coefficients and the recurrence coefficients for the orthogonal polynomials with repect to the Laguerre weight with singularity of root type and jump type at the soft edge via the…

For a given real number $a$ we define the sequence $\{E_{n,a}\}$ by $E_{0,a}=1$ and $E_{n,a}=-a\sum_{k=1}^{[n/2]} \binom n{2k}E_{n-2k,a}$ $(n\ge 1)$, where $[x]$ is the greatest integer not exceeding $x$. Since $E_{n,1}=E_n$ is the n-th…

One of the classical problems in group theory is determining the set of positive integers $n$ such that every group of order $n$ has a particular property $P$, such as cyclic or abelian. We first present the Sylow theorems and the idea of…

The main contributions of this paper are the proposition and the convergence analysis of a class of inertial projection-type algorithm for solving variational inequality problems in real Hilbert spaces where the underline operator is…

Celebrated theorems of Roth and of Matou\v{s}ek and Spencer together show that the discrepancy of arithmetic progressions in the first $n$ positive integers is $\Theta(n^{1/4})$. We study the analogous problem in the $\mathbb{Z}_n$ setting.…

This paper explores the Prouhet-Tarry-Escott problem (PTE), the Generalized PTE problem (GPTE), and the Fermat form of Generalized PTE problem (FPTE). The GPTE problem extends the PTE problem by allowing different sets of exponents, while…

In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…