Cartan型模李超代数S(m,n;t)的中心扩张

本文研究了特征为素数p>2的有限维Special李超代数S(m,n;t)的中心扩张.通过计算从S(m,n;t)到S(m,n;t)^*的斜外导子,得到二阶上同调群H²(S(m,n;t),F)是平凡的.应用此结果,可得S(m,n;t)的中心扩张是平凡的.     

Graphs satisfying inequality θ(G)θ(G)

In this paper, we study the edge clique cover number of squares of graphs. More specifically, we study the inequality θ(G²)θ(G) where θ(G) is the edge clique cover number of a graph G. We show that any graph G with at most θ(G) vertices satisfies the inequality. Among the graphs with more than θ(G) vertices, we find some graphs violating the inequality and show that dually chordal graphs and power-chordal graphs satisfy the inequality. Especially, we give an exact formula computing θ(T²) for a tree T.     

Theories of linear order

LetT be a complete theory of linear order; the language ofT may contain a finite or a countable set of unary predicates. We prove the following results. (i) The number of nonisomorphic countable models ofT is either finite or 2^ω. (ii) If the language ofT is finite then the number of nonisomorphic countable models ofT is either 1 or 2^ω. (iii) IfS ₁(T) is countable then so isS _n(T) for everyn. (iv) In caseS ₁(T) is countable we find a relation between the Cantor Bendixon rank ofS ₁(T) and the Cantor Bendixon rank ofS _n(T). (v) We define a class of modelsL, and show thatS ₁(T) is finite iff the models ofT belong toL. We conclude that ifS ₁(T) is finite thenT is finitely axiomatizable. (vi) We prove some theorems concerning the existence and the structure of saturated models. Most of the results in this paper appeared in the author’s Master of Science thesis which was prepared at the Hebrew University under the supervision of Professor H. Gaifman.     

The smooth Banach submanifold B*(E, F) in B(E, F)

Let E,F be two Banach spaces,B(E,F),B+(E,F),Φ(E,F),SΦ(E,F) and R(E,F) be bounded linear,double splitting,Fredholm,semi-Frdholm and finite rank operators from E into F,respectively. Let Σ be any one of the following sets:{T ∈Φ(E,F):Index T=constant and dim N(T)=constant},{T ∈ SΦ(E,F):either dim N(T)=constant< ∞ or codim R(T)=constant< ∞} and {T ∈ R(E,F):Rank T=constant< ∞}. Then it is known that Σ is a smooth submanifold of B(E,F) with the tangent space TAΣ={B ∈ B(E,F):BN(A)-R(A) } for any A ∈Σ. However,for ...     

An Asymptotic Ratio in the Complete Binary Tree

Let T _n be the complete binary tree of height n considered as the Hasse-diagram of a poset with its root 1 _n as the maximum element. For a rooted tree T, define two functions counting the embeddings of T into T _n as follows A(n;T)=|{S T _n  : 1 _n ∈S, S≅T}|, and B(n;T)=|{S T _n :1 _n ∉S, S≅T}|. In this paper we investigate the asymptotic behavior of the ratio A(n;T)/B(n;T), and we show that lim  _n→∞[A(n;T)/B(n;T)]=2^ℓ;−1−1, for any tree T with ℓ leaves. This revised version was published online in June 2006 with corrections to the Cover Date.     

A unified approach for univalent functions with negative coefficients using the Hadamard product

For given analytic functions ϕ(z) = z + Σ _n=2^∞ λ _n z ⁿ , Ψ(z) = z + Σ _n=2^∞ μ with λ _n ≥ 0, μ _n ≥ 0, and λ _n ≥ μ _n and for α, β (0≤α<1, 0<β≤1), let E(φ,ψ; α, β) be of analytic functions ƒ(z) = z + Σ _n=2^∞ a _n z ⁿ in U such that f(z)*ψ(z)≠0 and

A note on the Σ1 collection scheme and fragments of bounded arithmetic

We show that for each n ≥ 1, if T₂ⁿ does not prove the weak pigeonhole principle for Σ^b_n functions, then the collection scheme B Σ₁ is not finitely axiomatizable over T₂ⁿ. The same result holds with Sⁿ₂ in place of T 2ⁿ (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

β级星像函数类和凸像函数类的扩展问题

本文利用文[2,3]的引理和算子L(a,c)f(z)的一些性质.结合Hadamard乘积,研究了算子L(a,c)f(z),获得了L(a,c)f(z)∈S*(β)和L(a,c)f(z)∈K(β)的充分条件,推广了文[2,3]的相关结论.     

Counting functions and expected values for the lattice profile at n

Recently, Dorfer and Winterhof introduced and analyzed a lattice test for sequences of length n over a finite field. We determine the number of sequences η of length n with given largest dimension S_n(η)=S for passing this test. From this result we derive an exact formula for the expected value of S_n(η). For the binary case we characterize the (infinite) sequences η with maximal possible S_n(η) for all n.     

Distortion Properties of Holomorphic Functions of Several Complex Variables

Let Q(D) be a class of functions q, q(0) = 0, |q(z)| < 1 holomorphic in the Reinhardt domain D ? C ⁿ, a and b — arbitrary fixed numbers satisfying the condition — 1 ≤ b < a ≤ 1. ??(a, b; D) — the class of functions p such that p ? ??(a, b; D) iff for some q ? Q(D) and every z ? D. S*(a, b; D) — the class of functions f such that f ? S*(a, g; D) iff S^c(a, b; D) — the class of functions q such that q ? S^c(a, b; D) iff , where p ε ??(a, b; D) and K is an operator of the form for z=z₁,z₂,…z_n. The author obtains sharp bounds on |p(z)|, f(z)| g(z)| as well as sharp coefficient inequalities for functions in ??(a, b; D), S*(a, b; D) and S^c(a, b; D).     

The 3‐connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial

Let G be a graph of order n, maximum degree Δ, and minimum degree δ. Let P(G, λ) be the chromatic polynomial of G. It is known that the multiplicity of zero “0” of P(G, λ) is one if G is connected, and the multiplicity of zero “1” of P(G, λ) is one if G is 2‐connected. Is the multiplicity of zero “2” of P(G, λ) at most one if G is 3‐connected? In this article, we first construct an infinite family of 3‐connected graphs G such that the multiplicity of zero “2” of P(G, λ) is more than one, and then characterize 3‐connected graphs G with Δ + δ?n such that the multiplicity of zero “2” of P(G, λ) is at most one. In particular, we show that for a 3‐connected graph G, if Δ + δ?n and (Δ, δ₃)≠(n?3, 3), where δ₃ is the third minimum degree of G, then the multiplicity of zero “2” of P(G, λ) is at most one. © 2011 Wiley Periodicals, Inc. J Graph Theory     

Existence of T*(3, 4,v)‐codes

A word of length k over an alphabet Q of size v is a vector of length k with coordinates taken from Q. Let Q^*₄ be the set of all words of length 4 over Q. A T^*(3, 4, v)‐code over Q is a subset C^*? Q^*₄ such that every word of length 3 over Q occurs as a subword in exactly one word of C^*. Levenshtein has proved that a T^*(3, 4, vv)‐code exists for all even v. In this paper, the notion of a generalized candelabra t‐system is introduced and used to show that a T^*(3, 4, v)‐code exists for all odd v. Combining this with Levenshtein's result, the existence problem for a T^*(3,4, v)‐code is solved completely. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 42–53, 2005.     

Schur functions and the invariant polynomials characterizing U(n) tensor operators

We give a direct formulation of the invariant polynomials _μG_q⁽ⁿ⁾(, Δ_i,;, x_{i,i + 1},) characterizing U(n) tensor operators p, q, …, q, 0, …, 0 in terms of the symmetric functions S_λ known as Schur functions. To this end, we show after the change of variables Δ_i = γ_i − δ_i and x_{i, i + 1} = δ_i − δ_{i + 1} that_μG_q⁽ⁿ⁾(,Δ_i;, x_{i, i + 1},) becomes an integral linear combination of products of Schur functions S_α(, γ_i,) · S_β(, δ_i,) in the variables {γ₁,…, γ_n} and {δ₁,…, δ_n}, respectively. That is, we give a direct proof that _μG_q⁽ⁿ⁾(,Δ_i,;, x_{i, i + 1},) is a bisymmetric polynomial with integer coefficients in the variables {γ₁,…, γ_n} and {δ₁,…, δ_n}. By making further use of basic properties of Schur functions such as the Littlewood-Richardson rule, we prove several remarkable new symmetries for the yet more general bisymmetric polynomials _μ^mG_q⁽ⁿ⁾(γ₁,…, γ_n; δ₁,…, δ_m). These new symmetries enable us to give an explicit formula for both _μ^mG₁⁽ⁿ⁾(γ; δ) and ₁G₂⁽ⁿ⁾(γ; δ). In addition, we describe both algebraic and numerical integration methods for deriving general polynomial formulas for _μ^mG_q⁽ⁿ⁾(γ; δ).     

On packing 3‐vertex paths in a graph

Let G be a connected graph and let eb(G) and λ(G) denote the number of end‐blocks and the maximum number of disjoint 3‐vertex paths Λ in G. We prove the following theorems on claw‐free graphs: (t1) if G is claw‐free and eb(G) ≤ 2 (and in particular, G is 2‐connected) then λ(G) = ⌊| V(G)|/3⌋; (t2) if G is claw‐free and eb(G) ≥ 2 then λ(G) ≥ ⌊(| V(G) | − eb(G) + 2)/3 ⌋; and (t3) if G is claw‐free and Δ^*‐free then λ(G) = ⌊| V(G) |/3⌋ (here Δ^* is a graph obtained from a triangle Δ by attaching to each vertex a new dangling edge). We also give the following sufficient condition for a graph to have a Λ‐factor: Let n and p be integers, 1 ≤ p ≤ n − 2, G a 2‐connected graph, and |V(G)| = 3n. Suppose that G − S has a Λ‐factor for every S ⊆ V(G) such that |S| = 3p and both V(G) − S and S induce connected subgraphs in G. Then G has a Λ‐factor. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 175–197, 2001     

Completeness of Trigonometric System with Integer Indices {e; x }

Necessary and sufficient conditions are given which ensure the completeness of the trigonometric systems with integer indices; {e^inx; x }^∞_n=−∞ or {e^inx; x }^∞_n=1 in L^α(μ,  ), α1. If there exists a support Λ of the measure μ which is a wandering set, that is, Λ+2kπ, k=0, ±1, ±2, … are mutually disjoint for different k's, then the linear span of our trigonometric system {e^inx; x }^∞_n=−∞ is dense in L^α(μ,  ) α1. The converse statement is also true.     

Polynomial Projections inC[−1, 1] andL(−1, 1) with Growthn, 0<γ1/2

Forγ(0, 1/2] we constructn-dimensional polynomial subspacesY_nofC[−1, 1] andL¹(−1, 1) such that the relative projection constantsλ(Y_n, C[−1, 1]) andλ(Y_n, L¹(−1, 1)) grow asn^γ. These subspaces are spanned by Chebyshev polynomials of the first and second kind, respectively. The spacesL¹_{w(α, β}wherew_{α, β}is the weight function of the Jacobi polynomials and (α, β){(−1/2, −1/2), (−1/2, 0), (0, −1/2)} are also studied.     

A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm

Recently, É. Tardos gave a strongly polynomial algorithm for the minimum-cost circulation problem and solved the open problem posed in 1972 by J. Edmonds and R.M. Karp. Her algorithm runs in O(m ² T(m, n) logm) time, wherem is the number of arcs,n is the number of vertices, andT(m, n) is the time required for solving a maximum flow problem in a network withm arcs andn vertices. In the present paper, taking an approach that is a dual of Tardos's, we also give a strongly polynomial algorithm for the minimum-cost circulation problem. Our algorithm runs in O(m ² S(m, n) logm) time and reduces the computational complexity, whereS(m, n) is the time required for solving a shortest path problem with a fixed origin in a network withm arcs,n vertices, and a nonnegative arc length function. The complexity is the same as that of Orlin's algorithm, recently developed by efficiently implementing the Edmonds-Karp scaling algorithm.     

Inverse Scattering at Fixed Energy in de Sitter�CReissner�CNordstr?m Black Holes

In this paper, we consider massless Dirac fields propagating in the outer region of de Sitter–Reissner–Nordstr?m black holes. We show that the metric of such black holes is uniquely determined by the partial knowledge of the corresponding scattering matrix S(λ) at a fixed energy λ ≠ 0. More precisely, we consider the partial wave scattering matrices S(λ, n) (here λ ≠ 0 is the fixed energy and n ? \mathbbN^*{n \in \mathbb{N}^{*}} denotes the angular momentum) defined as the restrictions of the full scattering matrix on a well chosen basis of spin-weighted spherical harmonics. We prove that the mass M, the square of the charge Q ² and the cosmological constant Λ of a dS-RN black hole (and thus its metric) can be uniquely determined from the knowledge of either the transmission coefficients T(λ, n), or the reflexion coefficients R(λ, n) (resp. L(λ, n)), for all n ? L{n \in {\mathcal{L}}} where L{\mathcal{L}} is a subset of \mathbbN^*{\mathbb{N}^{*}} that satisfies the Müntz condition ?_{n ? L}\frac1n = +￥{\sum_{n \in{\mathcal{L}}}\frac{1}{n} = +\infty} . Our main tool consists in complexifying the angular momentum n and in studying the analytic properties of the “unphysical” scattering matrix S(λ, z) in the complex variable z. We show, in particular, that the quantities \frac1T(l,z){\frac{1}{T(\lambda,z)}}, \fracR(l,z)T(l,z){\frac{R(\lambda,z)}{T(\lambda,z)}} and \fracL(l,z)T(l,z){\frac{L(\lambda,z)}{T(\lambda,z)}} belong to the Nevanlinna class in the region ${\{z \in \mathbb{C}, Re(z) > 0 \}}${\{z \in \mathbb{C}, Re(z) > 0 \}} for which we have analytic uniqueness theorems at our disposal. Eventually, as a by-product of our method, we obtain reconstruction formulae for the surface gravities of the event and cosmological horizons of the black hole which have an important physical meaning in the Hawking effect.     

Cochromatic Number and the Genus of a Graph

The cochromatic number of a graph G, denoted by z(G), is the minimum number of subsets into which the vertex set of G can be partitioned so that each sbuset induces an empty or a complete subgraph of G. In this paper we introduce the problem of determining for a surface S, z(S), which is the maximum cochromatic number among all graphs G that embed in S. Some general bounds are obtained; for example, it is shown that if S is orientable of genus at least one, or if S is nonorientable of genus at least four, then z(S) is nonorientable of genus at least four, then z(S)≤χ(S). Here χ(S) denotes the chromatic number S. Exact results are obtained for the sphere, the Klein bottle, and for S. It is conjectured that z(S) is equal to the maximum n for which the graph G_n = K₁ ∪ K₂ ∪ … ∪ K_n embeds in S.     

Best approximation in L(μ, X), II

The object of this paper is to prove the following theorem: If Y is a closed subspace of the Banach space X, then L¹(μ, Y) is proximinal in L¹(μ, X) if and only if L^p(μ, Y) is proximinal in L^p(μ, Y) for every p, 1 < p < ∞. As an application of this result we prove that if Y is either reflexive or Y is a separable proximinal dual space, then L¹(μ, Y) is proximinal in L¹(μ, X).