中文
相关论文

相关论文: Fertility Numbers of Consecutive $S_3$ Pattern-Avo…

200 篇论文

A nonnegative integer is called a fertility number if it is equal to the number of preimages of a permutation under West's stack-sorting map. We prove structural results concerning permutations, allowing us to deduce information about the…

组合数学 · 数学 2019-10-23 Colin Defant

We introduce the stack-sorting map $\text{SC}_\sigma$ that sorts, in a right-greedy manner, an input permutation through a stack that avoids some vincular pattern $\sigma$. The stack-sorting maps of Cerbai et al. in which the stack avoids a…

组合数学 · 数学 2024-10-23 William Zhao

West's stack-sorting map involves a stack which avoids the permutation $21$ consecutively. Defant and Zheng extended this to a consecutive-pattern-avoiding stack-sorting map $SC_\sigma$, where the stack must always avoid a given permutation…

组合数学 · 数学 2023-08-14 Ilaria Seidel , Nathan Sun

We introduce consecutive-pattern-avoiding stack-sorting maps $\text{SC}_\sigma$, which are natural generalizations of West's stack-sorting map $s$ and natural analogues of the classical-pattern-avoiding stack-sorting maps $s_\sigma$…

组合数学 · 数学 2020-08-28 Colin Defant , Kai Zheng

Defant and Zheng introduced a consecutive-pattern-avoiding stack sort map $SC_{\sigma}$, where the stack must avoid a consecutive pattern $\sigma$. Seidel and Sun disproved a conjecture in Defant and Zheng's paper about the maximum…

组合数学 · 数学 2026-04-22 Kai Yi

We introduce "fertility Wilf equivalence," "strong fertility Wilf equivalence," and "postorder Wilf equivalence," three variants of Wilf equivalence for permutation classes that formalize some phenomena that have appeared in the study of…

组合数学 · 数学 2020-01-13 Colin Defant

For $\eta\in S_3$, let $S_n^{\text{av}(\eta)}$ denote the set of permutations in $S_n$ that avoid the pattern $\eta$, and let $E_n^{\text{av}(\eta)}$ denote the expectation with respect to the uniform probability measure on…

概率论 · 数学 2023-04-28 Ross G. Pinsky

In their study of cyclic pattern containment, Domagalski et al. conjecture differential equations for the generating functions of circular permutations avoiding consecutive patterns of length 3. In this note, we prove and significantly…

组合数学 · 数学 2021-07-13 Sergi Elizalde , Bruce Sagan

Let $\mathcal D_n$ denote the average number of iterations of West's stack-sorting map $s$ that are needed to sort a permutation in $S_n$ into the identity permutation $123\cdots n$. We prove that…

组合数学 · 数学 2020-09-29 Colin Defant

In this paper, we study the distribution of consecutive patterns in the set of 123-avoiding permutations and the set of 132-avoiding permutations, that is, in $\mathcal{S}_n(123)$ and $\mathcal{S}_n(132)$. We first study the distribution of…

组合数学 · 数学 2019-01-07 Ran Pan , Dun Qiu , Jeffrey Remmel

We study pattern avoidance by combinatorial objects other than permutations, namely by ordered partitions of an integer and by permutations of a multiset. In the former case we determine the generating function explicitly, for integer…

组合数学 · 数学 2007-05-23 Carla D. Savage , Herbert S. Wilf

We prove a "decomposition lemma" that allows us to count preimages of certain sets of permutations under West's stack-sorting map $s$. As a first application, we give a new proof of Zeilberger's formula for the number of 2-stack-sortable…

组合数学 · 数学 2020-01-09 Colin Defant

Let a sock be an element of an ordered finite alphabet A and a sequence of these elements be a sock sequence. In 2023, Xia introduced a deterministic version of Defant and Kravitz's stack-sorting map by defining the $\phi_{\sigma}$ and…

组合数学 · 数学 2024-08-13 Samanyu Ganesh , Lanxuan Xia , Bole Ying

We introduce tools from discrete convexity theory and polyhedral geometry into the theory of West's stack-sorting map $s$. Associated to each permutation $\pi$ is a particular set $\mathcal V(\pi)$ of integer compositions that appears in a…

组合数学 · 数学 2023-05-23 Colin Defant

Let $s$ be West's stack-sorting map, and let $s_{T}$ be the generalized stack-sorting map, where instead of being required to increase, the stack avoids subpermutations that are order-isomorphic to any permutation in the set $T$. In 2020,…

组合数学 · 数学 2023-09-14 Christopher Bao , Giulio Cerbai , Yunseo Choi , Katelyn Gan , Owen Zhang

We exploit Krattenthaler's bijection between the set $S_n(3\textrm{-}1\textrm{-}2)$ of permutations in $S_n$ avoiding the classical pattern $3\textrm{-}1\textrm{-}2$ and Dyck $n$-paths to study the distribution of every consecutive pattern…

组合数学 · 数学 2009-04-02 M. Barnabei , F. Bonetti , M. Silimbani

In this paper, we introduce the dotted pattern-avoiding map $s_{\dot{\tau}}$, which avoids the dotted pattern $\dot{\tau}$ instead of descents as West's stack-sorting map $s$ does. We also extend the pattern-avoiding machine, which is…

组合数学 · 数学 2025-06-24 Hansen Shieh , Michael Yang , Ashley Yu

Given a compact subset $\Sigma$ of the real numbers obeying some technical conditions, we consider the set of algebraic integers whose conjugates all lie in $\Sigma$. The distribution of conjugates of such an integer defines a probability…

数论 · 数学 2024-03-19 Alexander Smith

Drmota and Stufler proved recently that the expected number of pattern occurrences of a given map is asymptotically linear when the number of edges goes to infinity. In this paper we improve their result by means of a different method. Our…

组合数学 · 数学 2020-05-15 Guan-Ru Yu

We study the existence of various sign and value patterns in sequences defined by multiplicative functions or related objects. For any set $A$ whose indicator function is 'approximately multiplicative' and uniformly distributed on short…

数论 · 数学 2019-12-04 Terence Tao , Joni Teräväinen
‹ 上一页 1 2 3 10 下一页 ›