English
Related papers

Related papers: Metrics on Signed Permutations with the Same Peak …

200 papers

Given a permutation $\sigma$, its corresponding binary search tree is obtained by recursively inserting the values $\sigma(1),\ldots,\sigma(n)$ into a binary tree so that the label of each node is larger than the labels of its left subtree…

Probability · Mathematics 2021-12-13 Benoît Corsini

We develop a more general view of Stembridge's enriched $P$-partitions and use this theory to outline the structure of peak algebras for the symmetric group and the hyperoctahedral group. Initially we focus on commutative peak algebras,…

Combinatorics · Mathematics 2007-05-23 T. Kyle Petersen

We define multideterminantal probability measures, a family of probability measures on $[k]^n$ where $[k]=\{1,2,\dots,k\}$, generalizing determinantal measures (which correspond to the case $k=2$). We give examples coming from the positive…

Probability · Mathematics 2025-07-16 Richard Kenyon

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Probability · Mathematics 2018-12-21 Volker Betz , Helge Schäfer , Dirk Zeindler

Global permutation patterns have recently been shown to characterize important properties of a Coxeter group. Here we study global patterns in the context of signed permutations, with both characterizing and enumerative results.…

Combinatorics · Mathematics 2025-04-18 Owen John Levens , Joel Brewster Lewis , Bridget Eileen Tenner

For a fixed positive integer n, let S_n denote the symmetric group of n! permutations on n symbols, and let maj(sigma) denote the major index of a permutation sigma. For positive integers k<m not greater than n and non-negative integers i…

Combinatorics · Mathematics 2007-05-23 Helene Barcelo , Robert Maule , Sheila Sundaram

For a tuple $A=(A_1,\ A_2,\ ...,\ A_n)$ of elements in a unital Banach algebra ${\mathcal B}$, its projective joint spectrum $P(A)$ is the collection of $z\in {\mathbb C}^n$ such that $A(z)=z_1A_1+z_2A_2+\cdots +z_nA_n$ is not invertible.…

Functional Analysis · Mathematics 2020-03-02 Ronald G. Douglas , Rongwei Yang

The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete…

Combinatorics · Mathematics 2007-08-21 Persi Diaconis , Jason Fulman , Robert Guralnick

We investigate the dependence of cosmological parameters on the number count of peaks (local maxima and minima) in the cosmic microwave background (CMB) sky. The peak statistics contains the whole information of acoustic oscillations in the…

Astrophysics · Physics 2007-05-23 Toshifumi Futamase , Masahiro Takada

The study of Fourier transforms of probability measures on fractal sets plays an important role in recent research. Faster decay rates are known to yield enhanced results in areas such as metric number theory. This paper focuses on…

Classical Analysis and ODEs · Mathematics 2024-12-24 Ying Wai Lee

We compare the marked length spectra of isometric actions of groups with non-positively curved features. Inspired by the recent works of Butt we study approximate versions of marked length spectrum rigidity. We show that for pairs of…

Geometric Topology · Mathematics 2024-10-04 Stephen Cantrell , Eduardo Reyes

In this paper we consider a punctured Riemann surface endowed with a Hermitian metric which equals the Poincar\'e metric near the punctures and a holomorphic line bundle which polarizes the metric. We show that the Bergman kernel can be…

Differential Geometry · Mathematics 2021-04-08 Hugues Auvray , Xiaonan Ma , George Marinescu

We look at geometric limits of large random non-uniform permutations. We mainly consider two theories for limits of permutations: permuton limits, introduced by Hoppen, Kohayakawa, Moreira, Rath, and Sampaio to define a notion of scaling…

Probability · Mathematics 2021-07-22 Jacopo Borga

In the combinatorial study of the coefficients of a bivariate polynomial that generalizes both the length and the reflection length generating functions for finite Coxeter groups, Petersen introduced a new Mahonian statistic $sor$, called…

Combinatorics · Mathematics 2012-06-05 William Y. C. Chen , George Z. Gong , Jeremy J. F. Guo

Signed shifts are generalizations of the shift map in which, interpreted as a map from the unit interval to itself sending x to the fractional part of Nx, some slopes are allowed to be negative. Permutations realized by the relative order…

Combinatorics · Mathematics 2019-01-03 Sergi Elizalde , Katherine Moore

In the late seventies, Sullivan showed that for a convex cocompact subgroup $\Gamma$ of $\operatorname{SO}^\circ(n,1)$ with critical exponent $\delta>0$, any $\Gamma$-conformal measure on $\partial \mathbb{H}^n$ of dimension $\delta$ is…

Dynamical Systems · Mathematics 2022-01-31 Sam Edwards , Minju Lee , Hee Oh

There is a natural analogue of weak Bruhat order on the involutions in any Coxeter group. The saturated chains of intervals in this order correspond to reduced words for a certain set of group elements called atoms. Brion gives a general…

Combinatorics · Mathematics 2025-06-12 Zachary Hamaker , Eric Marberg

A permutation array(or code) of length $n$ and distance $d$, denoted by $(n,d)$ PA, is a set of permutations $C$ from some fixed set of $n$ elements such that the Hamming distance between distinct members $\mathbf{x},\mathbf{y}\in C$ is at…

Information Theory · Computer Science 2008-01-28 Lizhen Yang , Ling Dong , Kefei Chen

For a bounded domain $D \subset \mathbb{C}^n$, let $K_D = K_D(z) > 0$ denote the Bergman kernel on the diagonal and consider the reproducing kernel Hilbert space of holomorphic functions on $D$ that are square integrable with respect to the…

Complex Variables · Mathematics 2021-10-19 Diganta Borah , Kaushal Verma

Understanding the metric structure of permutation families is fundamental to combinatorics and has applications in social choice theory, bioinformatics, and coding theory. We study permutation families defined by restriction…

Discrete Mathematics · Computer Science 2025-07-16 Danylo Tymoshenko , Leonhard Nagel
‹ Prev 1 3 4 5 6 7 10 Next ›