Related papers: Some determinants of path generating functions
We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…
The generating function and an explicit expression is derived for the (colored) Motzkin numbers of higher rank introduced recently. Considering the special case of rank one yields the corresponding results for the conventional colored…
Ilse Fischer and the second author introduced in [Algebr. Comb. 7 (2024), no. 5, 1319-1345] a two parameter family of polynomials defined as sums over totally symmetric plane partitions and connected to alternating sign matrices and…
We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…
In this paper, we enumerate lattice paths with certain constraints and apply the corresponding results to develop formulas for calculating the dimensions of submodules of a class of modules for planar upper triangular rook monoids. In…
We consider a wide class of determinants whose entries are moments of the so-called semiclassical functionals and we show that they are tau functions for an appropriate isomonodromic family which depends on the parameters of the symbols for…
Generative models have fundamentally reshaped the landscape of decision-making, reframing the problem from pure scalar reward maximization to high-fidelity trajectory generation and distribution matching. This paradigm shift addresses…
We consider weighted small step walks in the positive quadrant, and provide algebraicity and differential transcendence results for the underlying generating functions: we prove that depending on the probabilities of allowed steps, certain…
In this paper we consider pentadiagonal $(n+1)\times(n+1)$ matrices with two subdiagonals and two superdiagonals at distances $k$ and $2k$ from the main diagonal where $1\le k<2k\le n$. We give an explicit formula for their determinants and…
We present the new combinatorial class of product-coproduct prographs which are planar assemblies of two types of operators: products having two inputs and a single output and coproducts having a single input and two outputs. We show that…
We relate the combinatorics of periodic generalized Dyck and Motzkin paths to the cluster coefficients of particles obeying generalized exclusion statistics, and obtain explicit expressions for the counting of paths with a fixed number of…
We continue to investigate the properties of the earlier defined functions fm and gm, which depend on an initial arithmetic function f0. In this papers values of f0 are the Fine numbers. We investigate functions fi; gi; (i = 1; 2; 3; 4).…
This note collects some facts and conjectures about the Hankel determinants and their generating functions of the columns of Hoggatt triangles which apparently are related to combinatorial objects such as Young tableaux and Narayana…
In this note we prove an assertion made by M. Levin in 1999: the Pascal matrix modulo 2 has the property that each of the square sub-matrices laying on the upper border or on the left border has determinants, computed in $\mathbb{Z}$, equal…
Based on geometric intuition, in this paper we are trying to give an idea and visualize the meaning of the determinants for the cubic-matrix. In this paper we have analyzed the possibilities of developing the concept of determinant of…
With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…
We introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of those equivalence classes and use this information to obtain a combinatorial formula for the number of…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…
We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…
Given two relatively prime positive integers $\alpha$ and $\beta$, we consider simple lattice paths (with unit East and unit North steps) from $(0,0)$ to $(\alpha k,\beta k)$, and enumerate them by their left and right bounces with respect…