Zn[i] 的平方映射图

本文研究了模n 高斯整数环Z_n[i] 的平方映射图Γ(n). 利用数论、图论与群论等方法, 获得了Γ(n) 中顶点0 及1 的入度, 并研究了Γ(n) 的零因子子图的半正则性. 同时, 获得了Γ(n) 中顶点的高度公式.推广了Somer 等人给出的模n 剩余类环平方映射图的相关结论.     

On Cramer Approximations under Violation of Cramer's Condition

Let X ₁, X ₂,... be independent identically distributed random variables with distribution function F, S ₀ = 0, S _n = X ₁ + ⋯ + X _n , and Sˉ _n = max_1⩽k⩽n S _k . We obtain large-deviation theorems for S _n and Sˉ _n under the condition 1 − F(x) = P{X ₁ ⩾ x} = e^−l(x), l(x) = x ^α L(x), α ∈ (0, 1), where L(x) is a slowly varying function as x → ∞. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 4, pp. 447–456, October–December, 2005.     

超网络的主子超图分析法

本文引入了超网络、混合超图及其主子超图的概念,提出了分析线性有源超网络的一种新的拓扑方法——主子超图法的原理和算法。它产生的符号网络函数表达式很紧凑,而且不含对消项。它的计算时间复杂度为O(m³eⁿh+m₁u_GΣn₁),比文献[1,2]的降低两三个数量级。本法最适合于要求符号网络函数表达式按所有受控源互导纳集项的场合。     

A generalization of a result of R. Lyons about measures on [0, 1)

Letμ be a probability measure on [0, 1), invariant underS:x ↦px mod 1, and for which almost every ergodic component has positive entropy. Ifq is a real number greater than 1 for which logq/ logp is irrational, andT _n sendsx toq ⁿx mod 1, then for any ε>0 the measureμT _n ⁻¹ will — for a set ofn of positive lower density — be within ε of Lebesgue measure.     

Cyclotomic and simplicial matroids

We show that two naturally occurring matroids representable over ℚ are equal: thecyclotomic matroid μ_n represented by then ^th roots of unity 1, ζ, ζ², …, ζ^n-1 inside the cyclotomic extension ℚ(ζ), and a direct sum of copies of a certain simplicial matroid, considered originally by Bolker in the context of transportation polytopes. A result of Adin leads to an upper bound for the number of ℚ-bases for ℚ(ζ) among then ^th roots of unity, which is tight if and only ifn has at most two odd prime factors. In addition, we study the Tutte polynomial of μ_n in the case thatn has two prime factors. First author supported by NSF Postdoctoral Fellowship. Second author supported by NSF grant DMS-0245379.     

Universally L 1 good sequences with gaps tending to infinity

We construct a sequence (n _k ) such that n _{k + 1} − n _k → ∞ and for any ergodic dynamical system (X, Σ, μ, T) and f ε L ¹(μ) the averages converge to ∝ _X f dμ for μ almost every x. Since the above sequence is of zero Banach density this disproves a conjecture of J. Rosenblatt and M. Wierdl about the nonexistence of such sequences. Research supported by the Hungarian National Foundation for Scientific research T049727.     

The monodromy of a series of hypersurface singularities

Let {f=0} be a hypersurface inC ⁿ⁺¹ with a 1-dimensional singular set Σ. We consider the series of hypersurfaces {f+ɛx ^N=0} wherex is a generic linear form. We derive a formula, which relates the characteristic polynomials of the monodromies off andf+ɛx ^N. Other ingredients in this formula are the horizontal and the vertical monodromies of the transversal (isolated) singularities on each branch of the singular set. We use polar curves and the carrousel method in the proof. The formula is a generalization of the Iomdin formula for the Milnor numbers: μ(f+ɛx ^N )=μ _n (f)−μ _n −1(f)+Ne ₀(Σ)     

金属材料的有效应力集中系数预测

本文从理论上导出了高缺口敏感和低缺口敏感的金属材料的有效应力集中系数K_f为K_t^1/(1+n)和K_t^2/(3+n).通过对大量K_f数据的综合分析得到了K_f-K_t的关系图,并指出了上面两种K_f关系的适用范围;对钢和铝合金的计算结果表明:理论值与测量结果非常接近,绝大部分数据的相对误差在±10％之内.最后讨论了光滑试样疲劳极限(σ_R)的理论表达式:σ_R=(K/Eⁿ)^1/(1-n),并分析了该式的意义和适用范围,结果表明σ_n=σ_cy(循环屈服强度).     

QK空间的插值序列

本文研究了Q_K空间的插值问题.利用复分析和调和分析的方法,获得了单位圆盘上的一个序列{z_n}是Q_K∩H^∞空间的插值序列的一个充分必要条件,推广了Q_p空间的部分结果.     

关于多线性奇异积分的估计

对,记 其中P_mi+1(a_i,x,y)记a_i的在y点展开的第m_i+1阶Taylor级数余项,m_i≥1,m=(m₁,…,m_n),|m|=∑m_i。Ω:R^K→C是在单位球面上满足Lipschitz条件的零次齐次函数,并使得T_*^m+1满足一个有界性条件。本文的结果如下: 1)C为一个常数。 2)T^m+1(a,f)(x)a.e.存在. 3)对T_*^m+1存在Muckenhoupt类的加权估计。     

Lower bounds on signed edge total domination numbers in graphs

The open neighborhood N _G (e) of an edge e in a graph G is the set consisting of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 1}. If for each e ∈ E(G), then f is called a signed edge total dominating function of G. The minimum of the values , taken over all signed edge total dominating function f of G, is called the signed edge total domination number of G and is denoted by γ _st ′(G). Obviously, γ _st ′(G) is defined only for graphs G which have no connected components isomorphic to K ₂. In this paper we present some lower bounds for γ _st ′(G). In particular, we prove that γ _st ′(T) ⩾ 2 − m/3 for every tree T of size m ⩾ 2. We also classify all trees T with γ _st ′(T). Research supported by a Faculty Research Grant, University of West Georgia.     

Edge Domination in Graphs of Cubes

The signed edge domination number and the signed total edge domination number of a graph are considered; they are variants of the domination number and the total domination number. Some upper bounds for them are found in the case of the n-dimensional cube Q _n.     

A lower bound on the total signed domination numbers of graphs

Let G be a finite connected simple graph with a vertex set V(G)and an edge set E(G). A total signed domination function of G is a function f:V(G)∪E(G)→{-1,1}.The weight of f is W(f)=∑_(x∈V)(G)∪E(G))f(X).For an element x∈V(G)∪E(G),we define f[x]=∑_(y∈NT[x])f(y).A total signed domination function of G is a function f:V(G)∪E(G)→{-1,1} such that f[x]≥1 for all x∈V(G)∪E(G).The total signed domination numberγ_s~*(G)of G is the minimum weight of a total signed domination function on G. In this paper,we obtain some lower bounds for the total signed domination number of a graph G and compute the exact values ofγ_s~*(G)when G is C_n and P_n.     

关于图的团符号控制数

引入了图的团符号控制的概念,给出了n阶图G的团符号控制数γks(G)的若干下限,确定了几类特殊图的团符号控制数,并提出了若干未解决的问题和猜想.     

关于图的符号边全控制数

引入了图的符号边全控制的概念,给出了一个连通图G的符号边全控制数γs′t(G)的下限,确定所有n阶树T的最小符号边全控制数,并刻划了满足γs′t(G)=E(G)的所有连通图G,最后还提出了一个关于γs′t(G)上界的猜想.     

图的符号边控制数

图的符号边控制数有着许多重要的应用背景.已知它的计算是NP-完全问题,因而确定其精确值有重要意义.本文确定了图F*n+1、H n和P*n的符号边控制数.     

Graceful signed graphs: II. The case of signed cycles with connected negative sections

In our earlier paper [9], generalizing the well known notion of graceful graphs, a (p, m, n)-signed graph S of order p, with m positive edges and n negative edges, is called graceful if there exists an injective function f that assigns to its p vertices integers 0, 1,...,q = m + n such that when to each edge uv of S one assigns the absolute difference |f(u)-f(v)| the set of integers received by the positive edges of S is {1,2,...,m} and the set of integers received by the negative edges of S is {1,2,...,n}. Considering the conjecture therein that all signed cycles Z_k, of admissible length k 3 and signed structures, are graceful, we establish in this paper its truth for all possible signed cycles of lengths 0, 2 or 3 (mod 4) in which the set of negative edges forms a connected subsigraph.     

图的k符号边控制数

设G=(V,E)是一个图,一个函数f:E→{-1,+1},如果对于G中至少k条边e有sum from e'∈N[e]f(e')≥1成立,则称f为图G的一个k符号边控制函数.一个图的k符号边控制数定义为γ_(ks)^/(G)=min{∑_(e∈E(G))f(e)|f为图G的一个k符号边控制函数}.主要给出了一个图G的k符号边控制数γ_(ks)/(G)=min{∑_(e∈E(G))f(e)|f为图G的一个k符号边控制函数}.主要给出了一个图G的k符号边控制数γ_(ks)^/(G)的若干新下限,并确定了路和圈的k符号边控制数.     

Signed and minus domination in bipartite graphs

The paper studies the signed domination number and the minus domination number of the complete bipartite graph K _{p, q} .     

Hyperidentities of lattices and semilattices

Following W. Taylor we define a hyperidentity ∈ to be formally the same as an identity (e.g.,F(G(x, y, z), G(x, y, z))=G(x, y, z)). However, a varietyV is said to satisfy a hyperidentity ∈, if whenever the operation symbols of ∈ are replaced by any choice of polynomials (appropriate forV) of the same arity as the corresponding operation symbols of ∈, then the resulting identity holds inV in the usual sense. For example, if a varietyV of type <2,2> with operation symbols ∨ and ∧ satisfies the hyperidentity given above, then substituting the polynomial (x∨y)∨z for the symbolG, and the polynomialx∧y forF, we see thatV must in particular satisfy the identity ((x∨y)∨z)∧((x∨y)∨z)=((x∨y)∨z). The set of all hyperidentities satisfied by a varietyV, will be denoted byH(V). We shall letH ^m (V) be the set of all hyperidentities hoiding inV with operation symbols of arity at mostm, andH _n (V) will denote the set of all hyperidentities ofV with at mostn distinct variables. In this paper we shall show that ifV is a nontrivial variety of lattices or the variety of all semilattices, then for any integersm andn, there exists a hyperidentity ∈ such that ∈ holds inV, and ∈ is not a consequence ofH ^m (V)∪H _n (V). From this it is deduced that the hyperidentities ofV are not finitely based, partly soling a problem of Taylor [7, Problem 3]. The research of the author was supported by NSERC of Canada. Presented by W. Taylor.