Related papers: The enumeration of generalized Tamari intervals
The great enumerator Germain Kreweras empirically discovered this intriguing fact, and then needed lots of pages[K], and lots of human ingenuity, to prove it. Other great enumerators, for example, Heinrich Niederhausen[N], Ira Gessel[G1],…
The Young--Fibonacci graph is the Hasse diagram of one of the two (along with the Young lattice) 1-differential graded modular lattices. This explains the interest to path enumeration problems in this graph. We obtain a formula for the…
Let $G$ be a simple graph on $n$ vertices and $I(G)\subseteq R$ be its edge ideal. In this paper, we initiate the study of determining lattice points in $\mathbb{N}^2$ that appear as a pair $(\mathrm{reg}(R/I(G)), \mathrm{v}(I(G)))$, where…
We propose a multiscale approach to time series autoregression, in which linear regressors for the process in question include features of its own path that live on multiple timescales. We take these multiscale features to be the recent…
Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…
We consider the NP-complete problem of tracking paths in a graph, first introduced by Banik et. al. [3]. Given an undirected graph with a source $s$ and a destination $t$, find the smallest subset of vertices whose intersection with any…
Given integers $t$, $k$, and $v$ such that $0\leq t\leq k\leq v$, let $W_{tk}(v)$ be the inclusion matrix of $t$-subsets vs. $k$-subsets of a $v$-set. We modify slightly the concept of standard tableau to study the notion of rank of a…
By exhibiting the corresponding Lax pair representations we propose a wide class of integrable two-dimensional (2D) fermionic Toda lattice (TL) hierarchies which includes the 2D N=(2|2) and N=(0|2) supersymmetric TL hierarchies as…
There is a well-known asymptotic formula, due to W. M. Schmidt (1968) for the number of full-rank integer lattices of index at most $V$ in $\mathbb{Z}^n$. This set of lattices $L$ can naturally be partitioned with respect to the factor…
The recently introduced GALI method is used for rapidly detecting chaos, determining the dimensionality of regular motion and predicting slow diffusion in multi--dimensional Hamiltonian systems. We propose an efficient computation of the…
A generalised Struve function has recently been introduced by Ali, Mondal and Nisar [J. Korean Math. Soc. {\bf 54} (2017) 575--598] as \[(\frac{1}{2} z)^{\nu+1}\sum_{n=0}^\infty\frac{(\frac{1}{2} z)^{2n}}{\Gamma(n+\frac{3}{2})…
Transmission of a vertex v of a connected graph G is the sum of distances from v to all other vertices in G. Graph G is transmission irregular (TI) if no two of its vertices have the same transmission, and G is interval transmission…
In this paper we construct inverse bijections between two sequences of finite sets. One sequence is defined by planar diagrams and the other by lattice walks. G. Kuperberg has shown that the number of elements in these two sets are equal.…
In this paper we obtain bounds on a very general class of distance-based topological indices of graphs, which includes the Wiener index, defined as the sum of the distances between all pairs of vertices of the graph, and most…
We consider the model of random trees introduced by Devroye [SIAM J. Comput. 28 (1999) 409-432]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion…
In the 1970s, William Tutte developed a clever algebraic approach, based on certain "invariants", to solve a functional equation that arises in the enumeration of properly colored triangulations. The enumeration of plane lattice walks…
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing rigorously the virial expansion for imperfect gases. We…
We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval…
This paper is devoted to a new approach of the arithmetic of intervals. We present the set of intervals as a normed vector space. We define also a four-dimensional associative algebra whose product gives the product of intervals in any…
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…