共查询到20条相似文献,搜索用时 31 毫秒
1.
A characteristic property of spheres 总被引:1,自引:1,他引:0
A. D. Alexandrov 《Annali di Matematica Pura ed Applicata》1962,58(1):303-315
Summary We prove: Let S be a closed n-dimensional surface in an(n+1)-space of constant curvature (n ≥ 2); k1 ≥ ... ≥ kn denote its principle curvatures. Let φ(ξ1, ..., ξn) be such that
. Then if φ(k1, ..., kn)=const on S and S is subject to some additional general conditions (those(II
0) or(II) no 1), S is a sphere.
To Enrico Bompiani on his scientific Jubilee 相似文献
2.
Raphael Yuster 《Order》2003,20(2):121-133
Let TT
k
denote the transitive tournament on k vertices. Let TT(h,k) denote the graph obtained from TT
k
by replacing each vertex with an independent set of size h≥1. The following result is proved: Let c
2=1/2, c
3=5/6 and c
k
=1−2−k−log k
for k≥4. For every ∈>0 there exists N=N(∈,h,k) such that for every undirected graph G with n>N vertices and with δ(G)≥c
k
n, every orientation of G contains vertex disjoint copies of TT(h,k) that cover all but at most ∈n vertices. In the cases k=2 and k=3 the result is asymptotically tight. For k≥4, c
k
cannot be improved to less than 1−2−0.5k(1+o(1)).
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
3.
Robert S. Strichartz 《Journal of Geometric Analysis》1991,1(3):269-289
Let μ be a measure on ℝn that satisfies the estimate μ(B
r(x))≤cr
α for allx ∈ ℝn and allr ≤ 1 (B
r(x) denotes the ball of radius r centered atx. Let ϕ
j,k
(ɛ)
(x)=2
nj2ϕ(ɛ)(2
j
x-k) be a wavelet basis forj ∈ ℤ, κ ∈ ℤn, and ∈ ∈E, a finite set, and letP
j
(T)=Σɛ,k
<T,ϕ
j,k
(ɛ)
>ϕ
j,k
(ɛ)
denote the associated projection operators at levelj (T is a suitable measure or distribution). Iff ∈Ls
p(dμ) for 1 ≤p ≤ ∞, we show thatP
j(f dμ) ∈ Lp(dx) and ||P
j
(fdμ)||L
p(dx)≤c2
j((n-α)/p′))||f||L
p(dμ) for allj ≥ 0. We also obtain estimates for the limsup and liminf of ||P
j
(fdμ)||L
p(dx) under more restrictive hypotheses.
Communicated by Guido Weiss 相似文献
4.
E. S. Dubtsov 《Journal of Mathematical Sciences》2010,166(1):23-30
Let B
n
denote the unit ball in
\mathbbC \mathbb{C}
n
, n ≥ 1. Let K \mathcal{K}
0(n) denote the class of functions defined for z ∈ B
n
as a constant plus the integral of the kernel log(1/(1 −〈z, ζ〉)) against a complex Borel measure on the sphere {ζ ∈
\mathbbC \mathbb{C}
n
,: |ζ| = 1}. Properties of holomorphic functions g such that fg ∈ K \mathcal{K}
0(n) for all f ∈ K \mathcal{K}
0(n) are studied. The extended Cesàro operators are investigated on the spaces K \mathcal{K}
0(n), n ≥ 1. Bibliography: 15 titles. 相似文献
5.
Let R
k,s
(n) denote the number of solutions of the equation n = x2 + y1k + y2k + ?+ ysk{n= x^2 + y_1^k + y_2^k + \cdots + y_s^k} in natural numbers x, y
1, . . . , y
s
. By a straightforward application of the circle method, an asymptotic formula for R
k,s
(n) is obtained when k ≥ 3 and s ≥ 2
k–1 + 2. When k ≥ 6, work of Heath-Brown and Boklan is applied to establish the asymptotic formula under the milder constraint s ≥ 7 · 2
k–4 + 3. Although the principal conclusions provided by Heath-Brown and Boklan are not available for smaller values of k, some of the underlying ideas are still applicable for k = 5, and the main objective of this article is to establish an asymptotic formula for R
5,17(n) by this strategy. 相似文献
6.
Dietrich Burde 《manuscripta mathematica》2000,103(4):435-446
Let p(n) denote the partition function and define where p(0)= 1. We prove that p(n,k) is unimodal and satisfies for fixed n≥ 1 and all 1≤k≤n. This result has an interesting application: the minimal dimension of a faithful module for a k-step nilpotent Lie algebra of dimension n is bounded by p(n,k) and hence by , independently of k. So far only the bound n
n
−1 was known. We will also prove that for n≥ 1 and
.
Received: 17 December 1999 相似文献
7.
Y. Lacroix 《Israel Journal of Mathematics》2002,132(1):253-263
LetG denote the set of decreasingG: ℝ→ℝ withGэ1 on ]−∞,0], and ƒ
0
∞
G(t)dt⩽1. LetX be a compact metric space, andT: X→X a continuous map. Let μ denone aT-invariant ergodic probability measure onX, and assume (X, T, μ) to be aperiodic. LetU⊂X be such that μ(U)>0. Let τ
U
(x)=inf{k⩾1:T
k
xεU}, and defineG
U
(t)=1/u(U)u({xεU:u(U)τU(x)>t),tεℝ We prove that for μ-a.e.x∈X, there exists a sequence (U
n
)
n≥1
of neighbourhoods ofx such that {x}=∩
n
U
n
, and for anyG ∈G, there exists a subsequence (n
k
)
k≥1
withG
U
n
k
↑U weakly.
We also construct a uniquely ergodic Toeplitz flowO(x
∞,S, μ), the orbit closure of a Toeplitz sequencex
∞, such that the above conclusion still holds, with moreover the requirement that eachU
n
be a cylinder set.
In memory of Anzelm Iwanik 相似文献
8.
Let B
w
(ℓ
p
) denote the space of infinite matrices A for which A(x) ∈ ℓ
p
for all x = {x
k
}
k=1∞ ∈ ℓ
p
with |x
k
| ↘ 0. We characterize the upper triangular positive matrices from B
w
(ℓ
p
), 1 < p < ∞, by using a special kind of Schur multipliers and the G. Bennett factorization technique. Also some related results are
stated and discussed. 相似文献
9.
Marin Gutan 《Semigroup Forum》1996,53(1):173-183
Let σ be a nontrivial permutation of ordern. A semigroupS is said to be σ-permutable ifx
1
x
2
...x
n
=x
σ(1)
x
σ(2)
...x
σ(n)
, for every (x
1
,x
2,...,x
n
)∈S
n
. A semigroupS is called(r,t)-commutative, wherer,t are in ℕ*, ifx
1
...x
r
x
r+1
...x
r+t
=x
r+1
...x
r+t
x
1
...x
r
, for every (x
1
,x
2,...,x
r+t
∈S
r+t
. According to a result of M. Putcha and A. Yaqub ([11]), if σ is a fixed-point-free permutation andS is a σ-permutable semigroup then there existsk ∈ ℕ* such thatS is (1,k)-commutative. In [8], S. Lajos raises up the problem to determine the leastk=k(n) ∈ ℕ* such that, for every fixed-point-free permutation σ of ordern, every σ-permutable semigroup is also (1,k)-commutative. In this paper this problem is solved for anyn less than or equal to eight and also whenn is any odd integer. For doing this we establish that if a semigroup satisfies a permutation identity of ordern then inevitably it also satisfies some permutation identities of ordern+1. 相似文献
10.
. Let d(D) (resp., d(G)) denote the diameter and r(D) (resp., r(G)) the radius of a digraph D (resp., graph G). Let G×H denote the cartesian product of two graphs G and H. An orientation D of G is said to be (r, d)-invariant if r(D)=r(G) and d(D)=d(G). Let {T
i
}, i=1,…,n, where n≥2, be a family of trees. In this paper, we show that the graph ∏
i
=1
n
T
i
admits an (r, d)-invariant orientation provided that d(T
1)≥d(T
2)≥4 for n=2, and d(T
1)≥5 and d(T
2)≥4 for n≥3.
Received: July 30, 1997 Final version received: April 20, 1998 相似文献
11.
N. M. Timofeev 《Mathematical Notes》1997,61(3):321-332
Let τk(n) be the number of representations ofn as the product ofk positive factors, τ(n)=τ(n). The asymptotics of Σ
n≤x
τ
k
(n)τ(n+1) for 80k
10 (lnlnx)3≤lnx is shown to be uniform with respect tok.
Translated fromMatematicheskie Zametki, Vol. 61, No. 3, pp. 391–406, March, 1997.
Translated by N. K. Kulman 相似文献
12.
Let {S
n
} be a random walk on ℤ
d
and let R
n
be the number of different points among 0, S
1,…, S
n
−1. We prove here that if d≥ 2, then ψ(x) := lim
n
→∞(−:1/n) logP{R
n
≥nx} exists for x≥ 0 and establish some convexity and monotonicity properties of ψ(x). The one-dimensional case will be treated in a separate paper.
We also prove a similar result for the Wiener sausage (with drift). Let B(t) be a d-dimensional Brownian motion with constant drift, and for a bounded set A⊂ℝ
d
let Λ
t
= Λ
t
(A) be the d-dimensional Lebesgue measure of the `sausage' ∪0≤
s
≤
t
(B(s) + A). Then φ(x) := lim
t→∞:
(−1/t) log P{Λ
t
≥tx exists for x≥ 0 and has similar properties as ψ.
Received: 20 April 2000 / Revised version: 1 September 2000 / Published online: 26 April 2001 相似文献
13.
Raffaele Mosca 《Graphs and Combinatorics》2001,17(3):517-528
Let G be a graph with n vertices, and denote as γ(G) (as θ(G)) the cardinality of a minimum edge cover (of a minimum clique cover) of G. Let E (let C) be the edge-vertex (the clique-vertex) incidence matrix of G; write then P(E)={x∈ℜ
n
:Ex≤1,x≥0}, P(C)={x∈ℜ
n
:Cx≤1,x≥0}, α
E
(G)=max{1
T
x subject to x∈P(E)}, and α
C
(G)= max{1
T
x subject to x∈P(C)}. In this paper we prove that if α
E
(G)=α
C
(G), then γ(G)=θ(G).
Received: May 20, 1998?Final version received: April 12, 1999 相似文献
14.
An (n, d, k)-mapping f is a mapping from binary vectors of length n to permutations of length n + k such that for all x, y
{0,1}n, dH (f(x), f(y)) ≥ dH (x, y) + d, if dH (x, y) ≤ (n + k) − d and dH (f(x), f(y)) = n + k, if dH (x, y) > (n + k) − d. In this paper, we construct an (n,3,2)-mapping for any positive integer n ≥ 6. An (n, r)-permutation array is a permutation array of length n and any two permutations of which have Hamming distance at least r. Let P(n, r) denote the maximum size of an (n, r)-permutation array and A(n, r) denote the same setting for binary codes. Applying (n,3,2)-mappings to the design of permutation array, we can construct an efficient permutation array (easy to encode and decode)
with better code rate than previous results [Chang (2005). IEEE Trans inf theory 51:359–365, Chang et al. (2003). IEEE Trans
Inf Theory 49:1054–1059; Huang et al. (submitted)]. More precisely, we obtain that, for n ≥ 8, P(n, r) ≥ A(n − 2, r − 3) > A(n − 1,r − 2) = A(n, r − 1) when n is even and P(n, r) ≥ A(n − 2, r − 3) = A(n − 1, r − 2) > A(n, r − 1) when n is odd. This improves the best bound A(n − 1,r − 2) so far [Huang et al. (submitted)] for n ≥ 8.
The work was supported in part by the National Science Council of Taiwan under contract NSC-93-2213-E-009-117 相似文献
15.
A. N. Dyogtev 《Algebra and Logic》1996,35(2):80-85
Let A⊆N={0,1,2,...} and β be an n-ary Boolean function. We call A a β-implicatively selector (β-IS) set if there exists an
n-ary selector general recursive function f such that (∀x1,...,xn)(β(χ(x1),...,χ(xn))=1⟹f(x1,...,xn)∈A), where χ is the characteristic function of A. Let F(m), m≥1, be the family of all d
m+1
*
-IS sets, where
, F(0)=N, and F(∞) is the class of all subsets in N. The basic result of the article says that the family of all β-IS sets coincides with one
of F(m), m≥0, or F(∞), and, moreover, the inclusions F(0)⊂F(1)⊂...⊂F(∞) hold.
Translated fromAlgebra i Logika, Vol. 35, No. 2, pp. 145–153, March–April, 1996. 相似文献
16.
Ignacy Kotlarski 《Annali di Matematica Pura ed Applicata》1966,74(1):129-134
Summary The aim of this paper is to prove the following theorem about characterization of probability distributions in Hilbert spaces:Theorem. — Let x1, x2, …, xn be n (n≥3) independent random variables in the Hilbert spaceH, having their characteristic functionals fk(t) = E[ei(t,x
k)], (k=1, 2, …, n): let y1=x1 + xn, y2=x2 + xn, …, yn−1=xn−1 + xn.
If the characteristic functional f(t1, t2, …, tn−1) of the random variables (y1, y2, …, yn−1) does not vanish, then the joint distribution of (y1, y2, …, yn−1) determines all the distributions of x1, x2, …, xn up to change of location. 相似文献
17.
C. Aistleitner I. Berkes R. Tichy 《Proceedings of the Steklov Institute of Mathematics》2012,276(1):3-20
It is known that for any smooth periodic function f the sequence (f(2
k
x))
k≥1 behaves like a sequence of i.i.d. random variables; for example, it satisfies the central limit theorem and the law of the
iterated logarithm. Recently Fukuyama showed that permuting (f(2
k
x))
k≥1 can ruin the validity of the law of the iterated logarithm, a very surprising result. In this paper we present an optimal
condition on (n
k
)
k≥1, formulated in terms of the number of solutions of certain Diophantine equations, which ensures the validity of the law of
the iterated logarithm for any permutation of the sequence (f(n
k
x))
k≥1. A similar result is proved for the discrepancy of the sequence ({n
k
x})
k≥1, where {·} denotes the fractional part. 相似文献
18.
Let f∈C
[−1,1]
″
(r≥1) and Rn(f,α,β,x) be the generalized Pál interpolation polynomials satisfying the conditions Rn(f,α,β,xk)=f(xk),Rn
′(f,α,β,xk)=f′(xk)(k=1,2,…,n), where {xk} are the roots of n-th Jacobi polynomial Pn(α,β,x),α,β>−1 and {x
k
″
} are the roots of (1−x2)Pn″(α,β,x). In this paper, we prove that
holds uniformly on [0,1].
In Memory of Professor M. T. Cheng
Supported by the Science Foundation of CSBTB and the Natural Science Foundatioin of Zhejiang. 相似文献
19.
V. S. Atabekyan 《Journal of Contemporary Mathematical Analysis (Armenian Academy of Sciences)》2010,45(2):112-122
In the present paper for arbitrary automorphism φ of the free Bunside group B(m, n) and for any odd number n ≥ 1003 a sufficient condition for existence of non-φ-admissible normal subgroup of B(m, n) was found. In particular, if automorphism φ is normal, then for any basis {a
1, a
2, …, a
m
} of the group B(m, n) there is an integer k such that for each i the elements a
i
and φ(a
i)
k
are conjugates. 相似文献
20.
Vincenzo De Filippis 《Israel Journal of Mathematics》2009,171(1):325-348
Let R be a prime ring with extended centroid C, δ a nonzero generalized derivation of R, f(x
1, ..., x
n
) a nonzero multilinear polynomial over C, I a nonzero right ideal of R and k ≥ a fixed integer.
If [δ(f(r
1, ..., r
n
)), f(r
1, ..., r
n
)]
k
= 0, for all r
1, ..., r
n
∈ I, then either δ(x) = ax, with (a-γ)I = 0 and a suitable γ ∈ C or there exists an idempotent element e ∈ soc(RC) such that IC = eRC and one of the following holds
(1) if char(R) = 0 then f(x
1, ..., x
n
) is central valued in eRCe
(2) if char(R) = p > 0 then is central valued in eRCe, for a suitable s ≥ 0, unless when char(R) = 2 and eRCe satisfies the standard identity s
4
(3) δ(x) = ax−xb, where (a+b+α)e = 0, for α ∈ C, and f(x
1, ..., x
n
)2 is central valued in eRCe. 相似文献