scholarly journals The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order

2019 ◽  
Vol 13 (2) ◽  
pp. 361-377
Author(s):  
Rade Doroslovacki ◽  
Jelena Djokic ◽  
Bojana Pantic ◽  
Olga Bodroza-Pantic
Keyword(s):  
Recurrence Relation ◽  
Generating Function ◽  
Perfect Matchings ◽  
Odd Order

For all odd values of m, we prove that the sequence of the numbers of near-perfect matchings on Cm x P2n+1 cylinder with a vacancy on the boundary obeys the same recurrence relation as the sequence of the numbers of perfect matchings on Cm x P2n. Further more, we prove that for all odd values of m denominator of the generating function for the total number of the near-perfect matchings on Cm x P2n+1 graph is always the square of denominator of generating function for the sequence of the numbers of perfect matchings on Cm x P2n graph, as recently conjectured by Perepechko.

scholarly journals The Cube Recurrence

10.37236/1826 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Gabriel D. Carroll ◽  
David Speyer
Keyword(s):  
Recurrence Relation ◽  
Planar Graphs ◽  
Perfect Matchings ◽  
Laurent Polynomials ◽  
Combinatorial Interpretation ◽  
Combinatorial Model

We construct a combinatorial model that is described by the cube recurrence, a quadratic recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in ${\Bbb Z}^3$. In the process, we prove several conjectures of Propp and of Fomin and Zelevinsky about the structure of these polynomials, and we obtain a combinatorial interpretation for the terms of Gale-Robinson sequences, including the Somos-6 and Somos-7 sequences. We also indicate how the model might be used to obtain some interesting results about perfect matchings of certain bipartite planar graphs.

scholarly journals New Eulerian Numbers of Type $D$

10.37236/5514 ◽  
2016 ◽  
Vol 23 (1) ◽  
Author(s):  
Anna Borowiec ◽  
Wojciech Młotkowski
Keyword(s):  
Recurrence Relation ◽  
Generating Function ◽  
Probability Distributions ◽  
Type A ◽  
Eulerian Numbers ◽  
Eulerian Polynomials ◽  
Type D

We introduce a new array of type $D$ Eulerian numbers, different from that studied by Brenti, Chow and Hyatt. We find in particular the recurrence relation, Worpitzky formula and the generating function. We also find the probability distributions whose moments are Eulerian polynomials of type $A$, $B$ and $D$.

scholarly journals A Newton Interpolation Approach to Generalized Stirling Numbers

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Aimin Xu
Keyword(s):  
Explicit Expression ◽  
Recurrence Relation ◽  
Generating Function ◽  
Stirling Numbers ◽  
Divided Differences ◽  
Newton Interpolation ◽  
Basic Properties ◽  
Generalized Stirling Numbers

We employ the generalized factorials to define a Stirling-type pair{s(n,k;α,β,r),S(n,k;α,β,r)}which unifies various Stirling-type numbers investigated by previous authors. We make use of the Newton interpolation and divided differences to obtain some basic properties of the generalized Stirling numbers including the recurrence relation, explicit expression, and generating function. The generalizations of the well-known Dobinski's formula are further investigated.

scholarly journals Some Basic 𝑑-Orthogonal Polynomial Sets

2005 ◽  
Vol 12 (4) ◽  
pp. 583-593
Author(s):  
Ali Zaghouani
Keyword(s):  
Orthogonal Polynomial ◽  
Recurrence Relation ◽  
Generating Function ◽  
Linear Change ◽  
Change Of Variable

Abstract The purpose of this paper is to study the class of polynomial sets which are at the same time 𝑑-orthogonal and 𝑞-Appell. By a linear change of variable, the resulting set reduces to 𝑞-Al-Salam–Carlitz polynomials, for 𝑑 = 1. Various properties of the obtained polynomials are singled out: a generating function, a recurrence relation of order 𝑑 + 1. We also explicitly express a 𝑑-dimensional functional for which the d-orthogonality holds.

scholarly journals The Maximum Independent Sets of de Bruijn Graphs of Diameter 3

10.37236/681 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Dustin A. Cartwright ◽  
María Angélica Cueto ◽  
Enrique A. Tobis
Keyword(s):  
Recurrence Relation ◽  
Generating Function ◽  
Independent Sets ◽  
De Bruijn Graph ◽  
Alphabet Size ◽  
De Bruijn Graphs ◽  
Exponential Generating Function ◽  
De Bruijn

The nodes of the de Bruijn graph $B(d,3)$ consist of all strings of length $3$, taken from an alphabet of size $d$, with edges between words which are distinct substrings of a word of length $4$. We give an inductive characterization of the maximum independent sets of the de Bruijn graphs $B(d,3)$ and for the de Bruijn graph of diameter three with loops removed, for arbitrary alphabet size. We derive a recurrence relation and an exponential generating function for their number. This recurrence allows us to construct exponentially many comma-free codes of length 3 with maximal cardinality.

scholarly journals Closed Forms for Derangement Numbers in Terms of the Hessenberg Determinants

2016 ◽  
Author(s):  
Feng Qi ◽  
Jiao-Lian Zhao ◽  
Bai-Ni Guo
Keyword(s):  
Recurrence Relation ◽  
Generating Function ◽  
Higher Order ◽  
Order Derivative ◽  
Exponential Generating Function ◽  
Higher Order Derivative

In the paper, the authors find closed forms for derangement numbers in terms of the Hessenberg determinants, discover a recurrence relation of derangement numbers, present a formula for any higher order derivative of the exponential generating function of derangement numbers, and compute some related Hessenberg and tridiagonal determinants.

scholarly journals Solutions to the T-Systems with Principal Coefficients

10.37236/5698 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
Panupong Vichitkunakorn
Keyword(s):  
Recurrence Relation ◽  
Cluster Algebra ◽  
Perfect Matchings ◽  
Partition Functions ◽  
Initial Condition ◽  
Free Cluster ◽  
Octahedron Recurrence ◽  
T System

The $A_\infty$ T-system, also called the octahedron recurrence, is a dynamical recurrence relation. It can be realized as mutation in a coefficient-free cluster algebra (Kedem 2008, Di Francesco and Kedem 2009). We define T-systems with principal coefficients from cluster algebra aspect, and give combinatorial solutions with respect to any valid initial condition in terms of partition functions of perfect matchings, non-intersecting paths and networks. This also provides a solution to other systems with various choices of coefficients on T-systems including Speyer's octahedron recurrence (Speyer 2007), generalized lambda-determinants (Di Francesco 2013) and (higher) pentagram maps (Schwartz 1992, Ovsienko et al. 2010, Glick 2011, Gekhtman et al. 2016).

scholarly journals On a quaternionic sequence with Vietoris’ numbers

Filomat ◽  
2021 ◽  
Vol 35 (4) ◽  
pp. 1065-1086
Author(s):  
P. Catarino ◽  
Almeida de
Keyword(s):  
Recurrence Relation ◽  
Generating Function ◽  
Type Formula ◽  
Tridiagonal Matrices ◽  
Three Term Recurrence Relation ◽  
Rational Sequence

Special integers sequences have been the center of attention for many researchers, as well as the sequences of quaternions where its components are the elements of these sequences. Motivated by a rational sequence, we consider the quaternions with components Vietoris? numbers and investigate some of its properties. For this sequence a two and three term recurrence relation is established, as well as a Binet?s type formula. Moreover the generating function for this sequence is introduced and also the determinant of some tridiagonal matrices are used in order to find elements of this sequence.

scholarly journals SIF Permutations and Chord-Connected Permutations

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Natasha Blitvić
Keyword(s):  
Probability Theory ◽  
Generating Function ◽  
Probability Distributions ◽  
Free Probability ◽  
Perfect Matchings ◽  
Free Probability Theory ◽  
Diagrammatic Representation ◽  
International Audience ◽  
Binary Strings

International audience A <i>stabilized-interval-free </i> (SIF) permutation on [n], introduced by Callan, is a permutation that does not stabilize any proper interval of [n]. Such permutations are known to be the irreducibles in the decomposition of permutations along non-crossing partitions. That is, if $s_n$ denotes the number of SIF permutations on [n], $S(z)=1+\sum_{n\geq1} s_n z^n$, and $F(z)=1+\sum_{n\geq1} n! z^n$, then $F(z)= S(zF(z))$. This article presents, in turn, a decomposition of SIF permutations along non-crossing partitions. Specifically, by working with a convenient diagrammatic representation, given in terms of perfect matchings on alternating binary strings, we arrive at the \emphchord-connected permutations on [n], counted by $\{c_n\}_{n\geq1}$, whose generating function satisfies $S(z)= C(zS(z))$. The expressions at hand have immediate probabilistic interpretations, via the celebrated <i>moment-cumulant formula </i>of Speicher, in the context of the <i>free probability theory </i>of Voiculescu. The probability distributions that appear are the exponential and the complex Gaussian.

scholarly journals ON THE BINOMIAL TRANSFORMS OF THE HORADAM QUATERNION SEQUENCES

2020 ◽  
Author(s):  
Faruk Kaplan ◽  
Arzu Özkoç Öztürk
Keyword(s):  
Recurrence Relation ◽  
General Formula ◽  
Generating Function ◽  
Second Order ◽  
Binet Formula ◽  
New Type ◽  
Binomial Transform

The main object of the present paper is to consider the binomial transforms for Horadam quaternion sequences. We gave new formulas for recurrence relation, generating function, Binet formula and some basic identities for the binomial sequence of Horadam quaternions. Working with Horadam quaternions, we have found the most general formula that includes all binomial transforms with recurrence relation from the second order. In the last part, we determined the recurrence relation for this new type of quaternion by working with the iterated binomial transform, which is a dierent type of binomial transform.

Sign in / Sign up

Export Citation Format

Share Document