Related papers: Isomorphisms between pattern classes
We study the probability of a given element, in the commutator subgroup of a group, to be equal to a commutator of two randomly chosen group elements, and compute explicit formulas for calculating this probability for some interesting…
Determining whether two STRIPS planning instances are isomorphic is the simplest form of comparison between planning instances. It is also a particular case of the problem concerned with finding an isomorphism between a planning instance…
Suppose that $X$ and $Y$ are surfaces of finite topological type, where $X$ has genus $g\geq 6$ and $Y$ has genus at most $2g-1$; in addition, suppose that $Y$ is not closed if it has genus $2g-1$. Our main result asserts that every…
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 $p\in(1,\infty)\backslash\{2\}$. We show that every homomorphism from a $C^{*}$-algebra $\mathcal{A}$ into $B(l^{p}(J))$ satisfies a compactness property where $J$ is any set. As a consequence, we show that a $C^{*}$-algebra…
We consider the set of permutations that are sorted after two passes through a pop stack. We characterize these permutations in terms of forbidden patterns (classical and barred) and enumerate them according to the ascent statistic. Then we…
Let $p$ be a prime number, let $d$ be an integer and let $G$ be a $d$-generated finite $p$-group of nilpotency class smaller than $p$. Then the number of possible isomorphism types for the mod $p$ cohomology algebra $H^*(G;{\mathbb F}_p)$…
A partial automorphism of a semigroup $S$ is any isomorphism between its subsemigroups, and the set all partial automorphisms of $S$ with respect to composition is the inverse monoid called the partial automorphism monoid of $S$. Two…
If $G$ is the symmetry group of an uncolored pattern then a coloring of the pattern is semiperfect if the associated color group $H$ is a subgroup of $G$ of index 2. We give results on how to identify and enumerate all inequivalent…
In our previous paper math/0502157 we classified a large class of finite-dimensional pointed Hopf algebras up to isomorphism. However the following problem was left open for Hopf algebras of of type $A,D$ or $E_6$, that is whose Cartan…
We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…
We consider a class of graphs subject to certain restrictions, including the finiteness of diameters. Any surjective mapping $\phi:\Gamma\to\Gamma'$ between graphs from this class is shown to be an isomorphism provided that the following…
We define here the category of partial differential equations. Special cases of morphisms from an object (equation) are symmetries of the equation and reductions of the equation by a symmetry groups, but there are many other morphisms. We…
The NP-complete Permutation Pattern Matching problem asks whether a permutation P (the pattern) can be matched into a permutation T (the text). A matching is an order-preserving embedding of P into T. In the Generalized Permutation Pattern…
A loop whose inner mappings are automorphisms is an \emph{automorphic loop} (or \emph{A-loop}). We characterize commutative (A-)loops with middle nucleus of index 2 and solve the isomorphism problem. Using this characterization and certain…
A P-set of a symmetric matrix $A$ is a set $\alpha$ of indices such that the nullity of the matrix obtained from $A$ by removing rows and columns indexed by $\alpha$ is $|\alpha|$ more than that of $A$. It is known that each subset of a…
In this article, we study the invariant differential forms which a correspondence of curves admits. We also try to classify the correspondences of $\mathbb{P}^1$ that admits such invariant differential forms.
We define {\em incidence matrices} to be zero-one matrices with no zero rows or columns. A classification of incidence matrices is considered for which conditions of symmetry by transposition, having no repeated rows/columns, or…
\noindent In our contribution to this volume we deal with \emph{discrete} symmetries: these are symmetries based upon groups with a discrete set of elements (generally a set of elements that can be enumerated by the positive integers). In…
Permutation Pattern Matching (PPM) is the problem of deciding for a given pair of permutations P and T whether the pattern P is contained in the text T. Bose, Buss and Lubiw showed that PPM is NP-complete. In view of this result, it is…