Related papers: Constraining Strong c-Wilf Equivalence Using Clust…

We determine the sharp asymptotic scale of the probability that two uniformly random permutations are comparable in weak Bruhat order, showing that $\mathbb{P}(\sigma_1 \preceq_W \sigma_2)=\exp\Bigl(\bigl(-\tfrac12+o(1)\bigr)\,n\log…

Permutation patterns and pattern avoidance are central, well-studied concepts in combinatorics and computer science. Given two permutations $\tau$ and $\pi$, the pattern matching problem (PPM) asks whether $\tau$ contains $\pi$. This…

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

In this work, a new prototype-based clustering method named Evidential C-Medoids (ECMdd), which belongs to the family of medoid-based clustering for proximity data, is proposed as an extension of Fuzzy C-Medoids (FCMdd) on the theoretical…

For a permutation $\pi$ the major index of $\pi$ is the sum of all indices $i$ such that $\pi_i > \pi_{i+1}$. It is well known that the major index is equidistributed with the number of inversions over all permutations of length $n$. In…

In this paper we study pattern-replacement equivalence relations on the set $S_n$ of permutations of length $n$. Each equivalence relation is determined by a set of patterns, and equivalent permutations are connected by pattern-replacements…

Let $F$ be a non-archimedean local field, of characteristic 0. Let $V$ be a finite dimensional vector space over $F$ and $q$ be a non-degenerate quadratic form on $V$. Denote $G$ the special orthogonal group of $(V,q)$. Let $W$ a…

The research on pattern-avoidance has yielded so far limited knowledge on Wilf-ordering of permutations. The Stanley-Wilf limits sqrt[n](|S_n(tau)|) and further works suggest asymptotic ordering of layered versus monotone patterns. Yet,…

Using the notion of compatibility between Poisson brackets and cluster structures in the coordinate rings of simple Lie groups, Gekhtman Shapiro and Vainshtein conjectured a correspondence between the two. Poisson Lie groups are classified…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

Clustering is a central approach for unsupervised learning. After clustering is applied, the most fundamental analysis is to quantitatively compare clusterings. Such comparisons are crucial for the evaluation of clustering methods as well…

We consider skew-symmetrizable (upper) cluster algebras with a compatible Poisson structure, called $\mathsf{\Lambda}$-(upper) cluster algebras. For any two good elements (e.g., cluster monomials) in a $\mathsf{\Lambda}$-upper cluster…

A permutation $\pi \in S_n$ is said to {\it avoid} a permutation $\sigma \in S_k$ whenever $\pi$ contains no subsequence with all of the same pairwise comparisons as $\sigma$. For any set $R$ of permutations, we write $S_n(R)$ to denote the…

An exponential-time exact algorithm is provided for the task of clustering n items of data into k clusters. Instead of seeking one partition, posterior probabilities are computed for summary statistics: the number of clusters, and pairwise…

Let $E/F$ be a quadratic extension of $p$-adic fields and let $d$, $m$ be nonnegative integers of distinct parities. Fix admissible irreducible tempered representations $\pi$ and $\sigma$ of $GL_d(E)$ and $GL_m(E)$ respectively. We assume…

We study the large sample behavior of a convex clustering framework, which minimizes the sample within cluster sum of squares under an~$\ell_1$ fusion constraint on the cluster centroids. This recently proposed approach has been gaining in…

We use very large cosmological N--body simulations to obtain accurate predictions for the two-point correlations and power spectra of mass-limited samples of galaxy clusters. We consider two currently popular cold dark matter (CDM)…

The Permutation Pattern Matching problem asks, given two permutations $\sigma$ on $n$ elements and $\pi$, whether $\sigma$ admits a subsequence with the same relative order as $\pi$ (or, in the counting version, how many such subsequences…

The sign coherence phenomenon is an important feature of c-vectors in cluster algebras with principal coefficients. In this note, we consider a more general version of c-vectors defined for arbitrary cluster algebras of geometric type and…

Two permutations $(x_1,\dots,x_w)$ and $(y_1,\dots,y_w)$ are weakly similar if $x_i<x_{i+1}$ if and only if $y_i<y_{i+1}$ for all $1\leqslant i \leqslant w$. Let $\pi$ be a permutation of the set $[n]=\{1,2,\dots, n\}$ and let $wt(\pi)$…