English
Related papers

Related papers: A note on a bijection for Schr\"oder permutations

200 papers

This short note gives a bijection between quarter plane walks using the steps $\{\rightarrow, \searrow, \downarrow, \leftarrow, \nwarrow, \uparrow\}$ and bicoloured Motzkin paths.

Combinatorics · Mathematics 2014-12-05 Karen Yeats

In the computation of some representation-theoretic numerical invariants of domestic string algebras, a finite combinatorial gadget introduced by Schr\"{o}er--the \emph{bridge quiver} whose vertices are (representatives of cyclic…

Representation Theory · Mathematics 2022-10-31 Shantanu Sardar , Amit Kuber

Special birational transformations $\Phi:\p^r\da Z$ defined by quadric hypersurfaces are studied by means of the variety of lines $\mathcal L_z\subset\p^{r-1}$ passing through a general point $z\in Z$. Classification results are obtained…

Algebraic Geometry · Mathematics 2013-09-12 Alberto Alzati , José Carlos Sierra

We describe all Witt invariants of anti-hermitian forms over a quaternion algebra with its canonical involution, and in particular all Witt invariants of orthogonal groups $O(A,\sigma)$ where $(A,\sigma)$ is an central simple algebra with…

Rings and Algebras · Mathematics 2025-04-23 Nicolas Garrel

We study generating functions for the number of involutions, even involutions, and odd involutions in $S_n$ subject to two restrictions. One restriction is that the involution avoid 3412 or contain 3412 exactly once. The other restriction…

Combinatorics · Mathematics 2007-05-23 Eric Egge , Toufik Mansour

Nonnesting permutations are permutations of the multiset $\{1,1,2,2,\dots,n,n\}$ that avoid subsequences of the form $abba$ for any $a\neq b$. These permutations have recently been studied in connection to noncrossing (also called…

Combinatorics · Mathematics 2026-01-21 Sergi Elizalde , Amya Luo

We study generating functions for the number of involutions in $S_n$ avoiding (or containing once) 132, and avoiding (or containing once) an arbitrary permutation $\tau$ on $k$ letters. In several interesting cases the generating function…

Combinatorics · Mathematics 2007-05-23 O. Guibert , T. Mansour

We propose an algebro-geometric interpretation of the Schur and Macdonald indices of four-dimensional $\mathcal{N}=2$ superconformal field theories (SCFTs). We conjecture that there exists an affine scheme $X$, which reduces to the Higgs…

High Energy Physics - Theory · Physics 2026-02-12 Monica Jinwoo Kang , Craig Lawrie , Jaewon Song

We prove that an inclusion-exclusion inspired expression of Schubert polynomials of permutations that avoid the patterns 1432 and 1423 is nonnegative. Our theorem implies a partial affirmative answer to a recent conjecture of Yibo Gao about…

Combinatorics · Mathematics 2021-02-23 Karola Mészáros , Arthur Tanjaya

By extending the notion of grid classes to include infinite grids, we establish a structural characterisation of the simple permutations in Av(4231, 35142, 42513, 351624), a pattern class which has three different connections with algebraic…

Combinatorics · Mathematics 2013-12-13 Michael H. Albert , Robert Brignall

In a previous paper, we showed that $3\bar{5}241$-avoiding permutations are counted by the unique sequence that starts with a 1 and shifts left under the self-composition transform. The proof uses a complicated bijection. Here we give a…

Combinatorics · Mathematics 2011-04-26 David Callan

Let $\Bigl\langle\matrix{n\cr k}\Bigr\rangle$, $\Bigl\langle\matrix{B_n\cr k}\Bigr\rangle$, and $\Bigl\langle\matrix{D_n\cr k}\Bigr\rangle$ be the Eulerian numbers in the types A, B, and D, respectively -- that is, the number of…

Logic in Computer Science · Computer Science 2024-02-14 Luigi Santocanale

Baxter numbers are known to count several families of combinatorial objects, all of which come equipped with natural involutions. In this paper, we add a combinatorial family to the list, and show that the known bijections between these…

Combinatorics · Mathematics 2014-02-13 Kevin Dilks

We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…

Combinatorics · Mathematics 2024-06-25 Manosij Ghosh Dastidar , Michael Wallner

The main purpose of this article is to introduce some new binomial difference sequence spaces of fractional order ${\tilde{\alpha}} $ along with infinite matrices. Some topological properties of these spaces are considered along with the…

Functional Analysis · Mathematics 2020-12-15 S. Dutta , S. Singh

Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider n-permutations that avoid the generalized pattern…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev

Inspired by the definition of modified ascent sequences, we introduce a new class of integer sequences called revised ascent sequences. These sequences are defined as Cayley permutations where each entry is a leftmost occurrence if and only…

Combinatorics · Mathematics 2025-05-09 Robin D. P. Zhou

We give a natural definition of rowmotion for $321$-avoiding permutations, by translating, through bijections involving Dyck paths and the Lalanne--Kreweras involution, the analogous notion for antichains of the positive root poset of type…

Combinatorics · Mathematics 2022-12-23 Ben Adenbaum , Sergi Elizalde

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…

Combinatorics · Mathematics 2024-09-04 Kassie Archer , Ethan Borsh , Jensen Bridges , Christina Graves , Millie Jeske

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…

Combinatorics · Mathematics 2023-06-22 David Bevan , Derek Levin , Peter Nugent , Jay Pantone , Lara Pudwell , Manda Riehl , ML Tlachac