English
Related papers

Related papers: Rowmotion on 321-avoiding permutations

200 papers

Consider $a$ particles performing simple, symmetric, non-intersecting random walks, starting at points $2(j-1)$, $1\le j\le a$ at time 0 and ending at $2(j-1)+c-b$ at time $b+c$. This can also be interpreted as a random rhombus tiling of an…

Probability · Mathematics 2007-05-23 Kurt Johansson

In this paper we study pattern-replacement equivalence relations on the set $S_n$ of permutations of length $n$. Each equivalence relation is determined by a set of patterns, and equivalent permutations are connected by pattern-replacements…

Combinatorics · Mathematics 2020-09-11 Michael Ma

In this paper we study dynamical systems generated by a gonosomal evolution operator of a bisexual population. We find explicitly all (uncountable set) of fixed points of the operator. It is shown that each fixed point has eigenvalues less…

Dynamical Systems · Mathematics 2021-02-11 A. T. Absalamov , U. A. Rozikov

We prove a generalization of the fixed point theorem of Cartwright and Littlewood. Namely, suppose $h : \mathbb{R}^2 \to\mathbb{R}^2$ is an orientation preserving planar homeomorphism, and let $C$ be a continuum such that $h^{-1}(C)\cup C$…

Dynamical Systems · Mathematics 2015-10-23 Jan P. Boroński

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…

Combinatorics · Mathematics 2007-06-22 Guo-Niu Han , Guoce Xin

It is known that, when $n$ is even, the number of permutations of $\{1,2,\dots,n\}$ all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Heged\H{u}s and Roichman recently found a…

Combinatorics · Mathematics 2025-04-08 Sergi Elizalde

We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to infinity. We develop a general method…

Combinatorics · Mathematics 2011-10-13 Richard Ehrenborg , Sergey Kitaev , Peter Perry

We present a detailed analysis of all possible regular precessions of a heavy asymmetric body with a fixed point not coinciding with the center of mass. The calculations are done in terms of the rotation matrix, by writing the Euler-Poisson…

Classical Physics · Physics 2025-08-28 Alexei A. Deriglazov

We examine the poset $P$ of 132-avoiding $n$-permutations ordered by descents. We show that this poset is the "coarsening" of the well-studied poset $Q$ of noncrossing partitions . In other words, if $x<y$ in $Q$, then $f(y)<f(x)$ in $P$,…

Combinatorics · Mathematics 2007-05-23 Miklos Bona

Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…

Combinatorics · Mathematics 2019-05-24 Zachary Hamaker , Victor Reiner

This paper initiates a limit theory of permutation valued processes, building on the recent theory of permutons. We apply this to study the asymptotic behaviour of random sorting networks. We prove that the Archimedean path, the conjectured…

Probability · Mathematics 2019-11-05 Mustazee Rahman , Balint Virag , Mate Vizer

Pattern formation mechanisms of a reaction-diffusion-advection system, with one diffusivity, differential advection, and (Robin) boundary conditions of Danckwerts type, are being studied. Pattern selection requires mapping the domains of…

Pattern Formation and Solitons · Physics 2009-11-23 Arik Yochelis , Moshe Sheintuch

We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…

Combinatorics · Mathematics 2025-01-24 Vitor Fernandes , Alexei Vernitski

We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically conjectures the statements of known theorems such as the descriptions of stack-sortable (Knuth 1975) and…

Combinatorics · Mathematics 2012-12-03 Hjalti Magnusson , Henning Ulfarsson

We consider stochastic perturbations of PDEs which have special pattern solutions, such as (nonlinear) travelling waves, solitons, and spiral waves. We show orbital stability of these patterns on a timescale which is exponential in the…

Dynamical Systems · Mathematics 2024-06-25 Joris van Winden

The non-convexity of a smooth and compact connected component of a real algebraic plane curve can be measured by a combinatorial object called the Poincare-Reeb tree associated to the curve and to a direction of projection. In this paper we…

Algebraic Geometry · Mathematics 2022-07-13 Miruna-Stefana Sorea

Valid hook configurations are combinatorial objects used to understand West's stack-sorting map. We extend existing bijections corresponding valid hook configurations to intervals in partial orders on Motzkin paths. To enumerate valid hook…

Combinatorics · Mathematics 2019-10-22 Maya Sankar

We study Reeb dynamics on prequantization circle bundles and the filtered (equivariant) symplectic homology of prequantization line bundles, aka negative line bundles, with symplectically aspherical base. We define (equivariant) symplectic…

Symplectic Geometry · Mathematics 2018-06-18 Viktor L. Ginzburg , Jeongmin Shon

We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…

Combinatorics · Mathematics 2009-09-29 Olivier Guibert , Sylvain Pelat-Alloin

Let $A(p,n,k)$ be the number of $p$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We formulate the conjecture that, for every fixed $p$ and $n$, the…

Combinatorics · Mathematics 2024-01-12 Abdelmalek Abdesselam
‹ Prev 1 8 9 10 Next ›