It is known that a number of algebraic properties of the braid groups extend to arbitrary finite Coxeter type Artin groups. Here we show how to extend the results to more general groups that we callâ€¦ (More)

Let M be a surface, let N be a subsurface of M , and let n â‰¤ m be two positive integers. The inclusion of N in M gives rise to a homomorphism from the braid group BnN with n strings on N to the braidâ€¦ (More)

Let Bn be the Artin braid group on n strings with standard generators Ïƒ1, . . . , Ïƒnâˆ’1 , and let SBn be the singular braid monoid with generators Ïƒ Â±1 1 , . . . , Ïƒ Â±1 nâˆ’1, Ï„1, . . . , Ï„nâˆ’1 . Theâ€¦ (More)

Let A be an Artin group with standard generating set {Ïƒs : s âˆˆ S}. Tits conjectured that the only relations in A amongst the squares of the generators are consequences of the obvious ones, namelyâ€¦ (More)

We prove that an infinite irreducible Coxeter group cannot be a non-trivial direct product. Let W be a Coxeter group, and write W = W1 Ã— Â· Â· Â· Ã— Wp Ã— Wp+1, where W1, . . . , Wp are infiniteâ€¦ (More)

In this paper, it was concluded that embedding memories into an SOC increases bandwidth, speed, and reliability of the overall system, while reducing power consumption and form factor. Embedded DRAMâ€¦ (More)

Let V be a real vector space. An arrangement of hyperplanes in F is a finite set si of hyperplanes through the origin. A chamber of si is a connected component of V (\JhÂ£& ") â– The arrangement si isâ€¦ (More)

This paper presents three heuristic functions that aim to reduce the search cost for the knight tour problem. The first heuristic, h1a, is an interesting case of study that illustrates heuristicâ€¦ (More)