Results 241 to 250 of about 70,001 (264)
Some of the next articles are maybe not open access.
Journal of the London Mathematical Society, 1991
The authors say a group is homogeneous if any isomorphism between two of its finitely generated subgroups is induced by an automorphism. (In model theory there are also other versions of the concept of homogeneity; see the paper of \textit{B. I. Rose} and \textit{R. E. Woodrow} [Z. Math. Logik Grundlagen Math.
Cherlin, Gregory L., Felgner, Ulrich
openaire +1 more source
The authors say a group is homogeneous if any isomorphism between two of its finitely generated subgroups is induced by an automorphism. (In model theory there are also other versions of the concept of homogeneity; see the paper of \textit{B. I. Rose} and \textit{R. E. Woodrow} [Z. Math. Logik Grundlagen Math.
Cherlin, Gregory L., Felgner, Ulrich
openaire +1 more source
Journal of Group Theory, 2003
A group \(G\) is called \(R^*\)-group if for all \(n>0\) and elements \(g\) and \(x_1,\dots,x_n\) the equation \(g^{x_1 }\cdots g^{x_n }=1\) implies \(g=1\). The following results are proved: (1) if \(G\) is an Abelian-by-nilpotent as well as nilpotent-by-Abelian \(R^*\)-group, then every partial order on \(G\) can be extented to a linear order; (2) if
LONGOBARDI, Patrizia +2 more
openaire +3 more sources
A group \(G\) is called \(R^*\)-group if for all \(n>0\) and elements \(g\) and \(x_1,\dots,x_n\) the equation \(g^{x_1 }\cdots g^{x_n }=1\) implies \(g=1\). The following results are proved: (1) if \(G\) is an Abelian-by-nilpotent as well as nilpotent-by-Abelian \(R^*\)-group, then every partial order on \(G\) can be extented to a linear order; (2) if
LONGOBARDI, Patrizia +2 more
openaire +3 more sources
Applicable Algebra in Engineering, Communication and Computing, 2003
This paper deals with the problem of determining whether a quintic polynomial is solvable, i.e. whether its roots are expressible by repeated radicals. Every irreducible quintic \(f(x)\) can be transformed, by two applications of Tschirnhausen transformations, into a so-called Brioschi quintic or Brioschi resolvent, with a parameter \(Z\) in the ...
openaire +1 more source
This paper deals with the problem of determining whether a quintic polynomial is solvable, i.e. whether its roots are expressible by repeated radicals. Every irreducible quintic \(f(x)\) can be transformed, by two applications of Tschirnhausen transformations, into a so-called Brioschi quintic or Brioschi resolvent, with a parameter \(Z\) in the ...
openaire +1 more source
Mathematics of the USSR-Sbornik, 1989
This article contains complete proofs of the results obtained earlier by the author in his previous short communications which gives description of the orbit structure of the homogeneous flow on compact solvmanifolds. Let G/D be a solvmanifold, where G is a connected solvable Lie group, D- closed subgroup, \(x\in g\) the Lie algebra of G, and \(gD\to ...
openaire +3 more sources
This article contains complete proofs of the results obtained earlier by the author in his previous short communications which gives description of the orbit structure of the homogeneous flow on compact solvmanifolds. Let G/D be a solvmanifold, where G is a connected solvable Lie group, D- closed subgroup, \(x\in g\) the Lie algebra of G, and \(gD\to ...
openaire +3 more sources
Acta Mathematica Sinica, English Series, 2016
A finite group \(G\) is a \(D_{n}\)-group if and only if the number of non-linear irreducible characters of \(G\) is exactly \(n\) less than the number of their different degrees. \textit{Y. Berkovich} et al. [Proc. Am. Math. Soc. 115, No. 4, 955--959 (1992; Zbl 0822.20004)] classified \(D_{0}\)-groups and \textit{Y. Berkovich} and \textit{L. Kazarin} [
Liu, Yang, Lu, Zi Qun
openaire +1 more source
A finite group \(G\) is a \(D_{n}\)-group if and only if the number of non-linear irreducible characters of \(G\) is exactly \(n\) less than the number of their different degrees. \textit{Y. Berkovich} et al. [Proc. Am. Math. Soc. 115, No. 4, 955--959 (1992; Zbl 0822.20004)] classified \(D_{0}\)-groups and \textit{Y. Berkovich} and \textit{L. Kazarin} [
Liu, Yang, Lu, Zi Qun
openaire +1 more source
Mathematics of the USSR-Izvestiya, 1969
It is proved that in the class of radical groups containing solvable subgroups of some class s, the descending chain condition for subgroups is equivalent to the descending chain condition for solvable subgroups of class s.
openaire +2 more sources
It is proved that in the class of radical groups containing solvable subgroups of some class s, the descending chain condition for subgroups is equivalent to the descending chain condition for solvable subgroups of class s.
openaire +2 more sources
Mathematische Nachrichten, 1984
Let G be a finite solvable group. G is known to be nilpotent iff \(C_ G(M/N)=G\) holds for each chief factor M/N of G. A contrary situation takes place if \(C_ G(M/N)=M\) for each chief factor M/N of G. Groups G satisfying this condition are said to be abnilpotent. Those groups were already considered by \textit{T. O. Hawkes} [Trans. Am. Math. Soc. 214,
openaire +2 more sources
Let G be a finite solvable group. G is known to be nilpotent iff \(C_ G(M/N)=G\) holds for each chief factor M/N of G. A contrary situation takes place if \(C_ G(M/N)=M\) for each chief factor M/N of G. Groups G satisfying this condition are said to be abnilpotent. Those groups were already considered by \textit{T. O. Hawkes} [Trans. Am. Math. Soc. 214,
openaire +2 more sources
Dominance Solvable Voting Schemes
Econometrica, 1979The concept of a dominance solvable voting scheme is presented as a weakening of the strategy-proofness requirement: it relies on successive elimination of dominated strategies and generalizes the well known concept of "sophisticated voting." Dominance solvable decision schemes turn out to contain many usual voting procedures such as voting by veto ...
openaire +2 more sources
Algebra and Logic, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Solvability and unique solvability of max–min fuzzy equations
Fuzzy Sets and Systems, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources