Related papers: Patterns in Shi tableaux and Dyck paths
We have extended classical pattern avoidance to a new structure: multiple task-precedence posets whose Hasse diagrams have three levels, which we will call diamonds. The vertices of each diamond are assigned labels which are compatible with…
We construct 1-parameter families of non-periodic embedded minimal surfaces of infinite genus in $T \times \mathbb{R}$, where $T$ denotes a flat 2-tori. Each of our families converges to a foliation of $T \times \mathbb{R}$ by $T$. These…
Numerical computations of bifurcation maps for one dimensional maps show patterns (regular jumps in point density) in the zones of chaotic behaviour. In this work, empiric formulas are given for these patterns for an entire class of maps.
The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…
The pattern-avoiding fillings of Young diagrams we study arose from Postnikov's work on positive Grassman cells. They are called Le-diagrams, and are in bijection with decorated permutations. Other closely-related diagrams are interpreted…
The pattern avoidance problem seeks to construct a set with large fractal dimension that avoids a prescribed pattern, such as three term arithmetic progressions, or more general patterns, such as finding a set whose Cartesian product avoids…
The braid arrangement is the Coxeter arrangement of the type $A_\ell$. The Shi arrangement is an affine arrangement of hyperplanes consisting of the hyperplanes of the braid arrangement and their parallel translations. In this paper, we…
We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset $P=(X,\leq)$ is an injective mapping of $X$ into the Cartesian plane…
Chess tableaux are a special kind of standard Young tableaux where, in the chessboard coloring of the Young diagram, even numbers always appear in white cells and odd numbers in black cells. If, for $\lambda$ a partition of $n$,…
The Shi arrangement is an affine arrangement of hyperplanes consisting of the hyperplanes of the Weyl arrangement and their parallel translations. It was introduced by J.-Y. Shi in the study of the Kazhdan-Lusztig representation of the…
Paths that consist of up-steps of one unit and down-steps of $k$ units, being bounded below by a horizontal line $-t$, behave like $t+1$ ordered tuples of $k$-Dyck paths, provided that $t\le k$. We describe the general case, allowing $t$…
It is proposed that the spatial (and temporal) patterns spontaneously appearing in dissipative systems maximize the energy flow through the pattern forming interface. In other words - the patterns maximize the entropy growth rate in an…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
Keeping in mind the several models of M(atrix) theory we attempt to understand the possible structure of the topological M(atrix) theory ``underlying'' these approaches. In particular we raise the issue about the nature of the structure of…
We introduce the notion of a higher covering diagram in a base $\infty$-category $\mathcal{C}$. The theory of higher covering diagrams in $\mathcal{C}$ will be shown to recover various descent conditions known from the $\infty$-categorical…
We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary…
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…
In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux…
Web graphs form a family of planar directed graphs with boundary that can be used to model quantum $\mathfrak{sl}_n$-invariant vectors. Standard Young tableaux on an $n \times k$ rectangle naturally index a basis for $\mathfrak{sl}_n$ web…
We examine the structure of Farey maps, which are a class of maps (graph embeddings on surfaces) that have received significant attention recently. We describe how they are related to each other through regular coverings and parallel…