首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Extension properties of compact positive operators on Banach lattices are investigated. The following results are obtained:
  • 1. 
    (1) Any compact positive operator (any compact lattice homomorphism, resp.) from a majorizing sublattice G of a Banach lattice E into another Banach lattice F can be extended to a compact positive operator (a compact lattice homomorphism, resp.) from E into F;
  • 2. 
    (2) Any compact positive operator defined on a closed majorizing sublattice G of a Banach lattice E has a compact positive extension on E that preserves the spectrum (a necessary modification is needed).
Related extension problems are also studied.  相似文献   

2.
We consider systems of combinatorial Dyson–Schwinger equations in the Connes–Kreimer Hopf algebra HI of rooted trees decorated by a set I. Let H(S) be the subalgebra of HI generated by the homogeneous components of the unique solution of this system. If it is a Hopf subalgebra, we describe it as the dual of the enveloping algebra of a Lie algebra g(S) of one of the following types:
  • 1. 
    g(S) is an associative algebra of paths associated to a certain oriented graph.
  • 2. 
    Or g(S) is an iterated extension of the Faà di Bruno Lie algebra.
  • 3. 
    Or g(S) is an iterated extension of an infinite-dimensional abelian Lie algebra.
We also describe the character groups of H(S).  相似文献   

3.
Tutte introduced the theory of nowhere zero flows and showed that a plane graph G has a face k-coloring if and only if G has a nowhere zero A-flow, for any Abelian group A with |A|≥k. In 1992, Jaeger et al. [9] extended nowhere zero flows to group connectivity of graphs: given an orientation D of a graph G, if for any b:V(G)?A with ∑vV(G)b(v)=0, there always exists a map f:E(G)?A−{0}, such that at each vV(G), in A, then G is A-connected. Let Z3 denote the cyclic group of order 3. In [9], Jaeger et al. (1992) conjectured that every 5-edge-connected graph is Z3-connected. In this paper, we proved the following.
  • (i) 
    Every 5-edge-connected graph is Z3-connected if and only if every 5-edge-connected line graph is Z3-connected.
  • (ii) 
    Every 6-edge-connected triangular line graph is Z3-connected.
  • (iii) 
    Every 7-edge-connected triangular claw-free graph is Z3-connected.
In particular, every 6-edge-connected triangular line graph and every 7-edge-connected triangular claw-free graph have a nowhere zero 3-flow.  相似文献   

4.
Let (L;?,?) be a finite lattice and let n be a positive integer. A function f:LnR is said to be submodular if for all . In this article we study submodular functions when L is a diamond. Given oracle access to f we are interested in finding such that as efficiently as possible. We establish
  • • 
    a min–max theorem, which states that the minimum of the submodular function is equal to the maximum of a certain function defined over a certain polyhedron; and
  • • 
    a good characterisation of the minimisation problem, i.e., we show that given an oracle for computing a submodular f:LnZ and an integer m such that , there is a proof of this fact which can be verified in time polynomial in n and ; and
  • • 
    a pseudopolynomial-time algorithm for the minimisation problem, i.e., given an oracle for computing a submodular f:LnZ one can find in time bounded by a polynomial in n and .
  相似文献   

5.
6.
1.  Letm be the greatest integer such that . ThenPG(3,q) contains complete caps of sizek=(m+1)(q+1)+ω, with ω=0, 1, 2.
2.  PG(3,q),q≥5, contains complete caps of size
.
3.  InPG(3,q) complete caps different from ovaloids have some external planes.
  相似文献   

7.
Non-singular solutions to the normalized Ricci flow equation   总被引:2,自引:0,他引:2  
In this paper, we study non-singular solutions to Ricci flow on a closed manifold of dimension at least 4. Amongst other things we prove that, if M is a closed 4-manifold on which the normalized Ricci flow exists for all time t > 0 with uniformly bounded sectional curvature, then the Euler characteristic . Moreover, the 4-manifold satisfies one of the followings
(i)  M is a shrinking Ricci soliton;
(ii)  M admits a positive rank F-structure;
(iii)  the Hitchin–Thorpe type inequality holds
where (resp. ) is the Euler characteristic (resp. signature) of M. The first author was supported by a NSF Grant of China and the Capital Normal University.  相似文献   

8.
All the letters represent relative integers, except and and i = e1e2 in R(2, 0) oder e1 in R(1, 0). We study the Fermat’s equation
(1)
abc being prime two and two and by utilizing an elementary method. We use the Gauss’ formula
where n = 5, 7, 11, 17.
1.  If 2 is the p · g · c · d· of A and B we put
and A′ and B′ are prime between themselves.
2.  If βn = bn / (c − a) is not divisible by n, we write the expansion
(2)
by puting oder whereas oder It follows that B ′ is divisible by n.
3.  If one ab oder c is divisible by n we prove the impossibility
4.  In the case n = 3 the ring {a + bj} is euclidian which permits to conclude in favour of the impossibility.
  相似文献   

9.
We develop the theory of “branch algebras”, which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting on trees. In particular, for every field % MathType!End!2!1! we contruct a % MathType!End!2!1! which
–  • is finitely generated and infinite-dimensional, but has only finitedimensional quotients;
–  • has a subalgebra of finite codimension, isomorphic toM 2(k);
–  • is prime;
–  • has quadratic growth, and therefore Gelfand-Kirillov dimension 2;
–  • is recursively presented;
–  • satisfies no identity;
–  • contains a transcendental, invertible element;
–  • is semiprimitive if % MathType!End!2!1! has characteristic ≠2;
–  • is graded if % MathType!End!2!1! has characteristic 2;
–  • is primitive if % MathType!End!2!1! is a non-algebraic extension of % MathType!End!2!1!;
–  • is graded nil and Jacobson radical if % MathType!End!2!1! is an algebraic extension of % MathType!End!2!1!.
The author acknowledges support from TU Graz and UC Berkeley, where part of this research was conducted.  相似文献   

10.
We characterize the composition operators mapping Blochs boundedly into the weighted Bergman spaces of logarithmic weight. For 0 < p < ∞, 1 < α < ∞, let Ap, log α denote the space of holomorphic functions F in the unit disc D for which
and let Ap, log ασ denote the class of holomorphic self maps f of D for which
Then for the Bloch pullback operator Cf, the following are equivalent:
(1)  Cf maps Bloch space boundedly into A2p, log α
(2) 
(3)  .
This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD, Basic Research Promotion Fund) (KRF-2007-313-C00026).  相似文献   

11.
Let SG(1,3)p5 be a smooth, irreducible, non degenerate surface in the complex grassmannian G(1,3). Assume deg(S)=9, we show that S is one of the following surfaces:
(a)  A K3 surface blown up in one point.
(b)  The image of P2 by the linear system
(c)  The image of P2 by the linear system .
  相似文献   

12.
We construct a self-avoiding process taking values in the finite Sierpinski gasket, and study its properties. We then study continuum limit processes that are suggested by the statistical mechanics of self-avoiding paths on the pre-Sierpinski gasket. We prove that there are three types of continuum limit processes according to the parameters defining the statistical mechanics of self-avoiding paths:
(i)  the self-avoiding process we construct in this paper;
(ii)  a deterministic motion along a Peano curve on the finite Sierpinski gasket;
(iii)  a deterministic motion along a line segment.
  相似文献   

13.
14.
Let us consider the linear boundary value problem
((0.1))
where
and
is defined by
Classical Lyapunov inequality states that
for any function
where
The constant 4/L is optimal. Let us note that Lyapunov inequality is given in terms of
the usual norm in the space L1(0, L). In this paper we review some recent results on Lp Lyapunovtype inequalities,
, for ordinary and partial differential equations on a bounded and regular domain in
In the last case, it is showed that the relation between the quantities p and N/2 plays a crucial role, pointing out a deep difference with respect to the ordinary case. In the proof, the best constants are obtained by using a related variational problem and Lagrange multiplier theorem. Finally, the linear results are combined with Schauder fixed point theorem in the study of resonant nonlinear problems. The authors have been supported by the Ministry of Science and Technology of Spain MTM2005- 01331 and by Junta de Andalucia (FQM116).  相似文献   

15.
It is shown that if II n ,n\s>2, are Chogoshvili's cohomotopy functors [1, 2, 3], then
1)  the isomorphism
  相似文献   

16.
We study several kinds of distributivity for concept lattices of contexts. In particular, we find necessary and sufficient conditions for a concept lattice to be
(1)  distributive,
(2)  a frame (locale, complete Heyting algebra),
(3)  isomorphic to a topology,
(4)  completely distributive,
(5)  superalgebraic (i.e., algebraic and completely distributive).
In cases (2), (4) and (5), our criteria are first order statements on objects and attributes of the given context. Several applications are obtained by considering the completion by cuts and the completion by lower ends of a quasiordered set as special types of concept lattices. Various degrees of distributivity for concept lattices are expressed by certain separation axioms for the underlying contexts. Passing to complementary contexts makes some statements and proofs more elegant. For example, it leads to a one-to-one correspondence between completely distributive lattices and so-called Cantor lattices, and it establishes an equivalence between partially ordered sets and doubly founded reduced contexts with distributive concept lattices.  相似文献   

17.
One of the classical problem in computational biology is the character compatibility problem or perfect phylogeny problem. A standard formulation of this problem in terms of two closely related questions is the following. Given a data set consisting of a finite set X and a set
of partitions induced on X by a set of characters. Is
compatible, that is, does there exist an evolutionary tree that represents (in a well-defined sense) the data? If this is the case, is this tree unique? A fundamental result in phylogenetics states that the answer to the former of the two questions is yes precisely if the partition intersection graph
associated to
can be made chordal by obeying a certain rule. The main insight from this paper is that the relation graph
associated to a set
of partitions may provide a key for deciding whether such a chordalization of
exists. To prove our results, we introduce an extension of the concept of the partition intersection graph associated to
using
. Received August 27, 2004  相似文献   

18.
19.
Continuing earlier work on construction of harmonic spaces from translation invariant Dirichlet spaces defined on locally compact abelian groups, it is shown that the potential kernel for a non-symmetric translation invariant Dirichlet form on a locally compact abelian group under the extra assumptions that
(i)  the potential kernel is absolutely continuous and the canonical l.s.c. density is continuous in the complement of the neutral element.
(ii)  the theory is of local type.
(iii)  the underlying group is not discrete, can be interpreted as the potential kernel for a translation invariant axiomatic theory of harmonic functions, in which (among other properties) the domination axiom is fulfilled.
  相似文献   

20.
Two partial ordersP andQ on a setX arecomplementary (written asPQ) if they share no ordered pairs (except for loops) but the transitive closure of the union is all possible ordered pairs. For each positive integern we form a graph Pos n consisting of all nonempty partial orders on {1, ,n} with edges denoting complementation. We investigate here properties of the graphs Pos n . In particular, we show:
–  The diameter of Pos n is 5 for alln>2 (and hence Pos n is connected for alln);
–  With probability 1, the distance between two members of Pos n is 2;
–  The graphs Pos n are universal (i.e. every graph occurs as an induced subgraph of some Pos n );
–  The maximal size (n) of an independent set of Pos n satisfies the asymptotic formula
  相似文献   

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

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