Mina Teicher

Learn More
Anshel, et. al., introduced a new cryptographic protocol, the Commutator key agreement protocol, whose strength lies heavily on the difficulty of the generalized conjugacy problem in subgroups of the Braid group. A natural approach to this problem is by using a length-based method, with the length of the Garside normal form as a length function. Experiments(More)
Given a system of equations in a “random” finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability. Moreover, with a significant probability, the solution will be the first in the list. This gives a probabilistic solution(More)
Despite many reports indicating the existence of precise firing sequences in cortical activity, serious objections have been raised regarding the statistics used to detect them and the relations of these sequences to behavior. We show that in behaving monkeys, pairs of spikes from different neurons tend to prefer certain time delays when measured in(More)
This paper presents and describes a quotient of the Artin braid group by commutators of transversal half-twists and investigates its group actions. We denote the quotient by B̃n and refer to the groups which admit an action of B̃n as B̃n-groups. The group B̃n is an extension of a solvable group by a symmetric group. We distinguish special elements in(More)
In this paper we show that fundamental groups of complements of curves are “small” in the sense that they are “almost solvable”. Thus we can start to compute π2 as a module over π1 in order to produce new invariants of surfaces that might distinguish different components of a moduli space. 0. Applications of the calculations of fundamental groups to(More)
On March 2004, Anshel, Anshel, Goldfeld, and Lemieux introduced the Algebraic Eraser scheme for key agreement over an insecure channel. This scheme is based on semidirect products of algebraic structures, and uses a novel hybrid of infinite and finite noncommutative groups. They also introduced the Colored Burau Key Agreement Protocol (CBKAP), a concrete(More)
The multiple view geometry of static scenes is now well understood. Recently attention was turned to dynamic scenes where scene points may move while the cameras move. The triangulation of linear trajectories is now well handled. The case of quadratic trajectories also received some attention. We present a complete generalization and address the problem of(More)
The main result in this paper is as follows: Theorem. Let S be the branch curve in CP of a generic projection of a Veronese surface. Then π1(CP −S) is an extension of a solvable group by a symmetric group. A group with the property mentioned in the theorem is “almost solvable” in the sense that it contains a solvable normal subgroup of finite index. We pose(More)
Let T be the complex projective torus, and X the surface CP × T . Let XGal be its Galois cover with respect to a generic projection to CP . In this paper we compute the fundamental group of XGal , using the degeneration and regeneration techniques, the Moishezon-Teicher braid monodromy algorithm and group calculations. We show that π1(XGal) = Z 10 . AMS(More)