共查询到20条相似文献,搜索用时 31 毫秒
1.
E. A. Ramos 《Discrete and Computational Geometry》1996,15(2):147-167
We consider the problem of determining the smallest dimensiond=Δ(j, k) such that, for anyj mass distributions inR
d
, there arek hyperplanes so that each orthant contains a fraction 1/2
k
of each of the masses. The case Δ(1,2)=2 is very well known. The casek=1 is answered by the ham-sandwich theorem with Δ(j, 1)=j. By using mass distributions on the moment curve the lower bound Δ(j, k)≥j(2
k
−1)/k is obtained. We believe this is a tight bound. However, the only general upper bound that we know is Δ(j, k)≤j2
k−1. We are able to prove that Δ(j, k)=⌈j(2k−1/k⌉ for a few pairs (j, k) ((j, 2) forj=3 andj=2
n
withn≥0, and (2, 3)), and obtain some nontrivial bounds in other cases. As an intermediate result of independent interest we prove
a Borsuk-Ulam-type theorem on a product of balls. The motivation for this work was to determine Δ(1, 4) (the only case forj=1 in which it is not known whether Δ(1,k)=k); unfortunately the approach fails to give an answer in this case (but we can show Δ(1, 4)≤5).
This research was supported by the National Science Foundation under Grant CCR-9118874. 相似文献
2.
Hanno Lefmann 《Discrete and Computational Geometry》2008,40(3):401-413
We consider a variant of Heilbronn’s triangle problem by investigating for a fixed dimension d≥2 and for integers k≥2 with k≤d distributions of n points in the d-dimensional unit cube [0,1]
d
, such that the minimum volume of the simplices, which are determined by (k+1) of these n points is as large as possible. Denoting by Δ
k,d
(n), the supremum of this minimum volume over all distributions of n points in [0,1]
d
, we show that c
k,d
⋅(log n)1/(d−k+1)/n
k/(d−k+1)≤Δ
k,d
(n)≤c
k,d
′/n
k/d
for fixed 2≤k≤d, and, moreover, for odd integers k≥1, we show the upper bound Δ
k,d
(n)≤c
k,d
″/n
k/d+(k−1)/(2d(d−1)), where c
k,d
,c
k,d
′,c
k,d
″>0 are constants.
A preliminary version of this paper appeared in COCOON ’05. 相似文献
3.
Takashi Shioya 《manuscripta mathematica》1999,99(4):509-516
Let M be a compact n-dimensional Riemannian orbifold of Ricci curvature ≥n−1. We prove that for 1 ≤k≤n, the k
th nonzero eigenvalue of the Laplacian on M is equal to the dimension n if and only if M is isometric to the k-times spherical suspension over the quotient S
n
−
k
}Γ of the unit (n−k)-sphere by a finite group Γ⊂O(n−k+1) acting isometrically on S
n
−
k
⊂ℝ
n
−
k
+.
Received: 21 September 1998 / Revised version: 23 February 1999 相似文献
4.
Vladimir Shpilrain 《Israel Journal of Mathematics》1995,91(1-3):307-316
LetE be a bounded Borel subset of ℝn,n≥2, of positive Lebesgue measure andP
E the corresponding ‘Pompeiu transform”. We prove thatP
E is injective onL
p(ℝn) if 1≤p≤2n/(n-1). We explore the connection between this problem and a Wiener-Tauberian type theorem for theM(n) action onL
q(ℝn) for various values ofq. We also take up the question of whenP
E is injective in caseE is of finite, positive measure, but is not necessarily a bounded set. Finally, we briefly look at these questions in the
contexts of symmetric spaces of compact and non-compact type. 相似文献
5.
We obtain a new upper bound for the sum Σ
h≤H
Δ
k
(N, h) when 1 ≤ H ≤ N, k ∈ ℕ, k ≥ 3, where Δ
k
(N, h) is the (expected) error term in the asymptotic formula for Σ
N<n≤2N
d
k
(n)d
k
(n + h), and d
k
(n) is the divisor function generated by ζ(s)
k
. When k = 3, the result improves, for H ≥ N
1/2, the bound given in a recent work of Baier, Browning, Marasingha and Zhao, who dealt with the case k = 3. 相似文献
6.
Xiaotao Sun 《Inventiones Mathematicae》2008,173(2):427-447
Let X be a smooth projective variety of dimension n over an algebraically closed field k with char(k)=p>0 and F:X→X
1 be the relative Frobenius morphism. For any vector bundle W on X, we prove that instability of F
*
W is bounded by instability of W⊗Tℓ(Ω1
X
) (0≤ℓ≤n(p-1)) (Corollary 4.9). When X is a smooth projective curve of genus g≥2, it implies F
*
W being stable whenever W is stable.
Dedicated to Professor Zhexian Wan on the occasion of his 80th birthday. 相似文献
7.
Let B(k,0,n) denote the group with k generators which is free in the group variety defined by the identity x
n
=1. Let B
slo
(k,1,n) denote the semilattice-ordered semigroup with k generators which is free in the semilattice-ordered semigroup variety defined by the identity x
n
=x. We prove a generalization of the Green-Rees theorem: B
slo
(k,1,n) is finite for all k≥1 if and only if B(k,0,n−1) is finite for all k≥1. We find a formula for card(B
slo
(1,1,n)). We construct B
slo
(k,1,n) for some concrete values of k and n. 相似文献
8.
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 相似文献
9.
Recently, B. Y. Chen introduced a new intrinsic invariant of a manifold, and proved that everyn-dimensional submanifold of real space formsR
m
(ε) of constant sectional curvature ε satisfies a basic inequality δ(n
1,…,n
k
)≤c(n
1,…,n
k
)H
2+b(n
1,…,n
k
)ε, whereH is the mean curvature of the immersion, andc(n
1,…,n
k
) andb(n
1,…,n
k
) are constants depending only onn
1,…,n
k
,n andk. The immersion is calledideal if it satisfies the equality case of the above inequality identically for somek-tuple (n
1,…,n
k
). In this paper, we first prove that every ideal Einstein immersion satisfyingn≥n
1+…+n
k
+1 is totally geodesic, and that every ideal conformally flat immersion satisfyingn≥n
1+…+n
k
+2 andk≥2 is also totally geodesic. Secondly we completely classify all ideal semi-symmetric hypersurfaces in real space forms.
The author was supported by the NSFC and RFDP. 相似文献
10.
Let D = (V, E) be a primitive digraph. The vertex exponent of D at a vertex v∈ V, denoted by expD(v), is the least integer p such that there is a v →u walk of length p for each u ∈ V. Following Brualdi and Liu, we order the vertices of D so that exPD(V1) ≤ exPD(V2) …≤ exPD(Vn). Then exPD(Vk) is called the k- point exponent of D and is denoted by exPD (k), 1≤ k ≤ n. In this paper we define e(n, k) := max{expD (k) | D ∈ PD(n, 2)} and E(n, k) := {exPD(k)| D ∈ PD(n, 2)}, where PD(n, 2) is the set of all primitive digraphs of order n with girth 2. We completely determine e(n, k) and E(n, k) for all n, k with n ≥ 3 and 1 ≤ k ≤ n. 相似文献
11.
Let P(G, λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P(H, λ) = P(G, λ) implies H is isomorphic to G. Liu et al. [Liu, R. Y., Zhao, H. X., Ye, C. F.: A complete solution to a conjecture on chromatic uniqueness of complete
tripartite graphs. Discrete Math., 289, 175–179 (2004)], and Lau and Peng [Lau, G. C., Peng, Y. H.: Chromatic uniqueness of certain complete t-partite graphs. Ars Comb., 92, 353–376 (2009)] show that K(p − k, p − i, p) for i = 0, 1 are chromatically unique if p ≥ k + 2 ≥ 4. In this paper, we show that if 2 ≤ i ≤ 4, the complete tripartite graph K(p − k, p − i, p) is chromatically unique for integers k ≥ i and p ≥ k
2/4 + i + 1. 相似文献
12.
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 相似文献
13.
We study additive representability of orders on multisets (of size k drawn from a set of size n) which satisfy the condition of independence of equal submultisets (IES) introduced by Sertel and Slinko (Ranking committees,
words or multisets. Nota di Laboro 50.2002. Center of Operation Research and Economics. The Fundazione Eni Enrico Mattei,
Milan, 2002, Econ. Theory 30(2):265–287, 2007). Here we take a geometric view of those orders, and relate them to certain combinatorial objects which we call discrete
cones. Following Fishburn (J. Math. Psychol., 40:64–77, 1996) and Conder and Slinko (J. Math. Psychol., 48(6):425–431, 2004), we define functions f(n,k) and g(n,k) which measure the maximal possible deviation of an arbitrary order satisfying the IES and an arbitrary almost representable
order satisfying the IES, respectively, from a representable order. We prove that g(n,k) = n − 1 whenever n ≥ 3 and (n, k) ≠ (5, 2). In the exceptional case, g(5,2) = 3. We also prove that g(n,k) ≤ f(n,k) ≤ n and establish that for small n and k the functions g(n,k) and f(n,k) coincide.
相似文献
14.
For a graph G, we define σ2(G) := min{d(u) + d(v)|u, v ≠ ∈ E(G), u ≠ v}. Let k ≥ 1 be an integer and G be a graph of order n ≥ 3k. We prove if σ2(G) ≥ n + k − 1, then for any set of k independent vertices v
1,...,v
k
, G has k vertex-disjoint cycles C
1,..., C
k
of length at most four such that v
i
∈ V(C
i
) for all 1 ≤ i ≤ k. And show if σ2(G) ≥ n + k − 1, then for any set of k independent vertices v
1,...,v
k
, G has k vertex-disjoint cycles C
1,..., C
k
such that v
i
∈ V(C
i
) for all 1 ≤ i ≤ k, V(C
1) ∪...∪ V(C
k
) = V(G), and |C
i
| ≤ 4 for all 1 ≤ i ≤ k − 1.
The condition of degree sum σ2(G) ≥ n + k − 1 is sharp.
Received: December 20, 2006. Final version received: December 12, 2007. 相似文献
15.
Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()α≤≤ ()
n
−ω. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour
number μ(G) of G: n− (n−ω)()
n
−ω≤μ(G)≤n−α() α.
Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002 相似文献
16.
Isabella Novik 《Israel Journal of Mathematics》1998,108(1):45-82
In this paper we prove the Upper Bound Conjecture (UBC) for some classes of (simplicial) homology manifolds: we show that
the UBC holds for all odd-dimensional homology manifolds and for all 2k-dimensional homology manifolds Δ such that β
k
(Δ)⩽Σ{β
i
(Δ):i ≠k-2,k,k+2 and 1 ⩽i⩽2k-1}, where β
i
(Δ) are reduced Betti numbers of Δ. (This condition is satisfied by 2k-dimensional homology manifolds with Euler characteristic χ≤2 whenk is even or χ≥2 whenk is odd, and for those having vanishing middle homology.)
We prove an analog of the UBC for all other even-dimensional homology manifolds.
Kuhnel conjectured that for every 2k-dimensional combinatorial manifold withn vertices,
. We prove this conjecture for all 2k-dimensional homology manifolds withn vertices, wheren≥4k+3 orn≤3k+3. We also obtain upper bounds on the (weighted) sum of the Betti numbers of odd-dimensional homology manifolds. 相似文献
17.
For two vertices u and v of a connected graph G, the set I[u,v] consists of all those vertices lying on a u−v shortest path in G, while for a set S of vertices of G, the set I[S] is the union of all sets I[u,v] for u,v∈S. A set S is convex if I[S]=S. The convexity number con(G) of G is the maximum cardinality of a proper convex set of G. The clique number ω(G) is the maximum cardinality of a clique in G. If G is a connected graph of order n that is not complete, then n≥3 and 2≤ω(G)≤con(G)≤n−1. It is shown that for every triple l,k,n of integers with n≥3 and 2≤l≤k≤n−1, there exists a noncomplete connected graph G of order n with ω(G)=l and con(G)=k. Other results on convex numbers are also presented.
Received: August 19, 1998 Final version received: May 17, 2000 相似文献
18.
Wesley Pegden 《Combinatorica》2006,26(5):577-585
We prove that the out-distance sequence {f+(k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+(k+1)≤f+(k)2 for k≥1, where f+(k) denotes the number of vertices at directed distance k from a given vertex. As a corollary, we prove that for a connected vertex-transitive undirected graph of infinite degree
d, we have f(k)=d for all k, 1≤k<diam(G). This answers a question by L. Babai. 相似文献
19.
S. Staněk 《Ukrainian Mathematical Journal》2008,60(2):277-298
We present existence principles for the nonlocal boundary-value problem (φ(u(p−1)))′=g(t,u,...,u(p−1), αk(u)=0, 1≤k≤p−1, where p ≥ 2, π: ℝ → ℝ is an increasing and odd homeomorphism, g is a Carathéodory function that is either regular or has singularities in its space variables, and α
k: C
p−1[0, T] → ℝ is a continuous functional. An application of the existence principles to singular Sturm-Liouville problems (−1)n(φ(u(2n−)))′=f(t,u,...,u(2n−1)), u(2k)(0)=0, αku(2k)(T)+bku(2k=1)(T)=0, 0≤k≤n−1, is given.
Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 60, No. 2, pp. 240–259, February, 2008. 相似文献
20.
M. Z. Garaev 《Monatshefte für Mathematik》2006,148(2):127-138
We obtain nontrivial estimates of character sums over short intervals for almost all moduli. These bounds and the method of
Karatsuba for solving multiplicative ternary problems are used to prove that for π(X)(1 + o(1)) primes p,p ≤ X, there are p(1 + o(1)) residue classes modulo p of the form xy (mod p), where 1 ≤ x, y ≤ p?(log p)1,087. We also prove that for any prime p there are p(1 + o(1)) residue classes modulo p of the form xy* (mod p), where 1 ≤ x, y ≤ p?(log p)1+o(1) and y* is defined by yy* ≡ 1 (mod p). 相似文献