Lower bound on the profile of degree pairs in cross-intersecting set systems

We raise the following problem. For natural numbers m, n ≥ 2, determine pairs d′, d″ (both depending on m and n only) with the property that in every pair of set systems A, B with |A| ≤ m, |B| ≤ n, and A ∩ B ≠ 0 for all A ∈ A, B ∈ B, there exists an element contained in at least d′ |A| members of A and d″ |B| members of B. Generalizing a previous result of Kyureghyan, we prove that all the extremal pairs of (d′, d″) lie on or above the line (n − 1) x + (m − 1) y = 1. Constructions show that the pair (1 + ɛ / 2n − 2, 1 + ɛ / 2m − 2) is infeasible in general, for all m, n ≥ 2 and all ɛ > 0. Moreover, for m = 2, the pair (d′, d″) = (1 / n, 1 / 2) is feasible if and only if 2 ≤ n ≤ 4. The problem originates from Razborov and Vereshchagin’s work on decision tree complexity. Research supported in part by the Hungarian Research Fund under grant OTKA T-032969.     

On the value set of the Ramanujan function

We give lower bounds on the number of distinct values of the Ramanujan function τ(n), n ≦ x, and on the number of distinct residues of τ(n), n ≦ x, modulo a prime ℓ. We also show that for any prime ℓ the values τ(n), n ≦ ℓ⁴, form a finite additive basis modulo ℓ. Received: 6 October 2004     

On maximal weakly separated set-systems

For a permutation ω∈S _n , Leclerc and Zelevinsky in Am. Math. Soc. Transl., Ser. 2 181, 85–108 (1998) introduced the concept of an ω-chamber weakly separated collection of subsets of {1,2,…,n} and conjectured that all inclusionwise maximal collections of this sort have the same cardinality ℓ(ω)+n+1, where ℓ(ω) is the length of ω. We answer this conjecture affirmatively and present a generalization and additional results.     

List decodability at small radii

A′(n, d, e), the smallest ℓ for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size ℓ up to radius e, is determined for all d ≥ 2e − 3. As a result, A′(n, d, e) is determined for all e ≤ 4, except for 42 values of n.     

There Exist Highly Critically Connected Graphs of Diameter Three

Let κ(G) denote the (vertex) connectivity of a graph G. For ℓ≥0, a noncomplete graph of finite connectivity is called ℓ-critical if κ(G−X)=κ(G)−|X| for every X⊆V(G) with |X|≤ℓ. Mader proved that every 3-critical graph has diameter at most 4 and asked for 3-critical graphs having diameter exceeding 2. Here we give an affirmative answer by constructing an ℓ-critical graph of diameter 3 for every ℓ≥3.     

On the restricted arc-connectivity of s-geodetic digraphs

For a strongly connected digraph D the minimum ,cardinality of an arc-cut over all arc-cuts restricted arc-connectivity λ′（D） is defined as the S satisfying that D - S has a non-trivial strong component D1 such that D - V（D1） contains an arc. Let S be a subset of vertices of D. We denote by w＋（S） the set of arcs uv with u ∈ S and v S, and by w-（S） the set of arcs uv with u S and v ∈ S. A digraph D = （V, A） is said to be λ′-optimal if λ′（D） =ξ′（D）, where ξ′（D） is the minimum arc-degree of D defined as ξ（D） = min {ξ′（xy） ： xy ∈ A}, and ξ′（xy） = min（｜ω＋（{x,y}）｜, ｜w-（{x,y}）｜, ｜w＋（x） ∪ w- （y） ｜, ｜w- （x） ∪ω＋ （y）｜}. In this paper a sufficient condition for a s-geodetic strongly connected digraph D to be λ′-optimal is given in terms of its diameter. Furthermore we see that the h-iterated line digraph Lh（D） of a s-geodetic digraph is λ′-optimal for certain iteration h.     

Additive problems for integers with a given number of prime divisors

The asymptotics of sums of the form Στ(|bn−a|) (summation overn<N, ω(n)=k) is studied, whereω(n) is the number of distinct prime divisors ofn, andτ(n) is the number of all divisors. Translated fromMatematicheskie Zametki, Vol. 63, No. 5, pp. 749–762, May, 1998. In conclusion, the author wishes to express his gratitude to Professor N. M. Timofeev for valuable advice. This research was supported by the Russian Foundation for Basic Research under grant No. 96-01-00502.     

The limiting distribution of the trace of a random plane partition

We study the asymptotic behaviour of the trace (the sum of the diagonal parts) τ _n = τ _n (ω) of a plane partition ω of the positive integer n, assuming that ω is chosen uniformly at random from the set of all such partitions. We prove that (τ _n − c ₀ n ^2/3)/c ₁ n ^1/3 log^1/2 n converges weakly, as n → ∞, to the standard normal distribution, where c ₀ = ζ(2)/ [2ζ(3)]^2/3, c ₁ = √(1/3/) [2ζ(3)]^1/3 and ζ(s) = Σ _j=1^∞ j ^−s . Partial support given by the National Science Fund of the Bulgarian Ministry of Education and Science, grant No. VU-MI-105/2005.     

Lower bounds at infinity of solutions of partial differential equations in the exterior of a proper cone

An extension of a classical theorem of Rellich to the exterior of a closed proper convex cone is proved: Let Γ be a closed convex proper cone inR ⁿ and −Γ′ be the antipodes of the dual cone of Γ. Let be a partial differential operator with constant coefficients inR ⁿ, whereQ(ζ)≠0 onR ⁿ−iΓ′ andP _i is an irreducible polynomial with real coefficients. Assume that the closure of each connected component of the set {ζ∈R ⁿ−iΓ′;P _j(ζ)=0, gradP _j(ζ)≠0} contains some real point on which gradP _j≠0 and gradP _j∉Γ∪(−Γ). LetC be an open cone inR ⁿ−Γ containing both normal directions at some such point, and intersecting each normal plane of every manifold contained in {ξ∈R ⁿ;P(ξ)=0}. Ifu∈ℒ′∩L _loc ² (R ⁿ−Γ) and the support ofP(−i∂/∂x)u is contained in Γ, then the condition implies that the support ofu is contained in Γ.     

An extension of Ezeilo's result

Summary In a recent paper[1] Ezeilo considered the nonlinear third order differential equation x‴ + ω(x′)x″ + ω(x)x′ + ϑ(x, x′, x″)=p(t). He proved the ultimate boundedness of the solutions on rather general conditions for the nonlinear terms ϕ, ϕ, ϑ. These conditions (in a little weaker form) are also sufficient in order to prove the existence of forced oscillations in the case when the excitation is ω-periodic. For this purpose the Lerag-Schauder principle in a form suggested by G. Güssefeldt[2] is applicable. Dedicated to ProfessorKarl Klotter on his 70th birthday Entrata in Redazione il 21 ottobre 1971.     

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

§ 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…     

Families of finite sets with three intersections

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 ²), and show that in some casesm(n, k, L)=O(n ^3/2), which is quite surprising.     

The Convexity Number of a Graph

 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     

An additive divisor problem with a growing number of factors

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 ¹⁰ (lnlnx)³≤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     

Hyperspaces of Banach Spaces with the Attouch—Wets Topology

Let X be an infinite-dimensional Banach space with weight τ. By Cld _AW (X), we denote the hyperspace of nonempty closed sets in X with the Attouch—Wets topology. By Fin _AW (X), Comp _AW (X) and Bdd _AW (X), we denote the subspaces of Cld _AW (X) consisting of finite sets, compact sets and bounded closed sets, respectively. In this paper, it is proved that Fin _AW (X)≈Comp _AW (X)≈ℓ₂(τ)×ℓ₂ ^f ℓandℓBdd _AW (X)≈ℓ₂(2^τ)×ℓ₂ ^f where ≈ means ‘is homeomorphic to’, ℓ₂(τ) is the Hilbert space with weight τ (ℓ₂(ℵ₀)=ℓ₂ the separable Hilbert space) and ℓ₂ ^f ={(x _i ) _iεN εℓ₂∣x _i =0 except for finitely many iεN}.     

Multiscale stochastic homogenization of convection-diffusion equations

Multiscale stochastic homogenization is studied for convection-diffusion problems. More specifically, we consider the asymptotic behaviour of a sequence of realizations of the form ∂u _ɛ ^ω / ∂t+1 / ɛ ₃ C(T ₃(x/ɛ ₃)ω ₃) · ∇u _ɛ ^ω − div(α(T ₂(x/ɛ ₂)ω ₂, t) ∇u _ɛ ^ω ) = f. It is shown, under certain structure assumptions on the random vector field C(ω ₃) and the random map α(ω ₁, ω ₂, t), that the sequence {u _ɛ ^ω } of solutions converges in the sense of G-convergence of parabolic operators to the solution u of the homogenized problem ∂u/∂t − div (B(t)∇u= f).     

Multiple points of trajectories of multiparameter fractional Brownian motion

Consider 0<α<1 and the Gaussian process Y(t) on ℝ ^N with covariance E(Y(s)Y(t))=|t|^2α+|s|^2α−|t−s|^2α, where |t| is the Euclidean norm of t. Consider independent copies X ¹,…,X ^d of Y and␣the process X(t)=(X ¹(t),…,X ^d (t)) valued in ℝ ^d . When kN≤␣(k−1)αd, we show that the trajectories of X do not have k-multiple points. If N<αd and kN>(k−1)αd, the set of k-multiple points of the trajectories X is a countable union of sets of finite Hausdorff measure associated with the function ϕ(ɛ)=ɛ ^{k N /α−( k −1) d} (loglog(1/ɛ)) ^k . If N=αd, we show that the set of k-multiple points of the trajectories of X is a countable union of sets of finite Hausdorff measure associated with the function ϕ(ɛ)=ɛ ^d (log(1/ɛ) logloglog 1/ɛ) ^k . (This includes the case k=1.) Received: 20 May 1997 / Revised version: 15 May 1998     

Strong Arens irregularity of Beurling algebras with a locally convex topology

Let G be a locally compact group with a weight function ω. Recently, we have shown that the Banach space L₀^∞ (G,1/ω) can be identified with the strong dual of L¹(G, ω)equipped with some locally convex topologies τ. Here we use this duality to introduce an Arens multiplication on (L¹(G, ω), τ)**, and prove that the topological center of (L¹(G, ω), τ)** is (L¹(G, ω); this enables us to conclude that (L¹(G, ω), τ) is Arens regular if and only if G is discrete. We also give a characterization for Arens regularity of L₀^∞ (G, 1/ω)¹. Received: 8 March 2005     

Some divisibilities amongst the terms of linear recurrences

Let (u_n)n≥0 be a non-degenerate linear recurrence sequence of integers. We show that the set of positive integersn such that either ω)(n) orΩ(n) dividesu _n is of asymptotic density zero, where ω(n) and Ω(n) are the numbers of prime and prime power divisors ofn, respectively. The same also holds for the set of positive integersn such that τ(n)u _n , where τ(n) is the number of the positive integer divisors of n, provided thatu _n satisfies some mild technical conditions.     

On the chromatic polynomial of a graph

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