On quasi-symmetric designs with intersection difference three

In a recent paper, Pawale (Des Codes Cryptogr, 2010) investigated quasi-symmetric 2-(v, k, λ) designs with intersection numbers x > 0 and y = x + 2 with λ > 1 and showed that under these conditions either λ = x + 1 or λ = x + 2, or D{\mathcal{D}} is a design with parameters given in the form of an explicit table, or the complement of one of these designs. In this paper, quasi-symmetric designs with y − x = 3 are investigated. It is shown that such a design or its complement has parameter set which is one of finitely many which are listed explicitly or λ ≤ x + 4 or 0 ≤ x ≤ 1 or the pair (λ, x) is one of (7, 2), (8, 2), (9, 2), (10, 2), (8, 3), (9, 3), (9, 4) and (10, 5). It is also shown that there are no triangle-free quasi-symmetric designs with positive intersection numbers x and y with y = x + 3.     

On the comparison of PBIB designs with two associate classes

A method to compare two-associate-class PBIB designs is discussed. As an application, it is shown that ifd ^* is a group-divisible design withλ ₂=λ₁+1, a group divisible design with group size two andλ ₂=λ₁+1>1, a design based on a triangular scheme andv=10 andλ ₁=λ₂+1, a design with anL ₂ scheme andλ ₂=λ₁+1, a design with anL _s scheme,v=(s+1) ², andλ ₂=λ₁+1, wheres is a positive integer, or a design with a cyclic schemev=5, andλ ₁=λ₂±1, thend ^* is optimum with respect to a very general class of criteria over all the two-associate-class PBIB designs with the same values ofv, b andk asd ^*. The best two-associate-class PBIB design, however, is not necessarily optimal over all designs. This paper was prepared with the support of Office of Naval Research Contract No. N00014-75-C-0444/NR 042-036 and National Science Foundation Grant No. MCS-79-09502.     

Quasi-symmetric 2, 3, 4-designs

Quasi-symmetric designs are block designs with two block intersection numbersx andy It is shown that with the exception of (x, y)=(0, 1), for a fixed value of the block sizek, there are finitely many such designs. Some finiteness results on block graphs are derived. For a quasi-symmetric 3-design with positivex andy, the intersection numbers are shown to be roots of a quadratic whose coefficients are polynomial functions ofv, k and λ. Using this quadratic, various characterizations of the Witt—Lüneburg design on 23 points are obtained. It is shown that ifx=1, then a fixed value of λ determines at most finitely many such designs.     

Quasi-symmetric 3-designs with triangle-free graph

The following result is proved: Let D be a quasi-symmetric 3-design with intersection numbers x, y(0x<y<k). D has no three distinct blocks such that any two of them intersect in x points if and only if D is a Hadamard 3-design, or D has a parameter set (v, k, ) where v=(+2)(²+4+2)+1, k=²+3+2 and =1,2,..., or D is a complement of one of these designs.     

Non Existence of Triangle Free Quasi-symmetric Designs

The following two results are proved. Let D be a triangle free quasi-symmetric design with k=2y−x and x≥ 1 then D is a trivial design with v=5 and k=3. There do no exist triangle free quasi-symmetric designs with x≥ 1 and λ=y or λ=y−1.Communicated by: P. Wild     

The First Exit Time of a Brownian Motion from the Minimum and Maximum Parabolic Domains

Consider a Brownian motion starting at an interior point of the minimum or maximum parabolic domains, namely, D_min={(x,y₁,y₂):||x|| < min{(y₁+1)^1/p₁,(y₂+1)^1/p₂}}D_{\min}=\{(x,y_{1},y_{2}):\|x\|< \min\{(y_{1}+1)^{1/p_{1}},(y_{2}+1)^{1/p_{2}}\}\} and D_max={(x,y₁,y₂):||x|| < max{(y₁+1)^1/p₁,\allowbreak(y₂+1)^1/p₂}}D_{\max}=\{(x,y_{1},y_{2}):\|x\|<\max\{(y_{1}+1)^{1/p_{1}},\allowbreak(y_{2}+1)^{1/p_{2}}\}\} in R ^d+2,d≥1, respectively, where ‖⋅‖ is the Euclidean norm in R ^d , y ₁,y ₂≥−1, and p ₁,p ₂>1. Let t_Dmin\tau_{D_{\min}} and t_Dmax\tau_{D_{\max}} denote the first times the Brownian motion exits from D _min and D _max. Estimates with exact constants for the asymptotics of $\log P(\tau_{D_{\min}}>t)$\log P(\tau_{D_{\min}}>t) and $\log P(\tau_{D_{\max}}>t)$\log P(\tau_{D_{\max}}>t) are given as t→∞, depending on the relationship between p ₁ and p ₂, respectively. The proof methods are based on Gordon’s inequality and early works of Li, Lifshits, and Shi in the single general parabolic domain case.     

On the Diophantine equation x 2+5 m =y n

In this paper we consider the Diophantine equation x ²+5 ^m =y ⁿ , n>2, m>0. We prove that the equation has no positive integer solutions when 2∤ m, nor when 2∣m under the additional condition (x,y)=1, with the help of Bilu, Hanrot, and Voutier’s deep result in (J. Reine Angew. Math. 539:75–122, 2001). Supported by the 973 Grant of P.R.C and SRFDP 20040284018.     

Growth and Hölder conditions for the sample paths of Feller processes

Let (A,D(A)) be the infinitesimal generator of a Feller semigroup such that C _c ^∞(ℝ ⁿ )⊂D(A) and A|C _c ^∞(ℝ ⁿ ) is a pseudo-differential operator with symbol −p(x,ξ) satisfying |p(•,ξ)|_∞≤c(1+|ξ|²) and |Imp(x,ξ)|≤c ₀Rep(x,ξ). We show that the associated Feller process {X _t } _{t ≥0} on ℝ ⁿ is a semimartingale, even a homogeneous diffusion with jumps (in the sense of [21]), and characterize the limiting behaviour of its trajectories as t→0 and ∞. To this end, we introduce various indices, e.g., β_∞ ^x :={λ>0:lim _{|ξ|→∞ | x − y |≤2/|ξ|}|p(y,ξ)|/|ξ|^λ=0} or δ_∞ ^x :={λ>0:liminf _{|ξ|→∞ | x − y |≤2/|ξ| |ε|≤1}|p(y,|ξ|ε)|/|ξ|^λ=0}, and obtain a.s. (ℙ ^x ) that lim _{t →0} t ^−1/λ _{s ≤ t} |X _s −x|=0 or ∞ according to λ>β_∞ ^x or λ<δ_∞ ^x . Similar statements hold for the limit inferior and superior, and also for t→∞. Our results extend the constant-coefficient (i.e., Lévy) case considered by W. Pruitt [27]. Received: 21 July 1997 / Revised version: 26 January 1998     

Weak-Geodetically Closed Subgraphs in Distance-Regular Graphs

 Let Γ=(X,R) denote a distance-regular graph with diameter D≥2 and distance function δ. A (vertex) subgraph Ω⊆X is said to be weak-geodetically closed whenever for all x,y∈Ω and all z∈X,

Inequalities and bounds for quasi-symmetric 3-designs

Quasi-symmetric 3-designs with block intersection numbers x and y(0x<y<k) are studied, several inequalities satisfied by the parameters of a quasi-symmetric 3-designs are obtained. Let D be a quasi-symmetric 3-design with the block size k and intersection numbers x, y; y>x1 and suppose D′ denote the complement of D with the block size k′ and intersection numbers x′ and y′. If k −1 x + y then it is proved that x′ + y′ k′. Using this it is shown that the quasi-symmetric 3-designs corresponding to y = x + 1, x + 2 are either extensions of symmetric designs or designs corresponding to the Witt-design (or trivial design, i.e., v = k + 2) or the complement of above designs.     

Extremal probabilities for Gaussian quadratic forms

 Denote by Q an arbitrary positive semidefinite quadratic form in centered Gaussian random variables such that E(Q)=1. We prove that for an arbitrary x>0, inf _Q P(Q≤x)=P(χ² _n /n≤x), where χ _n ² is a chi-square distributed rv with n=n(x) degrees of freedom, n(x) is a non-increasing function of x, n=1 iff x>x(1)=1.5364…, n=2 iff x[x(2),x(1)], where x(2)=1.2989…, etc., n(x)≤rank(Q). A similar statement is not true for the supremum: if 1<x<2 and Z ₁ ,Z ₂ are independent standard Gaussian rv's, then sup_0≤λ≤1/2 P{λZ ₁ ² +(1−λ)Z ₂ ² ≤x} is taken not at λ=0 or at λ=1/2 but at 0<λ=λ(x)<1/2, where λ(x) is a continuous, increasing function from λ(1)=0 to λ(2)=1/2, e.g. λ(1.5)=.15…. Applications of our theorems include asymptotic quantiles of U and V-statistics, signal detection, and stochastic orderings of integrals of squared Gaussian processes. Received: 24 June 2002 / Revised version: 26 January 2003 Published online: 15 April 2003 Research supported by NSA Grant MDA904-02-1-0091 Mathematics Subject Classification (2000): Primary 60E15, 60G15; Secondary 62G10     

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.     

How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?

 Let D be a semicomplete multipartite digraph, with partite sets V ₁, V ₂,…, V _c, such that |V ₁|≤|V ₂|≤…≤|V _c|. Define f(D)=|V(D)|−3|V _c|+1 and . We define the irregularity i(D) of D to be max|d ⁺(x)−d ⁻(y)| over all vertices x and y of D (possibly x=y). We define the local irregularity i _l(D) of D to be max|d ⁺(x)−d ⁻(x)| over all vertices x of D and we define the global irregularity of D to be i _g(D)=max{d ⁺(x),d ⁻(x) : x∈V(D)}−min{d ⁺(y),d ⁻(y) : y∈V(D)}. In this paper we show that if i _g(D)≤g(D) or if i _l(D)≤min{f(D), g(D)} then D is Hamiltonian. We furthermore show how this implies a theorem which generalizes two results by Volkmann and solves a stated problem and a conjecture from [6]. Our result also gives support to the conjecture from [6] that all diregular c-partite tournaments (c≥4) are pancyclic, and it is used in [9], which proves this conjecture for all c≥5. Finally we show that our result in some sense is best possible, by giving an infinite class of non-Hamiltonian semicomplete multipartite digraphs, D, with i _g(D)=i(D)=i _l(D)=g(D)+?≤f(D)+1. Revised: September 17, 1998     

Sur Les Partitions en Chaînes du Graphe Divisoriel

On path partitions of the divisor graph. Let D(x) be the graph with vertices {1, 2, ..., ⌊x⌋} whose edges come from the division relation, and let D(x, y) be the subgraph restricted to the integers with prime factors less than or equal to y. We give sufficient conditions on x and y for the graph D(x, y) to be Hamiltonian. We deduce an asymptotic formula for the number of paths in D(x) needed to partition the set of vertices {1, 2, ..., ⌊x⌋}.

     

Le equazioni diofanteeax 4-bx 2+1=□, 4x 4+x 2 y 2+4y 4=□.

Summary Si determinano tre classi di quartiche u²=ax⁴+1, a e b interi, b²−4a≠□ per le quali l'appartenenza di un punto razionale (x₀,y₀),x₀≠0 porta l'esistenza nella stessa quartica di infiniti punti razionali. Si dimostra pure che l'equazione 4x²+x²y²+4y⁴=□ non ammette soluzioni intere con |xy| > 1. A BeniaminoSegre nel suo 70^mo compleanno. Entrata in Redazione il 26 febbraio 1973.     

Rectifiable oscillations in second-order half-linear differential equations

Second-order half-linear differential equation (H): on the finite interval I = (0,1] will be studied, where , p > 1 and the coefficient f(x) > 0 on I, , and . In case when p = 2, the equation (H) reduces to the harmonic oscillator equation (P): y′′ + f(x)y = 0. In this paper, we study the oscillations of solutions of (H) with special attention to some geometric and fractal properties of the graph . We establish integral criteria necessary and sufficient for oscillatory solutions with graphs having finite and infinite arclength. In case when , λ > 0, α > p, we also determine the fractal dimension of the graph G(y) of the solution y(x). Finally, we study the L ^p nonintegrability of the derivative of all solutions of the equation (H).      

非对称Cantor集的Hausdorff中心测度

§ 1　 IntroductionThe class of Cantor sets is a typical one of sets in fractal geometry.Mathematicianshave paid their attentions to such sets for a long time.Itis well known that the Hausdorffmeasure of the Cantor middle- third set is1(see[1]) .Recently,Feng[3] obtained the exactvalues of the packing measure for a class of linear Cantor sets.Using Feng s method,Zhuand Zhou[5] obtained the exactvalue of Hausdorff centred measure of the symmetry Cantorsets.In this papar,we consider the Ha…     

Convergence Rates of Best N-term Galerkin Approximations for a Class of Elliptic sPDEs

Deterministic Galerkin approximations of a class of second order elliptic PDEs with random coefficients on a bounded domain D⊂ℝ ^d are introduced and their convergence rates are estimated. The approximations are based on expansions of the random diffusion coefficients in L ²(D)-orthogonal bases, and on viewing the coefficients of these expansions as random parameters y=y(ω)=(y _i (ω)). This yields an equivalent parametric deterministic PDE whose solution u(x,y) is a function of both the space variable x∈D and the in general countably many parameters y.