Related papers: 1234-avoiding permutations and Dyck paths

We give a rigorous construction of the path integral in N=1/2 supersymmetry as an integral map for differential forms on the loop space of a compact spin manifold. It is defined on the space of differential forms which can be represented by…

We build a connection between rough path theory and noncommutative algebra, and interpret the integration of geometric rough paths as an example of a non-abelian Young integration. We identify a class of slowly-varying one-forms, and prove…

In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…

We propose a handful of definitions of injectivity for a parametrized family of maps and study its link with a global nonuniform stability conjecture for nonautonomous differential systems, which has been recently introduced. This relation…

We construct new monomorphisms between mapping class groups of surfaces. The first family of examples injects the mapping class group of a closed surface into that of a different closed surface. The second family of examples are defined on…

We present nine bijections between classes of Dyck paths and classes of standard Young tableaux (SYT). In particular, we consider SYT of flag and rectangular shapes, we give Dyck path descriptions for certain SYT of height at most 3, and we…

It is proved that the assembly maps in algebraic K- and L-theory with respect to the family of finite subgroups is injective for groups with finite asymptotic dimension that admit a finite model for the classifying space for proper actions.…

We provide a simple injective proof that the number of 132-avoiding permutations with a unique longest increasing subsequence is at least as large as the number of 132-avoiding permutations without a unique longest increasing subsequence.

We prove that the number of permutations which avoid 132-patterns and have exactly one 123-pattern equals (n-2)2^(n-3). We then give a bijection onto the set of permutations which avoid 123-patterns and have exactly one 132-pattern.…

In this paper, we consider several combinatorial problems whose enumeration leads to the odd-indexed Fibonacci numbers, including certain types of Dyck paths, block fountains, directed column-convex polyominoes, and set partitions with no…

This paper is a continuation of the systematic study of the distributions of quadrant marked mesh patterns initiated in [6]. Given a permutation $\sg = \sg_1 ... \sg_n$ in the symmetric group $S_n$, we say that $\sg_i$ matches the quadrant…

In this paper, we view parking functions viewed as labeled Dyck paths in order to study a notion of pattern avoidance first introduced by Remmel and Qiu. In particular we enumerate the parking functions avoiding any set of two or more…

Let $\sigma$ and $\tau$ be patterns of length three; that is $\sigma, \tau \in \{123,132,213,231,312,321\}$. In this paper, we enumerate the set of cyclic permutations in $\mathcal{S}_n$ that avoid $\sigma$ in their one-line notation and…

An $(a,b)$-Dyck path $P$ is a lattice path from $(0,0)$ to $(b,a)$ that stays above the line $y=\frac{a}{b}x$. The zeta map is a curious rule that maps the set of $(a,b)$-Dyck paths into itself; it is conjecturally bijective, and we provide…

Let $L_K(E)$ denote the Leavitt path algebra associated to the finite graph $E$ and field $K$. For any closed path $c$ in $E$, we define and investigate the uniserial, artinian, non-noetherian left $L_K(E)$-module $U_{E,c-1}$. The unique…

The number of Dyck paths of semilength $n$ is famously $C_n$, the $n$th Catalan number. This fact follows after noticing that every Dyck path can be uniquely parsed according to a context-free grammar. In a recent paper, Zeilberger showed…

Two Hamilton paths in $K_n$ are separated by a cycle of length $k$ if their union contains such a cycle. For small fixed values of $k$ we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in $K_n$ such that any…

In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in $\widetilde{S}_n$ that avoid p if and only if p avoids the pattern 321.…

Let $X=Spec{A}$ denote a regular affine scheme, over a field $k$, with $1/2\in k$ and $\dim X=d$. Let $P$ denote a projective $A$-module of rank $n\geq 2$. Let $\pi_0\left({\mathcal LO}(P)\right)$ denote the (Nori) Homotopy Obstruction set,…

Skew Dyck are a variation of Dyck paths, where additionally to steps $(1,1)$ and $(1,-1)$ a south-west step $(-1,-1)$ is also allowed, provided that the path does not intersect itself. Replacing the south-west step by a red south-east step,…