联图的圈基

MacLane于1937年给出了圈基方面的重要定理: 图G是平面图, 当且仅当图G有2-重基. 连通图G_1和G_2的联图G_1\vee G_2指的是在它们的不交并G_1\bigcup G_2上添加边集(u,v)|u\in V(G_1), v\in V(G_2). 对G_1和G_2的联图G_1\vee G_2的圈基重数进行了研究, 得到了一个上界, 改进了Zare的结果. 并在此基础之上, 进一步得到特殊联图C_m\vee C_n的圈基重数的一个上界.     

关于拉普拉斯谱半径的一个不等式

设G是一个简单连通图,v是图G的一个割点.G_1,G_2,…,G_s(s≥2)是图G的s个v-分支.令H_1=G_1∪G_2∪…∪G_t,H_2=G_(t+1)∪G_(t+2)∪…∪G_s,其中1≤t相似文献   

Extensions of Hałkowska–Zajac's three-valued paraconsistent logic

 As it was proved in [4, Sect. 3], the poset of extensions of the propositional logic defined by a class of logical matrices with equationally-definable set of distinguished values is a retract, under a Galois connection, of the poset of subprevarieties of the prevariety generated by the class of the underlying algebras of the defining matrices. In the present paper we apply this general result to the three-valued paraconsistent logic proposed by Hałkowska–Zajac [2]. Studying corresponding prevarieties, we prove that extensions of the logic involved form a four-element chain, the only proper consistent extensions being the least non-paraconsistent extension of it and the classical logic. RID="ID=" <E5>Mathematics Subject Classification (2000):</E5> 03B50, 03B53, 03G10 RID="ID=" <E5>Key words or phrases:</E5> Many-valued logic &ndash; Paraconsistent logic &ndash; Extension &ndash; Prevariety &ndash; Distributive lattice Received 12 August 2000 / Published online: 25 February 2002 RID=" ID=" <E5>Mathematics Subject Classification (2000):</E5> 03B50, 03B53, 03G10 RID=" ID=" <E5>Key words or phrases:</E5> Many-valued logic &ndash; Paraconsistent logic &ndash; Extension &ndash; Prevariety &ndash; Distributive lattice     

On Geometric Graphs with No Two Edges in Convex Position

A geometric graph is a graph G=G(V,E) drawn in the plane, where its vertex set V is a set of points in general position and its edge set E consists of straight segments whose endpoints belong to V . Two edges of a geometric graph are in convex position if they are disjoint edges of a convex quadrilateral. It is proved here that a geometric graph with n vertices and no edges in convex position contains at most 2n-1 edges. This almost solves a conjecture of Kupitz. The proof relies on a projection method (which may have other applications) and on a simple result of Davenport—Schinzel sequences of order 2. <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p399.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received December 18, 1995, and in revised form June 17, 1997.     

Asymptotic Decay for Some Differential Systems with Fading Memory

We study the large time behavior of the solution u to an initial and boundary value problem related to the following integro-differential equation $$ u_{tt} = G_0 \Delta u + \int_0^t G'(t-s) \Delta u(x, s)\, ds - a u_t \eqno(0.1) $$ where G 0 , a are real constant coefficients, G 0 > 0, a S 0 and $ G\,' \in L^1({{\shadR}}^ + ) \cap L^2({{\shadR}}^ + ), G\,' \le 0 $ . It is known that, when G ' L 0 and a > 0, the solution u of (0.1) exponentially decays. Here we prove that, for any nonnegative a and for any $ G ' \not \equiv 0 $ , the solution u of the Eq. (0.1) exponentially decays only if the relaxation kernel G ' does. In other words, the introduction of the dissipative term related to G ' does not allow the exponential decay due to the presence of the positive coefficient a . We also prove analogous results for the polynomial decay.     

On Partially Commutative Groups and the Relevant Algebras with Commutation

Siberian Mathematical Journal - We consider the algebra $ G_{\circ} $ with commutation on the set of the elements of a partially commutative metabelian group&nbsp; $ G $ . Under study is the...     

On the partition dimension of two-component graphs

In this paper, we continue investigating the partition dimension for disconnected graphs. We determine the partition dimension for some classes of disconnected graphs G consisting of two components. If \(G=G_1 \cup G_2\), then we give the bounds of the partition dimension of G for \(G_1 = P_n\) or \(G_1=C_n\) and also for \(pd(G_1)=pd(G_2)\).     

群的形变收缩及Toeplitz代数

设G为一个离散群,(G,G_ )为一个拟偏序群使得G_ ~0=G_ ∩G_ ~(-1)为G的非平凡子群。令[G]为G关于G_ ~0的左倍集全体,|G_ |为[G]的正部。记T~(G_ )和T~([G_ ])为相应的Toeplitz代数。当存在一个从G到G_ ~0上的形变收缩映照时,我们证明了T~(G_ )酉同构于T~([G_ ])×C_r~*(G_ ~0)的一个C_-~*c子代数。若进一步,G_ ~0还为G的一个正规子群,则T~(G_ )与T~([G_ ])×C_r~*(G_ ~0)酉同构。     

Mean values of multiplicative functions

Let f(n) be a totally multiplicative function such that | &fnof; (n)|&pre; 1 for all n, and let F(s) = &sum; &infin; n=1 &fnof;(n)n —&infin; be the associated Dirichlet series. A variant of Halász"s method is developed, by means of which estimates for &sum; N n=1 &fnof;(n)/n are obtained in terms of the size of | F(s) | for s near 1 with &real;s &gt;1. The result obtained has a number of consequences, particularly concerning the zeros of the partial sum U N (s) =&sum; N n=1 n-s s of the series for the Riemann zeta function.     

On the distribution of (k,r)-integers in Piatetski-Shapiro sequences

Czechoslovak Mathematical Journal - A natural number n is said to be a (k, r)-integer if n = akb, where k &gt; r &gt; 1 and b is not divisible by the rth power of any prime. We study the...     

笛卡尔乘积图的圈点连通度

图G的圈点连通度,记为κ_c(G),是所有圈点割中最小的数目,其中每个圈点割S满足G-S不连通且至少它的两个分支含圈.这篇文章中给出了两个连通图的笛卡尔乘积的圈点连通度:(1)如果G_1≌K_m且G_2≌K_n,则κ_c(G_1×G_2)=min{3m+n-6,m+3n-6},其中m+n≥8,m≥n+2,或n≥m+2,且κ_c(G_1×G_2)=2m+2n-8,其中m+n≥8,m=n,或n=m+1,或m=n+11;(2)如果G_1≌K_m(m≥3)且G_2■K_n,则min{3m+κ(G_2)-4,m+3κ(G_2)-3,2m+2κ(G_2)-4}≤κ_c(G_1×G_2)≤mκ(G2);(3)如果G_1■K_m,K_(1,m-1)且G_2■K_n,K_(1,n-1),其中m≥4,n≥4,则min{3κ(G_1)+κ(G_2)-1,κ(G_1)+3κ(G_2)-1,2_κ(G_1)+2_κ(G_2)-2}≤κ_c(G_1×G_2)≤min{mκ(G_2),nκ(G_1),2m+2n-8}.     

Chromatic Numbers of Some Distance Graphs

Mathematical Notes - For positive integers n &gt; r &gt; s, G(n, r, s) is the graph whose vertices are the r-element subsets of an n-element set, two subsets being adjacent if their...     

算子群的容许子群链

<正> 本文的目的是把作者(1956)最近所得到的一些有关链条件四条件的强果推广到算子群中去.在第一节里的主要结果是定理3,将其用于非结合环即得作者(1956)定理6之推广结果.在§2中讨论算子群的直接乘积的容许子群链,其主要结果为:若诸算子群均各     

粘合运算对图的控制参数的影响

简单图G的粘合运算G_(uv)指的是重合G的两个顶点{u,v}并且去掉重边和环所得到简单图的运算．本文考虑了粘合运算对图的4个控制参数γ(G),Γ(G),β(G),i(G)的影响．刻画了图G_(uv)与图G的控制参数γ(G),Γ(G),γ(G),i(G)之间的关系．及给出γ(G_(uv))=γ(G)-1和β(G_(uv)=β(G)-1的充要条件．     

Note on the Erdos - Szekeres Theorem

Let g(n) denote the least integer such that among any g(n) points in general position in the plane there are always n in convex position. In 1935, P. Erdős and G. Szekeres showed that g(n) exists and . Recently, the upper bound has been slightly improved by Chung and Graham and by Kleitman and Pachter. In this paper we further improve the upper bound to <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p457.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received July 1, 1997, and in revised form July 14, 1997.     

Disposition p-groups

For any prime p and positive integers c, d there is up to isomorphism a unique p-group \({G_{d}^{c}(p)}\) of least order having any (finite) p-group G with rank \({d(G) \le d}\) and Frattini class \({c_{p}(G) \le c}\) as epimorphic image. Here \({c_{p}(G) = n}\) is the least positive integer such that G has a central series of length n with all factors being elementary. This “disposition” p-group \({G_{d}^{c}(p)}\) has been examined quite intensively in the literature, sometimes controversially. The objective of this paper is to present a summary of the known facts, and to add some new results. For instance we show that for \({G = G_{d}^{c}(p)}\) the centralizer \({C_{G}(x) = \langle Z(G), x \rangle}\) whenever \({x \in G}\) is outside the Frattini subgroup, and that for odd p and \({d \ge 2}\) the group \({E = G_{d}^{c+1}(p)/(G_{d}^{c+1}(p))^{p^{c}}}\) is a distinguished Schur cover of G with \({E/Z(E) \cong G}\). We also have a fibre product construction of \({G_{d}^{c+1}(p)}\) in terms of \({G = G_{d}^{c}(p)}\) which might be of interest for Galois theory.     

Properties of Auto- and Antiautomorphisms of Maximal Chain Structures and their Relations to i-Perspectivities

Let E be a non empty set, let P : = E × E, := {x × E|x ∈ E}, := {E × x|x ∈ E}, and := {C ∈ 2 ^P |∀X ∈ : |C ∩ X| = 1} and let . Then the quadruple resp. is called chain structure resp. maximal chain structure. We consider the maximal chain structure as an envelope of the chain structure . Particular chain structures are webs, 2-structures, (coordinatized) affine planes, hyperbola structures or Minkowski planes. Here we study in detail the groups of automorphisms , , , related to a maximal chain structure . The set of all chains can be turned in a group such that the subgroup of generated by the left-, by the right-translations and by ι the inverse map of is isomorphic to (cf. (2.14)).     

On the arithmetic mean of the size of cross-union families

Acta Mathematica Hungarica - Let $$n &gt; k &gt; 1$$ be integers, $$[n] = \{1, \ldots, n\}$$ the standard $$n$$ -element set and $${[n]\choose k}$$ the collection of all its $$k$$ -subsets....     

论局部乘积与POINCARE-ALEXANDER-LEFSCHETZ型对偶定理

<正> 在§1我们界说了局部乘积,它关联 Hausdorff 紧致空间 X 中闭子集X_0的同调以及 X_0在 X 中邻域的同调.在流形与有边流形上的 Poincaré-Alexander-Lefschetz 型对偶定理可以用这种局部乘积表示(§2).在§3,我们研讨了一类所谓摹流形状空间.局部的下调群与上调群的概念在 [3,233—263页;8]中曾不明显地使     

On a class of singular p-Laplacian semipositone problems with sign-changing weights

We study existence of positive weak solution for a class of $p$-Laplacian problem $$\left\{\begin{array}{ll}-\Delta_{p}u = \lambda g(x)[f(u)-\frac{1}{u^{\alpha}}], &amp; x\in \Omega,\\u= 0 , &amp; x\in\partial \Omega,\end{array\right.$$ where $\lambda$ is a positive parameter and $\alpha\in(0,1),$ $\Omega $ is a bounded domain in $ R^{N}$ for $(N &gt; 1)$ with smooth boundary, $\Delta_{p}u = div (|\nabla u|^{p-2}\nabla u)$ is the p-Laplacian operator for $( p &gt; 2),$ $g(x)$ is $C^{1}$ sign-changing function such that maybe negative near the boundary and be positive in the interior and $f$ is $C^{1}$ nondecreasing function $\lim_{s\to\infty}\frac{f(s)}{s^{p-1}}=0.$ We discuss the existence of positive weak solution when $f$ and $g$ satisfy certain additional conditions. We use the method of sub-supersolution to establish our result.