An algebraic approach to the vector ε-algorithm

The vector -algorithm is obtained from the scalar -algorithm by taking the pseudo-inverse of a vector instead of the inverse of a scalar. Thus the vector -algorithm is known only through its rules contrarily to the scalar -algorithm and some other extrapolation algorithms.The aim of this paper is to provide an algebraic approach to the vector -algorithm.     

A new approach to the Assad–Kirk fixed point theorem

In the present paper, considering the Wardowski’s technique, we give a new approach to the Assad–Kirk fixed point theorem on metrically convex metric spaces.We also provide a nontrivial example showing that our result is a proper extension of the Assad–Kirk fixed point theorem.     

Exact Location of the Weighted Fermat–Torricelli Point on Flat Surfaces of Revolution

We find the exact location of the weighted Fermat–Torricelli point of a geodesic triangle on flat surfaces of revolution (circular cylinder and circular cone) in the three dimensional Euclidean space by applying a cosine law of three circular helixes which form a geodesic triangle on a circular cylinder, an explicit solution of the corresponding weighted Fermat–Torricelli point in the dimensional Euclidean space by calculating some lengths of geodesic arcs and angles and by using some lengths of straight lines on a circular cone which connect the vertices of the geodesic triangle with the vertex of the circular cone.     

Constructions of Solutions to Generalized Sylvester and Fermat–Torricelli Problems for Euclidean Balls

The classical problem of Apollonius is to construct circles that are tangent to three given circles in the plane. This problem was posed by Apollonius of Perga in his work “Tangencies.” The Sylvester problem, which was introduced by the English mathematician J.J. Sylvester, asks for the smallest circle that encloses a finite collection of points in the plane. In this paper, we study the following generalized version of the Sylvester problem and its connection to the problem of Apollonius: given two finite collections of Euclidean balls, find the smallest Euclidean ball that encloses all the balls in the first collection and intersects all the balls in the second collection. We also study a generalized version of the Fermat–Torricelli problem stated as follows: given two finite collections of Euclidean balls, find a point that minimizes the sum of the farthest distances to the balls in the first collection and shortest distances to the balls in the second collection.     

An algebraic identity and the Jacobi–Trudi formula

The first Jacobi–Trudi identity expresses Schur polynomials as determinants of matrices, the entries of which are complete homogeneous polynomials. The Schur polynomials were defined by Cauchy in 1815 as the quotients of determinants constructed from certain partitions. The Schur polynomials have become very important because of their close relationship with the irreducible characters of the symmetric groups and the general linear groups, as well as due to their numerous applications in combinatorics. The Jacobi–Trudi identity was first formulated by Jacobi in 1841 and proved by Nicola Trudi in 1864. Since then, this identity and its numerous generalizations have been the focus of much attention due to the important role which they play in various areas of mathematics, including mathematical physics, representation theory, and algebraic geometry. Various proofs of the Jacobi–Trudi identity, which are based on different ideas (in particular, a natural combinatorial proof using Young tableaux), have been found. The paper contains a short simple proof of the first Jacobi–Trudi identity and discusses its relationship with other well-known polynomial identities.     

An application of the fixed point theorem to the inverse sturm–liouville problem

The Sturm–Liouville operators −y″ + v(x)y on [0, 1] with Dirichlet boundary conditions y(0) = y(1) = 0 are considered. For any 1 ≤ p < ∞, a short proof of the characterization theorem for the spectral data corresponding to v ∈ L^p(0, 1) is given. Bibliography: 10 titles.     

A new algebraic approach to the Szegő-Widom limit theorem

We give another proof of the Szeg\H{o}–Widom Limit Theorem. This proof relies on a new Banach algebra method that can be directly applied to the asymptotic computation of the Toeplitz determinants. As a by-product, we establish an interesting identity for operator determinants of Toeplitz operators, namely if are certain matrix valued functions defined on the unit circle, then

An alternative approach to the Faber–Krahn inequality for Robin problems

We give a simple proof of the Faber–Krahn inequality for the first eigenvalue of the p-Laplace operator with Robin boundary conditions. The techniques introduced allow to work with much less regular domains by using test function arguments. We substantially simplify earlier proofs, and establish the sharpness of the inequality for a larger class of domains at the same time.     

The Fermat–Torricelli Problem, Part I: A Discrete Gradient-Method Approach

We give a discrete geometric (differential-free) proof of the theorem underlying the solution of the well known Fermat–Torricelli problem, referring to the unique point having minimal distance sum to a given finite set of non-collinear points in d-dimensional space. Further on, we extend this problem to the case that one of the given points is replaced by an affine flat, and we give also a partial result for the case where all given points are replaced by affine flats (of various dimensions), with illustrative applications of these theorems.     

On linear combinatorics I. Concurrency—An algebraic approach

This article is the first one in a series of three. It contains concurrency results for sets of linear mappings of with few compositions and/or small image sets. The fine structure of such sets of mappings will be described in part II [3]. Those structure theorems can be considered as a first attempt to find Freiman-Ruzsa type results for a non-Abelian group. Part III [4] contains some geometric applications.Dedicated to the memory of P. ErdsResearch partially supported by HU-NSF grants OTKA T014302 and T019367.     

An alternative approach to “fixed point theorems for occasionally weakly compatible mappings”

The aim of this short communication is to provide an alternative of Bisht and Pant result (2013) [1, Theorem 1.2] in the context of framing proper setting for the application of occasionally weakly compatible mappings.     

An elementary approach to the polynomial τ-functions of the KP Hierarchy

We give an elementary construction of the solutions of the KP hierarchy associated with polynomial τ-functions starting with a geometric approach to soliton equations based on the concept of a bi-Hamiltonian system. As a consequence, we establish a Wronskian formula for the polynomial τ-functions of the KP hierarchy. This formula, known in the literature, is obtained very directly. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 122, No. 1, pp. 23–36, January, 1999.     

An inference–proof approach to privacy-preserving horizontally partitioned linear programs

Mangasarian (Optim. Lett., 6(3), 431–436, 2012) proposed a constraints transformation based approach to securely solving the horizontally partitioned linear programs among multiple entities—every entity holds its own private equality constraints. More recently, Li et al. (Optim. Lett., doi:10.1007/s11590-011-0403-2, 2012) extended the transformation approach to horizontally partitioned linear programs with inequality constraints. However, such transformation approach is not sufficiently secure – occasionally, the privately owned constraints are still under high risk of inference. In this paper, we present an inference–proof algorithm to enhance the security for privacy-preserving horizontally partitioned linear program with arbitrary number of equality and inequality constraints. Our approach reveals significantly less information than the prior work and resolves the potential inference attack.     

An efficient technique for finding the eigenvalues of fourth-order Sturm–Liouville problems

In this paper, we will develop a numerical technique for finding the eigenvalues of fourth-order non-singular Sturm–Liouville problems. We used the variational iteration methods as a basis for this technique. Numerical results and conclusions will be presented. Comparison results with others will be presented.     

A Gamma-convergence approach to the Cahn–Hilliard equation

We study the asymptotic dynamics of the Cahn–Hilliard equation via the “Gamma-convergence” of gradient flows scheme initiated by Sandier and Serfaty. This gives rise to an H ¹-version of a conjecture by De Giorgi, namely, the slope of the Allen–Cahn functional with respect to the H ⁻¹-structure Gamma-converges to a homogeneous Sobolev norm of the scalar mean curvature of the limiting interface. We confirm this conjecture in the case of constant multiplicity of the limiting interface. Finally, under suitable conditions for which the conjecture is true, we prove that the limiting dynamics for the Cahn–Hilliard equation is motion by Mullins–Sekerka law. Partially supported by a Vietnam Education Foundation graduate fellowship.     

An ε-sensitivity analysis in the primal–dual interior point method

This paper presents a method of sensitivity analysis on the cost coefficients and the right-hand sides for most variants of the primal–dual interior point method. We first define an ε-optimal solution to describe the characteristics of the final solution obtained by the primal–dual interior point method. Then an ε-sensitivity analysis is defined to determine the characteristic region where the final solution remains the ε-optimal solution as a cost coefficient or a right-hand side changes. To develop the method of ε-sensitivity analysis, we first derive the expressions for the final solution from data which are commonly maintained in most variants of the primal–dual interior point method. Then we extract the characteristic regions on the cost coefficients and the right-hand sides by manipulating the mathematical expressions for the final solution. Finally, we show that in the nondegenerate case, the characteristic regions obtained by ε-sensitivity analysis are convergent to those obtained by sensitivity analysis in the simplex algorithm.