Related papers: Isomorphisms between pattern classes

Let $A$ and $B$ be two connected graded algebras finitely generated in degree one. If $A$ is isomorphic to $B$ as ungraded algebras, then they are also isomorphic to each other as graded algebras.

If two schemes are isomorphic, then their $m$-jet schemes are isomorphic for all $m$. In this paper we consider the converse problem. We prove that if an isomorphism of the $m$-jet schemes is induced from a morphism of the base schemes,…

We consider 9 infinite families of finite $p$-groups, for $p$ a prime, and we settle the isomorphism problem that arises when the parameters that define these groups are modified.

We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

We define a statistic on the graph of commutation classes of a permutation of the symmetric group which is used to show that these graphs are equipped with a ranked poset structure, with a minimum and maximum. This characterization also…

The concepts of symmetry and its breakdown are investigated in two different terms according to whether the resulting asymmetry is universal or only obtained for a special configuration: we shall illustrate this by considering in the first…

We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a…

A criterion is given which assures that two p-divisible groups X and Y over an algebraically closed field of characteristic p are isomorphic when their p-kernels X[p] and Y[p] are isomorphic.

Constellations are partial algebras that are one-sided generalisations of categories. It has previously been shown that the category of inductive constellations is isomorphic to the category of left restriction semigroups. Here we consider…

The class of all quasigroups is covered by six classes: the class of all asymmetric quasigroups and five varieties of quasigroups (commutative, left symmetric, right symmetric, semi-symmetric and totally symmetric). Each of these classes is…

We prove that if $G$ is finite 2-generated $p$-group of nilpotence class at most 2 then the group algebra of $G$ with coefficients in the field with $p$ elements determines $G$ up to isomorphisms.

The Modular Isomorphism Problem asks if an isomorphism of group algebras of two finite p-groups G and H over a field of characteristic p, implies an isomorhism of the groups G and H. We survey the history of the problem, explain strategies…

We hope to see how much for a model M of some completion T of PA (Peano Arithmetic) does M restriction {<} determine M, say up to isomorphism. We advance in characterizing for non-standard models M of PA the "minimal" set {(a,b):n < a < b…

An alternating sign matrix is a square matrix satisfying (i) all entries are equal to 1, -1 or 0; (ii) every row and column has sum 1; (iii) in every row and column the non-zero entries alternate in sign. The 8-element group of symmetries…

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…

Type isomorphism is useful for retrieving library components, since a function in a library can have a type different from, but isomorphic to, the one expected by the user. Moreover type isomorphism gives for free the coercion required to…

We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations…