Related papers: Constructing Pseudo-involutions in the Riordan Gro…
We derive new infinite series involving Fibonacci numbers and Riemann zeta numbers. The calculations are facilitated by evaluating linear combinations of polygamma functions of the same order at certain arguments.
We characterize certain Riordan arrays by their $A$-matrices and $\rho$ sequences. We conjecture the form of a generic $A$-matrix which leads to Somos $4$ sequences. We find an $A$-matrix that produces a Riordan quasi-involution, and we…
It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
An M-sequence generated by a primitive polynomial has many interesting and desirable properties. A pseudo-random array is the two-dimensional generalization of an M-sequence. There are non-primitive polynomials all of whose non-zero…
We use combinatorial and generating function techniques to enumerate various sets of involutions which avoid 231 or contain 231 exactly once. Interestingly, many of these enumerations can be given in terms of $k$-generalized Fibonacci…
Every ordinary Riordan array contains two naturally embedded Riordan arrays. We explore this phenomenon, and we compare it to the situation for certain moment matrices of families of orthogonal polynomials.
Generating random and pseudorandom numbers with a deterministic system is a long-standing challenge in theoretical research and engineering applications. Several pseudorandom number generators based on the inversive congruential method have…
We review recent developments of machine learning algorithms pertinent to the inverse renormalization group, which was originally established as a generative numerical method by Ron-Swendsen-Brandt via the implementation of compatible Monte…
In groups with involution a nonassociative product of elements is defined, which leads to the definition of a certain type of quasigroups. These quasigroups are represented by square tables of complex numbers, with inverses, which differ…
We present a parametric family of Riordan arrays which are obtained by multiplying any Riordan array with a generalized Pascal array. In particular, we focus on some interesting properties of one-parameter Catalan triangles. We obtain…
We study the involutions belonging to the class of 321 avoiding permutations. We calculate the algebraic generating functions of the set containing the involutions avoiding 321 and of some of its subsets. Precisely we determine the…
In this research we continue our previous investigation of wreath product normal structure \cite{SkuESL}. We generalize the group of unimodular matrices \cite{Amit} and find its structure. For this goal we propose one extension of the…
A pseudomodular group is a discrete subgroup $\Gamma \leq PGL(2,\mathbb{Q})$ which is not commensurable with $PSL(2,\mathbb{Z})$ and has cusp set precisely $\mathbb{Q}\cup\{\infty\}$. The existence of such groups was proved by Long and…
This article is devoted to the investigation of semidirect products of groups of loops and groups of diffeomorphisms of finite and infinte dimensional real, complex and quaternion manifolds. Necessary statements about quaternion manifolds…
To a finite group G one can associate a tower of wreath products S_n[G]. It is well known that the graded direct sum of the Grothendieck groups of the categories of finite dimensional complex representations of these groups can be given the…
An $f$-subgroup is a linear recurring sequence subgroup, a multiplicative subgroup of a field whose elements can be generated (without repetition) by a linear recurrence relation, with characteristic polynomial $f$. It is called…
In this paper, we discuss centralizers in the Riordan group. We will see that Fa\`a di Bruno's formula is an application of the Fundamental Theorem of Riordan arrays. Then the composition group of formal power series in ${\cal F}_1$ is…
Two methods of constructing 2D Toda $\tau$-functions that are generating functions for certain geometrical invariants of a combinatorial nature are related. The first involves generation of paths in the Cayley graph of the symmetric group…
An element of a group is called \emph{reversible} if it is conjugate to its inverse, and \emph{strongly reversible} if it can be expressed as a product of two involutions. We study strongly reversible elements in the Riordan group and in…
This study presents miscellaneous properties of pseudo-factorials, which are numbers whose recurrence relation is a twisted form of that of usual factorials. These numbers are associated with special elliptic functions, most notably, a…