English
Related papers

Related papers: Wilf equivalence relations for consecutive pattern…

200 papers

We analyze the possibility of a spontaneous breaking of C-invariance in gauge theories with fermions in vector-like - but otherwise generic - representations of the gauge group. QCD, supersymmetric Yang-Mills theory, and orientifold field…

High Energy Physics - Theory · Physics 2008-11-26 Adi Armoni , Mikhail Shifman , Gabriele Veneziano

The main theme of this paper is the enumeration of the occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence $f_r^v(k,n),$ the number of $n$-array $k$-ary words that contain a given…

Combinatorics · Mathematics 2019-05-15 Toufik Mansour , Reza Rastegar , Alexander Roitershtein

We study a family of equivalence relations on $S_n$, the group of permutations on $n$ letters, created in a manner similar to that of the Knuth relation and the forgotten relation. For our purposes, two permutations are in the same…

Combinatorics · Mathematics 2017-08-23 William Kuszmaul , Ziling Zhou

Topologies $\tau, \sigma$ on a set $X$ are called $\pi$-compatible if $\tau$ is a $\pi$-network for $\sigma$, and vice versa. If topologies $\tau, \sigma$ on a set $X$ are $\pi$-compatible then the families of nowhere dense sets (resp.…

General Topology · Mathematics 2023-08-25 Vitalij A. Chatyrko

A set $S$ of permutations is forcing if for any sequence $\{\Pi_i\}_{i \in \mathbb{N}}$ of permutations where the density $d(\pi,\Pi_i)$ converges to $\frac{1}{|\pi|!}$ for every permutation $\pi \in S$, it holds that $\{\Pi_i\}_{i \in…

Combinatorics · Mathematics 2021-10-15 Martin Kurecka

In this note we investigate correlation inequalities for `up-sets' of permutations, in the spirit of the Harris--Kleitman inequality. We focus on two well-studied partial orders on $S_n$, giving rise to differing notions of up-sets. Our…

Combinatorics · Mathematics 2020-04-22 J. Robert Johnson , Imre Leader , Eoin Long

On an associative algebra, we introduce the concept of symmetric $(\sigma,\tau)$-derivations together with a regularity condition and prove that strongly regular symmetric $(\sigma,\tau)$-derivations are inner. Symmetric…

Quantum Algebra · Mathematics 2023-04-19 Kwalombota Ilwale

Two permutation classes, the X-class and subpermutations of the increasing oscillation are shown to exhibit an exponential Wilf-collapse. This means that the number of distinct enumerations of principal subclasses of each of these classes…

Combinatorics · Mathematics 2023-06-22 Michael Albert , Vít Jelínek , Michal Opler

Let $A$ be a unital separable \CA and $B=C\otimes {\cal K},$ where $C$ is a unital \CA. Let $\tau: A\to M(B)/B$ be a weakly unital full essential extensions of $A$ by $B.$ We show that there is a bijection between a quotient group of…

Operator Algebras · Mathematics 2007-05-23 Huaxin Lin

For $p\ge 1$ let $\varphi_p(x)=x^2/2$ if $|x|\le 1$ and $\varphi_p(x)=1/p|x|^p-1/p+1/2$ if $|x|>1$. For a random variable $\xi$ let $\tau_{\varphi_p}(\xi)$ denote $\inf\{a\ge 0:\;\forall_{\lambda\in\mathbb{R}}\;…

Probability · Mathematics 2021-09-22 Krzysztof Zajkowski

A permutation on an alphabet $ \Sigma $, is a sequence where every element in $ \Sigma $ occurs precisely once. Given a permutation $ \pi $= ($\pi_{1} $, $ \pi_{2} $, $ \pi_{3} $,....., $ \pi_{n} $) over the alphabet $ \Sigma $ =$\{ $0, 1,…

Discrete Mathematics · Computer Science 2016-01-19 Bhadrachalam Chitturi , Krishnaveni K S

In this paper, we consider the family of pattern-replacement equivalence relations referred to as the "indices and values adjacent" case. Each such equivalence is determined by a partition $P$ of a subset of $S_c$ for some $c$. In 2010,…

Combinatorics · Mathematics 2014-03-04 William Kuszmaul

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…

Combinatorics · Mathematics 2007-05-23 Eric S. Egge , Toufik Mansour

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

Representation Theory · Mathematics 2025-10-27 Ewan Cassidy

Drawing on a problem posed by Hertzsprung in 1887, we say that a given permutation $\pi\in\mathcal{S}_n$ contains the Hertzsprung pattern $\sigma\in\mathcal{S}_k$ if there is factor $\pi(d+1)\pi(d+2)\cdots\pi(d+k)$ of $\pi$ such that…

Combinatorics · Mathematics 2021-04-08 Anders Claesson

Let I_n(\pi) denote the number of involutions in the symmetric group S_n which avoid the permutation \pi. We say that two permutations \alpha,\beta\in\S{j} may be exchanged if for every n, k, and ordering \tau of j+1,...,k, we have…

Combinatorics · Mathematics 2007-05-23 Aaron D. Jaggard

We show that if a permutation $\pi$ contains two intervals of length 2, where one interval is an ascent and the other a descent, then the M\"{o}bius function $\mu[\pi]$ of the interval $[1,\pi]$ is zero. As a consequence, we show that the…

Combinatorics · Mathematics 2019-08-15 Robert Brignall , Vít Jelínek , Jan Kynčl , David Marchant

Inversion sequences are integer sequences $e=e_{1}e_{2}\dots e_{n}$ such that $0\leq e_{i}<i$ for each $i$. The study of patterns in inversion sequences was initiated by Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck in the…

Combinatorics · Mathematics 2019-06-19 Juan S. Auli , Sergi Elizalde

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$…

Combinatorics · Mathematics 2023-06-30 Gal Beniamini , Nir Lavee , Nati Linial

We continue the study of shift equivalence relations from the perspective of C*-bimodule theory. We study emerging shift equivalence relations following work of the second-named author with Carlsen and Eilers, both in terms of adjacency…

Operator Algebras · Mathematics 2024-11-11 Boris Bilich , Adam Dor-On , Efren Ruiz