共查询到20条相似文献,搜索用时 15 毫秒
1.
O. V. Mel'nikov 《Mathematical Notes》1998,64(1):82-91
It is proved that, for a (closed) subgroupH of a free profinite or free prosolvable groupF of rankF>1 such thatH contains a nontrivial composition subgroupN ofF, we have rankF< and [F:H]<.Translated fromMatematicheskie Zametki, Vol. 64, No. 1, pp. 95–106, July, 1998. 相似文献
2.
3.
Bernhard Herwig Steffen Lempp Martin Ziegler 《Proceedings of the American Mathematical Society》1999,127(12):3711-3719
We construct a strongly minimal (and thus uncountably categorical) but not totally categorical theory in a finite language of binary predicates whose only constructive (or recursive) model is the prime model.
4.
Summary We show that a well-known identity of Ramanujan admits only a bounded number of solutions over general finitely generated
domains. The bound is explicit and uniform in the sense that it depends only on the dimensions of the domains involved. Our
method is constructive, and opens up a possibility to determine the solutions in concrete instances. In some special cases
all solutions are determined. Our results can also be considered as a continuation of some theorems of Z. Daróczy and G. Hajdu,
obtained over Z. We note that in case of Hosszú's equation, similar results were obtained by several authors. 相似文献
5.
Olga Sapir 《Semigroup Forum》2009,78(3):427-449
We show that there exists an algorithm which decides whether a finite set of identities containing a permutation identity defines a variety generated by a finite semigroup or not. 相似文献
6.
7.
8.
Ross Willard 《Proceedings of the American Mathematical Society》1998,126(3):629-635
Using a method of R. McKenzie, we construct a finitely generated semisimple variety of infinite type, and a finitely generated nonsemisimple variety of finite type, both having arbitrarily large finite but no infinite simple members. This amplifies M. Valeriote's negative solution to Problem 11 from Hobby and McKenzie, The Structure of Finite Algebras.
9.
Tapani Hyttinen 《Mathematical Logic Quarterly》2005,51(3):291-298
We show that if M is a strongly minimal large homogeneous structure in a countable similarity type and the pregeometry of M is locally modular but not modular, then the pregeometry is affine over a division ring. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
10.
We show the existence of a rank function on finitely generated modules over group algebras , where is an arbitrary field and is a finitely generated amenable group. This extends a result of W. Lück (1998).
11.
Given any sequence of non-abelian finite simple primitive permutationgroups Sn, we construct a finitely generated group G whose profinitecompletion is the infinite permutational wreath product ...Sn Sn1 ... S0. It follows that the upper compositionfactors of G are exactly the groups Sn. By suitably choosingthe sequence Sn we can arrange that G has any one of a continuousrange of slow, non-polynomial subgroup growth types. We alsoconstruct a 61-generator perfect group that has every non-abelianfinite simple group as a quotient. 2000 Mathematics SubjectClassification: 20E07, 20E08, 20E18, 20E32. 相似文献
12.
S. Akbari M. Mahdavi-Hezavehi 《Proceedings of the American Mathematical Society》2000,128(6):1627-1632
As a generalization of Wedderburn's classic theorem, it is shown that the multiplicative group of a noncommutative finite dimensional division algebra cannot be finitely generated. Also, the following conjecture is investigated: An infinite non-central normal subgroup of cannot be finitely generated.
13.
E. V. Sokolov 《Mathematical Notes》2005,78(5-6):696-708
It is proved that an arbitrary descending HNN-extension of a finitely generated Abelian group is conjugacy separable. 相似文献
14.
E. K. Narayanan 《代数通讯》2018,46(6):2319-2331
A result of Segal states that every complex irreducible representation of a finitely generated nilpotent group G is monomial if and only if G is abelian-by-finite. A conjecture of Parshin, recently proved affirmatively by Beloshapka and Gorchinskii (2016), characterizes the monomial irreducible representations of finitely generated nilpotent groups. This article gives a slightly shorter proof of the conjecture using ideas of Kutzko and Brown. We also give a characterization of the finite-dimensional irreducible representations of two-step nilpotent groups and describe these completely for two-step groups whose center has rank one. 相似文献
15.
16.
In this paper, we prove a finite basis theorem for radical well-mixed difference ideals generated by binomials. As a consequence, every strictly ascending chain of radical well-mixed difference ideals generated by binomials in a difference polynomial ring is finite, which solves an open problem in difference algebra raised by Hrushovski in the binomial case. 相似文献
17.
A finitely generated group is called representation rigid (briefly, rigid) if for every n, has only finitely many classes of simple representations in dimension n. Examples include higher rank S-arithmetic groups. By Margulis super rigidity, the latter have a stronger property: they are representation super rigid; i.e., their proalgebraic completion is finite dimensional. We construct examples of nonlinear rigid groups which are not super rigid, and which exhibit every possible type of infinite dimensionality. Whether linear representation rigid groups are super rigid remains an open question. 相似文献
18.
N. Dehghani 《代数通讯》2013,41(11):4732-4748
For certain classes 𝒞 of R-modules, including singular modules or modules with locally Krull dimensions, it is investigated when every module in 𝒞 with a finitely generated essential submodule is finitely generated. In case 𝒞 = Mod-R, this means E(M)/M is Noetherian for any finitely generated module MR. Rings R with latter property are studied and shown that they form a class 𝒬 properly between the class of pure semisimple rings and the class of certain max rings. Duo rings in 𝒬 are precisely Artinian rings. If R is a quasi continuous ring in 𝒬 then R ? A ⊕ T where A is a semisimple Artinian ring and T ∈ 𝒬 with Z(TT) ≤ess TT. 相似文献
19.
A. P. J. Breunese P. C. Breedveld 《Mathematical and Computer Modelling of Dynamical Systems: Methods, Tools and Applications in Engineering and Related Sciences》2013,19(2):134-156
In bond graph models, the atomic submodels are described by sets of equations. Because of the physical justification of the bond graph formalism, it provides extensive possibilities for verification of the model at the graphical level. The equation formulation on the other hand is founded in the mathematical domain, so the need for a check against physical criteria is both more needed and more difficult. Causality assignment is the meeting point of the graphical level and the equation level. In bond graph modeling, causality assignment is a vital step in analysis and simulation. The assignment process in the graph is based on the causality restrictions of the atomic submodels. In this article, an automatic procedure for the derivation of causality restrictions of atomic submodels is presented. This process not only generates the correct set of causality restrictions, but also provides a detailed verification of the correctness of the submodel 相似文献
20.
V. S. Samovol 《Mathematical Notes》2006,80(1-2):261-271
We consider the problem of finitely smooth normalization of a system of ordinary differential equations whose linear part has two eigenvalues, while the other eigenvalues lie outside the imaginary axis. 相似文献