We introduce a tiling problem between bounded open convex polyforms P ^⊂ℝ 2 with colored directed edges. If there exists of the polyform ^ by 1 , we construct monomorphism from sandpile group G Γ =ℤ /Δ(ℤ ) on =P ∩ℤ to one . provide several examples infinite series such tilings converging ℝ and thus define limit plane.

Plan-subplan matching is an important step in case-based plan recognition. We present RelaxedVF2, an algorithm for plan-subplan matching for plans encoded using the Action Sequence Graph representation. RelaxedVF2 is a subgraph monomorphism algorithm that affords flexibility and error tolerance for plan-subplan matching. We present a study comparing RelaxedVF2 with an alternate degreesequence m...

We show that if G is a fundamental group of a finite k-acylindrical graph of groups where every vertex group is word-hyperbolic and where every edge-monomorphism is a quasi-isometric embedding, then all the vertex groups are quasiconvex in G (the group G is word-hyperbolic by the Combination Theorem of M.Bestvina and M.Feighn). This allows one, in particular, to approximate the word metric on G...

‎given an integer $n$‎, ‎we denote by $mathfrak b_n$ and $mathfrak c_n$ the classes of all groups $g$ for which the map $phi_{n}:gmapsto g^n$ is a monomorphism and an epimorphism of $g$‎, ‎respectively‎. ‎in this paper we give a characterization for groups in $mathfrak b_n$ and for groups in $mathfrak c_n$‎. ‎we also obtain an arithmetic description of the set of all integers $n$ such that a gr...