English
Related papers

Related papers: On alternating signed permutations with the maxima…

200 papers

In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate…

Number Theory · Mathematics 2017-12-12 Taekyun Kim , Dae san Kim

The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…

Combinatorics · Mathematics 2022-03-10 Svante Janson

We consider a two-speed branching random walk, which consists of two macroscopic stages with different reproduction laws. We prove that the centered maximum converges in law to a Gumbel variable with a random shift and the extremal process…

Probability · Mathematics 2025-03-11 Lianghui Luo

For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

Probability · Mathematics 2007-05-23 Alexander Gnedin

In this paper we examine embeddings of alternating groups and symmetric groups into almost simple groups of exceptional type. In particular, we prove that unless the alternating or symmetric group has degree 6 or 7, there is no maximal…

Group Theory · Mathematics 2017-05-17 David A. Craven

Two permutations are similar if they have the same length and the same relative order. A collection of $r\ge2$ disjoint, similar subsequences of a permutation $\pi$ form $r$-twins in $\pi$. We study the longest guaranteed length of…

Combinatorics · Mathematics 2021-05-07 Andrzej Dudek , Jarosław Grytczuk , Andrzej Ruciński

Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments…

Probability · Mathematics 2010-12-10 Gert de Cooman , Erik Quaeghebeur

In this paper, we establish some common fixed point results for a new class of pair of contractions mappings having functions as contractive parameters, and satisfying certain commutative properties.

Functional Analysis · Mathematics 2015-02-17 J. R. Morales , E. M. Rojas

We consider quasiconformal deformations of $\mathbb{C}\setminus\mathbb{Z}$. We give some criteria for infinitely often punctured planes to be quasiconformally equivalent to $\mathbb{C}\setminus\mathbb{Z}$. In particular, we characterize the…

Differential Geometry · Mathematics 2014-12-30 Hiroki Fujino

In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper "Self-complementary totally symmetric plane partitions" (J. Combin. Theory Ser. A 42, 277-292). In other words we show that…

Combinatorics · Mathematics 2007-05-23 Masao Ishikawa

We prove that the enumerative polynomials of quasi-Stirling permutations of multisets with respect to the statistics of plateaux, descents and ascents are partial $\gamma$-positive, thereby confirming a recent conjecture posed by Lin, Ma…

Combinatorics · Mathematics 2021-07-14 Sherry H. F. Yan , Yunwei Huang , Lihong Yang

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

Combinatorics · Mathematics 2026-03-31 Verónica Borrás-Serrano , Isabel Byrne , Anant Godbole , Nathaniel Veimau

Andr\'e proved that the number of alternating permutations on $\{1, 2, \dots, n\}$ is equal to the Euler number $E_n$. A refinement of Andr\'e's result was given by Entringer, who proved that counting alternating permutations according to…

Combinatorics · Mathematics 2022-03-22 Yoann Gelineau , Heesung Shin , Jiang Zeng

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

Discrete Mathematics · Computer Science 2024-06-25 Atli Fannar Franklín , Anders Claesson , Christian Bean , Henning Úlfarsson , Jay Pantone

We establish that any even permutation from A_n moving at least [3n/4] + o(n) points is the commutator of a generating pair of A_n and a generating pair of S_n. From this we deduce an exponential lower bound on the number of systems of…

Group Theory · Mathematics 2014-03-13 David Zmiaikou

The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez \& Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of…

Dynamical Systems · Mathematics 2016-08-08 Primitivo B. Acosta-Humánez , Oscar E. Martínez-Castiblanco

We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…

Combinatorics · Mathematics 2021-08-31 Jakub Konieczny

Given a set $S$ consisting of $n$ points in $\mathbb{R}^d$ and one or two vantage points, we study the number of orderings of $S$ induced by measuring the distance (for one vantage point) or the average distance (for two vantage points)…

Chung and Graham define quasirandom subsets of $\mathbb{Z}_n$ to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of $\mathbb{Z}_n$ $\epsilon$-balanced if its…

Combinatorics · Mathematics 2007-05-23 Joshua N. Cooper

We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data arising from the representation of an ASM as a collection of…

Combinatorics · Mathematics 2007-05-23 Benjamin Wieland