Sulla funzione di Hilbert di un sottoschema zero-dimensionale diP 3

Riassunto In questo lavoro diamo una caratterizzazione aritmetica della differenza prima ΔH(X,−) della funzione di Hilbert di un sottoschema chiuso 0-dimensionaleX diP ³. Il risultato principale viene applicato per dimostrare che seX è contenuto in una completa intersezione di tipo(a, b, c), a≦b≦c allora ΔH(X, n) è decrescente pern≧a+c−2.

---

Summary In this paper we give an aritmetical characterization of the first difference ΔH(X,−) of the Hilbert function of a closed 0-dimensional subschemeX ofP ³. The main result is then applied to prove that ifX is contained in a complete intersection of type(a, b, c), a≦b≦c then ΔH(X, n) is decreasing forn≧a+c−2.

---

---

Lavoro svolto con finanziamento MPI.     

The existence of Howell designs of even side

A Howell design of side s and order 2n, or more briefly, an H(s, 2n), is an s × s array in which each cell either is empty or contains an unordered pair of elements from some 2n-set, say X, such that (i) each row and column is Latin (that is, every element of X is in precisely one cell of each row and column) and (ii) any unordered pair of elements of X is in at most one cell of the array. A necessary condition for the existence of an H(s, 2n) is that n = 0 or n ? s ? 2n ?1. An $\text{H}{}^1\text{(s, 2n)}$ is an H(s, 2n) in which there is a subset of X, say Y, of cardinality 2n ? s such that no pair of elements from Y is in any cell of the array. In this paper it is shown that if s is an even positive integer, if s and n satisfy the necessary condition and if (s, 2n) ≠ (2, 4) or (6, 12), then there is an $\text{H}{}^1\text{(s, 2n)}$; furthermore, there is no H(2, 4) nor any $\text{H}{}^1\text{(6,12)}$ though there is an H(6, 12).     

On Howell designs

A Howell Design of type H(s, 2n) consists of a square of side s such that each cell is either empty or contains an unordered pair of integers taken from amongst 1, 2, 3, …, 2n provided: (1) each integer from 1 to 2n appears exactly once in each row and each column of the square and (2) every unordered pair appears at most once in a cell of the square. It is easily seen that for a Howell Design to exist that n ? s ? 2n ? 1. This paper presents a large number of constructions of Howell Designs and some existence theorems.     

An upper bound for the cardinality of ans-distance subset in real euclidean space,II

It is shown that ifX is ans-distance subset inR ^d , then |X|≦( _s ^d+s ). Supported in part by NSF grant MCS7903128 A01. Supported in part by NSF grant MCS.     

On the evolution operator for abstract parabolic equations

We find a new construction of the evolution operatorG(t, s) associated to a family {A(t), 0≦t≦T} of generators of analytic semigroups in a Banach spaceX. We study the dependence ofG (t, s) ont ands, and we give regularity results for the solution of the i.v.p.u′(t)=A(t)u(t)+f(t),u(0)=x.     

An extremal set theoretical characterization of some steiner systems

Letn, k, t be integers,n>k>t≧0, and letm(n, k, t) denote the maximum number of sets, in a family ofk-subsets of ann-set, no two of which intersect in exactlyt elements. The problem of determiningm(n, k, t) was raised by Erdős in 1975. In the present paper we prove that ifk≦2t+1 andk−t is a prime, thenm(n, k, t)≦( _t ⁿ )( _k ^2k-t-1 )/( _t ^2k-t-1 ). Moreover, equality holds if and only if an (n, 2k−t−1,t)-Steiner system exists. The proof uses a linear algebraic approach.     

On extremal problems of graphs and generalized graphs

Anr-graph is a graph whose basic elements are its vertices and r-tuples. It is proved that to everyl andr there is anε(l, r) so that forn>n ₀ everyr-graph ofn vertices andn ^{r−ε(l, r)} r-tuples containsr. l verticesx ^(j), 1≦j≦r, 1≦i≦l, so that all ther-tuples occur in ther-graph.     

Linear series onk-gonal curves

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 ∈ Pic^k (X) with h ⁰ (X, L)=2 and L spanned. Fix a rank 1 torsion free sheaf M on X with h ⁰(X,M)=r+1≧2, h¹ (X, M)≧2 and M spanned by its global sections. Set d≔deg(M) and s≔max {n≧0:h ⁰ (X, M ⊗(L^*)^⊗n)>0}. Then one of the following cases occur:

On the distribution of reducible polynomials

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 ² log t ≪ |ℛ₂(t)| ≪ t ² log t and t ⁿ ≪ |ℛ _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 ⁿ⁻¹(log t)².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 ²(log t) ⁿ⁻¹ ≪ R _n ^s (t) ≪ t ² (log t) ⁿ⁻¹ (t → ∞) for every fixed n ≥ 2.      

On K s -free subgraphs in K s+k -free graphs and vertex Folkman numbers

Extending the problem of determining Ramsey numbers Erdős and Rogers introduced the following function. For given integers 2 ≤ s < t let f _s,t (n) = min{max{|S|: S ⊆ V (H) and H[S] contains no K _s }}, where the minimum is taken over all K _t -free graphs H of order n. This function attracted a considerable amount of attention but despite that, the gap between the lower and upper bounds is still fairly wide. For example, when t=s+1, the best bounds have been of the form Ω(n ^1/2+o(1)) ≤ f _s,s+1(n) ≤ O(n ^1−ɛ(s)), where ɛ(s) tends to zero as s tends to infinity. In this paper we improve the upper bound by showing that f _s,s+1(n) ≤ O(n ^2/3). Moreover, we show that for every ɛ > 0 and sufficiently large integers 1 ≪ k ≪ s, Ω(n ^1/2−ɛ ) ≤ f _s,s+k (n) ≤ O(n ^1/2+ɛ . In addition, we also discuss some connections between the function f _s,t and vertex Folkman numbers.     

s-numbers of projections in Banach spaces

Given ans-number sequences te {h, x, y, c, d, a, Γ}, we find a characterization of the following property of a Banach spaceX:(P _s). There is a constantC>0 such that, for anyn-dimensional subspaceE ofX, we can find a projectionP fromX ontoE with sup k ks _k(P)≦Cn. As an application, we prove thatX has weak type 2 if and only ifX is finite dimensionally norming, thus answering a question of Casazza and Shura. Weak Hilbert spaces are also characterized in a new way, the main tool in the proof being a characterization of weak cotype 2 by means of projections. The latter is applied to the study of U.A.P., too.     

The generalized Boardman homomorphisms

This paper provides universal upper bounds for the exponent of the kernel and of the cokernel of the classical Boardman homomorphism b ⁿ : π ⁿ (X)→H ⁿ (H;ℤ), from the cohomotopy groups to the ordinary integral cohomology groups of a spectrum X, and of its various generalizations π ⁿ (X)→E ⁿ (X), F ⁿ (X)→(E∧F) ⁿ (X), F ⁿ (X)→H ⁿ (X;π ₀ F) and F ⁿ (X)→H ^n+t (X;π _t F) for other cohomology theories E ^*(−) and F ^*(−). These upper bounds do not depend on X and are given in terms of the exponents of the stable homotopy groups of spheres and, for the last three homomorphisms, in terms of the order of the Postnikov invariants of the spectrum F.     

Almost automorphic solutions to integral equations on the line

Given a∈L ¹(ℝ) and A the generator of an L ¹-integrable family of bounded and linear operators defined on a Banach space X, we prove the existence of almost automorphic solution to the semilinear integral equation u(t)=∫ _−∞ ^t a(t−s)[Au(s)+f(s,u(s))]ds for each f:ℝ×X→X almost automorphic in t, uniformly in x∈X, and satisfying diverse Lipschitz type conditions. In the scalar case, we prove that a∈L ¹(ℝ) positive, nonincreasing and log-convex is already sufficient.     

Extreme value limit laws in the nonidentically distributed case

LetX ₁, ...,X _n be independent random variables, letF _i be the distribution function ofX _i (1≦i≦n) and letX _1n ≦... ≦X _nn be the corresponding order statistics. We consider the statisticsX _kn, wherek=k(n),k/n → 1 andn−k → ∞. Under some additional restrictions concerning the behaviour of the sequences {a _n>0,b _n,k(n),F _n} we characterize the class of all distribution functionsH such that Prob{(X _kn −b _n )/a _n <x)}→H. Dedicated to the Memory of N. V. Smirnov (1900–1966)     

Many partition relations below density

We force 2 ^λ to be large, and for many pairs in the interval (λ, 2 ^λ ) a strong version of the polarized partition relations holds. We apply this to problems in general topology. For example, consistently, every 2 ^λ is the successor of a singular and for every Hausdorff regular space X, hd(X) ≤ s(X)⁺³, hL(X) ≤ s(X)⁺³ and better when s(X) is regular, via a halfgraph partition relations. For the case s(X) = ℵ ₀ we get hd(X), hL(X) ≤ N ₂.     

On the vector space of 0-configurations

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 ⁿ − |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).     

Partition of graphs with condition on the connectivity and minimum degree

C. Thomassen and M. Szegedy proved the existence of a functionf(s, t) such that the points of anyf(s, t)-connected graph have a decomposition into two non-empty sets such that the subgraphs induced by them ares-connected andt-connected, respectively. We prove, thatf(s, t) ≦ 4s+4t − 13 and examine a similar problem for the minimum degree.     

Homological stability for configuration spaces of manifolds

Let C _n (M) be the configuration space of n distinct ordered points in M. We prove that if M is any connected orientable manifold (closed or open), the homology groups H _i (C _n (M);ℚ) are representation stable in the sense of Church and Farb (). Applying this to the trivial representation, we obtain as a corollary that the unordered configuration space B _n (M) satisfies classical homological stability: for each i, H _i (B _n (M);ℚ)≈H _i (B _n+1(M);ℚ) for n>i. This improves on results of McDuff, Segal, and others for open manifolds. Applied to closed manifolds, this provides natural examples where rational homological stability holds even though integral homological stability fails.     

STABILITY AND ALMOST PERIODIC SOLUTIONS OF NEUTRAL FUNCTIONAL DIFFERENTIAL EQUATIONS WITH INFINITE DELAY

Itiswellknownthattheexistenceofalmostperiodicsolutionsiscloselyrelatedtothestabilityofsolutions.Forfunctionaldifferentialequationswithinfinitedelay,Y.Hin.[5'6]studiedtheproblemsontheexistenceofalmostperiodicsolutionsandthestability.However,therearefewpapersll2]dealingwithneutralfunctionaldifferentialequationswithinfinitedelay.Inthepresentpaper,forneutralfunctionaldifferentialequationswithinfinitedelay,weprovetheinherencetheoremfortheuniformlystableoperatorD(t),definethestabilitywithrespecttot…