Degree-regular triangulations of torus and Klein bottle

A triangulation of a connected closed surface is called weakly regular if the action of its automorphism group on its vertices is transitive. A triangulation of a connected closed surface is called degree-regular if each of its vertices have the same degree. Clearly, a weakly regular triangulation is degree-regular. In [8], Lutz has classified all the weakly regular triangulations on at most 15 vertices. In [5], Datta and Nilakantan have classified all the degree-regular triangulations of closed surfaces on at most 11 vertices. In this article, we have proved that any degree-regular triangulation of the torus is weakly regular. We have shown that there exists ann-vertex degree-regular triangulation of the Klein bottle if and only if n is a composite number ≥ 9. We have constructed two distinctn-vertex weakly regular triangulations of the torus for eachn ≥ 12 and a (4m + 2)-vertex weakly regular triangulation of the Klein bottle for eachm ≥ 2. For 12 ≤n ≤ 15, we have classified all then-vertex degree-regular triangulations of the torus and the Klein bottle. There are exactly 19 such triangulations, 12 of which are triangulations of the torus and remaining 7 are triangulations of the Klein bottle. Among the last 7, only one is weakly regular.     

On a quadratic functional occurring in a bivariate scattered data interpolation problem

Sunto L’applicazione di noti metodi che utilizzano funzioni di tipo blending per la costruzione di funzioni bivariate C¹ per l’interpolazione di dati, richiede la conoscenza delle derivate parziali del primo ordine ai vertici di una triangolazione sottostante. In questo lavoro consideriamo il metodo proposto da Nielson, che consiste nel calcolare stime delle derivate parziali del primo ordine minimizzando un opportuno funzionale quadratico, caratterizzato da parametri di tensione non negativi. Scopo del lavoro è l’analisi di alcune proprietà particolari di questo funzionale per la costruzione di algoritmi efficienti e robusti per la determinazione delle stime suddette delle derivate quando si ha a che fare con insiemi di dati di grandi dimensioni. Abstract The application of widely known blending methods for constructingC ¹ bivariate functions interpolating scattered data requires the knowledge of the partial derivatives of first order at the vertices of an underlying triangulation. In this paper we consider the method proposed by Nielson that consists in computing estimates of the first order partial derivatives by minimizing an appropriate quadratic functional, characterized by nonnegative tension parameters. The aim of the paper is to analyse some peculiar properties of this functional in order to construct robust and efficient algorithms for determining the above estimates of the derivatives when we are concerned with extremely large data sets.      

An interpolation problem in the Denjoy–Carleman classes

Inspired by some iterative algorithms useful for proving the real analyticity (or the Gevrey regularity) of a solution of a linear partial differential equation with real-analytic coefficients, we consider the following question. Given a smooth function defined on $[a,b]\subset \mathbb{R}$ and given an increasing divergent sequence $d_n$ of positive integers such that the derivative of order $d_n$ of f has a growth of the type $M_{d_n}$, when can we deduce that f is a function in the Denjoy–Carleman class $C^M([a,b])$? We provide a positive result and show that a suitable condition on the gaps between the terms of the sequence $d_n$ is needed.     

Functions of two variables continuous along straigt lines

For a functionf(x, y), the setsJ _a of all its discontinuity points with a jump ofa or more (that is, such that the oscillation of the function in the neighborhood of any point fromJ _a is not smaller thana) are studied. Two cases are considered: (1)f is continuous along any straight line; (2)f is continuous along lines parallel to thex- andy-axes. In the first case, conditions that must be met by the setJ _a are given. In the second case, it is shown that a (closed) setF can be the setJ _a for a certain function if and only if the projections ofF on the coordinate axes nowhere dense. Translated fromMatematicheskie Zametki, Vol. 62, No. 2, pp. 306–311, August, 1997. Translated by V. N. Dubrovsky     

On polynomial interpolation of two variables

Polynomial interpolation of two variables based on points that are located on multiple circles is studied. First, the poisedness of a Birkhoff interpolation on points that are located on several concentric circles is established. Second, using a factorization method, the poisedness of a Hermite interpolation based on points located on various circles, not necessarily concentric, is established. Even in the case of Lagrange interpolation, this gives many new sets of poised interpolation points.     

On interpolation with products of positive definite functions

In this paper we consider the problem of scattered data interpolation for multivariate functions. In order to solve this problem, linear combinations of products of positive definite kernel functions are used. The theory of reproducing kernels is applied. In particular, it follows from this theory that the interpolating functions are solutions of some varational problems.     

二元Lagrange三角插值多项式在Orlicz空间内的逼近

研究了二元函数用一种组合型的三角插值多项式算子逼近的问题.借助连续模这一工具,给出了这类三角插值多项式在Orlicz空间内的逼近定理.     

Conjugate interpolation problems in spaces of entire functions

A generalization of the Taylor expansions of entire functions with variable center is used to illustrate the notion of conjugate interpolation problem. The radii of existence, uniqueness, and convergence for such problems are found. A relationship between the interpolation functional systems of two mutually conjugate problems is revealed. Translated fromMatematicheskie Zametki, Vol. 67, No. 4, pp. 616–628, April, 2000.     

Neumann series and Lommel functions of two variables

We obtain several new results for Neumann series of Bessel functions as well as for its various special cases. The generalization of some well-known results for these kind of series, such as the Graf's addition theorem, are also established.     

Paths with a given number of vertices from each partite set in regular multipartite tournaments

A tournament is an orientation of a complete graph, and in general a multipartite or c-partite tournament is an orientation of a complete c-partite graph.For c?2 we prove that a regular c-partite tournament with r?2 vertices in each partite set contains a directed path with exactly two vertices from each partite set. Furthermore, if c?4, then we will show that almost all regular c-partite tournaments D contain a directed path with exactly r-s vertices from each partite set for each given integer s∈N, if r is the cardinality of each partite set of D. Some related results are also presented.     

Bases in the Spaces of C∞ -Functions on Cantor-Type Sets

We construct a topological basis in the space of Whitney functions given on the Cantor-type set.     

Tight bounds for the vertices of degree k in minimally k‐connected graphs

For minimally k‐connected graphs on n vertices, Mader proved a tight lower bound for the number of vertices of degree k in dependence on n and k. Oxley observed 1981 that in many cases a considerably better bound can be given if is used as additional parameter, i.e. in dependence on m, n, and k. It was left open to determine whether Oxley's more general bound is best possible. We show that this is not the case, but give a closely related bound that deviates from a variant of Oxley's long‐standing one only for small values of m. We prove that this new bound is best possible. The bound contains Mader's bound as special case.     

Randomized algorithms for the separation of point sets and for solving quadratic programs

A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space ^d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia.     

“复数域上微分中值定理新证”注记

所谓“实数域上的微分中值定理可以推广到复数域上”的论断值得商榷．通过给出实例的方法,具体分析所谓的“解析函数的微分中值定理”之错误所在．     

Existence of an Angular Density of Roots of Entire Functions of Order Zero

We obtain sufficient conditions for the set of roots of an entire function of order zero of strongly regular growth to possess an angular density.     

A law of the iterated logarithm for arithmetic functions

Let be a sequence of centered iid random variables. Let be a strongly additive arithmetic function such that and put . If and satisfies a Lindeberg-type condition, we prove the following law of the iterated logarithm:

We also prove the validity of the corresponding weighted strong law of large numbers in .

     

Pairs of commuting Hamiltonians quadratic in the momenta

In the case of two degrees of freedom, we consider pairs of Hamiltonians quadratic in the momenta and commuting with respect to the standard Poisson bracket. We find new multiparameter families of such pairs and present a universal scheme for constructing a complete solution of the Hamilton-Jacobi equation in terms of integrals over an algebraic curve. For the most complicated examples, this curve is a nonhyperelliptic covering of an elliptic curve. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 149, No. 2, pp. 147–160, November, 2006.     

On Codes Identifying Sets of Vertices in Hamming Spaces

A code is called (t, 2)-identifying if for all the words x, y(x y) and the sets (B _t (x) B _t (y)) C and are nonempty and different. Constructions of such codes and a lower bound on the cardinality of these codes are given. The lower bound is shown to be sharp in some cases. We also discuss a more general notion of -identifying codes and introduce weakly identifying codes.