Generalized Jacobsthal numbers and restricted k-ary words

2019 ◽  
Vol 28 (1) ◽  
pp. 91-108
Author(s):  
José L. Ramirez ◽  
Mark Shattuck
Keyword(s):  
Complete Graph ◽  
Generating Functions ◽  
Finite Automata ◽  
General Setting ◽  
Polynomial Extension ◽  
Combinatorial Argument ◽  
Domino Tilings ◽  
Basic Properties ◽  
Binomial Type

Abstract We consider a generalization of the problem of counting ternary words of a given length which was recently investigated by Koshy and Grimaldi [10]. In particular, we use finite automata and ordinary generating functions in deriving a k-ary generalization. This approach allows us to obtain a general setting in which to study this problem over a k-ary language. The corresponding class of n-letter k-ary words is seen to be equinumerous with the closed walks of length n − 1 on the complete graph for k vertices as well as a restricted subset of colored square-and-domino tilings of the same length. A further polynomial extension of the k-ary case is introduced and its basic properties deduced. As a consequence, one obtains some apparently new binomial-type identities via a combinatorial argument.

New family of Whitney numbers

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 309-320 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad Cakic ◽  
F.A. Shiha
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Stirling Numbers ◽  
Explicit Formulas ◽  
Basic Properties ◽  
New Family ◽  
Whitney Numbers ◽  
Special Cases

In this paper we give a new family of numbers, called ??-Whitney numbers, which gives generalization of many types of Whitney numbers and Stirling numbers. Some basic properties of these numbers such as recurrence relations, explicit formulas and generating functions are given. Finally many interesting special cases are derived.

scholarly journals Basic Properties of the Polygonal Sequence

2021 ◽  
Author(s):  
Kunle Adegoke
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Partial Sums ◽  
Basic Properties ◽  
Polygonal Numbers

We study various properties of the polygonal numbers; such as their recurrence relations, fundamental identities, weighted binomial and ordinary sums and the partial sums and generating functions of their powers. A feature of our results is that they are presented naturally in terms of the polygonal numbers themselves and not in terms of arbitrary integers as is the case in most literature.

scholarly journals Basic Properties of the Polygonal Sequence

2021 ◽  
Author(s):  
Kunle Adegoke
Keyword(s):  
Generating Functions ◽  
Continued Fraction ◽  
Recurrence Relations ◽  
Partial Sums ◽  
Basic Properties ◽  
Polygonal Numbers

We study various properties of the polygonal numbers; such as their recurrence relations; fundamental identities; weighted binomial and ordinary sums; partial sums and generating functions of their powers; and a continued fraction representation for them. A feature of our results is that they are presented naturally in terms of the polygonal numbers themselves and not in terms of arbitrary integers; unlike what obtains in most literature.

Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP

1996 ◽  
Vol 5 (3) ◽  
pp. 297-306 ◽  
Author(s):  
Rachid Saad
Keyword(s):  
Complete Graph ◽  
Strong Evidence ◽  
General Setting ◽  
Maximum Length ◽  
Sufficient Condition ◽  
Complete Graphs ◽  
Random Polynomial ◽  
Exact Matching ◽  
Matching Problem ◽  
Bipartite Tournament

Jackson [10] gave a polynomial sufficient condition for a bipartite tournament to contain a cycle of a given length. The question arises as to whether deciding on the maximum length of a cycle in a bipartite tournament is polynomial. The problem was considered by Manoussakis [12] in the slightly more general setting of 2-edge coloured complete graphs: is it polynomial to find a longest alternating cycle in such coloured graphs? In this paper, strong evidence is given that such an algorithm exists. In fact, using a reduction to the well known exact matching problem, we prove that the problem is random polynomial.

scholarly journals The Properties of Generalized Collision Branching Processes

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Juan Wang ◽  
Chunhao Cai
Keyword(s):  
Explicit Expression ◽  
Generating Functions ◽  
Branching Processes ◽  
Hitting Times ◽  
Conditional Mean ◽  
Basic Properties ◽  
Extinction Probabilities ◽  
The Mean

We consider basic properties regarding uniqueness, extinction, and explosivity for the Generalized Collision Branching Processes (GCBP). Firstly, we investigate some important properties of the generating functions for GCB q-matrix in detail. Then for any given GCB q-matrix, we prove that there always exists exactly one GCBP. Next, we devote to the study of extinction behavior and hitting times. Some elegant and important results regarding extinction probabilities, the mean extinction times, and the conditional mean extinction times are presented. Moreover, the explosivity is also investigated and an explicit expression for mean explosion time is established.

scholarly journals Some partition and analytical identities arising from the Alladi, Andrews, Gordon bijection

2020 ◽  
Author(s):  
S. Capparelli ◽  
A. Del Fra ◽  
P. Mercuri ◽  
A. Vietri
Keyword(s):  
Generating Functions ◽  
General Setting ◽  
Integer Partitions ◽  
Partition Identities ◽  
General Kind ◽  
One To One ◽  
Jagged Partitions

Abstract In the work of Alladi et al. (J Algebra 174:636–658, 1995) the authors provided a generalization of the two Capparelli identities involving certain classes of integer partitions. Inspired by that contribution, in particular as regards the general setting and the tools the authors employed, we obtain new partition identities by identifying further sets of partitions that can be explicitly put into a one-to-one correspondence by the method described in the 1995 paper. As a further result, although of a different nature, we obtain an analytical identity of Rogers–Ramanujan type, involving generating functions, for a class of partition identities already found in that paper and that generalize the first Capparelli identity and include it as a particular case. To achieve this, we apply the same strategy as Kanade and Russell did in a recent paper. This method relies on the use of jagged partitions that can be seen as a more general kind of integer partitions.

Classes of Transfinite Sequences Accepted by Nondeterministic Finite Automata

1984 ◽  
Vol 7 (2) ◽  
pp. 191-223
Author(s):  
Jerzy Wojciechowski
Keyword(s):  
Finite Automaton ◽  
Finite Automata ◽  
Basic Properties ◽  
Nondeterministic Finite Automata ◽  
The Family ◽  
Finite Sequences ◽  
Emptiness Problem ◽  
Nondeterministic Finite Automaton ◽  
Defining Sets

In this paper the notion of a nondeterministic finite automaton acting on arbitrary transfinite sequences is introduced. It is a generalization of the finite automaton on finite sequences and the finite automaton on ω-sequences. The basic properties of the behaviour of such automata are proved. The methods are shown how to construct automata accepting classes A ⋃ B, A ⋂ B, A ∘ B, A*, Aω, A# if we have automata accepting classes A and B. We prove that if a TF-automaton having k states accepts anything then it accepts an α-sequence for a certain, α ∈ { ∑ i = 0 m ω i · a i : ∑ i = 1 m i · a i + a 0 ⩽ k }. Using the foregoing fact, we show that the family of classes definable by TF-automata is not closed with respect to the complement operation, that nondeterministic automata are not equivalent to the deterministic ones and that the emptiness problem for TP-automata is decidable. In the last section we show the construction of TP-automata defining sets {∗α} for α < ω ω and having as few states as possible.

scholarly journals The Translated Dowling Polynomials and Numbers

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mahid M. Mangontarum ◽  
Amila P. Macodi-Ringia ◽  
Normalah S. Abdulcarim
Keyword(s):  
Integral Representation ◽  
Explicit Formula ◽  
Generating Function ◽  
Generating Functions ◽  
Hankel Transform ◽  
Bell Polynomials ◽  
Basic Properties ◽  
Whitney Numbers ◽  
Exponential Generating Function

More properties for the translated Whitney numbers of the second kind such as horizontal generating function, explicit formula, and exponential generating function are proposed. Using the translated Whitney numbers of the second kind, we will define the translated Dowling polynomials and numbers. Basic properties such as exponential generating functions and explicit formula for the translated Dowling polynomials and numbers are obtained. Convexity, integral representation, and other interesting identities are also investigated and presented. We show that the properties obtained are generalizations of some of the known results involving the classical Bell polynomials and numbers. Lastly, we established the Hankel transform of the translated Dowling numbers.

scholarly journals Excedances in classical and affine Weyl groups

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Pietro Mongelli
Keyword(s):  
Generating Functions ◽  
Weyl Groups ◽  
Nous Obtenons ◽  
Affine Weyl Groups ◽  
Basic Properties ◽  
Affine Groups ◽  
International Audience ◽  
Affine Permutations

International audience Based on the notion of colored and absolute excedances introduced by Bagno and Garber we give an analogue of the derangement polynomials. We obtain some basic properties of these polynomials. Moreover, we define an excedance statistic for the affine Weyl groups of type $\widetilde{B}_n, \widetilde {C}_n$ and $\widetilde {D}_n$ and determine the generating functions of their distributions. This paper is inspired by one of Clark and Ehrenborg (2011) in which the authors introduce the excedance statistic for the group of affine permutations and ask if this statistic can be defined for other affine groups. Basée sur la notion des excédances colorés et absolu introduits par Bagno and Garber, nous donnons un analogue des polynômes des dérangements. Nous obtenons quelques propriétés de base de ces polynômes. En outre, nous définissons une excédance statistique pour le groupes de Weyl affines de type $\widetilde{B}_n, \widetilde {C}_n$ et $\widetilde {D}_n$ et nous déterminons les fonctions génératrices de leurs distributions. Cet article est inspirè d'un article de Clark et Ehrenborg (2011) dans lequel les auteurs introduisent les excedances pour le groupe des permutations affine et demander si cette statistique peut être éèfinie pour les autres groupes affines.

Sign in / Sign up

Export Citation Format

Share Document