中文
相关论文

相关论文: Cyclic sieving on permutations -- an analysis of m…

200 篇论文

Selective sweeps are typically associated with a local reduction of genetic diversity around the adaptive site. However, selective sweeps can also quickly carry neutral mutations to observable population frequencies if they arise early in a…

种群与进化 · 定量生物学 2012-06-29 Philipp W. Messer , Richard A. Neher

We consider random transformations $T_\omega^n:=T_{\sigma^{n-1}\omega}\circ\cdots\circ T_{\sigma\omega}\circ T_\omega,$ where each map $T_{\omega}$ acts on a complete metrizable space $M$. The randomness comes from an invertible ergodic…

动力系统 · 数学 2024-02-21 Jason Atnip , Gary Froyland , Cecilia González-Tokman , Sandro Vaienti

The experimental evaluation of algorithms results in a large set of data which generally do not follow a normal distribution or are not heteroscedastic. Besides, some of its entries may be missing, due to the inability of an algorithm to…

机器学习 · 计算机科学 2019-08-16 Iago A Carvalho

Define a permutation to be any sequence of distinct positive integers. Given two permutations p and s on disjoint underlying sets, we denote by p sh s the set of shuffles of p and s (the set of all permutations obtained by interleaving the…

组合数学 · 数学 2019-06-19 Duff Baker-Jarvis , Bruce Sagan

In the first part of the paper, we study the inversion statistic of random permutations under the family $(\mathbb{P}_\theta^{(n)})_{\theta \ge 0}$ of Ewens sampling distributions on $S_n$. We obtain a rather simple exact formula for the…

概率论 · 数学 2025-11-18 Ross G. Pinsky , Dominic T. Schickentanz

We prove several general formulas for the distributions of various permutation statistics over any set of permutations whose quasisymmetric generating function is a symmetric function. Our formulas involve certain kinds of plethystic…

组合数学 · 数学 2020-08-21 Ira M. Gessel , Yan Zhuang

The set of nonnegative integer lattice points in a polytope, also known as the fiber of a linear map, makes an appearance in several applications including optimization and statistics. We address the problem of sampling from this set using…

统计计算 · 统计学 2024-07-24 Miles Bakenhus , Sonja Petrović

We revisit the densest binary sphere packings (DBSP) under the periodic boundary conditions and present an updated phase diagram, including newly found 12 putative densest structures over the $x - \alpha$ plane, where $x$ is the relative…

材料科学 · 物理学 2021-02-24 Ryotaro Koshoji , Mitsuaki Kawamura , Masahiro Fukuda , Taisuke Ozaki

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

组合数学 · 数学 2013-05-01 Kassie Archer , Sergi Elizalde

We introduce a new sorting device for permutations which makes use of a pop stack augmented with a bypass operation. This results in a sorting machine, which is more powerful than the usual Popstacksort algorithm and seems to have never…

离散数学 · 计算机科学 2025-03-12 Lapo Cioni , Luca Ferrari , Rebecca Smith

The $\sigma$-machine was recently introduced by Cerbai, Claesson and Ferrari as a tool to gain a better insight on the problem of sorting permutations with two stacks in series. It consists of two consecutive stacks, which are restricted in…

组合数学 · 数学 2023-04-06 Giulio Cerbai

Given a permutation $\sigma = \sigma_1 \ldots \sigma_n$ in the symmetric group $\mathcal{S}_{n}$, we say that $\sigma_i$ matches the quadrant marked mesh pattern $\mathrm{MMP}(a,b,c,d)$ in $\sigma$ if there are at least $a$ points to the…

组合数学 · 数学 2023-06-22 Dun Qiu , Jeffrey B. Remmel

A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…

概率论 · 数学 2011-11-10 Omer Angel , Alexander E. Holroyd , Dan Romik , Balint Virag

It is known that backward iterations of independent copies of a contractive random Lipschitz function converge almost surely under mild assumptions. By a sieving (or thinning) procedure based on adding to the functions time and space…

概率论 · 数学 2020-03-25 Alexander Marynych , Ilya Molchanov

In this paper we look at polynomials arising from statistics on the classes of involutions, $I_n$, and involutions with no fixed points, $J_n$, in the symmetric group. Our results are motivated by F. Brenti's conjecture which states that…

组合数学 · 数学 2007-05-23 W. M. B. Dukes

Datasets in which measurements of two (or more) types are obtained from a common set of samples arise in many scientific applications. A common problem in the exploratory analysis of such data is to identify groups of features of different…

统计方法学 · 统计学 2024-05-15 Miheer Dewaskar , John Palowitch , Mark He , Michael I. Love , Andrew B. Nobel

We study a family of maps from $S_n \to S_n$ we call fixed point homing shuffles. These maps generalize a few known problems such as Conway's Topswops, and a card shuffling process studied by Gweneth McKinley. We show that the iterates of…

组合数学 · 数学 2025-08-20 Jonathan Parlett

Granular convergence is a property of a granular pack as it is repeatedly sheared in a cyclic, quasistatic fashion, as the packing configuration changes via discrete events. Under suitable conditions the set of microscopic configurations…

软凝聚态物质 · 物理学 2023-08-25 Anna Movsheva , Thomas A. Witten

The special purpose sorting operation, context directed swap (CDS), is an example of the block interchange sorting operation studied in prior work on permutation sorting. CDS has been postulated to model certain molecular sorting events…

组合数学 · 数学 2018-11-30 Marisa Gaetz , Bethany Flanagan , Marion Scheepers , Meghan Shanks

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

组合数学 · 数学 2009-11-19 Michael Lugo