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:

Lower-semicontinuity result for the two-scale convergence

Let (m, n) ∈ ℕ², Ω an open bounded domain in ℝ^m , Y = [0, 1]^m ; u^ε in (L²(Ω))ⁿ which is two-scale converges to some u in (L²(Ω × Y))ⁿ . Let φ: Ω × ℝ^m × ℝⁿ → ℝ such that: φ(x, ·, ·) is continuous a.e. x ∈ Ω φ(·, y, z) is measurable for all (y, z) in ℝ^m × ℝⁿ , φ(x, ·, z) is 1-periodic in y, φ(x, y, ·) is convex in z. Assume that there exist a constant C₁ > 0 and a function C₂ ∈ L²(Ω) such that

     

Star-Configurations in ℙn and the Weak-Lefschetz Property

We find that some union of two star-configurations in ?² has generic Hilbert function. Applying the result, we prove that some Artinian quotients of a coordinate ring of a star-configuration in ?ⁿ satisfy the weak-Lefschetz property. More precisely, let 𝕏 and 𝕐 be star-configurations in ?² of type (2, s) and (2, s + 1) defined by forms F₁,…, F_s, and G₁,…, G_s, L, respectively, with deg(F_i) = deg(G_i) ≤2 for i = 1,…, s and s ≥ 3. If L is a general linear form in R = 𝕜[x₀, x₁, x₂], then R/(I_𝕏 + I_𝕐) has the weak-Lefschetz property with a Lefschetz element L, which extends the result of [21 Shin, Y. S. (2012). Star-configurations in ?² having generic Hilbert functions and the weak-Lefschetz property. Comm. in Algebra 40:2226–2242.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]].     

Strongly Closed Subgraphs in a Distance-Regular Graph with <Emphasis Type="Italic">c</Emphasis><Subscript>2</Subscript> > 1

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:

Iteratively reweighted least squares minimization for sparse recovery

Under certain conditions (known as the restricted isometry property, or RIP) on the m × N matrix Φ (where m < N), vectors x ∈ ?^N that are sparse (i.e., have most of their entries equal to 0) can be recovered exactly from y := Φx even though Φ^?1(y) is typically an (N ? m)—dimensional hyperplane; in addition, x is then equal to the element in Φ^?1(y) of minimal ??₁‐norm. This minimal element can be identified via linear programming algorithms. We study an alternative method of determining x, as the limit of an iteratively reweighted least squares (IRLS) algorithm. The main step of this IRLS finds, for a given weight vector w, the element in Φ^?1(y) with smallest ??₂(w)‐norm. If x⁽ⁿ⁾ is the solution at iteration step n, then the new weight w⁽ⁿ⁾ is defined by w := [|x|² + ε]^?1/2, i = 1, …, N, for a decreasing sequence of adaptively defined ε_n; this updated weight is then used to obtain x^{(n + 1)} and the process is repeated. We prove that when Φ satisfies the RIP conditions, the sequence x⁽ⁿ⁾ converges for all y, regardless of whether Φ^?1(y) contains a sparse vector. If there is a sparse vector in Φ^?1(y), then the limit is this sparse vector, and when x⁽ⁿ⁾ is sufficiently close to the limit, the remaining steps of the algorithm converge exponentially fast (linear convergence in the terminology of numerical optimization). The same algorithm with the “heavier” weight w = [|x|² + ε]^?1+τ/2, i = 1, …, N, where 0 < τ < 1, can recover sparse solutions as well; more importantly, we show its local convergence is superlinear and approaches a quadratic rate for τ approaching 0. © 2009 Wiley Periodicals, Inc.     

On the Exact Spread of Sporadic Simple Groups

A group is 2-generated if it can be generated by two elements x and y. In this case y is called a mate for x. Brenner and Wiegold (1975a Brenner , J. L. , Wiegold , J. ( 1975a ). Two-generator groups. I . Michigan Math. J. 22 : 53 – 64 .[Crossref], [Web of Science ®] , [Google Scholar]) defined a finite group G to have spread r if for every set {x ₁, x ₂,…, x _r } of distinct nontrivial elements of G, there exists an element y ? G such that G = 〈 x _i , y〉 for all i. A group is said to have exact spread r if it has spread r but not r + 1. The exact spread of a group G is denoted by s(G). Ganief (1996 Ganief , M. S. ( 1996 ). 2-Generations of the Sporadic Simple Groups , Ph.D thesis , University of Natal . [Google Scholar]) in his Ph.D. thesis proved that if G is a sporadic simple group, then s(G) ≥ 2. In Ganief and Moori (2001 Ganief , M. S. , Moori , J. ( 2001 ). On the spread of the sporadic simple groups . Comm. Algebra 29 : 3239 – 3255 .[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) the second author and Ganief used probabilistic methods and established a reasonable lower bound for the exact spread s(G) of each sporadic simple group G. The present article deals with the search for reasonable upper bounds for the exact spread of the sporadic simple groups.     

Irreducible Divisor Graphs II

Let R be an integral domain, and let x ∈ R be a nonzero nonunit that can be written as a product of irreducibles. Coykendall and Maney (to appear), defined the irreducible divisor graph of x, denoted G(x), as follows. The vertices of G(x) are the nonassociate irreducible divisors of x (each from a pre-chosen coset of the form π U(R) for π ∈ R irreducible). Given distinct vertices y and z, we put an edge between y and z if and only if yz|x. Finally, if y ⁿ |x but y ⁿ⁺¹ ? x, then we put n ? 1 loops on the vertex y.

In this article, inspired by the approach of the authors from Akhtar and Lee (to appear Akhtar , R. , Lee , L. Homology of zero divisors . To appear in Rocky Mountain J. Math.  [Google Scholar]), we study G(x) using homology. A connection is found between H ₁ and the cycle space of G(x). We also characterize UFDs via these homology groups.     

Functional equations and Weierstrass sigma-functions

It is proved that if an entire function f: ? → ? satisfies an equation of the form α ₁(x)β ₁(y) + α ₂(x)β ₂(y) + α ₃(x)β ₃(y), x,y ∈ C, for some α _j , β _j : ? → ? and there exist no \({\widetilde \alpha _j}\) and ?\({\widetilde \beta _j}\) for which \(f\left( {x + y} \right)f\left( {x - y} \right) = {\overline \alpha _1}\left( x \right){\widetilde \beta _1}\left( y \right) + {\overline \alpha _2}\left( x \right){\widetilde \beta _2}\left( y \right)\), then f(z) = exp(Az ² + Bz + C) ? σ _Γ(z - z ₁) ? σ _Γ(z - z ₂), where Γ is a lattice in ?; σ _Γ is the Weierstrass sigma-function associated with Γ; A,B,C, z ₁, z ₂ ∈ ?; and \({z_1} - {z_2} \notin \left( {\frac{1}{2}\Gamma } \right)\backslash \Gamma \).     

Oscillation of partial difference equations with continuous variables

In this paper, we consider the partial difference equation with continuous variables of the form P₁z(x + a, y + b) + p₂z (x + a, y) + p₃z (x, y + b) − p₄z (x, y) + P (x, y) z (x − τ, y − σ) = 0, where P ϵ C(R⁺ × R⁺, R⁺ − {0}), a, b, τ, σ are real numbers and p_i (i = 1, 2, 3, 4) are nonnegative constants. Some sufficient conditions for all solutions of this equation to be oscillatory are obtained.     

Inequalities for ordered sums

Summary Letx _i =y _i +z _i ,i=1, ...n, and writex ₍₁₎≦...≦x _(n) , with corresponding notation for the orderedy _i andz _i . It is shown, for example, that ,r=1, ...n. Inequalities are also obtained for convex (or concave) functions of thex _(i) . The results lead immediately to bounds for the expected values of order statistics in nonstandard situations in terms of simpler expectations. A small numerical example illustrates the method. Research supported by U.S. Army Research Office.     

Singular Nonlinear (n − 1,1) Conjugate Boundary Value Problems

Solutions are obtained for the boundary value problem, y ⁽ⁿ⁾ + f(x,y) = 0, y ⁽ⁱ⁾(0) = y(1) = 0, 0 i n – 2, where f(x,y) is singular at y = 0. An application is made of a fixed point theorem for operators that are decreasing with respect to a cone.     

Divided differences for functions of two variables for irregularly spaced arguments

Divided differences forf (x, y) for completely irregular spacing of points (x _i ,y _i ) are developed here by a natural generalization of Newton's scheme. Existing bivariate schemes either iterate the one-dimensional scheme, thus constraining (x _i ,y _i ) to be at corners of rectangles, or give polynomials Σa _jk x ^j y ^k having more coefficients than interpolation conditions. Here the generalizedn ^th divided difference is defined by (1)\(\left[ {01... n} \right] = \sum\limits_{i = 0}^n {A_i f\left( {x_i , y_i } \right)} \) where (2)\(\sum\limits_{i = 0}^n {A_i x_i^j , y_i^k = 0} \), and 1 for the last or (n+1)^th equation, for every (j, k) wherej+k=0, 1, 2,... in the usual ascending order. The gen. div. diff. [01...n] is symmetric in (x _i ,y _i ), unchanged under translation, 0 forf (x, y) an, ascending binary polynomial as far asn terms, degree-lowering with respect to (X, Y) whenf(x, y) is any polynomialP(X+x, Y+y), and satisfies the 3-term recurrence relation (3) [01...n]=λ{[1...n]?[0...n?1]}, where (4) λ= |1...n|·|01...n?1|/|01...n|·|1...n?1|, the |...i...| denoting determinants inx _i ^j y _i ^k . The generalization of Newton's div. diff. formula is (5)

$$\begin{gathered} f\left( {x, y} \right) = f\left( {x_0 , y_0 } \right) - \frac{{\left| {\alpha 0} \right|}}{{\left| 0 \right|}}\left[ {01} \right] + \frac{{\left| {\alpha 01} \right|}}{{\left| {01} \right|}}\left[ {012} \right] - \frac{{\left| {\alpha 012} \right|}}{{\left| {012} \right|}}\left[ {0123} \right] + \cdots + \hfill \\ + \left( { - 1} \right)^n \frac{{\left| {\alpha 01 \ldots n - 1} \right|}}{{\left| {01 \ldots n - 1} \right|}}\left[ {01 \ldots n} \right] + \left( { - 1} \right)^{n + 1} \frac{{\left| {\alpha 01 \ldots n} \right|}}{{\left| {01 \ldots n} \right|}}\left[ {01 \ldots n} \right], \hfill \\ \end{gathered} $$     

Oblique derivative problem for general Chaplygin-Rassias equations

The present paper deals with the oblique derivative problem for general second order equations of mixed (elliptic-hyperbolic) type with the nonsmooth parabolic degenerate line K_1(y)u_(xx) |K_2(x)|u_(yy) a(x,y)u_x b(x, y)u_y c(x,y)u=-d(x,y) in any plane domain D with the boundary D=Γ∪L_1∪L_2∪L_3∪L_4, whereΓ(■{y>0})∈C_μ~2 (0<μ<1) is a curve with the end points z=-1,1. L_1, L_2, L_3, L_4 are four characteristics with the slopes -H_2(x)/H_1(y), H_2(x)/H_1(y),-H_2(x)/H_1(y), H_2(x)/H_1(y)(H_1(y)=|k_1(y)|~(1/2), H_2(x)=|K_2(x)|~(1/2) in {y<0}) passing through the points z=x iy=-1,0,0,1 respectively. And the boundary condition possesses the form 1/2 u/v=1/H(x,y)Re[λuz]=r(z), z∈Γ∪L_1∪L_4, Im[λ(z)uz]|_(z=z_l)=b_l, l=1,2, u(-1)=b_0, u(1)=b_3, in which z_1, z_2 are the intersection points of L_1, L_2, L_3, L_4 respectively. The above equations can be called the general Chaplygin-Rassias equations, which include the Chaplygin-Rassias equations K_1(y)(M_2(x)u_x)_x M_1(x)(K_2(y)u_y)_y r(x,y)u=f(x,y), in D as their special case. The above boundary value problem includes the Tricomi problem of the Chaplygin equation: K(y)u_(xx) u_(yy)=0 with the boundary condition u(z)=φ(z) onΓ∪L_1∪L_4 as a special case. Firstly some estimates and the existence of solutions of the corresponding boundary value problems for the degenerate elliptic and hyperbolic equations of second order are discussed. Secondly, the solvability of the Tricomi problem, the oblique derivative problem and Frankl problem for the general Chaplygin- Rassias equations are proved. The used method in this paper is different from those in other papers, because the new notations W(z)=W(x iy)=u_z=[H_1(y)u_x-iH_2(x)u_y]/2 in the elliptic domain and W(z)=W(x jy)=u_z=[H_1(y)u_x-jH_2(x)u_y]/2 in the hyperbolic domain are introduced for the first time, such that the second order equations of mixed type can be reduced to the mixed complex equations of first order with singular coefficients. And thirdly, the advantage of complex analytic method is used, otherwise the complex analytic method cannot be applied.     

A Quantitative Version of the Non-Abelian Idempotent Theorem

Suppose that G is a finite group and f is a complex-valued function on G. f induces a (left) convolution operator from L ²(G) to L ²(G) by g ? f *g{g \mapsto f \ast g} where

Quasi‐symmetric designs with fixed difference of block intersection numbers

The following results for proper quasi‐symmetric designs with non‐zero intersection numbers x,y and λ > 1 are proved.

• (1) Let D be a quasi‐symmetric design with z = y ? x and v ≥ 2k. If x ≥ 1 + z + z³ then λ < x + 1 + z + z³.
• (2) Let D be a quasi‐symmetric design with intersection numbers x, y and y ? x = 1. Then D is a design with parameters v = (1 + m) (2 + m)/2, b = (2 + m) (3 + m)/2, r = m + 3, k = m + 1, λ = 2, x = 1, y = 2 and m = 2,3,… or complement of one of these design or D is a design with parameters v = 5, b = 10, r = 6, k = 3, λ = 3, and x = 1, y = 2.
• (3) Let D be a triangle free quasi‐symmetric design with z = y ? x and v ≥ 2k, then x ≤ z + z².
• (4) For fixed z ≥ 1 there exist finitely many triangle free quasi‐symmetric designs non‐zero intersection numbers x, y = x + z.
• (5) There do not exist triangle free quasi‐symmetric designs with non‐zero intersection numbers x, y = x + 2.

© 2006 Wiley Periodicals, Inc. J Combin Designs 15: 49–60, 2007     

A wavelike functional equation of Pexider type

Summary. Let (G, +) and (H, +) be abelian groups such that the equation 2u = v 2u = v is solvable in both G and H. It is shown that if f₁, f₂, f₃, f₄, : G ×G ? H f_1, f_2, f_3, f_4, : G \times G \longrightarrow H satisfy the functional equation f₁(x + t, y + s) + f₂(x - t, y - s) = f₃(x + s, y - t) + f₄(x - s, y + t) for all x, y, s, t ? G x, y, s, t \in G , then f₁, f₂, f₃, and f₄ are given by f₁ = w + h, f₂ = w - h, f₃ = w + k, f₄ = w - k where w : G ×G ? H w : G \times G \longrightarrow H is an arbitrary solution of f (x + t, y + s) + f (x - t, y - s) = f (x + s, y - t) + f (x - s, y + t) for all x, y, s, t ? G x, y, s, t \in G , and h, k : G ×G ? H h, k : G \times G \longrightarrow H are arbitrary solutions of D_y,t³g(x,y) = 0 \Delta_{y,t}^{3}g(x,y) = 0 and D_x,t³g(x,y) = 0 \Delta_{x,t}^{3}g(x,y) = 0 for all x, y, s, t ? G x, y, s, t \in G .     

On Σ1-definable Functions Provably Total in I ∏

We prove the following theorem: Let φ(x) be a formula in the language of the theory PA^? of discretely ordered commutative rings with unit of the form ?yφ′(x,y) with φ′ and let ∈ Δ₀ and let fφ: ? → ? such that f_φ(x) = y iff φ′(x,y) & (?z < y) φ′(x,z). If I ∏ ∈(?x ≥ 0), φ then there exists a natural number K such that I ∏ ? ?y?x(x > y ? ?φ(x) < x^K). Here I ∏₁^? denotes the theory PA^? plus the scheme of induction for formulas φ(x) of the form ?yφ′(x,y) (with φ′) with φ′ ∈ Δ₀.