Related papers: Covering n-Permutations with (n+1)-Permutations

A covering array CA(N; t; k; v) is an N x k array on v symbols such that every N x t subarray contains as a row each t-tuple over the v symbols at least once. The minimum N for which a CA(N; t; k; v) exists is called the covering array…

Say that a cardinal number $\kappa$ is \emph{small} relative to the space $X$ if $\kappa <\Delta(X)$, where $\Delta(X)$ is the least cardinality of a non-empty open set in $X$. We prove that no Baire metric space can be covered by a small…

In 1984, Ditor asked two questions: (1) For each $n\in\omega$ and infinite cardinal $\kappa$, is there a join-semilattice of breadth $n+1$ and cardinality $\kappa^{+n}$ whose principal ideals have cardinality $< \kappa$? (2) For each $n \in…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…

This paper has two agendas. Firstly, we exhibit new results for coverage processes. Let $p(n,m,\alpha)$ be the probability that $n$ spherical caps of angular radius $\alpha$ in $S^m$ do not cover the whole sphere $S^m$. We give an exact…

Let $\kappa$ be a regular limit cardinal, $\kappa \subseteq A$. We study a notion of $n$-s-stationarity on $\mathcal{P}_{\kappa}(A)$. We construct a sequence of topologies $\langle \tau_0, \tau_1, \dots \rangle $ on…

A permutation is $k$-coverable if it can be partitioned into $k$ monotone subsequences. Barber conjectured that, for any given permutation, if every subsequence of length $k+2 \choose 2$ is $k$-coverable then the permutation itself is…

We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, on some cardinals as large as the whole clone…

This letter gives approximations to an integral appearing in the formula for downlink coverage probability of a typical user in Poisson point process (PPP) based stochastic geometry frameworks of the form $\int_0^\infty \exp\{ - (Ax + B…

Let $n$ be a fixed integer with $n\geq 2$. For $i,j\in\mathbb{Z}_n$, define $||i,j||_n$ to be the distance between $i$ and $j$ when the elements of $\mathbb{Z}_n$ are written in a cycle. So $||i,j||_n=\min\{(i-j)\bmod n,(j-i)\bmod n\}$. For…

A permutation p is realized by the shift on N symbols if there is an infinite word on an N-letter alphabet whose successive left shifts by one position are lexicographically in the same relative order as p. The set of realized permutations…

We can generalize the definition of {\it splitting number } $s(\kappa )$ for $\kappa$ uncountable regular: $s(\kappa )=min\{ |\Cal S|:\Cal S\subset \Cal P(\kappa ) \forall a\in \kappa ^\kappa \exists b\in \Cal S |a\cap b|=|a\setminus…

Let $S_{\rm div}(n)$ denote the set of permutations $\pi$ of $n$ such that for each $1\leq j \leq n$ either $j \mid \pi(j)$ or $\pi(j) \mid j$. These permutations can also be viewed as vertex-disjoint directed cycle covers of the divisor…

Let $\kappa$ be an uncountable cardinal with $\kappa=\kappa^{{<}\kappa}$. Given a cardinal $\mu$, we equip the set ${}^\kappa\mu$ consisting of all functions from $\kappa$ to $\mu$ with the topology whose basic open sets consist of all…

An accessing set in a graph is a subset B of vertices such that there exists D subset of B, such that each vertex of V\B has an even number of neighbors in D. In this paper, we introduce new bounds on the minimal size kappa'(G) of an…

In [8] the second and third authors showed that if the least inaccessible cardinal is the least measurable cardinal, then there is an inner model with $o(\kappa)\geq2$. In this paper we improve this to $o(\kappa)\geq\kappa+1$ and show that…

We resolve the space complexity of single-pass streaming algorithms for approximating the classic set cover problem. For finding an $\alpha$-approximate set cover (for any $\alpha= o(\sqrt{n})$) using a single-pass streaming algorithm, we…

We consider averages $\kappa$ of spectral measures of rank one perturbations with respect to a $\sigma$-finite measure $\nu$. It is examined how various degrees of continuity of $\nu$ with respect to $\alpha$-dimensional Hausdorff measures…

Let $s$ be West's deterministic stack-sorting map. A well-known result (West) is that any length $n$ permutation can be sorted with $n-1$ iterations of $s.$ In 2020, Defant introduced the notion of highly-sorted permutations -- permutations…