Related papers: On Hardy's Apology Numbers

By considering generalized logarithm and exponential functions used in nonextensive statistics, the four usual algebraic operators : addition, subtraction, product and division, are generalized. The properties of the generalized operators…

Let $\mathfrak{p}=(\mathfrak{p}_1,...,\mathfrak{p}_r)$ be a system of $r$ polynomials with integer coefficients of degree $d$ in $n$ variables $\mathbf{x}=(x_1,...,x_n)$. For a given $r$-tuple of integers, say $\mathbf{s}$, a general local…

Ramsey theory is an active research area in combinatorics whose central theme is the emergence of order in large disordered structures, with Ramsey numbers marking the threshold at which this order first appears. For generalized Ramsey…

This paper introduces a simple type system for combinatory logic in which combinators have at most one type, whose polymorphism is revealed by application. The combinatory types exactly describe the structure of their values, which may be…

We study the prime pair counting functions $\pi_{2k}(x),$ and their averages over $2k.$ We show that good results can be achieved with relatively little effort by considering averages. We prove an asymptotic relation for longer averages of…

We study the composition operators of the Hardy space on D $\infty$ $\cap$ {\ell} 1 , the {\ell} 1 part of the infinite polydisk, and the behavior of their approximation numbers.

In his celebrated book "On Number and Games" (Academic Press, New-York, 1976), J.H. Conway introduced twelve versions of compound games. We analyze these twelve versions for the Node-Kayles game on paths. For usual disjunctive compound,…

We first establish the result that the Narayana polynomials can be represented as the integrals of the Legendre polynomials. Then we represent the Catalan numbers in terms of the Narayana polynomials by three different identities. We give…

In this article, we define discrete analogue of generalized Hardy spaces and its separable subspace on a homogenous rooted tree and study some of its properties such as completeness, inclusion relations with other spaces, separability,…

This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of…

In this survey we give a compact presentation of well-known functional inequalities of Hardy and Rellich type in the $L^2$ setting. In addition, we give some insights of their proofs by using standard and basic tools such as the method of…

We define reflective numbers and their iterative summations. We provide classification of reflective numbers based on their iterative cyclical limits.

We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews' results in [5]. The novelty is that the method constructs solutions to functional equations…

In this paper we present and prove rapidly convergent formulas for the distribution of the $3$-smooth, $5$-smooth, $7$-smooth and all other smooth numbers. One of these formulas is another version of a formula due to Hardy and Littlewood…

We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei…

In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…

We introduce poly-Cauchy permutations that are enumerated by the poly-Cauchy numbers. We provide combinatorial proofs for several identities involving poly-Cauchy numbers and some of their generalizations. The aim of this work is to…

As children acquire the knowledge of their language's morphology, they invariably discover the productive processes that can generalize to new words. Morphological learning is made challenging by the fact that even fully productive rules…

Four Jacobi settings are considered in the context of Hardy's inequality: the trigonometric polynomials and functions, and the corresponding symmetrized systems. In the polynomial cases sharp Hardy's inequality is proved for the type…

We prove certain generalization of Hardy's inequality where the "boundary defining function" is replaced by a polynomial defining a singular algebraic variety. An application is given on the existence of a small time heat trace expansion…