Related papers: Combinatorial approach of certain generalized Stir…
By using the associated and restricted Stirling numbers of the second kind, we give some generalizations of the poly-Bernoulli numbers. We also study their arithmetical and combinatorial properties. As an application, at the end of the…
We use elementary methods to establish three key recurrence relations: one for derangement numbers, a second for harmonic numbers, and a third for degenerate harmonic numbers. Our results not only contribute to the understanding of the…
Quickly convergent series are given to compute polyzeta numbers. The formula involves an intricate combination of (generalized) polylogarithms at 1/2. However, the combinatorics has a very simple geometric interpretation: it corresponds…
We provide a combinatorial derivation of an asymptotic formula for averages of mixed ratios of characteristic polynomials over the unitary group, where mixed ratios are products of ratios and/or logarithmic derivatives. Our proof of this…
We give some formulas of poly-Cauchy numbers by the $r$-Stirling transform. In the case of the classical or poly-Bernoulli numbers, the formulas are with Stirling numbers of the first kind. In our case of the classical or poly-Cauchy…
We evaluate binomial series with harmonic number coefficients, providing recursion relations, integral representations, and several examples. The results are of interest to analytic number theory, the analysis of algorithms, and…
Asymmetric combination of logics is a formal process that develops the characteristic features of a specific logic on top of another one. Typical examples include the development of temporal, hybrid, and probabilistic dimensions over a…
We introduce an algorithm that exploits a combinatorial symmetry of an arrangement in order to produce a geometric reflection between two disconnected components of its moduli space. We apply this method to disqualify three real examples…
The whole enterprise of spin compositions can be recast as simple enumerative combinatoric problems. We show here that enumerative combinatorics (EC)\citep{book:Stanley-2011} is a natural setting for spin composition, and easily leads to…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
We define the $m$th-order Eulerian numbers with a combinatorial interpretation. The recurrence relation of the $m$th-order Eulerian numbers, the row generating function and the row sums of the $m$th-order Eulerian triangle are presented. We…
We introduce, characterise and provide a combinatorial interpretation for the so-called $q$-Jacobi-Stirling numbers. This study is motivated by their key role in the (reciprocal) expansion of any power of a second order $q$-differential…
We consider generalized Stirling numbers of the second kind $% S_{a,b,r}^{\alpha_{s},\beta_{s},r_{s},p_{s}}\left( p,k\right) $, $% k=0,1,\ldots .rp+\sum_{s=2}^{L}r_{s}p_{s}$, where $a,b,\alpha_{s},\beta_{s} $ are complex numbers, and…
In this paper, we give explicit evaluation for some infinite series involving generalized (alternating) harmonic numbers. In addition, some formulas for generalized (alternating) harmonic numbers will also be derived.
Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
In this paper, we count a dual set of Stirling permutations by the number of alternating runs. Properties of the generating functions, including recurrence relations, grammatical interpretations and convolution formulas are studied.
Juggling patterns can be described by a sequence of cards which keep track of the relative order of the balls at each step. This interpretation has many algebraic and combinatorial properties, with connections to Stirling numbers, Dyck…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…