共查询到20条相似文献,搜索用时 614 毫秒
1.
Vladimir A. Kozlov 《Arkiv f?r Matematik》1999,37(2):305-322
The equationx
(n)(t)=(−1)
n
│x(t)│
k
withk>1 is considered. In the casen≦4 it is proved that solutions defined in a neighbourhood of infinity coincide withC(t−t0)−n/(k−1), whereC is a constant depending only onn andk. In the general case such solutions are Kneser solutions and can be estimated from above and below by a constant times (t−t
0)−n/(k−1). It is shown that they do not necessarily coincide withC(t−t0)−n/(k−1). This gives a negative answer to two conjectures posed by Kiguradze that Kneser solutions are determined by their value in
a point and that blow-up solutions have prescribed asymptotics.
Dedicated to Professor Vladimir Maz'ya on the occasion of his 60th birthday.
The author was supported by the Swedish Natural Science Research Council (NFR) grant M-AA/MA 10879-304. 相似文献
2.
Here we prove the following result.
Theorem 1.1.Let X be an integral projective curve of arithmetic genus g and k≧ ≧4 an integer. Assume the existence of L ∈ Pick
(X) with h
0
(X, L)=2 and L spanned. Fix a rank 1 torsion free sheaf M on X with h
0(X,M)=r+1≧2, h1
(X, M)≧2 and M spanned by its global sections. Set d≔deg(M) and s≔max {n≧0:h
0 (X, M ⊗(L*)⊗n)>0}. Then one of the following cases occur:
We find also other upper bounds onh
0 (X, F).
(a) | M≊L ⊗r; |
(b) | M is the subsheaf of ω X⊗(L*)⊗t, t:=g−d+r−1, spanned by H0(X, ωX⊗(L*)⊗t); |
(c) | there is a rank 1 torsion free sheaf F on X with 1≦h 0(X, F)≦k−2 such that M≊L⊗s⊗F. Moreover, if we fix an integer m with 2≦m≦k−2 and assume r#(s+1)k−(ns+n+1) per every 2≦n≦m, we have h0 (X, F)≦k−m−1. |
Sunto In questo lavoro si dimostra il seguente teorema. Teorem 1.1.Sia X una curva proiettiva ridotta e irriducibile di genere aritmetico g e k≥4 un intero. Si supponga l'esistenza di L ε Pick (X) con h 0 (X, L)=2 e L generato. Si fissi un fascio senza torsione di rango uno M su X con h0 (X, M)=r++1≥2, h1 (X, M) ≧2 e M generato dalle sue sezioni globali. Si ponga d≔deg(M) e s≔max{n≧0:h 0(X, M ⊗(L*)⊗n)>0}. Allora si verifica uno dei casi seguenti:相似文献Si ricavano anche altre maggiorazioni suh 0,(X, F).
(a) M≊L ⊗r; (b) M è il sottofascio di ω X⊗(L*)⊗t, t:=g−d+r−1 generato da H0 (X, ωX⊗(L*)⊗t); (c) esiste un fascio senza torsione di rango un F su X con 1≦h 0 (X, F) <=k−2 tale che M ≊L ⊗8 ⊗ F. Inoltre, se si fissa un intero m con 2≦m≦k−2 e si suppone r#(s+1) k−(ns+n+1) per ogni 2≦n≦m, si ottiene h 0 (X, F)≦k−m−1.
3.
Dr. Matthias Kriesell 《Combinatorica》2006,26(3):277-314
A non-complete graph G is called an (n,k)-graph if it is n-connected but G—X is not (n−|X|+1)-connected for any X ⊂V (G) with |X|≤k. Mader conjectured that for k≥3 the graph K2k+2−(1−factor) is the unique (2k,k)-graph(up to isomorphism).
Here we prove this conjecture. 相似文献
4.
Let α be a rational-valued set-function on then-element sexX i.e. α(B) εQ for everyB ⫅X. We say that α defines a 0-configuration with respect toA⫅2
x
if for everyA εA we have
α(B)=0. The 0-configurations form a vector space of dimension 2
n
− |A| (Theorem 1). Let 0 ≦t<k ≦n and letA={A ⫅X: |A| ≦t}. We show that in this case the 0-configurations satisfying α(B)=0 for |B|>k form a vector space of dimension
, we exhibit a basis for this space (Theorem 4). Also a result of Frankl, Wilson [3] is strengthened (Theorem 6). 相似文献
5.
Theorem: For each 2 ≤ k < ω there is an -sentence ϕk such that
(1) ϕk is categorical in μ if μ≤ℵk−2;
(2) ϕk is not ℵk−2-Galois stable
(3) ϕk is not categorical in any μ with μ>ℵk−2;
(4) ϕk has the disjoint amalgamation property
(5) For k > 2
(a) ϕk is (ℵ0, ℵk−3)-tame; indeed, syntactic first-order types determine Galois types over models of cardinality at most ℵk−3;
(b) ϕk is ℵm-Galois stable for m ≤ k − 3
(c) ϕk is not (ℵk−3, ℵk−2).
The first author is partially supported by NSF grant DMS-0500841. 相似文献
6.
Gerald Kuba 《Mathematica Slovaca》2009,59(3):349-356
Let ℛ
n
(t) denote the set of all reducible polynomials p(X) over ℤ with degree n ≥ 2 and height ≤ t. We determine the true order of magnitude of the cardinality |ℛ
n
(t)| of the set ℛ
n
(t) by showing that, as t → ∞, t
2 log t ≪ |ℛ2(t)| ≪ t
2 log t and t
n
≪ |ℛ
n
(t)| ≪ t
n
for every fixed n ≥ 3. Further, for 1 < n/2 < k < n fixed let ℛ
k,n
(t) ⊂ ℛ
n
(t) such that p(X) ∈ ℛ
k,n
(t) if and only if p(X) has an irreducible factor in ℤ[X] of degree k. Then, as t → ∞, we always have t
k+1 ≪ |ℛ
k,n
(t)| ≪ t
k+1 and hence |ℛ
n−1,n
(t)| ≫ |ℛ
n
(t)| so that ℛ
n−1,n
(t) is the dominating subclass of ℛ
n
(t) since we can show that |ℛ
n
(t)∖ℛ
n−1,n
(t)| ≪ t
n−1(log t)2.On the contrary, if R
n
s
(t) is the total number of all polynomials in ℛ
n
(t) which split completely into linear factors over ℤ, then t
2(log t)
n−1 ≪ R
n
s
(t) ≪ t
2 (log t)
n−1 (t → ∞) for every fixed n ≥ 2.
相似文献
7.
DuBeiliang 《高校应用数学学报(英文版)》2001,16(2):107-110
Abstract. In this paper, it is shown that a sufficient condition for the existence of a 相似文献
8.
Summary Let1≦k≦n−1, 2≦n. This paper examines the vectors δp(Lk), where Lk is a k-dimensional subspace of an n-dimensional space, and the co-ordinates of δp(Lk) are given below by (1.1).
For fixed k, the set of such vectors as Lk varies is determined for p=2. For general p, information is given on upper and lower bounds for the sum of the co-ordinates of δp(Lk).
Dedicated to the sixtieth birthday of Prof. Edgar R. Lorch
This research was supported in part by the Office of Naval Research under contract number Nonr 3775(09), NR 047040. 相似文献
9.
P. Erdös 《Israel Journal of Mathematics》1963,1(3):156-160
Denote byG(n; m) a graph ofn vertices andm edges. We prove that everyG(n; [n
2/4]+1) contains a circuit ofl edges for every 3 ≦l<c
2
n, also that everyG(n; [n
2/4]+1) contains ak
e(u
n, un) withu
n=[c
1 logn] (for the definition ofk
e(u
n, un) see the introduction). Finally fort>t
0 everyG(n; [tn
3/2]) contains a circuit of 2l edges for 2≦l<c
3
t
2.
This work was done while the author received support from the National Science Foundation, N.S.F. G.88. 相似文献
10.
J. B. Shearer 《Combinatorica》1985,5(3):241-245
LetX
1, ...,X
n
be events in a probability space. Let ϱi be the probabilityX
i
occurs. Let ϱ be the probability that none of theX
i
occur. LetG be a graph on [n] so that for 1 ≦i≦n X
i
is independent of ≈X
j
‖(i, j)∉G≈. Letf(d) be the sup of thosex such that if ϱ1, ..., ϱ
n
≦x andG has maximum degree ≦d then ϱ>0. We showf(1)=1/2,f(d)=(d−1)
d−1
d
−d ford≧2. Hence
df(d)=1/e. This answers a question posed by Spencer in [2]. We also find a sharp bound for ϱ in terms of the ϱ
i
andG. 相似文献
11.
Intersection theorems with geometric consequences 总被引:3,自引:0,他引:3
In this paper we prove that ifℱ is a family ofk-subsets of ann-set, μ0, μ1, ..., μs are distinct residues modp (p is a prime) such thatk ≡ μ0 (modp) and forF ≠ F′ ≠ℱ we have |F ∩F′| ≡ μi (modp) for somei, 1 ≦i≦s, then |ℱ|≦(
s
n
).
As a consequence we show that ifR
n
is covered bym sets withm<(1+o(1)) (1.2)
n
then there is one set within which all the distances are realised.
It is left open whether the same conclusion holds for compositep. 相似文献
12.
Bernardo M. Ábrego Silvia Fernández-Merchant Bernardo Llano 《Discrete and Computational Geometry》2010,43(1):1-20
Given a finite set P⊆ℝ
d
, called a pattern, t
P
(n) denotes the maximum number of translated copies of P determined by n points in ℝ
d
. We give the exact value of t
P
(n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that t
P
(n)=n−m
r
(n), where r is the rational affine dimension of P, and m
r
(n) is the r -Kruskal–Macaulay function. We note that almost all patterns in ℝ
d
are rational simplices. The function t
P
(n) is also determined exactly when |
P
|≤3 or when P has rational affine dimension one and n is large enough. We establish the equivalence of finding t
P
(n) and the maximum number s
R
(n) of scaled copies of a suitable pattern R⊆ℝ+ determined by n positive reals. As a consequence, we show that
sAk(n)=n-\varTheta (n1-1/p(k))s_{A_{k}}(n)=n-\varTheta (n^{1-1/\pi(k)})
, where A
k
={1,2,…,k} is an arithmetic progression of size k, and π(k) is the number of primes less than or equal to k. 相似文献
13.
Z. Ditzian 《Israel Journal of Mathematics》1985,52(4):341-354
Equivalences between the condition |P
n
(k)
(x)|≦K(n
−1√1−x
2+1/n
2)
k
n
-a, whereP
n(x) is the bestn-th degree polynomial approximation tof(x), and the Peetre interpolation space betweenC[−1,1] and the space (1−x
2)
k
f
(2k)(x)∈C[−1,1] is established. A similar result is shown forE
n(f)=
‖f−P
n‖
C[−1,1]. Rates other thann
-a are also discussed.
Supported by NSERC grant A4816 of Canada. 相似文献
14.
Melvin Hausner 《Combinatorica》1985,5(3):215-225
Ifμ is a positive measure, andA
2, ...,A
n
are measurable sets, the sequencesS
0, ...,S
n
andP
[0], ...,P
[n] are related by the inclusion-exclusion equalities. Inequalities among theS
i
are based on the obviousP
[k]≧0. Letting
=the average average measure of the intersection ofk of the setsA
i
, it is shown that (−1)
k
Δ
k
M
i
≧0 fori+k≦n. The casek=1 yields Fréchet’s inequalities, andk=2 yields Gumbel’s and K. L. Chung’s inequalities. Generalizations are given involvingk-th order divided differences. Using convexity arguments, it is shown that forS
0=1,
whenS
1≧N−1, and
for 1≦k<N≦n andv=0, 1, .... Asymptotic results asn → ∞ are obtained. In particular it is shown that for fixedN,
for all sequencesM
0, ...,M
n
of sufficiently large length if and only if
for 0<t<1. 相似文献
15.
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. 相似文献
16.
Peter Frankl 《Combinatorica》1984,4(2-3):141-148
LetX be a finite set ofn elements and ℓ a family ofk-subsets ofX. Suppose that for a given setL of non-negative integers all the pairwise intersections of members of ℓ have cardinality belonging toL. Letm(n, k, L) denote the maximum possible cardinality of ℓ. This function was investigated by many authors, but to determine its exact
value or even its correct order of magnitude appears to be hopeless. In this paper we investigate the case |L|=3. We give necessary and sufficient conditions form(n, k, L)=O(n) andm(n, k, L)≧O(n
2), and show that in some casesm(n, k, L)=O(n
3/2), which is quite surprising. 相似文献
17.
Bao Yongguang 《分析论及其应用》1995,11(4):15-23
Let ξn −1 < ξn −2 < ξn − 2 < ... < ξ1 be the zeros of the the (n−1)-th Legendre polynomial Pn−1(x) and −1=xn<xn−1<...<x1=1, the zeros of the polynomial
. By the theory of the inverse Pal-Type interpolation, for a function f(x)∈C
[−1,1]
1
, there exists a unique polynomial Rn(x) of degree 2n−2 (if n is even) satisfying conditions Rn(f, ξk) = f (εk) (1 ⩽ k ⩽ n −1); R1
n(f,xk)=f1(xk)(1≤k≤n). This paper discusses the simultaneous approximation to a differentiable function f by inverse Pal-Type interpolation
polynomial {Rn(f, x)} (n is even) and the main result of this paper is that if f∈C
[1,1]
r
, r≥2, n≥r+2, and n is even then |R1
n(f,x)−f1(x)|=0(1)|Wn(x)|h(x)·n3−r·E2n−r−3(f(r)) holds uniformly for all x∈[−1,1], where
. 相似文献
18.
A. V. Kostochka 《Combinatorica》1982,2(2):187-192
Letf(n) denote the minimal number of edges of a 3-uniform hypergraphG=(V, E) onn vertices such that for every quadrupleY ⊂V there existsY ⊃e ∈E. Turán conjectured thatf(3k)=k(k−1)(2k−1). We prove that if Turán’s conjecture is correct then there exist at least 2
k−2 non-isomorphic extremal hypergraphs on 3k vertices. 相似文献
19.
Fix integers n, x, k such that n≥3, k>0, x≥4, (n, x)≠(3, 4) and k(n+1)<(
n
n+x
). Here we prove that the order x Veronese embedding ofP
n
is not weakly (k−1)-defective, i.e. for a general S⊃P
n
such that #(S) = k+1 the projective space | I
2S
(x)| of all degree t hypersurfaces ofP
n
singular at each point of S has dimension (
n
/n+x
)−1− k(n+1) (proved by Alexander and Hirschowitz) and a general F∈| I
2S
(x)| has an ordinary double point at each P∈ S and Sing (F)=S.
The author was partially supported by MIUR and GNSAGA of INdAM (Italy). 相似文献
20.
Gil Kalai 《Israel Journal of Mathematics》1983,45(4):337-351
Let
(n, k) be the class of all simplicial complexesC over a fixed set ofn vertices (2≦k≦n) such that: (1)C has a complete (k−1)-skeleton, (2)C has precisely (
k
n−1
)k-faces, (3)H
k
(C)=0. We prove that for
,H
k−1(C) is a finite group, and our main result is:
. This formula extends to high dimensions Cayley’s formula for the number of trees onn labelled vertices. Its proof is based on a generalization of the matrix tree theorem. 相似文献