By algebraic group theory, there is a map from the semisimple conjugacy classes of a finite group of Lie type to the conjugacy classes of the Weyl group. Picking a semisimple class uniformly at random yields a probability measure on conjugacy classes of the Weyl group. We conjecture that this measure agrees with a second measure on conjugacy classes of the Weyl group induced by a construction o...

In this paper, we study separability of graded field extensions. In particular, without restriction to torsion free of the grade group, we show that some separability results of graded field extensions given in [7] hold. On the other hand, the separability notions defined in [1] do not cover many situations, for example group algebras. We show that these notions are simple cases of separability...

Let G be a connected reductive linear algebraic group defined over an field k of characteristic not 2, θ ∈ Aut(G) an involutional k-automorphism of G and K = Gθ = {g ∈ G | θ(g) = g} the set of fixed points of θ. Denote the set of k-rational points of G by Gk. In this paper we shall classify the K-conjugacy classes of θ-stable maximal tori of G. This is shown to be independent of the characteris...

Recently, Laplacian matrices of graphs are studied as density matrices in quantum mechanics. We continue this study and give conditions for separability of generalized Laplacian matrices of weighted graphs with unit trace. In particular, we show that the Peres-Horodecki positive partial transpose separability condition is necessary and sufficient for separability in C2 ⊗ C. In addition, we pres...

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 discuss the complexity of conjugacy problem in Miller’s groups. We stratify the groups in question and show that for “almost all”, in some explicit sense, elements, the conjugacy search problem is decidable in cubic time. It is worth noting that a Miller’a group may have undecidable conjugacy search problem; our results show that “hard” instances of the problem comprise a negligibly small pa...

In this paper we study the separability in the plane by two criteria: double wedge separability and constant turn separability. We give O(N logN)-time optimal algorithms for computing all the separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and the flattest minimal constant turn polygonal line separating two sets of points.

This paper addresses arguments that “separability” is an assumption of Bell’s theorem, and that abandoning this assumption in our interpretation of quantum mechanics (a position sometimes referred to as “holism”) will allow us to restore a satisfying locality principle. Separability here means that all events associated to the union of some set of disjoint regions are combinations of events ass...

We give two results for computing doubly-twisted conjugacy relations in free groups with respect to homomorphisms φ and ψ such that certain remnant words from φ are longer than the images of generators under ψ. Our first result is a remnant inequality condition which implies that two words u and v are not doubly-twisted conjugate. Further we show that if ψ is given and φ, u, and v are chosen at...