中文
相关论文

相关论文: MacMahon-type Identities for Signed Even Permutati…

200 篇论文

We study the hypersimplex under the action of the symmetric group $S_n$ by coordinate permutation. We prove that the evaluation of its equivariant $H^*$-polynomial at $1$ is the permutation character of decorated ordered set partitions…

组合数学 · 数学 2026-01-14 Oliver Clarke , Max Kölbl

Heyde proved that a Gaussian distribution on the real line is characterized by the symmetry of the conditional distribution of one linear statistic given another. The present article is devoted to a group analogue of the Heyde theorem. We…

泛函分析 · 数学 2020-07-27 Margaryta Myronyuk

Breakpoint graphs are ubiquitous structures in the field of genome rearrangements. Their cycle decomposition has proved useful in computing and bounding many measures of (dis)similarity between genomes, and studying the distribution of…

离散数学 · 计算机科学 2013-03-18 Simona Grusea , Anthony Labarre

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

组合数学 · 数学 2025-10-15 Yong Liao , Yuping Yang , Houyi Yu

A tuple $(G_1,\dots,G_n)$ of graphs on the same vertex set of size $n$ is said to be Hamilton-universal if for every map $\chi: [n]\to[n]$ there exists a Hamilton cycle whose $i$-th edge comes from $G_{\chi(i)}$. Bowtell, Morris, Pehova and…

组合数学 · 数学 2026-02-26 Micha Christoph , Anders Martinsson , Aleksa Milojević

Recently, the second author studied an Eulerian statistic (called cover) in the context of convex polytopes, and proved an equal joint distribution of (cover,des) with (des,exc). In this paper, we present several direct bijective proofs…

组合数学 · 数学 2012-08-16 Travis Hance , Nan Li

We bound the rate of convergence to uniformity for certain random walks on the complete monomial groups G \wr S_n for any group G. These results provide rates of convergence for random walks on a number of groups of interest: the…

概率论 · 数学 2012-08-27 Clyde H. Schoolfield,

It is shown that all the assumptions for symmetric monoidal categories flow out of a unifying principle involving natural isomorphisms of the type ${(A\otimes B)\otimes(C\otimes D)\to(A\otimes C)\otimes(B\otimes D)}$, called medial…

范畴论 · 数学 2007-05-23 K. Dosen , Z. Petric

In a recent paper, Baxter and Zeilberger show that the two most important Mahonian statistics, the inversion number and the major index, are asymptotically independently normally distributed on permutations. In another recent paper,…

组合数学 · 数学 2016-04-13 Marko Thiel

In the first paper in this series we estimated the probability that a random permutation $\pi\in\mathcal{S}_n$ has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that $\pi$ has $m$…

群论 · 数学 2017-06-12 Sean Eberhard , Kevin Ford , Dimitris Koukoulopoulos

In this paper, we find distributions of the left-to-right maxima, right-to-left maxima, left-to-right minima and right-to-left-minima statistics on up-down and down-up permutations of even and odd lengths. For instance, we show that the…

组合数学 · 数学 2024-08-26 Tian Han , Sergey Kitaev , Philip B. Zhang

The structure of the multiplicative group $M_n = ({\mathbb Z}/n{\mathbb Z})^\times$ encodes a great deal of arithmetic information about the integer $n$ (examples include $\phi(n)$, the Carmichael function $\lambda(n)$, and the number…

数论 · 数学 2025-04-16 Greg Martin , Reginald M. Simpson

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…

Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…

表示论 · 数学 2007-05-23 Valentin Vankov Iliev

Let $S^B_n$ be the Coxeter group of type B. We denote the set of indices where $\sigma\in S^B_n$ has a peak as $Peak(\sigma)$ and let $P^{B}(S;n)=\{\sigma \in S^{B}_n~|~ Peak(\sigma)=S\}$. In \cite{metrics}, Diaz-Lopez, Haymaker, Keough,…

We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…

概率论 · 数学 2019-05-14 David Judkovich

Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…

组合数学 · 数学 2012-09-05 Sara Billey , Krzysztof Burdzy , Bruce Sagan

For a positive integer $r$, George Andrews proved that the set of partitions of $n$ in which odd multiplicities are at least $2r + 1$ is equinumerous with the set of partitions of $n$ in which odd parts are congruent to $2r + 1$ modulo $4r…

组合数学 · 数学 2022-12-29 Darlison Nyirenda

In this paper we take a probabilistic look at Maclaurin's inequality, which is a refinement of the classical AM-GM inequality. In a natural randomized setting, we obtain limit theorems and show that a reverse inequality holds with high…

概率论 · 数学 2024-11-12 Lorenz Frühwirth , Michael Juhos , Joscha Prochno

Let the term $k$-representation refer to the permutation representations of the symmetric group $\mathfrak{S}_n$ on $k$-tuples and $k$-subsets as well as the $S^{(n-k,1^k)}$ irreducible representation of $\mathfrak{S}_n$. Endow…

概率论 · 数学 2018-10-30 Benjamin Tsou