Related papers: Patterns in Shi tableaux and Dyck paths
Grand Dyck paths with air pockets (GDAP) are a generalization of Dyck paths with air pockets by allowing them to go below the $x$-axis. We present enumerative results on GDAP (or their prefixes) subject to various restrictions such as…
Patterns, which are collections of elements arranged in regular or near-regular arrangements, are an important graphic art form and widely used due to their elegant simplicity and aesthetic appeal. When a pattern is encoded as a flat image…
Statistical Topology emerged since topological aspects continue to gain importance in many areas of physics. It is most desirable to study topological invariants and their statistics in schematic models that facilitate the identification of…
Fix a vector space over a finite field and a system of linear equations. We provide estimates, in terms of the dimension of the vector space, of the maximum of the sizes of subsets of the space that do not admit solutions of the system…
Despite the popularity of low-rank matrix completion, the majority of its theory has been developed under the assumption of random observation patterns, whereas very little is known about the practically relevant case of non-random…
Dyck paths categories are introduced as a combinatorial model of the category of representations of quivers of Dynkin type An. In particular, it is proved that there is a bijection between some Dyck paths and perfect matchings of some snake…
We present a bijection between the set of standard Young tableaux of staircase minus rectangle shape, and the set of marked shifted standard Young tableaux of a certain shifted shape. Numerically, this result is due to DeWitt (2012).…
As in an earlier paper we start from the hypothesis that physics on the Planck scale should be described by means of concepts taken from ``discrete mathematics''. This goal is realized by developing a scheme being based on the dynamical…
In this article, we introduce a notion of size for sets called thickness that can be used to guarantee that two Cantor sets intersect (the Gap Lemma), and show a connection among Thickness, Schmidt Games and Patterns. We work mostly in the…
A pattern is encountered in a word if some infix of the word is the image of the pattern under some non-erasing morphism. A pattern $p$ is unavoidable if, over every finite alphabet, every sufficiently long word encounters $p$. A theorem by…
Graphs are extremely versatile and ubiquitous mathematical structures with potential to model a wide range of domains. For this reason, graph problems have been of interest since the early days of computer science. Some of these problems…
We investigate numerically and analytically Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The thin random graphs in this limit…
We study the Swift-Hohenberg equation - a paradigm model for pattern formation - with "large" spatially periodic coefficients and find a Turing bifurcation that generates patterns whose leading order form is a Bloch wave modulated by…
Higher dimensional permutations are tuples of d-1 permutations that can be identified with a point set in a d-dimensional grid. In N. Bonichon and P.-J. Morel, {\it J. Integer Sequences} 25 (2022), several conjectures regarding the…
Model studies indicate that many climate subsystems, especially ecosystems, may be vulnerable to 'tipping': a 'catastrophic process' in which a system, driven by gradually changing external factors, abruptly transitions (or 'collapses')…
The importance of higher-order relations is widely recognized in a large number of real-world systems. However, annotating them is a tedious and sometimes impossible task. Consequently, current approaches for data modelling either ignore…
Given a combinatorial structure, a ``twin'' is a pair of disjoint substructures which are isomorphic (or look the same in some sense). In recent years, there have been many problems about finding large twins in various combinatorial…
We define a far-reaching generalization of Schnyder woods which encompasses many classical combinatorial structures on planar graphs. Schnyder woods are defined for planar triangulations as certain triples of spanning trees covering the…
Structuring theories is one of the main approaches to reduce the combinatorial explosion associated with reasoning and exploring large theories. In the past we developed the notion of development graphs as a means to represent and maintain…
A two-dimensional configuration is a coloring of the infinite grid Z^2 with finitely many colors. For a finite subset D of Z^2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The…