Mixed-Type Duality on Nonsmooth Minimax Fractional Programming Involving Exponential (p,r)-Invexity

Considering a nonsmooth minimax fractional programming problem involving exponential (p, r)-invexity, we construct a mixed-type dual problem, which is performed by an incomplete Lagrangian dual model. This mixed-type dual model involves the Wolfe type dual and Mond-Weir type dual as the special cases under exponential (p, r)-invexity. We establish the mixed-type duality problem with conditions for exponential (p, r)-invexity and prove that the optimal values of the primary problem and the mixed-type duality problem have no duality gap under the framwork of exponential (p, r)-invexity.     

On Ramanujan asymptotic expansions and inequalities for hypergeometric functions

In this paper we first discuss refinement of the Ramunujan asymptotic expansion for the classical hypergeometric functionsF(a,b;c;x), c ≤a + b, near the singularityx = 1. Further, we obtain monotonous properties of the quotient of two hypergeometric functions and inequalities for certain combinations of them. Finally, we also solve an open problem of finding conditions ona, b > 0 such that 2F(−a,b;a +b;r ²) < (2−r ²)F(a,b;a +b;r ²) holds for all r∈(0,1).     

On the optimal approximation of bounded linear functionals in Hilbert spaces of analytic functions

Optimal numerical approximation of bounded linear functionals by weighted sums in Hilbert spaces of functions analytic in a circleK _r , in a circular annulusK _r1,r2 and in an ellipseE _r is investigated by Davis' method on the common algebraic background for diagonalising the normal equation matrix. The weights and error functional norms for optimal rules with nodes located angle-equidistant on the concentric circleK _s or on the confocal ellipseE _s and in the interval [–1,1] for an arbitrary bounded linear functional are given explicitly. They are expressed in terms of a complete orthonormal system in the Hilbert space.     

Optimal quadrature problem on <Emphasis Type="Italic">n</Emphasis>-information for Hardy-Sobolev classes

For β > 0 and an integer r ≥ 2, denote by [(H)\tilde]_￥,b^r\tilde H_{\infty ,\beta }^r those 2π-periodic, real-valued functions f on ℝ, which are analytic in S _β := {z ∈ ℂ: |Im z| < β} and satisfy the restriction |f ^(r)(z)|≤1, z ∈ S _β . The optimal quadrature formulae about information composed of the values of a function and its kth (k = 1, ..., r − 1) derivatives on free knots for the classes [(H)\tilde]_￥,b^r\tilde H_{\infty ,\beta }^r are obtained, and the error estimates of the optimal quadrature formulae are exactly determined.     

RELATIVE WIDTH OF SMOOTH CLASSES OF MULTIVARIATE PERIODIC FUNCTIONS WITH RESTRICTIONS ON ITERATED LAPLACE DERIVATIVES IN THE L2-METRIC

For two subsets W and V of a Banach space X, let Kn(W, V, X) denote the relative Kolmogorov n-width of W relative to V defined by Kn (W, V, X) := inf sup Ln f∈W g∈V∩Ln inf ‖f-g‖x,where the infimum is taken over all n-dimensional linear subspaces Ln of X. Let W2(△r) denote the class of 2w-periodic functions f with d-variables satisfying ∫[-π,π]d |△rf(x)|2dx ≤ 1,while △r is the r-iterate of Laplace operator △. This article discusses the relative Kolmogorov n-width of W2(△r) relative to W2(△r) in Lq([-r, πr]d) (1 ≤ q ≤∞), and obtain its weak asymptotic result.     

Joint Distributions of the Numbers of Visits for Finite-State Markov Chains

For a discrete-time Markov chain with finite state space {1, …, r} we consider the joint distribution of the numbers of visits in states 1, …, r−1 during the firstNsteps or before theNth visit tor. From the explicit expressions for the corresponding generating functions we obtain the limiting multivariate distributions asN→∞ when staterbecomes asymptotically absorbing and forj=1, …, r−1 the probability of a transition fromrtojis of order 1/N.     

The number of symmetric colorings of the dihedral group D3

We compute the number of symmetric r-colorings and the number of equivalence classes of symmetric r-colorings of the dihedral group D₃.     

On Some Asymptotic Formulæ of Ramanujan

Let σ_b(n) ≔ Σ_d|nd^b. For every integer r ≥ 2 and for 0 < a < 1 we estabish an asymptotic estimate of Σ_{n ≤ x}σ^r_–a(n).     

New Linear Codes with Covering Radius 2 and Odd Basis

On the way of generalizing recent results by Cock and the second author, it is shown that when the basis q is odd, BCH codes can be lengthened to obtain new codes with covering radius R=2. These constructions (together with a lengthening construction by the first author) give new infinite families of linear covering codes with codimension r=2k+1 (the case q=3, r=4k+1 was considered earlier). New code families with r=4k are also obtained. An updated table of upper bounds on the length function for linear codes with 24, R=2, and q=3,5 is given.     

On the local distribution of certain arithmetic functions

Let d(n), σ ₁(n), and φ(n) stand for the number of positive divisors of n, the sum of the positive divisors of n, and Euler’s function, respectively. For each ν ∈, Z, we obtain asymptotic formulas for the number of integers n ⩽ x for which e _n = 2 ^v r for some odd integer m as well as for the number of integers n ⩽ x for which e _n = 2 ^v r for some odd rational number r. Our method also applies when φ(n) is replaced by σ ₁(n), thus, improving upon an earlier result of Bateman, Erdős, Pomerance, and Straus, according to which the set of integers n such that is an integer is of density 1/2. Research supported in part by a grant from NSERC. Research supported by the Applied Number Theory Research Group of the Hungarian Academy of Science and by a grant from OTKA. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 3, pp. 315–331, July–September, 2006.     

Integral closures and weight functions over finite fields

Curves and surfaces of type I are generalized to integral towers of rank r. Weight functions with values in N^r and the corresponding weighted total-degree monomial orderings lift naturally from one domain R_j−1 in the tower to the next, R_j, the integral closure of R_j−1[x_j]/φ(x_j). The qth power algorithm is reworked in this more general setting to produce this integral closure over finite fields, though the application is primarily that of calculating the normalizations of curves related to one-point AG codes arising from towers of function fields. Every attempt has been made to couch all the theory in terms of multivariate polynomial rings and ideals instead of the terminology from algebraic geometry or function field theory, and to avoid the use of any type of series expansion.     

Quantized CP approximation and sparse tensor interpolation of function‐generated data

In this article, we consider the iterative schemes to compute the canonical polyadic (CP) approximation of quantized data generated by a function discretized on a large uniform grid in an interval on the real line. This paper continues the research on the quantics‐tensor train (QTT) method (“O(d log N)‐quantics approximation of N‐d tensors in high‐dimensional numerical modeling” in Constructive Approximation, 2011) developed for the tensor train (TT) approximation of the quantized images of function related data. In the QTT approach, the target vector of length 2^L is reshaped to a Lth‐order tensor with two entries in each mode (quantized representation) and then approximated by the QTT tensor including 2r²L parameters, where r is the maximal TT rank. In what follows, we consider the alternating least squares (ALS) iterative scheme to compute the rank‐r CP approximation of the quantized vectors, which requires only 2rL?2^L parameters for storage. In the earlier papers (“Tensors‐structured numerical methods in scientific computing: survey on recent advances” in Chemom Intell Lab Syst, 2012), such a representation was called Q_Can format, whereas in this paper, we abbreviate it as the QCP (quantized canonical polyadic) representation. We test the ALS algorithm to calculate the QCP approximation on various functions, and in all cases, we observed the exponential error decay in the QCP rank. The main idea for recovering a discretized function in the rank‐r QCP format using the reduced number of the functional samples, calculated only at O(2rL) grid points, is presented. The special version of the ALS scheme for solving the arising minimization problem is described. This approach can be viewed as the sparse QCP‐interpolation method that allows to recover all 2rL representation parameters of the rank‐r QCP tensor. Numerical examples show the efficiency of the QCP‐ALS‐type iteration and indicate the exponential convergence rate in r.     

Second‐order properties of the point process of nodes in a stationary Voronoi tessellation

In this paper we derive representation formulae for the second factorial moment measure of the point process of nodes and the second moment of the number of vertices of the typical cell associated with a stationary normal Voronoi tessellation in ?^d . In case the Voronoi tessellation is generated by a stationary Poisson process with intensity λ > 0 the corresponding pair correlation function g_V,λ (r) can be expressed by a weighted sum of d +2 (numerically tractable) multiple parameter integrals. The asymptotic variance of the number of nodes in an increasing cubic domain as well as the second moment of the number of vertices of the typical Poisson Voronoi cell are calculated exactly by means of these parameter integrals. The existence of a (d ? 1)st‐order pole of g_V,λ (r) at r = 0 is proved and the exact value of lim_{r →0} r^{d –1} g_V,λ (r) is determined. In the particular cases d = 2 and d = 3 the graph of g_V,1(r) including its local extreme points, the points of level 1 of gV, 1(r) and other characteristics are computed by numerical integration. Furthermore, an asymptotically exact confidence interval for the intensity of nodes is obtained. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Solutions of multiple vector refinement equations with infinite mask

This paper is devoted to investigating the solutions of refinement equations of the form Ф（x）=∑α∈Z^s α（α）Ф（Mx-α）,x∈R^s,where the vector of functions Ф = （Ф1,… ,Фr）^T is in （L1（R^s））^r, α =（α（α））α∈Z^s is an infinitely supported sequence of r × r matrices called the refinement mask, and M is an s × s integer matrix such that lim n→∞ M^-n =0, with m = detM. Some properties about the solutions of refinement equations axe obtained.     

On a multiplicative function on the set of shifted primes

It is proved that if ƒ(n) is a multiplicative function taking a valueζ on the set of primes such thatζ ³ = 1,ζ ≠ 1 andƒ ³(p ^r)=1 forr≥2, then there exists aθ ∈ (0, 1), for which

The primal power affine scaling method

In this paper, we present a variant of the primal affine scaling method, which we call the primal power affine scaling method. This method is defined by choosing a realr>0.5, and is similar to the power barrier variant of the primal-dual homotopy methods considered by den Hertog, Roos and Terlaky and Sheu and Fang. Here, we analyze the methods forr>1. The analysis for 0.50<r<1 is similar, and can be readily carried out with minor modifications. Under the non-degeneracy assumption, we show that the method converges for any choice of the step size . To analyze the convergence without the non-degeneracy assumption, we define a power center of a polytope. We use the connection of the computation of the power center by Newton's method and the steps of the method to generalize the 2/3rd result of Tsuchiya and Muramatsu. We show that with a constant step size such that /(1-)^2r > 2/(2r-1) and with a variable asymptotic step size k uniformly bounded away from 2/(2r+1), the primal sequence converges to the relative interior of the optimal primal face, and the dual sequence converges to the power center of the optimal dual face. We also present an accelerated version of the method. We show that the two-step superlieear convergence rate of the method is 1+r/(r+1), while the three-step convergence rate is 1+ 3r/(r+2). Using the measure of Ostrowski, we note thet the three-step method forr=4 is more efficient than the two-step quadratically convergent method, which is the limit of the two-step method asr approaches infinity.Partially supported by the grant CCR-9321550 from NSF.     

Strongly Singular Sturm – Liouville Problems

We consider a Sturm – Liouville operator Lu = —(r(t)u′)′ + p (t)u , where r is a (strictly) positive continuous function on ]a, b [ and p is locally integrable on ]a, b[. Let r₁(t) = (1/r) ds andchoose any c ∈]a, b[. We are interested in the eigenvalue problem Lu = λm(t)u, u (a) = u (b) = 0,and the corresponding maximal and anti .maximal principles, in the situation when 1/r ∈ L¹ (a, c),1 /r ∉ L¹ (c, b), pr₁ ∉ L¹ (a, c) and pr₁ ∉ L¹(c, b).     

Sooner and Later Waiting Time Problems Based on a Dependent Sequence

This paper introduces a new concept: a binary sequence of order (k,r), which is an extension of a binary sequence of order k and a Markov dependent sequence. The probability functions of the sooner and later waiting time random variables are derived in the binary sequence of order (k,r). The probability generating functions of the sooner and later waiting time distributions are also obtained. Extensions of these results to binary sequence of order (g,h) are also presented.     

Multiplicities and Reduction Numbers

Let (Rmbe a Cohen–Macaulay local ring and let I be an ideal. There are at least five algebras built on I whose multiplicity data affect the reduction number r(I) of the ideal. We introduce techniques from the Rees algebra theory of modules to produce estimates for r(I), for classes of ideals of dimension one and two. Previous cases of such estimates were derived for ideals of dimension zero.     

All meromorphic solutions of an ordinary differential equation and its applications

Dedicated to Professor Yuzan He on the Occasion of his 80th Birthday In this paper, we employ the complex method to obtain all meromorphic solutions of an auxiliary ordinary differential equation at first and then find out all meromorphic exact solutions of the combined KdV–mKdV equation and variant Boussinesq equations. Our result shows that all rational and simply periodic exact solutions of the combined KdV–mKdV equation and variant Boussinesq equations are solitary wave solutions, the method is more simple than other methods, and there exist some rational solutions w_r,2(z) and simply periodic solutions w_s,2(z) that are not only new but also not degenerated successively by the elliptic function solutions. Copyright © 2016 John Wiley & Sons, Ltd.