相关论文: Jagged partitions and lattice paths

In this paper, we consider the asymptotic properties of hook numbers of partitions in restricted classes. More specifically, we compare the frequency with which partitions into odd parts and partitions into distinct parts have hook numbers…

Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…

A \emph{Dyck path} is a lattice path in the first quadrant of the $xy$-plane that starts at the origin, ends on the $x$-axis, and consists of the same number of North-East steps $U$ and South-East steps $D$. A \emph{valley} is a subpath of…

We compute the limit shape for several classes of restricted integer partitions, where the restrictions are placed on the part sizes rather than the multiplicities. Our approach utilizes certain classes of bijections which map limit shapes…

We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…

A "tree-partition" of a graph $G$ is a partition of $V(G)$ such that identifying the vertices in each part gives a tree. It is known that every graph with treewidth $k$ and maximum degree $\Delta$ has a tree-partition with parts of size…

In this paper we study a subfamily of a classic lattice path, the \emph{Dyck paths}, called \emph{restricted $d$-Dyck} paths, in short $d$-Dyck. A valley of a Dyck path $P$ is a local minimum of $P$; if the difference between the heights of…

Recent work of the author connected several parking function enumeration problems to enumerations of Catalan paths with respect to certain weight functions that are expressed in terms of the ascent lengths. Motivated by this, we generalise…

The lowest zeros of the lattice partition function for non-compact QED are found in the complex fermion mass plane on $6^4$, $8^4$ and $10^4$ lattices at intermediate values of the coupling. The scaling of the low lying zeros with lattice…

Assume that we embed the path $P_n$ as a subgraph of a $2$-dimensional grid, namely, $P_k \times P_l$. Given such an embedding, we consider the ordered set of subpaths $L_1, L_2, \ldots , L_m$ which are maximal straight segments in the…

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…

Level-restricted paths play an important role in crystal theory. They correspond to certain highest weight vectors of modules of quantum affine algebras. We show that the recently established bijection between Littlewood--Richardson…

It has recently been observed empirically that the number of FPL configurations with 3 sets of a, b and c nested arches equals the number of plane partitions in a box of size a x b x c. In this note, this result is proved by constructing…

In this paper we define and study self-similar ranked fragmentations. We first show that any ranked fragmentation is the image of some partition-valued fragmentation, and that there is in fact a one-to-one correspondence between the laws of…

Inspired by a new mathematical model for bobbin lace, this paper considers finite lattice paths formed from the set of step vectors $\mathfrak{A}=$$\{\rightarrow,$ $\nearrow,$ $\searrow,$ $\uparrow,$ $\downarrow\}$ with the restriction that…

We study right tail large deviations of the logarithm of the partition function for directed lattice paths in i.i.d. random potentials. The main purpose is the derivation of explicit formulas for the $1+1$-dimensional exactly solvable case…

We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltonian sets of polygonal paths relative its size. These…

We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…

In this paper, we establish a connection between Rogers-Ramanujan-Gordon type overpartitions to lattice paths with four kinds of unitary steps. By establishing the bijective relationship between overpartitions and lattice paths, we…