English
Related papers

Related papers: 1234-avoiding permutations and Dyck paths

200 papers

Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$…

Let $k$ be a field of positive characteristic $p$, and $X$ be a separated of finite type $k$-scheme of dimension $d$. We construct a cycle map from the additive cycle complex to the residual complex of Serre-Grothendieck coherent duality…

Algebraic Geometry · Mathematics 2024-06-04 Fei Ren

Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length $2n$ and noncrossing partitions of $[2n+1]$ with $n+1$ blocks. In terms of the number of…

Combinatorics · Mathematics 2008-07-27 William Y. C. Chen , Sabrina X. M. Pang , Ellen X. Y. Qu , Richard P. Stanley

Let R be a compact, connected, orientable surface of genus g with p boundary components. Let C(R) be the complex of curves on R and Mod_R^* be the extended mapping class group of R. Suppose that either g = 2 and p > 1 or g > 2 and p >= 0.…

Geometric Topology · Mathematics 2007-05-23 Elmas Irmak

The Pancake graph($P_n$) represents the group of all permutations on n elements, namely $S_n$, with respect to the generating set containing all prefix reversals. The diameter of a graph is the maximum of all distances on the graph, where…

Combinatorics · Mathematics 2022-04-19 Harigovind V R , Pramod P Nair

Let $S_{\rm div}(n)$ denote the set of permutations $\pi$ of $n$ such that for each $1\leq j \leq n$ either $j \mid \pi(j)$ or $\pi(j) \mid j$. These permutations can also be viewed as vertex-disjoint directed cycle covers of the divisor…

Number Theory · Mathematics 2022-09-29 Nathan McNew

Paths $P_1,\ldots,P_k$ in a graph $G=(V,E)$ are mutually induced if any two distinct $P_i$ and $P_j$ have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to decide if…

Data Structures and Algorithms · Computer Science 2021-10-28 Petr A. Golovach , Daniël Paulusma , Erik Jan van Leeuwen

The interference pattern produced by a quantum particle in Young's double-slit setup is attributed to the particle's wavefunction having gone through both slits. In the path integral formulation, this interference involves a superposition…

Quantum Physics · Physics 2022-06-02 Q. Duprey , A. Matzkin

We consider the distribution of ascents, descents, peaks, valleys, double ascents, and double descents over permutations avoiding a set of patterns. Many of these statistics have already been studied over sets of permutations avoiding a…

Combinatorics · Mathematics 2019-07-24 Michael Bukata , Ryan Kulwicki , Nicholas Lewandowski , Lara Pudwell , Jacob Roth , Teresa Wheeland

We study the geometry and topology of real analytic maps $\mathbb{C}^n \to \mathbb{C}^k$, where $n > k$, regarded as mixed maps, defined below. Firstly, we give two natural families of mixed isolated complete intersection singularities,…

Algebraic Geometry · Mathematics 2026-05-08 Inácio Rabelo , José Seade

In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).

Computational Geometry · Computer Science 2018-08-29 Esther Galby , Maria Pia Mazzoleni , Bernard Ries

It is well known that the number of non-isomorphic unit interval orders on $[n]$ equals the $n$-th Catalan number. Using work of Skandera and Reed and work of Postnikov, we show that each unit interval order on $[n]$ naturally induces a…

Combinatorics · Mathematics 2018-02-13 Anastasia Chavez , Felix Gotti

Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…

Group Theory · Mathematics 2014-06-13 Ergün Yaraneri

Let $S$ be a finite non-commutative semigroup. The commuting graph of $S$, denoted $\cg(S)$, is the graph whose vertices are the non-central elements of $S$ and whose edges are the sets $\{a,b\}$ of vertices such that $a\ne b$ and $ab=ba$.…

Group Theory · Mathematics 2011-08-19 Joao Araujo , Michael Kinyon , Janusz Konieczny

We study those Artin groups which, modulo their centers, are finite index subgroups of the mapping class group of a sphere with at least 5 punctures. In particular, we show that any injective homomorphism between these groups is…

Group Theory · Mathematics 2007-05-23 Robert W. Bell , Dan Margalit

We embed the rough integration in a larger geometrical/algebraic framework of integrating one-forms against group-valued paths, and reduce the rough integral to an inhomogeneous analogue of the classical Young integral. We define dominated…

Classical Analysis and ODEs · Mathematics 2016-01-05 Terry J. Lyons , Danyu Yang

We study finite-dimensional integrals in a way that elucidates the mathematical meaning behind the formal manipulations of path integrals occurring in quantum field theory. This involves a proper understanding of how Wick's theorem allows…

Mathematical Physics · Physics 2016-10-12 Timothy Nguyen

A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…

Combinatorics · Mathematics 2012-04-20 Olivier Bernardi , Guillaume Chapuy

Given a reflection group $G$ acting on a complex vector space $V$, a reflection map is the composition of an embedding $X \hookrightarrow V$ with the orbit map $V\to\mathbb C^p$ that maps a $G$-orbit to a point. Reflection maps can be very…

Algebraic Geometry · Mathematics 2017-10-24 G. Peñafort-Sanchis

Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…

Combinatorics · Mathematics 2025-07-03 Zhaochen Ding , Zheng Guo , Luyi Liu