English
Related papers

Related papers: A semigroup approach to iterated binomial transfor…

200 papers

The purpose of this paper is to give a characterisation of divided power algebras over a reduced operad. Such a characterisation is given in terms of polynomial operations, following the classical example of divided power algebras. We…

Algebraic Topology · Mathematics 2020-08-12 Sacha Ikonicoff

In this study, we apply "r" times the binomial transform to k-Lucas sequence. Also, the Binet formula, summation, generating function of this transform are found using recurrence relation. Finally, we give the properties of iterated…

Number Theory · Mathematics 2016-04-26 Nazmiye Yilmaz , Necati Taskara

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

Combinatorics · Mathematics 2014-06-11 Tewodros Amdeberhan , Victor H. Moll

We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical…

Combinatorics · Mathematics 2015-05-28 José Agapito , Ângela Mestre , Pasquale Petrullo , Maria M. Torres

In recent work, M. Just and the second author defined a class of "semi-modular forms" on $\mathbb C$, in analogy with classical modular forms, that are "half modular" in a particular sense; and constructed families of such functions as…

Number Theory · Mathematics 2021-08-03 A. P. Akande , Robert Schneider

In this article, the 2-iterated Sheffer polynomials are introduced by means of generating function and operational representation. Using the theory of Riordan arrays and relations between the Sheffer sequences and Riordan arrays, a…

Classical Analysis and ODEs · Mathematics 2015-06-02 Subuhi Khan , Mumtaz Riyasat

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…

Formal Languages and Automata Theory · Computer Science 2025-09-30 Attila Egri-Nagy , Chrystopher L. Nehaniv

In this study, we apply the binomial transforms to Tribonacci and Tribonacci-Lucas sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we illustrate the…

Combinatorics · Mathematics 2016-01-12 Nazmiye Yilmaz , Necati Taskara

Ordinary algebra of formal power series in one variable is convenient to study by means of the algebra of Riordan matrices and the Riordan group. In this paper we consider algebra of formal power series without constant term, isomorphic to…

Number Theory · Mathematics 2017-02-06 E. Burlachenko

We introduce and study the properties of a new family of fractional differential and integral operators which are based directly on an iteration process and therefore satisfy a semigroup property. We also solve some ODEs in this new model…

Classical Analysis and ODEs · Mathematics 2021-05-03 Arran Fernandez , Dumitru Baleanu

Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…

Combinatorics · Mathematics 2025-12-22 Kunle Adegoke

Each numerical sequence $\left( {{b}_{0}},{{b}_{1}},{{b}_{2}},... \right)$ with the generating function $B\left( x \right)$ defines the pseudo-involution in the Riordan group $\left( 1,xg\left( x \right) \right)$ such that $g\left( x…

Number Theory · Mathematics 2017-07-05 E. Burlachenko

We prove a parametric generalization of the classical Poincare-Perron theorem on stabilizing recurrence relations where we assume that the varying coefficients of a recurrence depend on auxiliary parameters and converge uniformly in these…

Functional Analysis · Mathematics 2010-11-10 J. Borcea , S. Friedland , B. Shapiro

Various kinds of infinitary operations satisfying forms of associativity have been considered in the literature by various authors, including A. Tarski, C. Karp, J. H. Conway, D. Krob, N. Bedon, and C. Rispal. Applications include the…

Group Theory · Mathematics 2026-05-28 Paolo Lipparini

We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…

Group Theory · Mathematics 2022-06-29 Peter M. Hines

The reconstruction theorem and the multilevel Schauder estimate have central roles in the analytic theory of regularity structures [17]. Inspired by [26], we provide elementary proofs for them by using the semigroup of operators.…

Analysis of PDEs · Mathematics 2025-01-23 Masato Hoshino

Riordan arrays, denoted by pairs of generating functions (g(z), f(z)), are infinite lower-triangular matrices that are used as combinatorial tools. In this paper, we present Riordan and stochastic Riordan arrays that have connections to the…

Combinatorics · Mathematics 2021-05-27 Candice Marshall , Asamoah Nkwanta

In this paper, we develop a semi-classical analysis on H-type groups. We define semi-classical pseudodifferential operators, prove the boundedness of their action on square integrable functions and develop a symbolic calculus. Then, we…

Functional Analysis · Mathematics 2018-12-04 Clotilde Fermanian-Kammerer , Veronique Fischer

A numerical semigroup is said to be ordinary if it has all its gaps in a row. Indeed, it contains zero and all integers from a given positive one. One can define a simple operation on a non-ordinary semigroup, which we call here the…

Number Theory · Mathematics 2012-03-23 Maria Bras-Amorós

We consider pseudo-involutions in the Riordan group where the generating function $g$ for the first column of a Riordan array satisfies a palindromic or near-palindromic functional equation. For those types of equations, we find, for very…

Combinatorics · Mathematics 2022-03-29 Alexander Burstein , Louis W. Shapiro