全文获取类型
收费全文 | 91篇 |
免费 | 4篇 |
国内免费 | 6篇 |
专业分类
化学 | 4篇 |
数学 | 95篇 |
物理学 | 2篇 |
出版年
2022年 | 2篇 |
2020年 | 1篇 |
2018年 | 2篇 |
2017年 | 1篇 |
2016年 | 5篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 9篇 |
2012年 | 8篇 |
2011年 | 1篇 |
2010年 | 3篇 |
2009年 | 4篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 1篇 |
2004年 | 2篇 |
2003年 | 4篇 |
2002年 | 4篇 |
2001年 | 4篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 4篇 |
1997年 | 3篇 |
1996年 | 4篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1973年 | 1篇 |
1970年 | 2篇 |
1933年 | 1篇 |
排序方式: 共有101条查询结果,搜索用时 31 毫秒
31.
Elements a, b of a group G are said to be fused or inverse-fused if there exists σεAut(G) such that a = bσ or a = (b-1)σ respectively. This paper gives a classification of all finite groups in which any two elements of the same order are fused orinverse-fused. 相似文献
32.
33.
ABSTRACT The article is dedicated to some generalizations of minimax soluble groups satisfying common criterion of nilpotency, such that normality of maximal subgroups, nilpotency of the factor-group by the Frattini subgroup, normality of pronormal subgroups, non-existence of proper abnormal subgroups and so on. 相似文献
34.
On partitioning the orbitals of a transitive permutation group 总被引:1,自引:0,他引:1
Cai Heng Li Cheryl E. Praeger 《Transactions of the American Mathematical Society》2003,355(2):637-653
Let be a permutation group on a set with a transitive normal subgroup . Then acts on the set of nontrivial -orbitals in the natural way, and here we are interested in the case where has a partition such that acts transitively on . The problem of characterising such tuples , called TODs, arises naturally in permutation group theory, and also occurs in number theory and combinatorics. The case where is a prime-power is important in algebraic number theory in the study of arithmetically exceptional rational polynomials. The case where exactly corresponds to self-complementary vertex-transitive graphs, while the general case corresponds to a type of isomorphic factorisation of complete graphs, called a homogeneous factorisation. Characterising homogeneous factorisations is an important problem in graph theory with applications to Ramsey theory. This paper develops a framework for the study of TODs, establishes some numerical relations between the parameters involved in TODs, gives some reduction results with respect to the -actions on and on , and gives some construction methods for TODs.
35.
Let be a graph and G be a 2-arc transitive automorphism group of . For a vertex x let G(x)(x) denote the permutation group induced by the stabilizer G(x) of x in G on the set (x) of vertices adjacent to x in . Then is said to be a locally projective graph of type (n,q) if G(x)(x) contains PSLn(q) as a normal subgroup in its natural doubly transitive action. Suppose that is a locally projective graph of type (n,q), for some n 3, whose girth (that is, the length of a shortest cycle) is 5 and suppose that G(x) acts faithfully on (x). (The case of unfaithful action was completely settled earlier.) We show that under these conditions either n=4, q=2, has 506 vertices and
, and contains the Wells graph on 32 vertices as a subgraph. In the latter case if, for a given n, at least one graph satisfying the conditions exists then there is a universal graph W(n) of which all other graphs for this n are quotients. The graph W(3) satisfies the conditions and has 220 vertices. 相似文献
36.
A permutation group is innately transitive if it has a transitive minimal normal subgroup, and this subgroup is called a plinth.
In this paper we study three special types of inclusions of innately transitive permutation groups in wreath products in product
action. This is achieved by studying the natural Cartesian decomposition of the underlying set that corresponds to the product
action of the wreath product. Previously we identified six classes of Cartesian decompositions that can be acted upon transitively
by an innately transitive group with a non-abelian plinth. The inclusions studied in this paper correspond to three of the
six classes. We find that in each case the isomorphism type of the acting group is restricted, and some interesting combinatorial
structures are left invariant. We also give a fairly general construction of inclusions for each type. 相似文献
37.
Alice Devillers Michael Giudici Cai Heng Li Cheryl E. Praeger 《Journal of Algebraic Combinatorics》2012,35(2):173-192
A new infinite family of bipartite cubic 3-arc transitive graphs is constructed and studied. They provide the first known
examples admitting a 2-arc transitive vertex-biquasiprimitive group of automorphisms for which the index two subgroup fixing
each half of the bipartition is not quasiprimitive on either bipartite half. 相似文献
38.
We classify the neighbour-transitive codes in Johnson graphs $J(v,k)$ of minimum distance at least three which admit a neighbour-transitive group of automorphisms that is an almost simple two-transitive group of degree $v$ and does not occur in an infinite family of two-transitive groups. The result of this classification is a table of 22 codes with these properties. Many have relatively large minimum distance in comparison to their length $v$ and number of code words. We construct an additional five neighbour-transitive codes with minimum distance two admitting such a group. All 27 codes are $t$ -designs with $t$ at least two. 相似文献
39.
The Johnson graph \(J(v,k)\) has, as vertices, the \(k\) -subsets of a \(v\) -set \(\mathcal {V}\) and as edges the pairs of \(k\) -subsets with intersection of size \(k-1\) . We introduce the notion of a neighbour-transitive code in \(J(v,k)\) . This is a proper vertex subset \(\Gamma \) such that the subgroup \(G\) of graph automorphisms leaving \(\Gamma \) invariant is transitive on both the set \(\Gamma \) of ‘codewords’ and also the set of ‘neighbours’ of \(\Gamma \) , which are the non-codewords joined by an edge to some codeword. We classify all examples where the group \(G\) is a subgroup of the symmetric group \(\mathrm{Sym}\,(\mathcal {V})\) and is intransitive or imprimitive on the underlying \(v\) -set \(\mathcal {V}\) . In the remaining case where \(G\le \mathrm{Sym}\,(\mathcal {V})\) and \(G\) is primitive on \(\mathcal {V}\) , we prove that, provided distinct codewords are at distance at least \(3\) , then \(G\) is \(2\) -transitive on \(\mathcal {V}\) . We examine many of the infinite families of finite \(2\) -transitive permutation groups and construct surprisingly rich families of examples of neighbour-transitive codes. A major unresolved case remains. 相似文献
40.