Related papers: Isomorphisms between pattern classes
Although the conjugacy classes of the general linear group are known, it is not obvious (from the canonic form of matrices) that two permutation matrices are similar if and only if they are conjugate as permutations in the symmetric group,…
Since the introduction of the concept of isotopism of algebras by Albert in 1942, a prolific literature on the subject has been developed for distinct types of algebras. Nevertheless, there barely exists any result on the problem of…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutation consists of the skew sum of a sequence of plane trees, together with an increasing sequence of points above and an increasing sequence of…
We prove some noncommutative analogues of a theorem by Plotkin and Rudin about isometries between subspaces of Lp-spaces. Let 0<p<\infty, p not an even integer. The main result of this paper states that in the category of unital subspaces…
When a set of permutations comprising a pattern class C is submitted as input to a priority queue the resulting output is again a pattern class C'. The basis of C' is determined for pattern classes C whose basis elements have length 3, and…
We prove that each isometric isomorphism, between the monoids of all nonegative 1-Lipschitz maps defined on invariant metric groups and equiped with the inf-convolution law, is given canonically from an isometric isomorphism between their…
The concept of complexity appears in virtually all areas of knowledge. Its intuitive meaning shares similarities across fields, but disagreements between its details hinders a general definition, leading to a plethora of proposed…
A permutation of size $n$ can be identified to its diagram in which there is exactly one point per row and column in the grid $[n]^2$. In this paper we consider multidimensional permutations (or $d$-permutations), which are identified to…
Subgraph Isomorphism uses a small graph as a pattern to identify within a larger graph a set of vertices that have matching edges. This paper addresses a logic program written in Prolog for a specific relatively complex graph pattern for…
In this note, we establish an equivalence of categories between the category of all eight-dimensional composition algebras with any given quadratic form $n$ over a field $k$ of characteristic not two, and a category arising from an action…
We introduce the notion of a topological symmetry as a quantum mechanical symmetry involving a certain topological invariant. We obtain the underlying algebraic structure of the Z_2-graded uniform topological symmetries of type (1,1) and…
Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.
As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of straight segments at 45 degree angles, and the permutation is…
In this paper, we study the structure of finite groups with a large number of conjugacy classes of $p$-elements for some prime $p$. As consequences, we obtain some new criteria for the existence of normal $p$-complements in finite groups.
For each natural number $n$, we define a category whose objects are discriminant algebras in rank $n$, i.e. functorial means of attaching to each rank-$n$ algebra a quadratic algebra with the same discriminant. We show that the discriminant…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
We compare a piecewise linear map with constant slope beta>1 and a piecewise linear map with constant slope -beta. These maps are called the positive and negative beta-transformations. We show that for a certain set of beta's, the…
Symmetry is an important feature of many constraint programs. We show that any symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Different symmetries pick out different solutions in each symmetry…