An example of non-uniqueness of a simple partial fraction of the best uniform approximation

For arbitrary natural n ≥ 2 we construct an example of a real continuous function, for which there exists more than one simple partial fraction of order ≤ n of the best uniform approximation on a segment of the real axis. We prove that even the Chebyshev alternance consisting of n+1 points does not guarantee the uniqueness of the best approximation fraction. The obtained results are generalizations of known non-uniqueness examples constructed for n = 2, 3 in the case of simple partial fractions of an arbitrary order n.     

Criterion for the appearance of singular nodes under interpolation by simple partial fractions

Under simple interpolation by simple partial fractions, the poles of the interpolation fraction may arise at some nodes irrespective of the values of the interpolated function at these nodes. Such nodes are said to be singular. In the presence of singular nodes, the interpolation problem is unsolvable. We establish two criteria for the appearance of singular nodes under an extension of interpolation tables and obtain an algebraic equation for calculating such nodes.     

Interpolation of rational functions by simple partial fractions

We study a generalized interpolation of a rational function at n nodes by a simple partial fraction of degree n and reduce the consideration to the solvability question for a special difference equation. We construct explicit interpolation formulas in the case where the equation order is equal to 1. We show that for functions A(x − a) ^m , m ? \mathbbN m \in \mathbb{N} , it is possible to reduce the consideration to a system of m + 1 independent first order equations and construct explicit interpolation formulas. Bibliography: 6 titles.     

一类Nevanlinna-Pick问题的Toeplitz向量方法

首次应用改进的Ｔｏｅｐｌｉｔｚ向量方法刻划Ｃａｒａｔｈｅｏｄｏｒｙ函数类中含多重零插值点的Ｎｅｖａｎ ｌｉｎｎａ Ｐｉｃｋ问题与截断的三角矩量问题之间的内在联系，从而给出这类Ｎｅｖａｎｌｉｎｎａ Ｐｉｃｋ问题的可解性准则和通解的参数化表示．     

Two-scale symbol and autocorrelation symbol for B-splines with multiple knots

The Fourier transforms of B-splines with multiple integer knots are shown to satisfy a simple recursion relation. This recursion formula is applied to derive a generalized two-scale relation for B-splines with multiple knots. Furthermore, the structure of the corresponding autocorrelation symbol is investigated. In particular, it can be observed that the solvability of the cardinal Hermite spline interpolation problem for spline functions of degree 2m+1 and defectr, first considered by Lipow and Schoenberg [9], is equivalent to the Riesz basis property of our B-splines with degreem and defectr. In this way we obtain a new, simple proof for the assertion that the cardinal Hermite spline interpolation problem in [9] has a unique solution.     

Independent permutations,as related to a problem of Moser and a theorem of Pólya

We introduce the notion of a set of independent permutations on the domain {0, 1,… n ? 1}, and obtain bounds on the size of the largest such set. The results are applied to a problem proposed by Moser in which he asked for the largest number of nodes in a d-cube of side n such that no n of these nodes are collinear. Independent permutations are also related to the problem of placing n non-capturing superqueens (chess queens with wrap-around capability) on an n × n board. As a special case of this treatment we obtain Pólya's theorem that this problem can be solved if and only if n is not a multiple of 2 or 3.     

On solvability of the axial 8-index assignment problem on single-cycle permutations

Under study is the axial 8-index assignment problem on single-cycle permutations. For a long time the question of solvability of its set of constraints for single-cycle permutations of length n in the case of 8 indices remained open.We prove that the set of constraints have a solution for odd n ≥ 87.     

Neumann problem for generalized n-Poisson equation

Using a hierarchy of integral operators having higher-order Neumann functions and their derivatives as kernels, the Neumann problem for a 2nth order linear partial complex differential equation is discussed. The solvability of the problem is obtained.     

Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results

We present anO(p · n) algorithm for the problem of finding disjoint simple paths of minimum total length betweenp given pairs of terminals on oriented partial 2-trees withn nodes and positive or negative arc lengths. The algorithm is inO(n) if all terminals are distinct nodes. We characterize the convex hull of the feasible solution set for the casep=2.We gratefully acknowledge the referee's many helpful suggestions to improve the presentation of this paper.     

On intersections of Sylow 2-subgroups in automorphism groups of finite simple groups of exceptional Lie type

We consider the problem of interpolation of finite sets of numerical data bounded in L _p -norms (1 ≤ p < ∞) by smooth functions that are defined in an n-dimensional Euclidean ball of radius R and vanish on the boundary of the ball. Under some constraints on the location of interpolation nodes, we obtain two-sided estimates with a correct dependence on R for the L _p -norms of the Laplace operators of the best interpolants.     

Optimization of the Hausdorff distance between sets in Euclidean space

Set approximation problems play an important role in many areas of mathematics and mechanics. For example, approximation problems for solvability sets and reachable sets of control systems are intensively studied in differential game theory and optimal control theory. In N.N. Krasovskii and A.I. Subbotin’s investigations devoted to positional differential games, one of the key problems was the problem of identification of solvability sets, which are maximal stable bridges. Since this problem can be solved exactly in rare cases only, the question of the approximate calculation of solvability sets arises. In papers by A.B. Kurzhanskii and F.L. Chernous’ko and their colleagues, reachable sets were approximated by ellipsoids and parallelepipeds.In the present paper, we consider problems in which it is required to approximate a given set by arbitrary polytopes. Two sets, polytopes A and B, are given in Euclidean space. It is required to find a position of the polytopes that provides a minimum Hausdorff distance between them. Though the statement of the problem is geometric, methods of convex and nonsmooth analysis are used for its investigation.One of the approaches to dealing with planar sets in control theory is their approximation by families of disks of equal radii. A basic component of constructing such families is best n-nets and their generalizations, which were described, in particular, by A.L. Garkavi. The authors designed an algorithm for constructing best nets based on decomposing a given set into subsets and calculating their Chebyshev centers. Qualitative estimates for the deviation of sets from their best n-nets as n grows to infinity were given in the general case by A.N. Kolmogorov. We derive a numerical estimate for the Hausdorff deviation of one class of sets. Examples of constructing best n-nets are given.     

A criterion for the best approximation of constants by simple partial fractions

The problem of the best uniform approximation of a real constant c by real-valued simple partial fractions R _n on a closed interval of the real axis is considered. For sufficiently small (in absolute value) c, |c| ≤ c _n , it is proved that R _n is a fraction of best approximation if, for the difference R _n ? c, there exists a Chebyshev alternance of n + 1 points on a closed interval. A criterion for best approximation in terms of alternance is stated.     

The \bar \partial -problem on q-pseudoconvex domains with applications

For a q-pseudoconvex domain Ω in ? ⁿ , 1 ≤ q ≤ n, with Lipschitz boundary, we solve the $\bar \partial $ -problem with exact support in Ω. Moreover, we solve the $\bar \partial $ -problem with solutions smooth up to the boundary over Ω provided that it has smooth boundary. Applications are given to the solvability of the tangential Cauchy-Riemann equations on the boundary.     

The $$\bar \partial $$ -problem with support conditions on some weakly pseudoconvex domainswith support conditions on some weakly pseudoconvex domains

We consider a domain Ω with Lipschitz boundary, which is relatively compact in ann-dimensional Kähler manifold and satisfies some “logδ-pseudoconvexity” condition. We show that the\(\bar \partial \)-equation with exact support in ω admits a solution in bidegrees (p, q), 1≤q≤n?1. Moreover, the range of\(\bar \partial \) acting on smooth (p, n?1)-forms with support in\(\bar \Omega \) is closed. Applications are given to the solvability of the tangential Cauchy-Riemann equations for smooth forms and currents for all intermediate bidegrees on boundaries of weakly pseudoconvex domains in Stein manifolds and to the solvability of the tangential Cauchy-Riemann equations for currents on Levi flatCR manifolds of arbitrary codimension.     

Clusters of point matrices

Along with classical orthogonal polynomials, we consider orthogonal polynomials of degree n ? 1 at n points. These arise naturally from interpolation polynomials. The name “point matrices” is justified by the fact that we deal, not with a class of similar or congruent matrices that play a key role in a linear space and are related to its bases, but with matrices with a fixed set of nodes (or points) x ₁, …, x _n . A certain matrix cluster corresponds to each set of nodes. It is stated that there exists a simple connection between eigenproblems of a Hankel matrix H and a symmetric Jacobi matrix T.     

The limit distribution of the number of nodes in low strata of a random mapping

We consider random single-valued mappings of an n-element set into itself. Using simple probabilistic facts, we show that the number of nodes in low strata and the number of cyclic nodes of the graphs of such mappings are identically distributed as n → ∞.     

The boundary Carathéodory-Fejér interpolation problem

We give a new solvability criterion for the boundary Carathéodory-Fejér problem: given a point x∈R and, a finite set of target values, to construct a function f in the Pick class such that the first few derivatives of f take on the prescribed target values at x. We also derive a linear fractional parametrization of the set of solutions of the interpolation problem with real target values. The proofs are based on a reduction method due to Julia and Nevanlinna.     

Forbidden (0,1)-Vectors in Hyperplanes of ℝ n : The Restricted Case

In this paper we continue our investigation on “Extremal problems under dimension constraint” introduced in [2]. Let E(n, k) be the set of (0,1)-vectors in ? ⁿ with k one's. Given 1 ≤ m, w ≤ n let X ? E(n, m) satisfy span (X) ∩ E(n, w) = ?. How big can |X| be? This is the main problem studied in this paper. We solve this problem for all parameters 1 ≤ m, w ≤ n and n > n ₀(m, w).