English
Related papers

Related papers: A Note on the Structure of Roller Coaster Permutat…

200 papers

The coexistence of infinitely many attractors is called extreme multistability in dynamical systems. In coupled systems, this phenomenon is closely related to partial synchrony and characterized by the emergence of a conserved quantity. We…

Chaotic Dynamics · Physics 2015-06-11 Chittaranjan Hens , Syamal K. Dana , Ulrike Feudel

In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…

Combinatorics · Mathematics 2015-04-10 Shi-Mei Ma , Yeong-Nan Yeh

Regular variation of distributional tails is known to be preserved by various linear transformations of some random structures. An inverse problem for regular variation aims at understanding whether the regular variation of a transformed…

Probability · Mathematics 2014-01-23 Ewa Damek , Thomas Mikosch , Jan Rosinski , Gennady Samorodnitsky

The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We show that the set of occupied sites for this model on an infinite regular tree is a…

Combinatorics · Mathematics 2010-10-11 Itamar Landau , Lionel Levine

A permutohedral variety is a remarkable object in various areas of mathematics, and its topological invariants are widely recognized. However, only little is known about a real permutohedral variety, that is, the real locus of a…

Algebraic Topology · Mathematics 2024-10-01 Suyoung Choi , Younghan Yoon

The study of toppling on permutations with an extra labeled chip was initiated by the first author with D. Hathcock and P. Tetali (arXiv:2010.11236), where the extra chip was added in the middle. We extend this to all possible locations $p$…

Combinatorics · Mathematics 2021-11-10 Arvind Ayyer , Beáta Bényi

In part I (math.PR/0406392) we proved for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is of the maximal order square root of n. In higher dimensions we call…

Probability · Mathematics 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

We prove that every permutation of a Cartesian product of two finite sets can be written as a composition of three permutations, the first of which only modifies the left projection, the second only the right projection, and the third again…

Group Theory · Mathematics 2019-01-18 Ville Salo

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Combinatorics · Mathematics 2008-01-29 Joshua Cooper , Andrew Petrarca

We propose an interpretation for the meets and joins in the lattice of experimental propositions of a physical theory, answering a question of Birkhoff and von Neumann in [1]. When the lattice is atomistic, it is isomorphic to the lattice…

Quantum Physics · Physics 2023-07-26 Pavlos Kazakopoulos , Georgios Regkas

The circular peak set of a permutation $\sigma$ is the set $\{\sigma(i)\mid \sigma(i-1)<\sigma(i)>\sigma(i+1)\}$. In this paper, we focus on the enumeration problems for permutations by circular peak sets. Let $cp_n(S)$ denote the number of…

Combinatorics · Mathematics 2008-06-05 Pierre Bouchard , Hungyung Chang , Jun Ma , Jean Yeh

A permutation is centrosymmetric if it is fixed by a half-turn rotation of its diagram. Initially motivated by a question by Alexander Woo, we investigate the question of whether the growth rate of a permutation class equals the growth rate…

Combinatorics · Mathematics 2019-07-16 Justin M. Troyka

We introduce the cyclic major index of a cycle permutation and give a bivariate analogue of enumerative formula for the cyclic shuffles with a given cyclic descent numbers due to Adin, Gessel, Reiner and Roichman, which can be viewed as a…

Combinatorics · Mathematics 2022-05-10 Kathy Q. Ji , Dax T. X. Zhang

Let $f$ be a permutation from $\mathbb{N}_0$ onto $\mathbb{N}_0$. Let $x\in\mathbb{N}_0$ and consider a (finite or infinite) sequence $s= (x,f(x),f^2(x),\cdots)$. We call $s$ a permutation sequence. Let $D$ be the set of elements of $s$. If…

Number Theory · Mathematics 2022-05-30 John L Simons

An involution is usually defined as a mapping that is its own inverse. In this paper, we study quaternion involutions that have the additional properties of distribution over addition and multiplication. We review formal axioms for such…

Rings and Algebras · Mathematics 2007-06-13 Todd A. Ell , Stephen J. Sangwine

Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…

Discrete Mathematics · Computer Science 2023-06-22 Murray Tannock , Michael Albert

We consider a stack sorting algorithm where only the appropriate output values are popped from the stack and then any remaining entries in the stack are run through the stack in reverse order. We identify the basis for the $2$-reverse pass…

Combinatorics · Mathematics 2018-08-14 Toufik Mansour , Howard Skogman , Rebecca Smith

The concept of structural invariance previously introduced by the authors is used to argue that the connection between random matrix theory and quantum systems with a chaotic classical counterpart is in fact largely exact in the…

chao-dyn · Physics 2008-02-03 F. Leyvraz , T. H. Seligman

Let $L$ be an alternating prime non-split link in $S^3$. We use the category of flypes between reduced alternating diagrams for $L$ to classify involutions on $L$. As consequences, we show that the quotient of an alternating periodic link…

Geometric Topology · Mathematics 2021-10-12 Keegan Boyle

Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\mathrm{Perm}$, the group of all recursive permutations $\mathcal{G}$. Multiple equivalent…

Logic · Mathematics 2016-12-16 Tobias Boege