相关论文: Refined Restricted Involutions

We study the distributions of the random Dirichlet series with parameters $(s, \beta)$ defined by $$ S=\sum_{n=1}^{\infty}\frac{I_n}{n^s}, $$ where $(I_n)$ is a sequence of independent Bernoulli random variables, $I_n$ taking value $1$ with…

In this note we count linear arrangements that avoid certain patterns and show their connection to the derangement numbers. We discuss the sequence Dn, which counts linear arrangements that avoid patterns 12, 23, ..., (n-1)n, n1, and show…

The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition.…

We prove that if a subset of $(\mathbb{F}_q^n)^k$ (with $q$ an odd prime power) avoids a full-rank three-point pattern $\vec{x},\vec{x}+M_1\vec{d},\vec{x}+M_2\vec{d}$ then it is exponentially small, having size at most $3 \cdot c_q^{nk}$…

Let $S$ be a set of $n$ points in general position in the plane. The Second Selection Lemma states that for any family of $\Theta(n^3)$ triangles spanned by $S$, there exists a point of the plane that lies in a constant fraction of them.…

We consider elements of finite order in the Riordan group $\cal R$ over a field of characteristic $0$. Viewing $\cal R$ as a semi-direct product of groups of formal power series, we solve, for all $n \geq 2$, two foundational questions…

We study how the inversion statistic is influenced by fixed points in a permutation. %The expected number of inversions in a uniformly random permutation in $S_n$ is $\frac{n(n-1)}4$. For each $n\in\mathbb{N}$, and each $k\in\{0,1,\cdots,…

A regenerative random composition of integer $n$ is constructed by allocating $n$ standard exponential points over a countable number of intervals, comprising the complement of the closed range of a subordinator $S$. Assuming that the…

An involution is a bijection that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathsf{invol}(\sigma)$ denote the number of ways $\sigma$ can be expressed as a composition of two involutions of $[n].$ We prove that the…

We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…

We give a positive answer to a question raised by Davis et al. ({\em Discrete Mathematics} 341, 2018), concerning permutations with the same pinnacle set. Given $\pi\in S_n$, a {\em pinnacle} of $\pi$ is an element $\pi_i$ ($i\neq 1,n$)…

A collection $B$ of patterns is called inversion monotone if $\mathrm{av}_n^k(B)$, the number of $B$-avoiding permutations of length $n$ with $k$ inversions, is weakly increasing in $n$ for any fixed $k$. In 2012, Claesson, Jel\'inek and…

An involution in a Coxeter group has an associated set of involution words, a variation on reduced words. These words are saturated chains in a partial order first considered by Richardson and Springer in their study of symmetric varieties.…

A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$…

Let $k$ be a nonnegative integer, and let $\alpha$ and $\beta$ be two permutations of $n$ symbols. We say that $\alpha$ and $\beta$ $k$-commute if $H(\alpha\beta, \beta\alpha)=k$, where $H$ denotes the Hamming metric between permutations.…

A family $\mathcal F\subset 2^{[n]}$ is called intersecting if any two of its sets intersect. Given an intersecting family, its diversity is the number of sets not passing through the most popular element of the ground set. Peter Frankl…

Answering a question of Geoff Robinson, we compute the large n limiting proportion of i(n,q)/q^[n^2/2], where i(n,q) denotes the number of involutions in GL(n,q). We give similar results for the finite unitary, symplectic, and orthogonal…

Let $\mathcal I_k$ be the class of convex $k$-intersection bodies in $\mathbb{R}^n$ (in the sense of Koldobsky) and $\mathcal I_k^m$ be the class of convex origin-symmetric bodies all of whose $m$-dimensional central sections are…

We enumerate the numbers $Av_n^k(1324)$ of 1324-avoiding $n$-permutations with exactly $k$ inversions for all $k$ and $n \geq (k+7)/2$. The result depends on a structural characterization of such permutations in terms of a new notion of…

We consider encoding problems for range queries on arrays. In these problems the goal is to store a structure capable of recovering the answer to all queries that occupies the information theoretic minimum space possible, to within lower…