Solvability
81Quasi-bialgebra — In mathematics, quasi bialgebras are a generalization of bialgebras, which were defined by the Ukrainian mathematician Vladimir Drinfeld in 1990.A quasi bialgebra mathcal{B A} = (mathcal{A}, Delta, varepsilon, Phi) is an algebra mathcal{A} over a …
82Quasi-Hopf algebra — A quasi Hopf algebra is a generalization of a Hopf algebra, which was defined by the Russian mathematician Vladimir Drinfeld in 1989.A quasi Hopf algebra is a quasi bialgebra mathcal{B A} = (mathcal{A}, Delta, varepsilon, Phi)for which there… …
83Supersolvable group — In mathematics, a group is supersolvable (or supersoluble) if it has an invariant normal series where all the factors are cyclic groups. Supersolvablility is stronger than the notion of solvability.DefinitionLet G be a group. G is supersolvable… …
84Lewy's example — In mathematics, in the field partial differential equations, Lewy s example is a celebrated example, due to Hans Lewy, of a linear partial differential equation with no solutions. It removes the hope that the analog of the Cauchy Kovalevskaya… …
85CN group — In mathematics, in the area of algebra known as group theory, a more than fifty year effort was made to answer a conjecture of harv|Burnside|1911: are all groups of odd order solvable? Progress was made by showing that CA groups, groups in which… …
86Abel equation — The Abel equation, named after Niels Henrik Abel, is special case of functional equations which can be written in the form:f(h(x)) = f(x + 1),!or: alpha(f(x))=alpha(x)+1!and shows non trivial properties at the iteration.EquivalenceIn some sense,… …
87Dijkstra Prize — The Edsger W. Dijkstra Prize in Distributed Computing is given for outstanding papers on the principles of distributed computing, whose significance and impact on the theory and/or practice of distributed computing has been evident for at least a …
88Kalmanson combinatorial conditions — In mathematics, the Kalmanson combinatorial conditions are a set of conditions on the distance matrix used in determining the solvability of the traveling salesman problem. These conditions apply to a special kind of cost matrix, the Kalmanson… …
89Atkinson's theorem — In operator theory, Atkinson s theorem gives a characterization of Fredholm operators. The theorem Let H be a Hilbert space and L ( H ) the bounded operators on H . The following is the classical definition of a Fredholm operator: a T ∈ L ( H )… …
90Alliance for Climate Protection — Focus Global warming Membership over 5,000,000 worldwide[1] Established 2006 Founder …
