全文获取类型
收费全文 | 162篇 |
免费 | 8篇 |
国内免费 | 27篇 |
专业分类
综合类 | 4篇 |
数学 | 192篇 |
物理学 | 1篇 |
出版年
2023年 | 3篇 |
2022年 | 3篇 |
2021年 | 1篇 |
2020年 | 4篇 |
2019年 | 4篇 |
2018年 | 6篇 |
2017年 | 5篇 |
2016年 | 3篇 |
2015年 | 2篇 |
2014年 | 3篇 |
2013年 | 26篇 |
2012年 | 6篇 |
2011年 | 4篇 |
2010年 | 11篇 |
2009年 | 20篇 |
2008年 | 13篇 |
2007年 | 11篇 |
2006年 | 8篇 |
2005年 | 2篇 |
2004年 | 4篇 |
2003年 | 7篇 |
2002年 | 14篇 |
2001年 | 4篇 |
2000年 | 8篇 |
1999年 | 5篇 |
1998年 | 10篇 |
1997年 | 2篇 |
1996年 | 3篇 |
1995年 | 4篇 |
1959年 | 1篇 |
排序方式: 共有197条查询结果,搜索用时 15 毫秒
41.
This paper deals with the automorphism group of the partial order of finite traces. We show that any group can arise as such an automorphism group if we allow arbitrary large dependence alphabets. Restricting to finite dependence alphabets, the automorphism groups are profinite and possess only finitely many simple decomposition factors. Finally, we show that the partial order associated with the Rado graph as dependence alphabet does not give rise to a homogeneous domain thereby answering an open question from Boldi, P., Cardone, F. and Sabadini, N. (1993). 相似文献
42.
Jim Coykendall 《代数通讯》2017,45(7):2795-2808
In this note, we investigate ideal and factorization-theoretic properties of some root closed cancellative commutative monoids of rank at most two. 相似文献
43.
Cycles, also known as self-avoiding polygons, elementary circuits or simple cycles, are closed walks which are not allowed to visit any vertex more than once. We present an exact formula for enumerating such cycles of any length on any directed graph involving a sum over its induced subgraphs. This result stems from a Hopf algebra, which we construct explicitly, and which provides further means of counting cycles. Finally, we obtain a more general theorem asserting that any Lie idempotent can be used to enumerate cycles. 相似文献
44.
Hedrlín and Pultr proved that for any monoid M there exists a graph G with endomorphism monoid isomorphic to M . In this paper we give a construction G(M) for a graph with prescribed endomorphism monoid M . Using this construction we derive bounds on the minimum number of vertices and edges required to produce a graph with a given endomorphism monoid for various classes of finite monoids. For example we show that for every monoid M , | M |=m there is a graph G with End(G)? M and |E(G)|≤(1 + 0(1))m2. This is, up to a factor of 1/2, best possible since there are monoids requiring a graph with \begin{eqnarray*} && \frac{m^{2}}{2}(1 -0(1)) \end{eqnarray*} edges. We state bounds for the class of all monoids as well as for certain subclasses—groups, k‐cancellative monoids, commutative 3‐nilpotent monoids, rectangular groups and completely simple monoids. © 2009 Wiley Periodicals, Inc. J Graph Theory 62, 241–262, 2009 相似文献
45.
For a given finite monoid , let be the number of graphs on n vertices with endomorphism monoid isomorphic to . For any nontrivial monoid we prove that where and are constants depending only on with .For every k there exists a monoid of size k with , on the other hand if a group of unity of has a size k>2 then . 相似文献
46.
Michael Freeze 《Discrete Mathematics》2010,310(23):3373-3389
A generalization of the Davenport constant is investigated. For a finite abelian group G and a positive integer k, let denote the smallest ? such that each sequence over G of length at least ? has k disjoint non-empty zero-sum subsequences. For general G, expanding on known results, upper and lower bounds on these invariants are investigated and it is proved that the sequence is eventually an arithmetic progression with difference exp(G), and several questions arising from this fact are investigated. For elementary 2-groups, is investigated in detail; in particular, the exact values are determined for groups of rank four and five (for rank at most three they were already known). 相似文献
47.
Symmetric ideals in increasingly larger polynomial rings that form an ascending chain are investigated. We focus on the asymptotic behavior of codimensions and projective dimensions of ideals in such a chain. If the ideals are graded it is known that the codimensions grow eventually linearly. Here this result is extended to chains of arbitrary symmetric ideals. Moreover, the slope of the linear function is explicitly determined. We conjecture that the projective dimensions also grow eventually linearly. As part of the evidence we establish two non-trivial lower linear bounds of the projective dimensions for chains of monomial ideals. As an application, this yields Cohen–Macaulayness obstructions. 相似文献
48.
In this paper, the half-strong endomorphisms of the join of split graphs are investigated. We give the conditions under which the half-strong endomorphisms of the join of split graphs form a monoid. 相似文献
49.
50.
Rowena Paget 《Journal of Algebraic Combinatorics》2006,24(3):239-252
We show that, over an arbitrary field, q-rook monoid algebras are iterated inflations of Iwahori-Hecke algebras, and, in particular, are cellular. Furthermore we give an algebra decomposition which shows a q-rook monoid algebra is Morita equivalent to a direct sum of Iwahori-Hecke algebras. We state some of the consequences for the representation theory of q-rook monoid algebras.Supported by EPSRC grant GR/S18151/01 相似文献