Related papers: On the centrosymmetric permutations in a class

We are interested in a fragmentation process. We observe fragments frozen when their sizes are less than $\epsilon$ ($\epsilon$ > 0). Is is known ([BM05]) that the empirical measure of these fragments converges in law, under some…

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…

We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…

This paper concerns the asymptotic behaviour of solutions of a linear convolution Volterra summation equation with an unbounded forcing term. In particular, we suppose the kernel is summable and ascribe growth bounds to the exogenous…

We complete the derived equivalence classification of all symmetric algebras of polynomial growth, by solving the subtle problem of distinguishing the standard and nonstandard nondomestic symmetric algebras of polynomial growth up to…

We consider the eigenvectors of symmetric matrices with independent heavy tailed entries, such as matrices with entries in the domain of attraction of $\alpha$-stable laws, or adjacencymatrices of Erdos-Renyi graphs. We denote by…

We introduce the "Median Inverse Problem" for metric spaces. In particular, having a permutation $\pi$ in the symmetric group $S_n$ (endowed with the breakpoint distance), we study the set of all $k$-subsets $\{x_1,...,x_k\}\subset S_n$ for…

Permutation Pattern Matching (PPM) is the problem of deciding for a given pair of permutations P and T whether the pattern P is contained in the text T. Bose, Buss and Lubiw showed that PPM is NP-complete. In view of this result, it is…

This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction…

We consider the problem of estimating the division rate of a size-structured population in a nonparametric setting. The size of the system evolves according to a transport-fragmentation equation: each individual grows with a given transport…

We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…

For any smooth compact manifold $W$ of dimension at least two we prove that the classifying spaces of its group of diffeomorphisms which fix a set of $k$ points or $k$ embedded disks (up to permutation) satisfy homology stability. The same…

Symmetry is a key feature observed in nature (from flowers and leaves, to butterflies and birds) and in human-made objects (from paintings and sculptures, to manufactured objects and architectural design). Rotational, translational, and…

The juxtaposition of permutation classes $\mathcal{C}$ and $\mathcal{D}$ is the class of all permutations formed by concatenations $\sigma\tau$, such that $\sigma$ is order isomorphic to a permutation in $\mathcal{C}$, and $\tau$ to a…

The present paper is devoted to the study of classes of mappings with non--bounded characteristics of quasiconformality. It is proved that the normal families of mappings distorting the families of mappings in ${\Bbb R}^n$ by special way,…

In this paper, we consider the moments of statistics on conjugacy classes of the colored permutation groups $\mathfrak{S}_{n,r}=\mathbb{Z}_r\wr \mathfrak{S}_n$. We first show that any fixed moment coincides on all conjugacy classes where…

For the elements of a Coxeter group, we present a statistic called depth, defined in terms of factorizations of the elements into products of reflections. Depth is bounded above by length and below by the average of length and reflection…

Fix $q\neq 1$, and sample $w\in S_n$ from the Mallows measure. We study the distribution of $C_i(w)$, the number of $i$-cycles, as $n$ grows large. When $q<1$, they are jointly Gaussian, and this more or less follows from known ideas, but…

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

The goal of this note is to prove a compact embedding result for spaces of forward rate curves. As a consequence of this result, we show that any forward rate evolution can be approximated by a sequence of finite dimensional processes in…