Related papers: Binary operations on pattern-avoiding cycles

A main result is that, roughly, a dense set of the infinitesimal trace-preserving deformations of a semicircular system $s_1,..., s_n$ arise from one-parameter groups of automorphisms of the free-group factor $L(F(n))$ generated by…

This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…

We construct an uncountable family of finitely generated groups of intermediate growth, with growth functions of new type. These functions can have large oscillations between lower and upper bounds, both of which come from a wide class of…

Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…

We study higher-loop orders of spin bit models underlying the non-planar dynamics of $\mathcal{N}=4$ SYM gauge theory. In particular, we derive a ''tower'' of non-planar identities involving products of site permutation operators. Such…

In combinatorics on words, a word w over an alphabet Sigma is said to avoid a pattern p over an alphabet Delta if there is no factor x of w and no non-erasing morphism h from Delta^* to Sigma^* such that h(p) = x. Bell and Goh have recently…

We contribute towards the classification programme for Conway groupoids associated to a $2-(n,4,\lambda)$ design. Our main results improve the known bounds for a hole stabilizer to be primitive, or to contain the alternating group, ${\rm…

$n$-cycle permutations with small $n$ have the advantage that their compositional inverses are efficient in terms of implementation. They can be also used in constructing Bent functions and designing codes. Since the AGW Criterion was…

In this paper we study $k$-noncrossing, canonical RNA pseudoknot structures with minimum arc-length $\ge 4$. Let ${\sf T}_{k,\sigma}^{[4]} (n)$ denote the number of these structures. We derive exact enumeration results by computing the…

We study the structure of 01-matrices avoiding a pattern P as an interval minor. We focus on critical P-avoiders, i.e., on the P-avoiding matrices in which changing a 0-entry to a 1-entry always creates a copy of P as an interval minor. Let…

For $n \in \mathbb{N}$, let $[n] = \{1, 2, \ldots, n\}$ be an $n$ - element set. As usual, we denote by $I_n$ the symmetric inverse semigroup on $[n]$, i.e. the partial one-to-one transformation semigroup on $[n]$ under composition of…

Let G be a semisimple Lie group with associated symmetric space D, and let Gamma subset G be a cocompact arithmetic group. Let L be a lattice inside a Z Gamma-module arising from a rational finite-dimensional complex representation of G.…

We consider the enumeration of ordered set partitions avoiding a permutation pattern, as introduced by Godbole, Goyt, Herdan and Pudwell. Let $\op_{n,k}(p)$ be the number of ordered set partitions of $\{1,2,\ldots,n\}$ into $k$ blocks that…

In this paper we study the cyclic inverse monoid $\CI_n$ on a set $\Omega_n$ with $n$ elements, i.e. the inverse submonoid of the symmetric inverse monoid on $\Omega_n$ consisting of all restrictions of the elements of a cyclic subgroup of…

In this paper, we compute the distributions of the statistic number of crossings over permutations avoiding one of the pairs $\{321,231\}$, $\{123,132\}$ and $\{123,213\}$. The obtained results are new combinatorial interpretations of two…

If a group $G$ is the union of proper subgroups $H_1, \dots, H_k$, we say that the collection $\{H_1, \dots H_k \}$ is a cover of $G$, and the size of a minimal cover (supposing one exists) is the covering number of $G$, denoted…

Centrosymmetric involutions in the symmetric group S_{2n} are permutations \pi such that \pi=\pi^{-1} and \pi(i)+\pi(2n+1-i)=2n+1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the…

Defant and Zheng introduced a consecutive-pattern-avoiding stack sort map $SC_{\sigma}$, where the stack must avoid a consecutive pattern $\sigma$. Seidel and Sun disproved a conjecture in Defant and Zheng's paper about the maximum…

Klazar defined and studied a notion of pattern avoidance for set partitions, which is an analogue of pattern avoidance for permutations. Sagan considered partitions which avoid a single partition of three elements. We enumerate partitions…

To each supersimple $2-(n,4,\lambda)$ design $\mathcal{D}$ one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid associated to $M_{13}$ which is constructed from $\mathbb{P}_3$.…