Related papers: Uniquely-Wilf classes

Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…

We provide a geometric condition that guarantees strong Wilf equivalence in the generalized factor order. This provides a powerful tool for proving specific and general Wilf equivalence results, and several such examples are given.

Two Delone sets are bounded distance equivalent to each other if there is a bijection between them such that the distance of corresponding points is uniformly bounded. Bounded distance equivalence is an equivalence relation. We show that…

We investigate the structure of finite groups whose non-central real class sizes have the same $2$-part. In particular, we prove that such groups are solvable and have $2$-length one. As a consequence, we show that a finite group is…

We prove that the number of permutations which avoid 132-patterns and have exactly one 123-pattern equals (n-2)2^(n-3). We then give a bijection onto the set of permutations which avoid 123-patterns and have exactly one 132-pattern.…

We study the equidistribution of mesh patterns of length 2. We show that the number of equidistribution equivalence classes lies between 105 and 108, and conjecture that it is exactly 105. As a consequence, we obtain an upper bound of 49…

The Collatz map is defined for a positive even integer as half that integer, and for a positive odd integer as that integer threefold, plus one. The Collatz conjecture states that when the map is iterated the number one is eventually…

It is known that there are only finitely many mutation-equivalence classes with a given singularity content, and each of these equivalence classes contains only finitely many minimal polygons. We describe an efficient algorithm to classify…

The finite groups having an indecomposable polynomial invariant whose degree is at least half of the order of the group are classified. Apart from four sporadic exceptions these are exactly the groups having a cyclic subgroup of index at…

As a consequence of the classification of finite simple groups, the classification of permutation groups of prime degree is complete, apart from the question of when the natural degree $(q^n-1)/(q-1)$ of ${\rm L}_n(q)$ is prime. We present…

We prove that the cardinality of transitive quasi-uniformities in a quasi-proximity class is at least $2^{2^{\aleph_0}}$ if there exist at least two transitive quasi-uniformities in the class. The transitive elements of $\pi(\delta)$ are…

We study the $\{1234, 3412\}$ pattern-replacement equivalence relation on the set $S_n$ of permutations of length $n$, which is conceptually similar to the Knuth relation. In particular, we enumerate and characterize the nontrivial…

Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be…

Ellis, Friedgut and Pilpel proved that for large enough $n$, a $t$-intersecting family of permutations contains at most $(n-t)!$ permutations. Their main theorem also states that equality holds only for $t$-cosets. We show that their proof…

We consider avoidance of permutation patterns with designated gap sizes between pairs of consecutive letters. We call the patterns having such constraints distant patterns (DPs) and we show their relation to other pattern notions…

For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A iff each one is a substitution instance of the other using operations from C. We study the clones for…

With an easily applicable criterion based on permutation symmetries of (identically prepared) replicas of quantum states we identify distinct entanglement classes in high-dimensional multi- partite systems. The different symmetry properties…

Given k sets such that no one is contained in another, there is an associated lattice on the power set P([k]) corresponding to inclusion relations among unions of the sets. Two lattices on P([k]) are equivalent if there is a permutation of…

Let $V_n$ be the number of equivalence classes of invertible maps from $\{0,1\}^n$ to $\{0,1\}^n$, under action of permutation of variables on domain and range. So far, the values $V_n$ have been known for $n\le 6$. This paper describes the…

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…