极大平面图的点面全色数

平面图 G(V,E,F)的点面全色数 xs(G)是使得集合 V(G)U F(G)中相邻和相关联的元素均染为不同颜色的最少颜色数.本文证明了:(1)若 G 为极大平面图,则4≤xs(G)≤6;且 xs(G)=4当且仅当 G 为点次模3-正则图.(2)若 G 为△(G)≤3的简单平面图,则 xs(G)≤6.一、引言本文限于考虑平面图 G(V,E,F),其中 V,E,F 分别为 G 的点集合,边集合和面集     

二维严格凸赋范空间单位球面间等距映射的线性延拓

主要研究二维严格凸实赋范空间E和F的单位球面S_1(E)和S_1(F)之间的等距映射的线性延拓问题.利用二维严格凸赋范空间单位球面的性质得到:若等距映射V_0:S_1(E)→S_1(F)满足一定条件,则V_0可延拓为全空间E上的线性等距映射V:E→F.     

Possible Spectrums of 3×3 Upper Triangular Operator Matrices

Let H1, H2 and H3 be infinite dimensional separable complex Hilbert spaces. We denote by M(D,E,F) a 3×3 upper triangular operator matrix acting on H1⊕H2⊕H3 of the form M(D,E,F)=(A D E 0 B F 0 0 C). For given A ∈ B(H1), B ∈ B(H2) and C ∈ B(H3), the sets UD,E,F σp(M(D,E,F)), ∪D,E,F σr(M(D,E,F)), ∪D,E,F σc(M(D,E,F)) and ∪D,E,F σ(M(D,E,F)) are characterized, where D ∈ B(H2,H1), E ∈ B(H3, H1), F ∈ B(H3, H2) and σ(·), σp(·), σr(·),σc(·) denote the spectrum, the point spectrum, the residual spectrum and the continuous spectrum, respectively.     

非满等距映射的线性延拓

主要研究实赋范空间E和F的单位球面S_1(E)和S_1(F)之间的等距映射的线性延拓问题．得到：若等距映射V_0：S_1(E)→S_1(F)满足一定条件,则V_0可延拓为全空间E上的线性等距映射V：E→F,这是我们首次在非满的情况下考虑Tingley问题．     

FRACTIONAL (g, f)-FACTORS OF GRAPHS

1 IntroductionThe graphs considered in this paper will be finite undirected graphs wllicll 11lay llavemultiple edges but no loops. Let G be a grapll with vertex set V(G) and edge set E(G). Fora vertex x of G, the degree of x in G is denoted by dG(z). Let g and f be two integer-valuedfunctions defined o11 V(G) such that 0 < g(z) 5 f(x) fOr all x E V(G). Then a (g, f)-factorof G is a spanning 8ubgraph F of G satisfying g(x) < dG(z) 5 f(x) for all x E V(F). Ifg(x) = f(x) for all x E V(…     

FIXED POINT THEOREMS FOR MULTI-VALUED MAPPINGS IN LOCALLY CONVEX SPACES

<正> Throughout the present paper it is assumed that E is a real,locally convex,Hausdorfftopological vector space,and X(?)E a nonempty compact convex subset.A multi-valuedmapping F:X→2~E is said to be upper(lower) semicontinuous if for any open(closed) setU(?)E the set{x∈X|F(x)(?)U)is open (closed) in X;or,equivalently,for any closed(open) set V(?)E the set{X∈X|F(x)∩ V(?)(?)}is closed (open) in X.Moreover,F     

On Some Total Chromatic Number ofOuterplanar Graphs with Δ(G) = 6(English)

AMS(1991)SubjectClassifiction:05C15Definition1Aplanargraphissaidtobeanouterplanarifitsvenicescanbeplacedontheboundaryofaparticularface,calledtheouterface.Definition2Aplanaredge-face--colouringofaplanargraphG(V,E,F)isanassignmentofkcolourstoalledgesandfacesinEUFsuchthatnotwoadjacentorincidentelementsreceivethesamecolour.Theminimumnumberkforwhichaproperdege-facek-colouringofGexistsiscalledtheedge--facetotalchromaticnumberofG,denotedbyX.(G).similarly,wecandefinethevertex-edge--facetotalchr…     

Partitioning circulant graphs into isomorphic linear forests

1.IntroductionAlinearforestisaforestwhosecomponentsarepaths.Akiyama,E-coo,andHararyprovedthefollowingTheoremAll]andTheoremBIZ].TheoremA.Every3-regUlargraphGhasapartition(FI,F2)ofE(G)suchthatboth(V(G),FI)and(V(G),F2)arelinearforests.TheoremB.Every4reg...     

Topologically minimal surfaces versus self-amalgamated Heegaard surfaces

Let V ∪SW be a Heegaard splitting of M,such that αM = α-W = F1 ∪ F2 and g(S) = 2g(F1)= 2g(F2). Let V * ∪S*W * be the self-amalgamation of V ∪SW. We show if d(S) 3 then S* is not a topologically minimal surface.     

求最小权无三角形完美2-匹配的 O(|V|~3)算法

设 G=(V,E)是一简单图.E(G)和 V(G)分别表示 G 的边集合和顶点集合.G 的一个无三角形2-匹配是一个整数向量 x=(x_e:e∈E(G)),使得x_e≥0,(?)_e∈E(G),(1)x(δ(v))≤2,(?)_v∈V(G),(2)x(γ(s))≤2,(?)S(?)V(G),|S|=3.(3)若 x 进一步使(2)都以等式成立,则 x 称为是无三角形完美2-匹配.文献[1]证明了:(1)—(3)的可行解集合就是 G 的无三角形2-匹配的凸包多面体.[1]还同时给出了求最     

Blow-up rates for parabolic systems

Let ⁿ be a bounded domain andB _R be a ball in ⁿ of radiusR. We consider two parabolic systems: ut=u +f(), i= +g(u) in × (0,T) withu=v=0 on × (0,T) andu _t =u, v _t =v inB _r × (0,T) withe/v=f (v), e/v=g(u) onB _R × (0,T). Whenf(v) andg(u) are power law or exponential functions, we establish estimates on the blow-up rates for nonnegative solutions of the systems.     

A certain periodic control problem for differential equations with impulses in the space of bounded numerical sequences

One considers the differential equation dx/dt=f(t, x) with the impulse action ¦_t=t_i=H_i(t_i,x) in the space of bounded numerical sequences, where f(t, x), H_i(t, x) are T-periodic, countable-dimensional vector-valued functions, is a positive parameter. One gives conditions for the existence of a control (₁,₂) such that the solution of the equation dx/dt=f(t, x)–₁ with impulse action x¦_t=t_i=H_i(t_i,x)–₂ assuming for t= the value x=x₀, be T-periodic.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 2, pp. 271–275, February, 1990.     

On a Problem of Karpilovsky

Let G be a finite elementary group. Let ⁿ (G) denote the nth power of the augmentation ideal (G) of the integral group ring G. In this paper, we give an explicit basis of the quotient group Q_n(G) = ⁿ(G)/ⁿ⁺¹ (G) and compute the order of Qⁿ (G).2000 Mathematics Subject Classification: 16S34, 20C05     

Edge Coloring of Embedded Graphs with Large Girth

Let G be a simple graph embedded in the surface of Euler characteristic ()0. Denote _e(G), and g the edge chromatic number, the maximum degree and the girth of the graph G, respectively. The paper shows that _e(G)= if 5 and g4, or 4 and g5, or 3 and g9. In addition, if ()>0, then _e(G)= if 3 and g8. Acknowledgments.The authors would like to thank Dr. C.Q. Zhang for carefully reading several versions of this paper during its preparation and for suggesting several stylistic changes that have improved the overall presentation.     

Packing circuits in eulerian digraphs

LetG be an eulerian digraph; let (G) be the maximum number of pairwise edge-disjoint directed circuits ofG, and (G) the smallest size of a set of edges that meets all directed circuits ofG. Borobia, Nutov and Penn showed that (G) need not be equal to (G). We show that (G)=(G) provided thatG has a linkless embedding in 3-space, or equivalently, if no minor ofG can be converted toK ₆ by –Y andY– operations.     

The Topology of the Coloring Complex

In a recent paper, E. Steingrímsson associated to each simple graph G a simplicial complex _G, referred to as the coloring complex of G. Certain nonfaces of _G correspond in a natural manner to proper colorings of G. Indeed, the h-vector is an affine transformation of the chromatic polynomial _G of G, and the reduced Euler characteristic is, up to sign, equal to |_G(–1)|–1. We show that _G is constructible and hence Cohen-Macaulay. Moreover, we introduce two subcomplexes of the coloring complex, referred to as polar coloring complexes. The h-vectors of these complexes are again affine transformations of _G, and their Euler characteristics coincide with _G(0) and –_G(1), respectively. We show for a large class of graphs—including all connected graphs—that polar coloring complexes are constructible. Finally, the coloring complex and its polar subcomplexes being Cohen-Macaulay allows for topological interpretations of certain positivity results about the chromatic polynomial due to N. Linial and I. M. Gessel.Research financed by ECs IHRP Programme, within the Research Training Network Algebraic Combinatorics in Europe, grant HPRN-CT-2001-00272.     

Configurational conditions and digraphs

Configurational conditions (Schließungsaussagen) of a noncommutative space will be developped from pairs (, ) of digraphs where is a partial digraph of . In this way we obtain an extensive generalization of Pfalzgraf 's q-simplex-conditions Sim_q.In Memoriam Hans Zassenhaus     

Inequalities in Products of Minors of Totally Nonnegative Matrices

Let _I,I be the minor of a matrix which corresponds to row set I and column set I. We give a characterization of the inequalities of the form _{I,I K,K J,J L,L} which hold for all totally nonnegative matrices. This generalizes a recent result of Fallat, Gekhtman, and Johnson.     

Groups acting simply transitively on the vertices of a building of typeà 2, I

If a group acts simply transitively on the vertices of an affine building with connected diagram, then must be of typeà _n–1 for somen2, and must have a presentation of a simple type. The casen=2, when is a tree, has been studied in detail. We consider the casen=3, motivated particularly by the case when is the building ofG=PGL(3,K),K a local field, and when G. We exhibit such a group whenK=F _q ((X)),q any prime power. Our study leads to combinatorial objects which we calltriangle presentations. These triangle presentations give rise to some new buildings of typeà ₂.     

On Differences of Semicubical Powers

For X,Y,>0, let and define I ₈(X,Y,) to be the cardinality of the set. In this paper it is shown that, for >0, Y ²/X ³=O(), =O(Y ³/X ³) and X=O (Y ²), one has I ₈(X,Y,)=O(X ² Y ²+X min (X ^{3/2} Y ³, X ^{11/2} Y ^{–1})+X min (^{1/3} X ² Y ³, X ^{14/3} Y ^{1/3})), with the implicit constant depending only on . There is a brief report on an application of this that leads, by way of the Bombieri-Iwaniec method for exponential sums, to some improvement of results on the mean squared modulus of a Dirichlet L-function along a short interval of its critical line.