相关论文: Binary operations on pattern-avoiding cycles

In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare…

Pattern classes which avoid 321 and other patterns are shown to have the same growth rates as similar (but strictly larger) classes obtained by adding articulation points to any or all of the other patterns. The method of proof is to show…

A partition $\alpha$ is said to contain another partition (or pattern) $\mu$ if the Ferrers board for $\mu$ is attainable from $\alpha$ under removal of rows and columns. We say $\alpha$ avoids $\mu$ if it does not contain $\mu$. In this…

We enumerate 132-avoiding permutations of order 3 in terms of the Catalan and Motzkin generating functions, answering a question of B\'{o}na and Smith from 2019. We also enumerate 231-avoiding permutations that are composed only of…

In their study of cyclic pattern containment, Domagalski et al. conjecture differential equations for the generating functions of circular permutations avoiding consecutive patterns of length 3. In this note, we prove and significantly…

Let $G$ be a finite group, and let $r_{3}(G)$ represent the size of the largest subset of $G$ without non-trivial three-term progressions. In a recent breakthrough, Croot, Lev and Pach proved that $r_{3}(C_{4}^{n}) \leqslant (3.61)^{n}$,…

A permutation $\sigma\in\mathfrak{S}_n$ is simsun if for all $k$, the subword of $\sigma$ restricted to $\{1,...,k\}$ does not have three consecutive decreasing elements. The permutation $\sigma$ is double simsun if both $\sigma$ and…

Let C be an arbitrary simple-root cyclic code and let G be the subgroup of Aut(C) (the automorphism group of C) generated by the multiplier, the cyclic shift and the scalar multiplications. To the best of our knowledge, the subgroup G is…

Using a result of Longo and Xu, we show that the anomaly arising from a cyclic permutation orbifold of order 3 of a holomorphic conformal net $\mathcal A$ with central charge $c=8k$ depends on the "gravitational anomaly" $k\pmod 3$. In…

We provide a growth bound for the operator norm of $C_0$-semigroups on Hilbert spaces under a corresponding growth bound on the resolvent of the semigroup generator. For some super-linear resolvent growths, our estimate is sharper than the…

We establish an improved lower bound of 10.271 for the exponential growth rate of the class of permutations avoiding the pattern 1324, and an improved upper bound of 13.5. These results depend on a new exact structural characterisation of…

Given a permutation $\sigma = \sigma_1 \ldots \sigma_n$ in the symmetric group $\mathcal{S}_{n}$, we say that $\sigma_i$ matches the quadrant marked mesh pattern $\mathrm{MMP}(a,b,c,d)$ in $\sigma$ if there are at least $a$ points to the…

A set partition $\sigma$ of $[n]=\{1,\cdots ,n\}$ contains another set partition $\omega$ if a standardized restriction of $\sigma$ to a subset $S\subseteq[n]$ is equivalent to $\omega$. Otherwise, $\sigma$ avoids $\omega$. Sagan and Goyt…

We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary…

Let $A_2(n,d)$ be the maximum size of a binary code of length $n$ and minimum distance $d$. In this paper we present the following new lower bounds: $A_2(18,4) \ge 5632$, $A_2(21,4) \ge 40960$, $A_2(22,4) \ge 81920$, $A_2(23,4) \ge 163840$,…

Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive.…

We revisit the main result of Carmosino et al \cite{CILM18} which shows that an $\Omega(n^{\omega/2+\epsilon})$ size noncommutative arithmetic circuit size lower bound (where $\omega$ is the matrix multiplication exponent) for a…

A set of permutations is called sign-balanced if the set contains the same number of even permutations as odd permutations. Let $S_n(\sigma_1, \sigma_2, \ldots, \sigma_r)$ be the set of permutations in the symmetric group $S_n$ which avoids…

Let $G$ be the alternating group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…

Pattern avoidance for permutations has been extensively studied, and has been generalized to vincular patterns, where certain elements can be required to be adjacent. In addition, cyclic permutations, i.e., permutations written in a circle…