Related papers: Lattice path enumeration for semi-magic squares by…

We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…

In a Latin square, every row can be interpreted as a permutation, and therefore has a parity (even or odd). We prove that in a uniformly random $n\times n$ Latin square, the $n$ row parities are very well approximated by a sequence of $n$…

We generalize the notion of orthogonal latin squares to colorings of simple graphs. Two $n$-colorings of a graph are said to be \emph{orthogonal} if whenever two vertices share a color in one coloring they have distinct colors in the other…

We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…

We solve two problems regarding the enumeration of lattice paths in $\mathbb{Z}^2$ with steps $(1,1)$ and $(1,-1)$ with respect to the major index, defined as the sum of the positions of the valleys, and to the number of certain crossings.…

Magic squares are well-known arrangements of integers with common row, column, and diagonal sums. Various other magic shapes have been proposed, but triangles have been somewhat overlooked. We introduce certain triangular arrangements of…

The set of Dyck paths of length $2n$ inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths:…

Writing the values of Krawtchouk polynomials as matrices, we consider weighted partial sums along columns. For the general case, we find an identity that, in the symmetric case yields a formula for such partial sums. Complete sums of…

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

Consider an $m\times n$ table $T$ and latices paths $\nu_1,\ldots,\nu_k$ in $T$ such that each step $\nu_{i+1}-\nu_i=(1,1)$, $(1,0)$ or $(1,-1)$. The number of paths from the $(1,i)$-blank (resp. first column) to the $(s,t)$-blank is…

In the first part of this paper I give an elementary overview about some number sequences which count various sorts of lattice paths in strips along the x-axis and compute their generating functions in terms of Fibonacci and Lucas…

Let \mathbb{F}_q^{n+l} denote the (n+l)-dimensional singular linear space over a finite field \mathbb{F}_q. For a fixed integer m\leq\min\{n,l\}, denote by \mathcal{L}^m_o(\mathbb{F}_q^{n+l}) the set of all subspaces of type (t,t_1), where…

Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…

Two Latin squares of order $n$ are $r$-orthogonal if, when superimposed, there are exactly $r$ distinct ordered pairs. The spectrum of all values of $r$ for Latin squares of order $n$ is known. A Latin square $A$ of order $n$ is…

A Latin tableau of shape $\lambda$ and type $\mu$ is a Young diagram of shape $\lambda$ in which each box contains a single positive integer, with no repeated integers in any row or column, and the $i$th most common integer appearing…

In 2008, Cavenagh and Dr\'{a}pal, et al, described a method of constructing Latin trades using groups. The Latin trades that arise from this construction are entry-transitive (that is, there always exists an autoparatopism of the Latin…

For a given form $F\in \mathbb Z[x_1,\dots,x_s]$ we apply the circle method in order to give an asymptotic estimate of the number of $m$-tuples $\mathbf x_1, \dots, \mathbf x_m$ spanning a linear space on the hypersurface $F(\mathbf x) = 0$…

The Tamari lattice, defined on Catalan objects such as binary trees and Dyck paths, is a well-studied poset in combinatorics. It is thus natural to try to extend it to other families of lattice paths. In this article, we fathom such a…

This paper treats certain integral lattices with respect to ternary quadratic forms, which are obtained from the data of a non-zero element and a maximal lattice in a quaternary quadratic space. Such a lattice can be described by means of…