中文
相关论文

相关论文: Homomesies on permutations -- an analysis of maps …

200 篇论文

Homomesy is an invariance phenomenon in dynamical algebraic combinatorics which occurs when the average value of some statistic on a set of combinatorial objects is the same over each orbit generated by a map on these objects. In this paper…

组合数学 · 数学 2025-11-19 William Dowling , Nadia Lafreniere

We perform a systematic study of permutation statistics and bijective maps on permutations using SageMath to search the FindStat combinatorial statistics database to identify apparent instances of the cyclic sieving phenomenon (CSP). Cyclic…

The rowmotion operator acting on the set of order ideals of a finite poset has been the focus of a significant amount of recent research. One of the major goals has been to exhibit homomesies: statistics that have the same average along…

组合数学 · 数学 2023-12-21 Colin Defant , Sam Hopkins , Svetlana Poznanović , James Propp

Given a permutation $\tau$ defined on a set of combinatorial objects $S$, together with some statistic $f:S\rightarrow \mathbb{R}$, we say that the triple $\langle S, \tau,f \rangle$ exhibits homomesy if $f$ has the same average along all…

组合数学 · 数学 2016-04-05 Shahrzad Haddadan

We introduce the notion of orbitmesy, which is related to homomesy, a central phenomenon in dynamical algebraic combinatorics. An orbit $O$ is said to be orbitmesic with respect to a statistic if the orbit's average statistic value is equal…

组合数学 · 数学 2025-08-28 Esther Banaian , Emily Barnard , Sunita Chepuri , Jessica Striker

J. Propp and T. Roby isolated a phenomenon in which a statistic on a set has the same average value over any orbit as its global average, naming it homomesy. They proved that the cardinality statistic on order ideals of the product of two…

组合数学 · 数学 2019-11-21 Corey Vorland

Many invertible actions $\tau$ on a set ${\mathcal{S}}$ of combinatorial objects, along with a natural statistic $f$ on ${\mathcal{S}}$, exhibit the following property which we dub \textbf{homomesy}: the average of $f$ over each…

组合数学 · 数学 2015-06-22 James Propp , Tom Roby

Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that…

组合数学 · 数学 2007-05-23 Astrid Reifegerste

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

组合数学 · 数学 2017-09-26 Samantha Dahlberg

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

The descent set D(w) of a permutation w of 1,2,...,n is a standard and well-studied statistic. We introduce a new statistic, the connectivity set C(w), and show that it is a kind of dual object to D(w). The duality is stated in terms of the…

组合数学 · 数学 2007-05-23 Richard P. Stanley

In 2000 Babson and Steingr{\'\i}msson introduced the notion of vincular patterns in permutations. They shown that essentially all well-known Mahonian permutation statistics can be written as combinations of such patterns. Also, they proved…

组合数学 · 数学 2012-03-20 Vincent Vajnovszki

In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…

概率论 · 数学 2018-06-01 İlker Arslan , Ümit Işlak , Cihan Pehlivan

Persistent homology captures the evolution of topological features of a model as a parameter changes. The most commonly used summary statistics of persistent homology are the barcode and the persistence diagram. Another summary statistic,…

统计方法学 · 统计学 2016-04-01 Violeta Kovacev-Nikolic , Peter Bubenik , Dragan Nikolić , Giseon Heo

The Fon-Der-Flaass action partitions the order ideals of a poset into disjoint orbits. For a product of two chains, Propp and Roby observed --- across orbits --- the mean cardinality of the order ideals within an orbit to be invariant. That…

组合数学 · 数学 2015-09-29 David B. Rush , Kelvin Wang

A rooted tree T is a poset whose Hasse diagram is a graph-theoretic tree having a unique minimal element. We study rowmotion on antichains and lower order ideals of T. Recently Elizalde, Roby, Plante and Sagan considered rowmotion on fences…

We investigate the eigenvalues statistics of ensembles of normal random matrices when their order N tends to infinite. In the model the eigenvalues have uniform density within a region determined by a simple analytic polynomial curve. We…

概率论 · 数学 2009-09-08 Alexei M. Veneziani , Tiago Pereira , Domingos H. U. Marchetti

We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…

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

A fence is a poset with elements F = {x_1, x_2, ..., x_n} and covers x_1 < x_2 < ... < x_a > x_{a+1} > ... > x_b < x_{b+1} < ... where a, b, ... are positive integers. We investigate rowmotion on antichains and ideals of F. In particular,…

组合数学 · 数学 2025-04-29 Sergi Elizalde , Matthew Plante , Tom Roby , Bruce Sagan
‹ 上一页 1 2 3 10 下一页 ›