arXiv subjects
Publications and source records attributed to Rehana Ashraf.
Different ways to describe a permutation, as a sequence of integers, or a product of Coxeter generators, or a tree, give different choices to define a simple permutation. We recollect few of them, define new types of simple permutations, and analyze their interconnections and some asymptotic and geometrical properties of these classes.
The paper contains enumerative combinatorics for positive braids, square free braids, and simple braids, emphasizing connections with classical Fibonacci sequence. The simple subgraph of the Cayley graph of the braid group is analyzed in the final part.
We study a subset of square free positive braids and we give a few algebraic characterizations of them and one geometric characterization: the set of positive braids whose closures are unlinks. We describe canonical forms of these braids and of their conjugacy classes.
Turning the skein relation for HOMFLY into a Fibonacci recurrence, we prove that there are only three rational specializations of HOMFLY polynomial: Alexander-Conway, Jones, and a new one. Using the recurrence relation, we find general and relative expansion formulae and rational generating functions for Alexander-Conway polynomial and the new polynomial, which reduce the computations to closure of simple braids, a subset of square free braids; HOMFLY polynomials of these simple braids are also computed. Algebraic independence of these three polynomials is proved.