偶数阶Sturm-Liouville边值问题的多个正解

该文讨论了偶数阶边值问题 (-1)^m y^(2m)₌f(t,y), 0≤t≤1,a_i+1y⁽²ⁱ⁾ (0)-β_i+1y ⁽²ⁱ⁺¹⁾ (0)=0, γ_i+1y⁽²ⁱ⁾ (1)+δ_i+1y⁽²ⁱ⁺¹⁾ (1)=0,0≤i ≤m-1正解的存在性.借助于Leggett-Williams 不动点定理,建立了该问题存在三个及任意奇数个正解的充分条件.     

Eigenvalue Intervals for 2mth Order Sturm—Liouville Boundary Value Problems

Values of λ are determined for which there exist positive solutions of the 2mth order differential equation on a measure chain, (-1)^m x ^?2m (t)=λa(t)f(u(σ(t))), y? [0,1], satisfying α _i+1 u ^?21(0)+0, γ _i+1 u ^?21(σ(1))=0, 0≤i≤m?1 with αi,βi,γi,δi≥0, where a and f are positive valued, and both lim _x-0+ (f(x)/x) and lim _x-0+ (f(x)/x) exist.     

Adjacency preserving functions on symmetric elements and linear preservers of non-zero decomposable symmetric tensors

Let A be a non-empty set and m be a positive integer. Let ≡ be the equivalence relation defined on A ^m such that (x ₁, …, x _m ) ≡ (y ₁, …, y _m ) if there exists a permutation σ on {1, …, m} such that y _σ(i) = x _i for all i. Let A ^(m) denote the set of all equivalence classes determined by ≡. Two elements X and Y in A ^(m) are said to be adjacent if (x ₁, …, x _m?1, a) ∈ X and (x ₁, …, x _m?1, b) ∈ Y for some x ₁, …, x _m?1 ∈ A and some distinct elements a, b ∈ A. We study the structure of functions from A ^(m) to B ⁽ⁿ⁾ that send adjacent elements to adjacent elements when A has at least n + 2 elements and its application to linear preservers of non-zero decomposable symmetric tensors.     

Existence of Three Positive Pseudo-symmetric Solutions for a One Dimensional Discrete p-Laplacian

We apply the Five Functionals Fixed Point Theorem to verify the existence of at least three positive pseudo-symmetric solutions for the discrete three point boundary value problem, ?(g(?u(t-1)))+a(t))f(u(t))=0, for t∈{a+1,…,b+1} and u(a)=0 with u(v)=u(b+2) where g(v)=|v| ^p-2 v, p>1, for some fixed v∈{a+1,…,b+1} and σ=(b+2+v)/2 is an integer.     

Shrinking Targets For IETS: Extending a Theorem of Kurzweil

Given an IET T : [0, 1) → [0, 1) and decreasing sequence of positive real numbers with divergent sum a = {a_i}^￥_i=1{{\bf a} = \{a_i\}^\infty_{i=1}} we consider

Langford sequences: perfect and hooked

A sequence {d, d+1,…, d+m?1} of m consecutive positive integers is said to be perfect if the integers {1, 2,…, 2m} can be arranged in disjoint pairs {(a_i, b_i): 1?i?m} so that {b_i?a_i: 1?i?m}={d,d+1,…,d+m?1}. A sequence is hooked if the set {1, 2,…, 2m?1 2m+1} can be arranged in pairs to satisfy the same condition. Well known necessary conditions for perfect sequences are herein shown to be sufficient. Similar necessary and sufficient conditions for hooked sequences are given.     

Differential Invariants of Second Order ODEs,I

This paper is devoted to differential invariants of equations

Explicit construction of general multivariate Padé approximants to an Appell function

Properties of Padé approximants to the Gauss hypergeometric function ₂F₁(a,b;c;z) have been studied in several papers and some of these properties have been generalized to several variables in [6]. In this paper we derive explicit formulae for the general multivariate Padé approximants to the Appell function F₁(a,1,1;a+1;x,y)=_i,j=0(axⁱy^j/(i+j+a)), where a is a positive integer. In particular, we prove that the denominator of the constructed approximant of partial degree n in x and y is given by , where the integer m, which defines the degree of the numerator, satisfies mn+1 and m+a2n. This formula generalizes the univariate explicit form for the Padé denominator of ₂F₁(a,1;c;z), which holds for c>a>0 and only in half of the Padé table. From the explicit formulae for the general multivariate Padé approximants, we can deduce the normality of a particular multivariate Padé table. AMS subject classification 41A63, 41A21     

Regularization of two-term differential equations with singular coefficients by quasiderivatives

We propose a regularization of the formal differential expression

A convexity theorem for multiplicative functions

We generalize a well known convexity property of the multiplicative potential function. We prove that, given any convex function g : \mathbbR^m ? [0, ￥]{g : \mathbb{R}^m \rightarrow [{0}, {\infty}]}, the function ${({\rm \bf x},{\rm \bf y})\mapsto g({\rm \bf x})^{1+\alpha}{\bf y}^{-{\bf \beta}}, {\bf y}>{\bf 0}}${({\rm \bf x},{\rm \bf y})\mapsto g({\rm \bf x})^{1+\alpha}{\bf y}^{-{\bf \beta}}, {\bf y}>{\bf 0}}, is convex if β ≥ 0 and α ≥ β ₁ + ··· + β _n . We also provide further generalization to functions of the form (x,y₁, . . . , y_n)? g(x)^1+af₁(y₁)^-b₁ ···f_n(y_n)^-b_n{({\rm \bf x},{\rm \bf y}_1, . . . , {y_n})\mapsto g({\rm \bf x})^{1+\alpha}f_1({\rm \bf y}_1)^{-\beta_1} \cdot \cdot \cdot f_n({\rm \bf y}_n)^{-\beta_n} } with the f _k concave, positively homogeneous and nonnegative on their domains.     

Construction of a Jacobi matrix from spectral data

A proof is given for the existence and uniqueness of a correspondence between two pairs of sequences {a},{b} and {ω},{μ}, satisfying b_i>0 for i=1,…,n?1 and ω₁<μ₁<?<μ_n?1<ω_n, under which the symmetric Jacobi matrices J(n,a,b) and J(n?1,a,b) have eigenvalues {ω} and {μ} respectively. Here J(m,a,b) is symmetric and tridiagonal with diagonal elements a_i (i=1,…,m) and off diagonal elements b_i (i=1,…,m?1). A new concise proof is given for the known uniqueness result. The existence result is new.     

Persistence, contractivity and global stability in logistic equations with piecewise constant delays

We establish sufficient conditions for the persistence and the contractivity of solutions and the global asymptotic stability for the positive equilibrium N^*=1/(a+∑_i=0^mb_i) of the following differential equation with piecewise constant arguments:

where r(t) is a nonnegative continuous function on [0,+∞), r(t)0, ∑_i=0^mb_i>0, b_i0, i=0,1,2,…,m, and a+∑_i=0^mb_i>0. These new conditions depend on a,b₀ and ∑_i=1^mb_i, and hence these are other type conditions than those given by So and Yu (Hokkaido Math. J. 24 (1995) 269–286) and others. In particular, in the case m=0 and r(t)≡r>0, we offer necessary and sufficient conditions for the persistence and contractivity of solutions. We also investigate the following differential equation with nonlinear delay terms:

where r(t) is a nonnegative continuous function on [0,+∞), r(t)0, 1−ax−g(x,x,…,x)=0 has a unique solution x^*>0 and g(x₀,x₁,…,x_m)C¹[(0,+∞)×(0,+∞)××(0,+∞)].     

A compact formulation of a mixed-integer set

We consider mixed-integer sets of the form X = {(s, y) ∈ ?₊ × ? ⁿ : s + a _j y _j ≥ b _j , ?j ∈ N}. A polyhedral characterization for the case where X is defined by two inequalities is provided. From that characterization we give a compact formulation for the particular case where the coefficients of the integer variables can take only two possible integer values a ₁, a ₂ ∈ ?₊ : X _n,m = {(s, y) ∈ ?₊ × ? ^n+m : s + a ₁ y _j ≥ b _j , ?j ∈ N ₁, s + a ₂ y _j ≥ b _j , j ∈ N ₂} where N ₁ = {1, …, n}, N ₂ = {n + 1, …, n + m}. In addition, we discuss families of facet-defining inequalities for the convex hull of X _n,m .     

A method of feasible directions using function approximations,with applications to min max problems

This paper presents a demonstrably convergent method of feasible directions for solving the problem min{φ(ξ)| gⁱ(ξ)?0i=1,2,…,m}, which approximates, adaptively, both φ(x) and ▽φ(x). These approximations are necessitated by the fact that in certain problems, such as when $\text{φ(x) =}\text{max}\text{{f(x, y) ¦ y ? Ω}{}_{\mathrm{y}}\text{}}$, a precise evaluation of φ(x) and ▽φ(x) is extremely costly. The adaptive procedure progressively refines the precision of the approximations as an optimum is approached and as a result should be much more efficient than fixed precision algorithms.It is outlined how this new algorithm can be used for solving problems of the form $\text{min}{}_{\mathrm{y}}\text{? Ω}{}_{\mathrm{x}}\text{max}{}_{\mathrm{y}}\text{? Ω}{}_{\mathrm{y}}\text{f(x, y)}$ under the assumption that Ωm_ξ={x|gⁱ(x)?0, j=1,…,s} ∩$\text{R}$ⁿ, Ω_y={y|ζ_i(y)?0, i-1,…,t} ∩ $\text{R}$^m, with f, g^j, ζⁱ continuously differentiable, f(x, ·) concave, ζⁱ convex for $\text{i = 1,…, t,}\text{and}\text{Ω}{}_{\mathrm{x}}\text{, Ω}{}_{\mathrm{y}}$ compact.     

Sopra una curva gobba luogo di certi punti parabolici di una rete di superficie,generale, dell’ordinen

Abstract   we prove that the operator maps into itself for where and k(x,y)=ϕ(x,y) e^ig(x,y), ϕ(x,y) satisfies (5), (e.g. ϕ(x,y)=|x–y|^iτ,τ real) and the phase g(x,y)=x^a⋅ y^b +Φ_**(x^a,y^b). We obtain L^p estimates for operators with more general phases than in [5] and for these operators we require that b₁ b₂>1, and and a_l≥ b_l≥ 1, which remained open from [4]. Keywords Oscillatory integrals, L^p mappings Mathematics Subject Classification (2000) Primary 42B20, Secondary 46B70, 47G10     

Divisibility among power GCD matrices and among power LCM matrices on three coprime divisor chains

Let h be a positive integer and S?=?{x ₁,?…?,?x _h } be a set of h distinct positive integers. We say that the set S is a divisor chain if x _σ(1) ∣?…?∣ x _σ(h) for a permutation σ of {1,?…?,?h}. If the set S can be partitioned as S?=?S ₁?∪?S ₂?∪?S ₃, where S ₁, S ₂ and S ₃ are divisor chains and each element of S _i is coprime to each element of S _j for all 1?≤?i?<?j?≤?3, then we say that the set S consists of three coprime divisor chains. The matrix having the ath power (x _i , x _j ) ^a of the greatest common divisor of x _i and x _j as its i, j-entry is called the ath power greatest common divison (GCD) matrix on S, denoted by (S ^?a ). The ath power least common multiple (LCM) matrix [S ^?a ] can be defined similarly. In this article, let a and b be positive integers and let S consist of three coprime divisor chains with 1?∈?S. We show that if a?∣?b, then the ath power GCD matrix (S ^?a ) (resp., the ath power LCM matrix [S ^?a ]) divides the bth power GCD matrix (S ^?b ) (resp., the bth power LCM matrix [S ^?b ]) in the ring M _h (Z) of h?×?h matrices over integers. We also show that the ath power GCD matrix (S ^?a ) divides the bth power LCM matrix [S ^?b ] in the ring M _h (Z) if a?∣?b. However, if a???b, then such factorizations are not true. Our results extend Hong's and Tan's theorems and also provide further evidences to the conjectures of Hong raised in 2008.     

A Monotonicity Property of Partial Orders

A proof using the FKG inequalities of the following result is obtained. Let P be a partially ordered set on a₁ ? a₂ ? ? ? a_m and b₁ ? b₂ ? ? ? b_n. Let P(x) be the proportion of linear extentions of P for which x holds. If x and y are disjunctions of conjunctions of additional inequalities of the form a_i ? b_j, then P(x and y) ? P(x)P(y). An example is provided that shows the result can be false if we don't assume the {a_i} and {b_j} are linearly ordered in P.     

Distance-Regular Graph with <Emphasis Type="Italic">c</Emphasis><Subscript>2</Subscript> > 1 and <Emphasis Type="Italic">a</Emphasis><Subscript>1</Subscript> = 0 < <Emphasis Type="Italic">a</Emphasis><Subscript>2</Subscript>

Let Γ be a distance-regular graph of diameter d ≥ 3 with c ₂ > 1. Let m be an integer with 1 ≤ m ≤ d − 1. We consider the following conditions:

关于一类微分方程周期解的存在性的注记

本文主要探讨下列周期系数微分方程dy/dt=(A₁(t)y+A₂(t)y²+A₃(t)y³)/(a₀(t)+a₁(t)y+a₂(t)y²)(**)的周期解个数问题，利用方程（**）解的差率法得到了方程（**）周期解的个数定理．本文仅在Ａ_i（ｔ），ａ_j（ｔ）（ｉ＝１，２，３，ｊ＝０，１，２）是连续周期函数的条件下得到这一结论，从而减弱了文［２］中相应定理的条件，即Ａ_i（ｔ），ａ_j（ｔ）均是连续可微的周期函数．     

The increase of sums and products dependent on (y 1, …,y n ) by rearrangement of this set

LetF(u, v) be a symmetric real function defined forα<u, v<β and assume thatG(u, v, w)=F(u, v)+F(u, w)−F(v, w) is decreasing inv andw foru≦min (u, v). For any set (y)=(y ₁, …,y _n ),α<y _i <β, given except in arrangement Σ _i ^=1/n F(y _i ,y _i+1) wherey _n+1=y ₁) is maximal if (and under some additional assumptions only if) (y) is arranged in circular symmetrical order. Examples are given and an additional result is proved on the productΠ _i ^=1/n [(y2i−1y2i) ^m +α ₁(y _2i−1 y _2i ) ^m−1+ … +a _m ] wherea _k ≧0 and where the set (y)=(y ₁, ..,y _n ),y _i ≧0 is given except in arrangement. The problems considered here arose in connection with a theorem by A. Lehman [1] and a lemma of Duffin and Schaeffer [2]. This paper is part of the author’s Master of Science dissertation at the Technion-Israel Institute of Technology. The author wishes to thank Professor B. Schwarz and Professor E. Jabotinsky for their help in the preparation of this paper.