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.     

The minimum independence number for designs

Fort=2,3 andk2t–1 we prove the existence oft–(n,k,) designs with independence numberC _,k n ^{(k–t)/(k–1)} (ln n) ^1/(k–1) . This is, up to the constant factor, the best possible.Some other related results are considered.Supported by NSF Grant DMS-9011850     

On the law of the iterated logarithm for subsequences for a stable subordinator

Let {X(t): 0≤t<∞) be a stable subordinator with α∈(0,1). For increasing sequences t_k we give normalizing constants a_k such thatliminf _k→∞ a _k ⁻¹ X(t_k) is a.s constant. We also derive a.s. upper bounds. Proceedings of the XVI Seminar on Stability Problems for Stochastic Models Part I, Eger, Hungary, 1994.     

Existence principles for higher-order nonlocal boundary-value problems and their applications to singular Sturm-Liouville problems

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)ⁿ(φ(u⁽²ⁿ⁻⁾))′=f(t,u,...,u⁽²ⁿ⁻¹⁾), u^(2k)(0)=0, α_ku^(2k)(T)+b_ku^(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.     

Asymptotic Upper Bounds for Ramsey Functions

 We show that for any graph G with N vertices and average degree d, if the average degree of any neighborhood induced subgraph is at most a, then the independence number of G is at least Nf _{a +1}(d), where f _{a +1}(d)=∫₀ ¹(((1−t)^{1/( a +1)})/(a+1+(d−a−1)t))dt. Based on this result, we prove that for any fixed k and l, there holds r(K _k + _l ,K _n )≤ (l+o(1))n ^k /(logn) ^{k −1}. In particular, r(K _k , K _n )≤(1+o(1))n ^{k −1}/(log n) ^{k −2}. Received: May 11, 1998 Final version received: March 24, 1999     

Enumeration ofQ-acyclic simplicial complexes

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 ⁿ⁻¹ )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.     

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:

线性时滞微分方程稳定性分析和数值例子

§ 1　IntroductionFunctional differential equations have a wide range of applications in science andengineering.The simplestand perhapsmostnatural type of functional differential equationis a“delay differential equation”,that is,differential equation with dependence on the paststate.The simplest type of pastdependence is thatit is carried through the state variablebut not through its derivative.Then the equation can be expressed as delay differentialequations(DDEs) .There are also a number…     

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.      

Bounding the number of connected components of a real algebraic set

For every polynomial mapf=(f ₁,…,f _k): ℝ ⁿ →ℝ ^k , we consider the number of connected components of its zero set,B(Z _f) and two natural “measures of the complexity off,” that is the triple(n, k, d), d being equal to max(degree off _i), and thek-tuple (Δ₁,...,Δ₄), Δ _k being the Newton polyhedron off _i respectively. Our aim is to boundB(Z _f) by recursive functions of these measures of complexity. In particular, with respect to (n, k, d) we shall improve the well-known Milnor-Thom’s bound μ _d (n)=d(2d−1) ⁿ⁻¹. Considered as a polynomial ind, μ _d (n) has leading coefficient equal to 2 ⁿ⁻¹. We obtain a bound depending onn, d, andk such that ifn is sufficiently larger thank, then it improves μ _d (n) for everyd. In particular, it is asymptotically equal to 1/2(k+1)n ^k−1 dⁿ, ifk is fixed andn tends to infinity. The two bounds are obtained by a similar technique involving a slight modification of Milnor-Thom's argument, Smith's theory, and information about the sum of Betti numbers of complex complete intersections.     

Polynomials of best approximation inC[−1,1]

Equivalences between the condition |P _n ^(k) (x)|≦K(n ⁻¹√1−x ²+1/n ²) ^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 ²) ^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.     

An approximation of a nonlinear integral equation driven by a function of boundedp-variation

The uniform distance between the solution of a nonlinear equation driven by a functionh with boundedp-variation and its Milstein-type approximation is estimated by δ _n v γ _p (n) v γ _p ² (n), where δ _n =max(t _k −t _k−1 ) is the maximum step size of the approximation on the interval [0,T], γ _p (n)=max υ _p ^1/p (h;[t _k-1,t _k ]), 1 <p < 2, and υ _p (h;[t _k-1,t _k ]) is thep-variation of the functionh on [t _k-1,t _k]. In particular, ifh is a Lipschitz function of order α, then the uniform distance has the bound δ _n ^α for δ_n <1. Institute of Mathematics and Informatics, Akademijos 4, 2600 Vilnius; Vilnius Technical University, Saulétekio 11, 2054 Vilnius, Lithuania. Published in Lietuvos Matematikos Rinkinys, Vol. 39, No. 3, pp. 317–330, July–September, 1999.     

On the weak non-defectivity of veronese embeddings of projective spaces

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 ⁿ is not weakly (k−1)-defective, i.e. for a general S⊃P ⁿ such that #(S) = k+1 the projective space | I _2S (x)| of all degree t hypersurfaces ofP ⁿ 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).     

On simultaneous approximation to a differentiable function and its derivative by inverse Pal-Type interpolation polynomials

Let ξ_{n −1} < ξ_{n −2} < ξ_{n − 2} < ... < ξ₁ be the zeros of the the (n−1)-th Legendre polynomial P_n−1(x) and −1=x_n<x_n−1<...<x₁=1, the zeros of the polynomial . By the theory of the inverse Pal-Type interpolation, for a function f(x)∈C _[−1,1] ¹ , there exists a unique polynomial R_n(x) of degree 2n−2 (if n is even) satisfying conditions R_n(f, ξ_k) = f (ε_k) (1 ⩽ k ⩽ n −1); R¹ _n(f,x_k)=f¹(x_k)(1≤k≤n). This paper discusses the simultaneous approximation to a differentiable function f by inverse Pal-Type interpolation polynomial {R_n(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 |R¹ _n(f,x)−f¹(x)|=0(1)|W_n(x)|h(x)·n^3−r·E_2n−r−3(f^(r)) holds uniformly for all x∈[−1,1], where .     

Polytopal and nonpolytopal spheres an algorithmic approach

The convexity theory for oriented matroids, first developed by Las Vergnas [17], provides the framework for a new computational approach to the Steinitz problem [13]. We describe an algorithm which, for a given combinatorial (d − 2)-sphereS withn vertices, determines the setC _d,n(S) of rankd oriented matroids withn points and face latticeS. SinceS is polytopal if and only if there is a realizableM εC _d,n(S), this method together with the coordinatizability test for oriented matroids in [10] yields a decision procedure for the polytopality of a large class of spheres. As main new result we prove that there exist 431 combinatorial types of neighborly 5-polytopes with 10 vertices by establishing coordinates for 98 “doubted polytopes” in the classification of Altshuler [1]. We show that for alln ≧k + 5 ≧8 there exist simplicialk-spheres withn vertices which are non-polytopal due to the simple fact that they fail to be matroid spheres. On the other hand, we show that the 3-sphereM ₉₆₃ ⁹ with 9 vertices in [2] is the smallest non-polytopal matroid sphere, and non-polytopal matroidk-spheres withn vertices exist for alln ≧k + 6 ≧ 9.     

The influence of variables in product spaces

LetX be a probability space and letf: X ⁿ → {0, 1} be a measurable map. Define the influence of thek-th variable onf, denoted byI _f (k), as follows: Foru=(u ₁,u ₂,…,u _n−1) ∈X ⁿ⁻¹ consider the setl _k (u)={(u ₁,u ₂,...,u _k−1,t,u _k ,…,u _n−1):t ∈X}. More generally, forS a subset of [n]={1,...,n} let the influence ofS onf, denoted byI _f (S), be the probability that assigning values to the variables not inS at random, the value off is undetermined. Theorem 1:There is an absolute constant c ₁ so that for every function f: X ⁿ → {0, 1},with Pr(f ⁻¹(1))=p≤1/2,there is a variable k so that Theorem 2:For every f: X ⁿ → {0, 1},with Prob(f=1)=1/2, and every ε>0,there is S ⊂ [n], |S|=c ₂(ε)n/logn so that I _f (S)≥1−ε. These extend previous results by Kahn, Kalai and Linial for Boolean functions, i.e., the caseX={0, 1}. Work supported in part by grants from the Binational Israel-US Science Foundation and the Israeli Academy of Science.     

Self-similar extremal processes

Given an extremal process X: [0,∞)→[0,∞)^d with lower curve C and associated point process N={(t_k, X_k):k≥0}, t_k distinct and X_k independent, given a sequence ζ _n =(τ _n , ξ _n ), n≥1, of time-space changes (max-automorphisms of [0,∞)^d+1), we study the limit behavior of the sequence of extremal processes Y_n(t)=ξ _n ^-1 ○ X ○ τ_n(t)=C_n(t) V max {ξ _n ^-1 ○ X_k: t_k ≤ τ_n(t){ ⇒ Y under a regularity condition on the norming sequence ζ_n and asymptotic negligibility of the max-increments of Y_n. The limit class consists of self-similar (with respect to a group η_α=(σ_α, L_α), α>0, of time-space changes) extremal processes. By self-similarity here we mean the property L_α ○ Y(t) ₌ ^d Y ○ α_α(t) for all α>0. The univariate marginals of Y are max-self-decomposable. If additionally the initial extremal process X is assumed to have homogeneous max-increments, then the limit process is max-stable with homogeneous max-increments. Supported by the Bulgarian Ministry of Education and Sciences (grant No. MM 234/1996). Proceedings of the Seminar on Stability Problems for Stochastic Models, Hajdúszoboszló, Hungary, 1997, Part I.     

Possible limit laws for entrance times of an ergodic aperiodic dynamical system

LetG denote the set of decreasingG: ℝ→ℝ withGэ1 on ]−∞,0], and ƒ ₀ ^∞ 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     

Spectral mapping theorems for exponentially bounded c-semigroups in Banach spaces

LetZ be a generator of an exponentially boundedC-semigroup {S _t } _t≥0 in a Banach space and letT _t =C ⁻¹ S _t . We show that the spectral mapping theorems such as exp(tσ(Z)) ⊂ σ(T _t ) and exp(tσ _p (Z)) ⊂ tσ _p (T _t ) ⊂ exp(tσ _p (Z)) ⋃ {0} for everyt≥0 hold. The present studies were supported by the Basic Science Research Institute Program, Ministry of Education, 1987.     

Slow and fast decay of solutions to some second order evolution equations

IfA=A ^*≥0 on the real Hilbert spaceH=L ² (Ω, dμ) withKerA=A ⁻¹ ({0})∈0, (I+A)⁻¹ compact andf(u)=c|u| ^p−1 u withc>0,p>1, the solutions ofu”+u’+Au+f(u)=0 tend to 0 in norm at least liket ^−1/(p−1) ast→∞. Here it is shown that the set of initial data of those solutions tending to 0 exponentially fast has near 0 the structure of a manifold with codimension dim(Ker A). If, in addition,A=−Δ with Neumann homogeneous boundary conditions, we show that the following alternative holds true: eitheru(t) tends to 0 exponentially fast, or ‖u(t)‖≥γt ^−1/(p−1) with γ>0 fort≥1.