Related papers: On Hardy's Apology Numbers
In this article, we give a particular recreational application of the sequence A000533 and A261544 in "The On-line Encyclopedia of Integer Sequences" (OEIS). The recreational application provides a direct extension to "The Repetitious…
In this paper, we propose new generalizations of amicable numbers. We also give examples and prove properties of these new concepts.
We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.
Three specializations of a set of orthogonal polynomials with ``8 different q's'' are given. The polynomials are identified as $q$-analogues of Laguerre polynomials, and the combinatorial interpretation of the moments give infinitely many…
In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…
We study factorizations of HOMFLY polynomials of certain knots and oriented links. We begin with a computer analysis of knots with at most 12 crossings, finding 17 non-trivial factorizations. Next, we give an irreducibility criterion for…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
Calculi with control operators have been studied to reason about control in programming languages and to interpret the computational content of classical proofs. To make these calculi into a real programming language, one should also…
When one inserts a number of identical bars in between blocks of an ordered set partition, they get a barred preferential arrangement. In this study we define a new generalization of barred preferential arrangements, by considering barred…
Several articles deal with tilings with various shapes, and also a very frequent type of combinatorics is to examine the walks on graphs or on grids. We combine these two things and give the numbers of the shortest walks crossing the tiled…
We introduce a new four-parameters sequence that simultaneously generalizes some well-known integer sequences, including Fibonacci, Padovan, Jacobsthatl, Pell, and Lucas numbers. Combinatorial interpretations are discussed and many…
Several combinatorial identities are presented, involving Stirling functions of the second kind with a complex variable. The identities involve also Stirling numbers of the first kind, binomial coefficients and harmonic numbers.
In this paper, by using some families of special numbers and polynomials with their generating functions, we give various properties of these numbers and polynomials. These numbers are related to the well-known numbers and polynomials,…
A growing effort in NLP aims to build datasets of human explanations. However, the term explanation encompasses a broad range of notions, each with different properties and ramifications. Our goal is to provide an overview of diverse types…
In this paper we study canonical models for representations of the Hardy algebras that generalize the model theory of Sz.-Nagy and Foias for contraction operators. The Hardy algebras are non selfadjoint operator algebras associated with…
In this paper, we provide suitable characterisations of pairs of weights $(V,W),$ known as Bessel pairs, that ensure the validity of weighted Hardy-type inequalities. The abstract approach adopted here makes it possible to establish such…
A quick way to compute generating functions related to Pell-Padovan tetranacci numbers and classical sequences of recursions of order two is provided. Eight special instances can be computed at once.
We present several types of ordinary generating functions involving central binomial coefficients, harmonic numbers, and odd harmonic numbers. Our results complement those of Boyadzhiev from 2012 and Chen from 2016. Based on these…
We present a combinatorial method of constructing solutions to the normal ordering of boson operators. Generalizations of standard combinatorial notions - the Stirling and Bell numbers, Bell polynomials and Dobinski relations - lead to…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…