objective: this in vitro study evaluated the fracture strength and bending amount of twotypes of fiber reinforced composite (frc) and cast metal frameworks used for fabrication of inlay fixed partial dentures (ifpds). materials and methods: seventy-two extracted first maxillary premolars and molars (36 each) were embedded in acrylic resin to represent a missing of second maxillary premolar. frc...

In this paper we construct a new interactive identification scheme based on the conjugacy problem. We prove that this scheme is secure against passive attacks if the matching triple search problem (MTSP) is intractable. Our proof is based on the fact that the conjugacy search problem (CSP) is hard in braid group, on the other hand, the conjugacy decision problem (CDP) is easy in braid group by ...

We consider the Magnus representation of the image of the braid group under the generalizations of the standard Artin representation discovered by M. Wada. We show that the images of the generators of the braid group under the Magnus representation are unitary relative to a Hermitian matrix. As a special case, we get that the Burau representation is unitary, which was known and proved by C. C. ...

The braid group Bn is the mapping class group of an n-times punctured disk. The Iwahori-Hecke algebra Hn is a quotient of the braid group algebra of Bn by a quadratic relation in the standard generators. We discuss how to use Hn to define the Jones polynomial of a knot or link. We also summarize the classification of the irreducible representations of Hn. We conclude with some directions for fu...

After making some basic definitions and results on links and braids, we focus on computational problems concerning the braid group such as the word and conjugacy problems and examine the recent use of the braid group and these problems in cryptography. We finally consider the NP-completeness of the NON-MINIMAL BRAIDS problem. We also briefly present some open problems as well as some basic noti...

Let A be an arrangement of n complex hyperplanes. The fundamental group of the complement of A is determined by a braid monodromy homomorphism, : Fs ! Pn. Using the Gassner representation of the pure braid group, we nd an explicit presentation for the Alexander invariant of A. From this presentation, we obtain combinatorial lower bounds for the ranks of the Chen groups of A. We also provide a c...

Our purpose is to describe a promising linear algebraic attack on the AAFG1 braid group cryptosystem proposed in [2] employing parameters suggested by the authors. Our method employs the well known Burau matrix representation of the braid group and techniques from computational linear algebra and provide evidence which shows that at least a certain class of keys are weak. We argue that if AAFG1...

Let A be an arrangement of n complex hyperplanes. The fundamental group of the complement of A is determined by a braid monodromy homomorphism, α : Fs → Pn. Using the Gassner representation of the pure braid group, we find an explicit presentation for the Alexander invariant of A. From this presentation, we obtain combinatorial lower bounds for the ranks of the Chen groups of A. We also provide...

This paper is devoted to characterizations of the (reduced) Burau representation of the Artin braid group, in terms of rigid local systems. We prove that the Burau representation is the only representation of the Hecke algebra for which some local system associated to every linear representation of the braid group is irreducible and rigid in the sense of Katz. We also use previous results to gi...