A determinantal description of GCD-closed sets and k-sets

Let S={x ₁,x ₂,…,x_n } be a naturally ordered set of distinct positive integers. S is called a k-set if k= gcd(x_i ,x_j ) for x_i ≠x_j any in S. In this paper k-sets are characterized by certain conditions on the determinants of some matrices associated with S.     

Approximations of Two-Place Functions by Finite Sums of Terms with Separable Variables

It is known that if a smooth function h in two real variables x and y belongs to the class Σ_n of all sums of the form Σⁿ_k=1ƒ_k(x) g_k(y), then its (n + 1)th order "Wronskian" det[h_xⁱy^j]ⁿ_i,j=0 is identically equal to zero. The present paper deals with the approximation problem h(x, y) Σⁿ_k=1ƒ_k(x) g_k(y) with a prescribed n, for general smooth functions h not lying in Σ_n. Two natural approximation sums T=T(h) Σ_n, S=S(h) Σ_n are introduced and the errors |h-T|, |h-S| are estimated by means of the above mentioned Wronskian of the function h. The proofs utilize the technique of ordinary linear differential equations.     

Higher order multi‐point boundary value problems

We consider the boundary value problem where n ? 2 and m ? 1 are integers, t_j ∈ [0, 1] for j = 1, …, m, and f and g_i, i = 0, …, n ? 1, are continuous. We obtain sufficient conditions for the existence of a solution of the above problem based on the existence of lower and upper solutions. Explicit conditions are also found for the existence of a solution of the problem. The differential equation has dependence on all lower order derivatives of the unknown function, and the boundary conditions cover many multi‐point boundary conditions studied in the literature. Schauder’s fixed point theorem and appropriate Nagumo conditions are employed in the analysis. Examples are given to illustrate the results. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Finite‐difference approximation for the u(k)‐derivative with O(hM−k+1) accuracy: An analytical expression

An approximation of function u(x) as a Taylor series expansion about a point x₀ at M points x_i, ～ i = 1,2,…,M is used where x_i are arbitrary‐spaced. This approximation is a linear system for the derivatives u^(k) with an arbitrary accuracy. An analytical expression for the inverse matrix A ^?1 where A = [A_ik] = (x_i ? x₀)^k is found. A finite‐difference approximation of derivatives u^(k) of a given function u(x) at point x₀ is derived in terms of the values u(x_i). © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A note on a third‐order multi‐point boundary value problem at resonance

Based on the coincidence degree theory of Mawhin, we prove some existence results for the following third‐order multi‐point boundary value problem at resonance where f: [0, 1] × R³ → R is a continuous function, 0 < ξ₁ < ??? < ξ_m < 1, α_i ∈ R, i = 1, …, m, m ≥ 1 and 0 < η₁ < η₂ < ??? < η_n < 1, β_j ∈ R, j = 1, 2, …, n, n ≥ 2. In this paper, the dimension of the linear space Ker L (linear operator L is defined by Lx = x′^′′) is equal to 2. Since all the existence results for third‐order differential equations obtained in previous papers are for the case dim Ker L = 1, our work is new.     

Matrices associated with arithmetical functions

Let f be an arithmetical function and S={x ₁,x ₂,…,x_n } a set of distinct positive integers. Denote by [f(x_i ,x_j }] the n×n matrix having f evaluated at the greatest common divisor (x_i ,x_j ) of x_i , and x_j as its i j-entry. We will determine conditions on f that will guarantee the matrix [f(x_i ,x_j )] is positive definite and, in fact, has properties similar to the greatest common divisor (GCD) matrix

[(x_i ,x_j )] where f is the identity function. The set S is gcd-closed if (x_i ,x_j )∈S for 1≤ i j ≤ n. If S is gcd-closed, we calculate the determinant and (if it is invertible) the inverse of the matrix [f(x_i ,x_j )]. Among the examples of determinants of this kind are H. J. S. Smith's determinant det[(i,j)].     

Data‐Driven Optimal Transport

The problem of optimal transport between two distributions ρ(x) and μ(y) is extended to situations where the distributions are only known through a finite number of samples {x_i} and {y_j}. A weak formulation is proposed, based on the dual of the Kantorovich formulation, with two main modifications: replacing the expected values in the objective function by their empirical means over the {x_i} and {y_j}, and restricting the dual variables u(x) and v(y) to a suitable set of test functions adapted to the local availability of sample points. A procedure is proposed and tested for the numerical solution of this problem, based on a fluidlike flow in phase space, where the sample points play the role of active Lagrangian markers. © 2016 Wiley Periodicals, Inc.     

On the Problem of Parameter Estimation in Exponential Sums

Let I≥1 be an integer, ω ₀=0<ω ₁<⋯<ω _I ≤π, and for j=0,…,I, a _j ∈ℂ, a_-j=[`(a_j)]a_{-j}={\overline{{a_{j}}}}, ω _−j =−ω _j , and a_j 1 0a_{j}\not=0 if j 1 0j\not=0. We consider the following problem: Given finitely many noisy samples of an exponential sum of the form

S‐essential spectra and application to an example of transport operators

In this article, we give some results on the S‐essential spectra of a linear operator defined on a Banach space. Furthermore, we apply the obtained results to determine the S‐essential spectra of an integro‐differential operator with abstract boundary conditions in the Banach space L_p([?a,a] × [?1,1]),p ≥ 1 and a > 0. Copyright © 2012 John Wiley & Sons, Ltd.     

A note on the stability of Jordan triple higher ring derivations

In the present paper, we establish the stability and the superstability of a functional inequality corresponding to the functional equation fn（xyx） = ∑i＋j＋k=n fi（x）fj （y）fk（x）. In addition, we take account of the problem of Jacobson radical ranges for such functional inequality.     

On Hong’s conjecture for power LCM matrices

A set S={x ₁,...,x _n } of n distinct positive integers is said to be gcd-closed if (x _i , x _j ) ∈ S for all 1 ⩽ i, j ⩽ n. Shaofang Hong conjectured in 2002 that for a given positive integer t there is a positive integer k(t) depending only on t, such that if n ⩽ k(t), then the power LCM matrix ([x _i , x _j ] ^t ) defined on any gcd-closed set S={x ₁,...,x _n } is nonsingular, but for n ⩾ k(t) + 1, there exists a gcd-closed set S={x ₁,...,x _n } such that the power LCM matrix ([x _i , x _j ] ^t ) on S is singular. In 1996, Hong proved k(1) = 7 and noted k(t) ⩾ 7 for all t ⩾ 2. This paper develops Hong’s method and provides a new idea to calculate the determinant of the LCM matrix on a gcd-closed set and proves that k(t) ⩾ 8 for all t ⩾ 2. We further prove that k(t) ⩾ 9 iff a special Diophantine equation, which we call the LCM equation, has no t-th power solution and conjecture that k(t) = 8 for all t ⩾ 2, namely, the LCM equation has t-th power solution for all t ⩾ 2.     

A note on bound for norms of Cauchy–Hankel matrices

We determine bounds for the spectral and ??_p norm of Cauchy–Hankel matrices of the form H_n=[1/(g+h(i+j))]ⁿ_i,j=1≡ ([1/(g+kh)]ⁿ_i,j=1), k=0, 1,…, n –1, where k is defined by i+j=k (mod n). Copyright © 2002 John Wiley & Sons, Ltd.     

Universal robustness of scale‐free networks against cascading edge failures

Considering the effect of the local topology structure of an edge on cascading failures, we investigate the cascading reaction behaviors on scale‐free networks with respect to small edge‐based initial attacks. Adopt the initial load of an edge ij in a network to be L_ij = (k_ik_j)^α[(∑k_a)(∑k_b)]^β with k_i and k_j being the degrees of the nodes connected by the edge ij, where α and β are tunable parameters, governing the strength of the edge initial load, and Γ_i and Γ_j are the sets of neighboring nodes of i and j, respectively. Our aim is to explore the relationship between some parameters and universal robustness characteristics against cascading failures on scale‐free networks. We find by the theoretical analysis that the Baraba'si‐Albert (BA) scale‐free networks can reach the strongest robustness level against cascading failures when α + β = 1, where the robustness is quantified by a transition from normal state to collapse. And the network robustness has a positive correlation with the average degree. We furthermore confirm by the numerical simulations these results.     

Distribution of eigenvalues for the discontinuous boundary-value problem with functional-manypoint conditions

In this study, we investigate the boundary-value problem with eigenvalue parameter generated by the differential equation with discontinuous coefficients and boundary conditions which contains not only endpoints of the considered interval, but also a point of discontinuity, a finite number of internal points and abstract linear functionals. So our problem is not a pure boundary-value one. We single out a class of linear functionals and find simple algebraic conditions on the coefficients which guarantee the existence of an infinite number of eigenvalues. Also, the asymptotic formulas for the eigenvalues are found. The results obtained in this paper are new, even in the case of boundary conditions either without internal points or without linear functionals.     

A Hausdorff‐like moment problem and the inversion of the Laplace transform

We consider the problem of finding u ∈ L ²(I ), I = (0, 1), satisfying ∫_I u (x )x dx = μ _k , where k = 0, 1, 2, …, (α _k ) is a sequence of distinct real numbers greater than –1/2, and μ = (μ _kl ) is a given bounded sequence of real numbers. This is an ill‐posed problem. We shall regularize the problem by finite moments and then, apply the result to reconstruct a function on (0, +∞) from a sequence of values of its Laplace transforms. Error estimates are given. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Disjoint skolem sequences and related disjoint structures

A Skolem sequence of order n is a sequence S = (s₁, s₂…, s²ⁿ) of 2n integers satisfying the following conditions: (1) for every k ∈ {1, 2,… n} there exist exactly two elements s_i,S_j such that S_i = S_j = k; (2) If s_i = s_j = k,i < j then j ? i = k. In this article we show the existence of disjoint Skolem, disjoint hooked Skolem, and disjoint near-Skolem sequences. Then we apply these concepts to the existence problems of disjoint cyclic Steiner and Mendelsohn triple systems and the existence of disjoint 1-covering designs. © 1993 John Wiley & Sons, Inc.     

Method for Solving the Multidimensional n‐Wave Resonant Equations and Geometry of Generalized Darboux‐Manakov‐Zakharov Systems

The intrinsic geometric properties of generalized Darboux‐Manakov‐Zakharov systems of semilinear partial differential equations (1) for a real‐valued function u(x₁, …, x_n) are studied with particular reference to the linear systems in this equation class. System (1) is overdetermined and will not generally be involutive in the sense of Cartan: its coefficients will be constrained by complicated nonlinear integrability conditions. We derive tools for explicitly constructing involutive systems of the form (1) , essentially solving the integrability conditions. Specializing to the linear case provides us with a novel way of viewing and solving the multidimensional n‐wave resonant interaction system and its modified version. For each integer n≥ 3 and nonnegative integer k, our procedure constructs solutions of the n‐wave resonant interaction system depending on at least k arbitrary functions each of one variable. The construction of these solutions relies only on differentiation, linear algebra, and the solution of ordinary differential equations.     

Generalized three-point difference schemes of high-order accuracy for systems of second-order nonlinear ordinary differential equations

For systems of second-order nonlinear ordinary differential equations with the Dirichlet boundary conditions, we develop generalized three-point difference schemes of high-order accuracy on a nonuniform grid. The construction of the suggested schemes requires solving four auxiliary Cauchy problems (two problems for systems of nonlinear ordinary differential equations and two problems for matrix linear ordinary differential equations) on the intervals [x _j−1, x _j ] (forward) and [x _j , x _j+1] (backward) at each grid point; this is done at each step by any single-step method of accuracy order $ \bar m $ \bar m = 2[(m+1)/2]. (Here m is a given positive integer, and [·] is the integer part of a number.) We prove that such three-point difference schemes have the accuracy order $ \bar m $ \bar m for the approximation to both the solution u of the boundary value problem and the flux K(x)d u/dx at the grid points.     

A degree condition for the circumference of a graph

We present a new condition on the degree sums of a graph that implies the existence of a long cycle. Let c(G) denote the length of a longest cycle in the graph G and let m be any positive integer. Suppose G is a 2-connected graph with vertices x₁,…,x_n and edge set E that satisfies the property that, for any two integers j and k with j < k, x_jx_k ? E, d(x_i) ? j and d(x_k) ? K - 1, we have (1) d(x_i) + d(x_k ? m if j + k ? n and (2) if j + k < n, either m ? n or d(x_j) + d(x_k) ? min(K + 1,m). Then c(G) ? min(m, n). This result unifies previous results of J.C. Bermond and M. Las Vergnas, respectively.