Hankel determinants of sums of consecutive weighted Schröder numbers (Q448379): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
Let \(\{a_l\}_{l\in \mathbb{Z}_+}\) be a sequence of numbers and let \[ A_n^{(k)}=(a_{k+i+j-2})_{i,j=1}^n \] be the corresponding Hankel matrix. The determinants of such matrices were explicitly found in the case when \(a_l\) are Catalan numbers \(c_l\), Motzkin numbers \(m_l\), large and small Schöder numbers \(r_l\) and \(c_l\). These numbers count the number of lattice paths with fixed ends and some restrictions on these paths. In particular, the large Schöder numbers \(r_l\) count the number of lattice paths from \((0,0)\) to \((2l,0)\) using up steps \(U\), down steps \(D\) and level steps \(L=(2,0)\) that never pass below the \(x\)-axis. The small Schöder numbers \(s_l\) count large Schöder paths of length \(l\) without level steps on the \(x\)-axis. There exist generalizations of these numbers called weight versions of Catalan, Motzkin and Schöder numbers. In particular, the large Schöder numbers \(r^t_l\) and \(c^t_l\) are defined as follows. These steps \(U\), \(D\), \(L\) have weights 1, 1, t. Let \(r_l^t\) (and \(s_l^t\)) denote the total weight of all weighted large (small) Schöder paths of length \(l\). The main result of the paper is the following. The authors consider the determinants \[ \Theta_n=(1+t)^{-\binom{n}{2}}\det_{1\leq i,j\leq n}(\alpha r^t_{i+j-2}+\beta r^t_{i+j-1}), \] \[ \Phi_n=(1+t)^{-\binom{n+1}{2}}\det_{1\leq i,j\leq n}(\alpha r^t_{i+j-1}+\beta r^t_{i+j}), \] \[ \Psi_n=(1+t)^{-\binom{n}{2}}\det_{1\leq i,j\leq n}(\alpha s^t_{i+j-2}+\beta s^t_{i+j-1}), \] \[ \Gamma_n= (1+t)^{-\binom{n+1}{2}}\det_{1\leq i,j\leq n}(\alpha s^t_{i+j-1}+\beta s^t_{i+j}). \] Here \(\alpha\), \(\beta\) are some parameters. The authors find generating functions of \(\Theta_n,\Phi_n,\Psi_n,\Gamma_n\) and explicit formulas for these quantities.
Property / review text: Let \(\{a_l\}_{l\in \mathbb{Z}_+}\) be a sequence of numbers and let \[ A_n^{(k)}=(a_{k+i+j-2})_{i,j=1}^n \] be the corresponding Hankel matrix. The determinants of such matrices were explicitly found in the case when \(a_l\) are Catalan numbers \(c_l\), Motzkin numbers \(m_l\), large and small Schöder numbers \(r_l\) and \(c_l\). These numbers count the number of lattice paths with fixed ends and some restrictions on these paths. In particular, the large Schöder numbers \(r_l\) count the number of lattice paths from \((0,0)\) to \((2l,0)\) using up steps \(U\), down steps \(D\) and level steps \(L=(2,0)\) that never pass below the \(x\)-axis. The small Schöder numbers \(s_l\) count large Schöder paths of length \(l\) without level steps on the \(x\)-axis. There exist generalizations of these numbers called weight versions of Catalan, Motzkin and Schöder numbers. In particular, the large Schöder numbers \(r^t_l\) and \(c^t_l\) are defined as follows. These steps \(U\), \(D\), \(L\) have weights 1, 1, t. Let \(r_l^t\) (and \(s_l^t\)) denote the total weight of all weighted large (small) Schöder paths of length \(l\). The main result of the paper is the following. The authors consider the determinants \[ \Theta_n=(1+t)^{-\binom{n}{2}}\det_{1\leq i,j\leq n}(\alpha r^t_{i+j-2}+\beta r^t_{i+j-1}), \] \[ \Phi_n=(1+t)^{-\binom{n+1}{2}}\det_{1\leq i,j\leq n}(\alpha r^t_{i+j-1}+\beta r^t_{i+j}), \] \[ \Psi_n=(1+t)^{-\binom{n}{2}}\det_{1\leq i,j\leq n}(\alpha s^t_{i+j-2}+\beta s^t_{i+j-1}), \] \[ \Gamma_n= (1+t)^{-\binom{n+1}{2}}\det_{1\leq i,j\leq n}(\alpha s^t_{i+j-1}+\beta s^t_{i+j}). \] Here \(\alpha\), \(\beta\) are some parameters. The authors find generating functions of \(\Theta_n,\Phi_n,\Psi_n,\Gamma_n\) and explicit formulas for these quantities. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Dmitry V. Artamonov / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05A15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15B05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6078349 / rank
 
Normal rank
Property / zbMATH Keywords
 
Hankel determinants
Property / zbMATH Keywords: Hankel determinants / rank
 
Normal rank
Property / zbMATH Keywords
 
Schröder numbers
Property / zbMATH Keywords: Schröder numbers / rank
 
Normal rank
Property / zbMATH Keywords
 
non-intersecting lattice paths
Property / zbMATH Keywords: non-intersecting lattice paths / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial methods
Property / zbMATH Keywords: combinatorial methods / rank
 
Normal rank
Property / zbMATH Keywords
 
Hankel matrix
Property / zbMATH Keywords: Hankel matrix / rank
 
Normal rank
Property / zbMATH Keywords
 
Catalan numbers
Property / zbMATH Keywords: Catalan numbers / rank
 
Normal rank
Property / zbMATH Keywords
 
Motzkin numbers
Property / zbMATH Keywords: Motzkin numbers / rank
 
Normal rank
Property / zbMATH Keywords
 
generating functions
Property / zbMATH Keywords: generating functions / rank
 
Normal rank

Revision as of 09:39, 30 June 2023

scientific article
Language Label Description Also known as
English
Hankel determinants of sums of consecutive weighted Schröder numbers
scientific article

    Statements

    Hankel determinants of sums of consecutive weighted Schröder numbers (English)
    0 references
    0 references
    0 references
    0 references
    6 September 2012
    0 references
    Let \(\{a_l\}_{l\in \mathbb{Z}_+}\) be a sequence of numbers and let \[ A_n^{(k)}=(a_{k+i+j-2})_{i,j=1}^n \] be the corresponding Hankel matrix. The determinants of such matrices were explicitly found in the case when \(a_l\) are Catalan numbers \(c_l\), Motzkin numbers \(m_l\), large and small Schöder numbers \(r_l\) and \(c_l\). These numbers count the number of lattice paths with fixed ends and some restrictions on these paths. In particular, the large Schöder numbers \(r_l\) count the number of lattice paths from \((0,0)\) to \((2l,0)\) using up steps \(U\), down steps \(D\) and level steps \(L=(2,0)\) that never pass below the \(x\)-axis. The small Schöder numbers \(s_l\) count large Schöder paths of length \(l\) without level steps on the \(x\)-axis. There exist generalizations of these numbers called weight versions of Catalan, Motzkin and Schöder numbers. In particular, the large Schöder numbers \(r^t_l\) and \(c^t_l\) are defined as follows. These steps \(U\), \(D\), \(L\) have weights 1, 1, t. Let \(r_l^t\) (and \(s_l^t\)) denote the total weight of all weighted large (small) Schöder paths of length \(l\). The main result of the paper is the following. The authors consider the determinants \[ \Theta_n=(1+t)^{-\binom{n}{2}}\det_{1\leq i,j\leq n}(\alpha r^t_{i+j-2}+\beta r^t_{i+j-1}), \] \[ \Phi_n=(1+t)^{-\binom{n+1}{2}}\det_{1\leq i,j\leq n}(\alpha r^t_{i+j-1}+\beta r^t_{i+j}), \] \[ \Psi_n=(1+t)^{-\binom{n}{2}}\det_{1\leq i,j\leq n}(\alpha s^t_{i+j-2}+\beta s^t_{i+j-1}), \] \[ \Gamma_n= (1+t)^{-\binom{n+1}{2}}\det_{1\leq i,j\leq n}(\alpha s^t_{i+j-1}+\beta s^t_{i+j}). \] Here \(\alpha\), \(\beta\) are some parameters. The authors find generating functions of \(\Theta_n,\Phi_n,\Psi_n,\Gamma_n\) and explicit formulas for these quantities.
    0 references
    Hankel determinants
    0 references
    Schröder numbers
    0 references
    non-intersecting lattice paths
    0 references
    combinatorial methods
    0 references
    Hankel matrix
    0 references
    Catalan numbers
    0 references
    Motzkin numbers
    0 references
    generating functions
    0 references

    Identifiers