Related papers: Packing sets of patterns

Permutation testing in linear models, where the number of nuisance coefficients is smaller than the sample size, is a well-studied topic. The common approach of such tests is to permute residuals after regressing on the nuisance covariates.…

Given a subset $S\subseteq\mathbb{P}$, let $\Pa(S;n)$ be the number of permutations in the symmetric group of ${1,2,...,n}$ that have peak set $S$. We prove a recent conjecture due to Billey, Burdzy and Sagan, which determines the sets that…

We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations…

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…

In this paper, we propose a general framework that extends the theory of permutation patterns to higher dimensions and unifies several combinatorial objects studied in the literature. Our approach involves introducing the concept of a…

Organising the relevant literature and by letting statistical convergence play the main role in the theory of compactness, a variant of compactness called statistical compactness has been achieved. As in case of sequential compactness, one…

We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the set without overlapping is called its {\em non-uniform…

We propose the density ratio permutation test, a hypothesis test that assesses whether the ratio between two densities is proportional to a known function based on independent samples from each distribution. The test uses an efficient…

We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

We study the factorised steady state of a general class of mass transport models in which mass, a conserved quantity, is transferred stochastically between sites. Condensation in such models is exhibited when above a critical mass density…

I give an account of the definitions of parton densities, both the conventional ones, integrated over parton transverse momentum, and unintegrated transverse-momentum-dependent densities. The aim is to get a precise and correct definition…

We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We…

In this note, we revisit a classical problem related to the density of nonlinear statistics. We obtain a new representation of densities and, for the first time, a necessary and sufficient condition for the existence of densities is…

Summarizing data samples by quantitative measures has a long history, with descriptive statistics being a case in point. However, as natural language processing methods flourish, there are still insufficient characteristic metrics to…

Hard-particle packings have served as useful starting points to study the structure of diverse systems such as liquids, living cells, granular media, glasses, and amorphous solids. Howard Reiss has played a major role in helping to…

In the context of the genome rearrangement problem, we analyze two well known models, namely the reversal and the prefix reversal models, by exploiting the connection with the notion of permutation pattern. More specifically, for any $k$,…

This paper is continuation of the study of the 1-box pattern in permutations introduced by the authors in \cite{kitrem4}. We derive a two-variable generating function for the distribution of this pattern on 132-avoiding permutations, and…

The problem of pattern selection arises when the evolution equations have many solutions, whereas observed patterns constitute a much more restricted set. An approach is advanced for treating the problem of pattern selection by defining the…

Whereas most dimensionality reduction techniques (e.g. PCA, ICA, NMF) for multivariate data essentially rely on linear algebra to a certain extent, summarizing ranking data, viewed as realizations of a random permutation $\Sigma$ on a set…

In previous work a probabilistic approach to controlling difficulties of density in hyperbolic space led to a workable notion of optimal density for packings of bodies. In this paper we extend an ergodic theorem of Nevo to provide an…