Related papers: Catalan triangles and tied arc diagrams
It is known that the monodromy group of each cover of a general curve of genus g>3 equals either the symmetric or the alternating group. The classical Catalan numbers count the minimal degree covers (with symmetric monodromy) of a general…
A Catalan word is one on the alphabet of positive integers starting with $1$ in which each subsequent letter is at most one more than its predecessor. Let $\mathcal{C}_n$ denote the set of Catalan words of length $n$. In this paper, we give…
We study the set of rational curves of a certain topological type in general members of certain families of Calabi-Yau threefolds. For some families we investigate to what extent it is possible to conclude that this set is finite. For other…
Stanley considered Dyck paths where each maximal run of down-steps to the $x$-axis has odd length; they are also enumerated by (shifted) Catalan numbers. Prefixes of these combinatorial objects are enumerated using the kernel method. A more…
This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…
We enumerate injectively $k$-colored rooted forests with a given number of vertices of each color and a given sequence of root colors. We obtain from this result some new multi-parameter distributions of Fuss-Catalan numbers. As an…
We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers,…
It is consistent relative to an inaccessible cardinal that ZF+DC holds, the hypergraph of equilateral triangles on a given Euclidean space has countable chromatic number, while the hypergraph of isosceles triangles in the plane does not.
For certain tropical quartic curves the existing techniques could not predict the lifting behavior of their bitangents over the real numbers. We close this gap by using patchworking techniques. Further, this paper provides an analysis of…
The Catalan numbers (C_n)_{n >= 0} = 1,1,2,5,14,42,... form one of the most venerable sequences in combinatorics. They have many combinatorial interpretations, from counting bracketings of products in non-associative algebra to counting…
We develop the Stienstra-Beukers theory of supercongruences in the setting of the Catalan-Larcombe-French sequence. We also give some applications to other sequences.
In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Standard set-valued Young tableaux are a generalization of standard Young tableaux in which cells may contain more than one integer, with the added conditions that every integer at position $(i,j)$ must be smaller than every integer at…
Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, pursuing the recent initiating work of the first and last…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
We describe an inner product on the diagrams on which the Temperley-Lieb algebra can be represented. We exhibit several constructions which are in natural combinatorial bijection with these diagrams, which are generalizations of various…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
Agol recently introduced the concept of a veering taut triangulation, which is a taut triangulation with some extra combinatorial structure. We define the weaker notion of a "veering triangulation" and use it to show that all veering…
We study the triangle inequalities for angles (with different definitions) and present inequalities concerning the entries of correlation matrices through the positivity of $3\times 3$ matrices. We extend our discussions to the inequalities…