Related papers: On Hardy's Apology Numbers
The behavior of certain weighted Hardy-type operators on rearrangement-invariant function spaces is thoroughly studied with emphasis being put on the optimality of the obtained results. First, the optimal rearrangement-invariant function…
We give new proofs of Hardy space estimates for fractional and singular integral operators on weighted and variable exponent Hardy spaces. Our proofs consist of several interlocking ideas: finite atomic decompositions in terms of $L^\infty$…
We prove some Hardy-type inequalities via an approach that involves constructing auxiliary sequences.
The $(q,r)$-Whitney numbers were recently defined in terms of the $q$-Boson operators, and several combinatorial properties which appear to be $q$-analogues of similar properties were studied. In this paper, we obtain elementary and…
We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers,…
We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…
Let $r$ be a positive real number and $p$ satisfy $(2/p)\in\mathbb{N}$. Then, we consider the lattice point problem of the closed curves astroid-type $p$-circle $\{x\in\mathbb{R}^{2}|\ |x_{1}|^{p}+|x_{2}|^{p}=r^{p}\}$ which generalize the…
Weird numbers are abundant numbers that are not pseudoperfect. Since their introduction, the existence of odd weird numbers has been an open problem. In this work, we describe our computational effort to search for odd weird numbers, which…
In this paper, we consider a weighted version of one-dimensional discrete Hardy inequalities with power weights of the form $n^\alpha$. We prove the inequality when $\alpha$ is an even natural number with the sharp constant and remainder…
Algebraic and analytic aspects of self-adjoint operators of order four or more with polynomial coefficients are investigated. As a consequence, a systematic way of constructing such operators is given. The procedure is applied to obtain…
There are 339 combinatorial types of generic metrics on six points. They correspond to the 339 regular triangulations of the second hypersimplex \Delta(6,2), which also has 14 non-regular triangulations.
The generalized operator-based Prony method is an important tool for describing signals which can be written as finite linear combinations of eigenfunctions of certain linear operators. On the other hand, Bernoulli's algorithm and its…
We present new estimate for Hardy-type inequality in variable exponent Lebesgue spaces. More precisely, by imposing regularity assumptions on the exponent, we prove that the estimations can be reduced to the fixed exponents.
The Hardy-Littlewood method is a well-known technique in analytic number theory. Among its spectacular applications are Vinogradov's 1937 result that every sufficiently large odd number is a sum of three primes, and a related result of…
In terms of the derivative operator and Watson-type $_3F_2$-series identities, three families of summation formulae involving generalized harmonic numbers are established.
The number of ordered factorizations and the number of recursive divisors are two related arithmetic functions that are recursively defined. But it is hard to construct explicit representations of these functions. Taking advantage of their…
Generalized Hurwitz theorem states that there are fifteen composition algebras for any given field: seven unital, six para-unital, and two non-unital algebras. In this article we explore the recovery of such algebras from 3D Geometric…
Using real-variable methods, we characterise multipliers for general classes of Hardy--Orlicz spaces, unifying and extending several classical results due to Hardy and Littlewood; Duren and Shields; Paley; and others. Applications of our…
Three-term recurrences have infused stupendous amount of research in a broad spectrum of the sciences, such as orthogonal polynomials (in special functions) and lattice paths (in enumerative combinatorics). Among these are the Lucas…
We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…