首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 905 毫秒
1.
A Singer cycle in GL(n,q) is an element of order q permuting cyclically all the nonzero vectors. Let be a Singer cycle in GL(2n,2). In this note we shall count the number of lines in PG (2n-1,2) whose orbit under the subgroup of index 3 in the Singer group is a spread. The lines constituting such a spread are permuted cyclically by the group 3, hence gives rise to a flag-transitive 2-(22n ,4,1) design.  相似文献   

2.
We study just infinite JG-modules, where J is either the -group algebra or the Ft-group algebra of the infinite cyclic group t over a finite field F and G is a solvable group of finite rank. With the help of the obtained results it is proved that the finitely approximated torsionfree solvable groups with the condition Min-- N are minimax.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 5, pp. 677–681, May, 1990.  相似文献   

3.
We show in this paper that the projective d-arrangement d formed by the facet hyperplanes of a cross-polytope, its hyperplanes of mirror symmetry, and the hyperplane at infinity is simplicial precisely for d4.The arrangement 4 is the only simplicial 4-arrangement presently known that does not lie in a natural sequence of analogous arrangements that are simplicial in each dimension. It has flat vector g=409, 746, 290, 33 and face vector f=409, 4104, 12336, 14400, 5760.  相似文献   

4.
The average case complexity classes P, L-samplable and NL, L-samplable are defined. We show that Deterministic Bounded Halting is complete for P, L-samplable and that Graph Reachability is complete for NL-samplable, both problems with a universal logspace samplable distribution.  相似文献   

5.
We prove that if M is a Noether JG-module, where G is an abelian group of finite free rank, and either J=, or J=Ft, where F is a finite field and t is an infinite cyclic group, then the module M belongs to a class (J, ) for some finite set in the sense defined by P. Hall.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 43, Nos. 7 and 8, pp. 1042–1048, July–August, 1991.  相似文献   

6.
Let G be a group, a G #, and let Fa be the set of all Frobenius subgroups with noninvariant factor a in G. In Theorems 1–3, we show that if a 2 1and G has sufficiently many subgroups a, a g F a. then aG F a.An element a is called (almost) Frobenius if, for (almost) all elements a g,the subgroup a, a g either belongs to F a or is Abelian. In Theorems 4–5, we investigate the structure of a G in G for the case where a is an (almost) Frobenius-Abelian element of order 2.In Theorem 6, we prove that a binary factorable group is locally completely factorable. Translated fromAlgebra i Logika, Vol. 34, No. 5, pp. 531–549, September-October, 1995.  相似文献   

7.
In this paper we examine for which Witt classes ,..., n over a number field or a function fieldF there exist a finite extensionL/F and 2,..., n L* such thatT L/F ()=1 andTr L/F (i)=i fori=2,...n.  相似文献   

8.
For a class of algorithms R satisfying sufficiently general conditions and an enumeration of the algorithms of this class, it is proved that if the algorithm from R with code m in this enumeration algorithmically decides a property, nontrivial to N1 and invariant (with respect to extensional equality) up to N, then for N max (t2(c)t5(N1, t2(a)) one has m t–3(N), where the constantsa, c and the function t are indicated in the text of the paper, t–3(N) is used instead of t–1(t–1(t–1(N))), and finally, t–1(x)=yx[t(y)x]. For natural enumerations the constantsa, c are not large, and the function t does not grow too rapidly. From the result obtained also follows a generalization of a theorem of Rice in a form close to that proved in [2].Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 73–76, 1979.In conclusion, the author thanks the participants in the Leningrad seminar on mathematical logic for valuable comments.  相似文献   

9.
LetG be a cyclicallyk-edge-connected cubic graph withk 3. Lete be an edge ofG. LetG be the cubic graph obtained fromG by deletinge and its end vertices. The edgee is said to bek-removable ifG is also cyclicallyk-edge-connected. Let us denote by S k (G) the graph induced by thek-removable edges and by N k (G) the graph induced by the non 3-removable edges ofG. In a previous paper [7], we have proved that N 3(G) is empty if and only ifG is cyclically 4-edge connected and that if N 3(G) is not empty then it is a forest containing at least three trees. Andersen, Fleischner and Jackson [1] and, independently, McCuaig [11] studied N 4(G). Here, we study the structure of N k (G) fork 5 and we give some constructions of graphs such thatN k (G) = E(G). We note that the main result of this paper (Theorem 5) has been announced independently by McCuaig [11].
Résumé SoitG un graphe cubique cyliquementk-arête-connexe, aveck 3. Soite une arête deG et soitG le graphe cubique obtenu à partir deG en supprimante et ses extrémités. L'arêtee est ditek-suppressible siG est aussi cycliquementk-arête-connexe. Désignons par S k (G) le graphe induit par les arêtesk-suppressibles et par N k (G) celui induit par les arêtes nonk-suppressibles. Dans un précédent article [7], nous avons montré que N 3(G) est vide si et seulement siG est cycliquement 4-arête-connexe et que si N 3(G) n'est pas vide alors c'est une forêt possédant au moins trois arbres. Andersen, Fleischner and Jackson [1] et, indépendemment, McCuaig [11] ont étudié N 4(G). Ici, nous étudions la structure de N k (G) pourk 5 et nous donnons des constructions de graphes pour lesquelsN k (G) = E(G). Nous signalons que le résultat principal de cet article (Théorème 5) a été annoncé indépendamment par McCuaig [11].
  相似文献   

10.
Given a fixed point free antianalytic involution k of a domain G in thecomplex plane, bounded by a finite number of analytic curves, k-invariant Greensfunctions are defined on G. The Lindelöfs principle is extended to k-invariantGreens functions. When G is the annulus, k-invariant Greens functions areobtained in the explicit form. Since the factorization of the annulus by the group kgenerated by k produces a Möbius strip, the respective result helped us to obtain explicitforms for Greens functions on the Möbius strip.  相似文献   

11.
Let V; , be a lattice, thenF(V), the set of all functions fromV toV, becomes a lattice by defining the operations and pointwise. If we also consider the composition of functions as an operation onF(V), we get the function algebra F(V); , ,·. In this paper we give a characterization of the lattices with nonsimple function algebras. Moreover, the congruence lattice of these function algebras turns out to be a three-element chain.  相似文献   

12.
Let be a univariant function, and letg(x) be the average of (x,u) asu runs over the unit sphere in n . We give a necessary and sufficient condition forg to be a kernel function, i.e., thatg be inL 1 ( n ) and have integral 1. The result is used to give a constructive proof of the density of the ridge functions based upon the function .  相似文献   

13.
We consider finite-dimensional homogeneous stochastic semigroups X s t , 0 s t < assuming values in the space of real square matrices. For stochastic semigroups assuming values in the class of upper triangular matrices we compute the index of exponential growth , where · is the operator norm of a matrix. The answer is given in terms of the characteristic Yt of the generating process Yt of the semigroup Xs t:x=–(1/2), where is the smallest eigenvalue of the matrix B which defines the characteristic Yt=Bt.Translated from Teoriya Sluchainykh Protsessov, No. 16, pp. 78–84, 1988.  相似文献   

14.
Gábor Czédli 《Order》1994,11(4):391-395
The quasiorders of a setA form a lattice Quord(A) with an involution –1={x, y: y, x}. Some results in [1] and Chajda and Pinus [2] lead to the problem whether every lattice with involution can be embedded in Quord(A) for some setA. Using the author's approach to the word problem of lattices (cf. [3]), which also applies for involution lattices, it is shown that the answer is negative.Research supported by the Hungarian National Foundation for Scientific Research (OTKA), under grant no. T 7442.  相似文献   

15.
If X is a Hausdorff space we construct a 2-groupoid G 2 X with the following properties. The underlying category of G 2 X is the `path groupoid" of X whose objects are the points of X and whose morphisms are equivalence classes f, g of paths f, g in X under a relation of thin relative homotopy. The groupoid of 2-morphisms of G 2 X is a quotient groupoid X / N X, where X is the groupoid whose objects are paths and whose morphisms are relative homotopy classes of homotopies between paths. N X is a normal subgroupoid of X determined by the thin relative homotopies. There is an isomorphism G 2 X(f,f) 2(X, f(0)) between the 2-endomorphism group of f and the second homotopy group of X based at the initial point of the path f. The 2-groupoids of function spaces yield a 2-groupoid enrichment of a (convenient) category of pointed spaces.We show how the 2-morphisms may be regarded as 2-tracks. We make precise how cubical diagrams inhabited by 2-tracks can be pasted.  相似文献   

16.
A result of Neisendorfer says that, for every connected p-complete finite complex Y with 2Y torsion, the p-completion of PK(/p, 1) (Ym) and Y are of the same homotopy type for any positive integer m. Here, PK(/p, 1)(Ym) is the periodization functor of Bousfield and Ym) is the m-connective cover of the space Y. The proof of this result depends on Millers Theorem of Sullivans conjecture. The aim in this paper is to study the phenomenon without the use of Millers Theorem.AMS Subject Classification (2000): 55P60  相似文献   

17.
RC *-fields     
It is stated that if a Boolean family W of valuation rings of a field F satisfies the block approximation property (BAP) and a global analog of the Hensel-Rychlick property (THR), in which case F, W is called an RC*-field, then F is regularly closed with respect to the family W (The-orem 1). It is proved that every pair F, W, where W is a weakly Boolean family of valuation rings of a field F, is embedded in the RC*-field F0, W0 in such a manner that R0 R0 F, R0 W0 is a continuous map, W0 is homeomorphic over W to a given Boolean space, and R0 is a superstructure of R0 F for every R0 W0 (Theorem 2).Translated fromAlgebra i Logika, Vol. 33, No. 4, pp. 367–386, July-August, 1994.  相似文献   

18.
LetL=f, g be the language with two unary operation symbols. I prove that the finitely based equational theory =[f0=0] ofL covers exactly 0 others.Presented by S. Burris.Dedicated to George McNulty, my mentor in equational logic.  相似文献   

19.
An ordered list of binary words of length n is called a distance-preserving m, n-code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic m, n-codes is presented, based on the standard Gray code and on some simple tools from linear algebra.  相似文献   

20.
Summary A general theory of stochastic integral in the abstract topological measurable space is established. The martingale measure is defined as a random set function having some martingale property. All square integrable martingale measures constitute a Hilbert space M 2. For each M 2, a real valued measure on the predictable -algebra is constructed. The stochastic integral of a random function with respect to is defined and investigated by means of Riesz's theorem and the theory of projections. The stochastic integral operator I is an isometry from L 2() to a stable subspace of M 2, its inverse is defined as a random Radon-Nikodym derivative. Some basic formulas in stochastic calculus are obtained. The results are extended to the cases of local martingale and semimartingale measures as well.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号