Given a set V of n elements we wish to linearly order them using pairwise preference labels which may be non-transitive (due to irrationality or arbitrary noise). The goal is to linearly order the elements while disagreeing with as few pairwise preference labels as possible. Our performance is measured by two parameters: The number of disagreements (loss) and the query complexity (number of pai...

We show there is a residual set of non-Anosov C∞ Axiom A diffeomorphisms with the no cycles property whose elements have trivial centralizer. If M is a surface and 2 ≤ r ≤ ∞, then we will show there exists an open and dense set of of Cr Axiom A diffeomorphisms with the no cycles property whose elements have trivial centralizer. Additionally, we examine commuting diffeomorphisms preserving a com...

let $g$ be a non-abelian group and let $z(g)$ be the center of $g$. associate with $g$ there is agraph $gamma_g$ as follows: take $gsetminus z(g)$ as vertices of$gamma_g$ and joint two distinct vertices $x$ and $y$ whenever$yxneq yx$. $gamma_g$ is called the non-commuting graph of $g$. in recent years many interesting works have been done in non-commutative graph of groups. computing the clique...

let g be a fixed element of a finite group g. we introduce the g-noncommuting graph of g whose vertex set is whole elements of the group g and two vertices x,y are adjacent whenever [x,y] g  and  [y,x] g. we denote this graph by . in this paper, we present some graph theoretical properties of g-noncommuting graph. specially, we investigate about its planarity and regularity, its clique number a...

We overview numerous algorithms in computational D-module theory together with the theoretical background as well as the implementation in the computer algebra system Singular. We discuss new approaches to the computation of Bernstein operators, of logarithmic annihilator of a polynomial, of annihilators of rational functions as well as complex powers of polynomials. We analyze algorithms for l...

We present constructions of a local and global common Lyapunov function for a finite family of pairwise commuting globally asymptotically stable nonlinear systems. The constructions are based on an iterative procedure, which at each step invokes a converse Lyapunov theorem for one of the individual systems. Our results extend a previously available one which relies on exponential stability of t...