On an inequality concerning the polar derivative of a polynomial

In this paper, we present a correct proof of an L _p -inequality concerning the polar derivative of a polynomial with restricted zeros. We also extend Zygmund’s inequality to the polar derivative of a polynomial.     

On a class of graphs without 3-stars

M. Numata described edge regular graphs without 3-stars. Allμ-subgraphs of these graphs are regular of the same valency. We prove that a connected graph without 3-stars all of whoseμ- subgraphs are regular of valencyα > 0 is either a triangular graph, or the Shläfli graph, or the icosahedron graph.     

On the Number of 5‐Cycles in a Tournament

We find a formula for the number of directed 5‐cycles in a tournament in terms of its edge scores and use the formula to find upper and lower bounds on the number of 5‐cycles in any n‐tournament. In particular, we show that the maximum number of 5‐cycles is asymptotically equal to , the expected number 5‐cycles in a random tournament (), with equality (up to order of magnitude) for almost all tournaments.     

On the Equivalence and Generalized of Weyl Theorem Weyl Theorem

We know that an operator T acting on a Banach space satisfying generalized Weyl＇s theorem also satisfies Weyl＇s theorem. Conversely we show that if all isolated eigenvalues of T are poles of its resolvent and if T satisfies Weyl＇s theorem, then it also satisfies generalized Weyl＇s theorem. We give also a sinlilar result for the equivalence of a-Weyl＇s theorem and generalized a-Weyl＇s theorem. Using these results, we study the case of polaroid operators, and in particular paranormal operators.     

On the Circumference of 2-Connected $$\mathcal{P}_{3}$$-Dominated Graphs

Let G be a connected graph. For at distance 2, we define , and , if then . G is quasi-claw-free if it satisfies , and G is P ₃-dominated() if it satisfies , for every pair (x, y) of vertices at distance 2. Certainly contains as a subclass. In this paper, we prove that the circumference of a 2-connected P ₃-dominated graph G on n vertices is at least min or , moreover if then G is hamiltonian or , where is a class of 2-connected nonhamiltonian graphs.     

Vertices of Degree 5 in a Contraction Critically 5-connected Graph

An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. A k-connected graph with no k-contractible edge is said to be contraction critically k-connected. We prove that a contraction critically 5-connected graph on n vertices has at least n/5 vertices of degree 5. We also show that, for a graph G and an integer k greater than 4, there exists a contraction critically k-connected graph which has G as its induced subgraph.     

On conditions for and the order of approximation of functions by operators of classS 2m

Following P. P. Korovkin, we study conditions for the convergence of operators of classesS _2m to continuous functions and the asymptotics of approximation by such operators to differentiable functions. Translated fromMatematicheskie Zametki, Vol. 67, No. 5, pp. 654–661, May, 2000.     

On the structure of the K2 of the ring of integers in a number field

For any prime p, the p-primary part of the tame and the wild kernel of a number field F is described in terms of ideal class groups of p-power cyclotomic extensions of F.     

On the <Emphasis Type="Italic">K</Emphasis>-Theory of Graph <Emphasis Type="Italic">C</Emphasis><Superscript>*</Superscript>-Algebras

We classify graph C ^*-algebras, namely, Cuntz-Krieger algebras associated to the Bass-Hashimoto edge incidence operator of a finite graph, up to strict isomorphism. This is done by a purely graph theoretical calculation of the K-theory of the C ^*-algebras and the method also provides an independent proof of the classification up to Morita equivalence and stable equivalence of such algebras, without using the boundary operator algebra. A direct relation is given between the K ₁-group of the algebra and the cycle space of the graph. We thank Jakub Byszewski for his input in Sect. 2.8. The position of the unit in K ₀( _Ч) was guessed based on some example calculations by Jannis Visser in his SCI 291 Science Laboratory at Utrecht University College.     

An Simple Elementary Proof for the Inequality dn〈3^n

In this paper, by using a variation of the Chebyshev＇s method, we present a very simple, elementary proof of an inequality which has applications in number theory.     

Construction of the extremal function for a functional on the classH ω (n)

For a functional on the classH _ω ⁽ⁿ⁾ ,n≥3, we construct the extremal function on which the upper bound obtained by A. I. Stepanets is attained. Translated fromMatematicheskie Zametki, Vol. 61, No. 4, pp. 519–529, April, 1997. Translated by N. K. Kulman     

Differential-geometric Newton method for the best rank-(R1, R2, R3) approximation of tensors

An increasing number of applications are based on the manipulation of higher-order tensors. In this paper, we derive a differential-geometric Newton method for computing the best rank-(R ₁, R ₂, R ₃) approximation of a third-order tensor. The generalization to tensors of order higher than three is straightforward. We illustrate the fast quadratic convergence of the algorithm in a neighborhood of the solution and compare it with the known higher-order orthogonal iteration (De Lathauwer et al., SIAM J Matrix Anal Appl 21(4):1324–1342, 2000). This kind of algorithms are useful for many problems. This paper presents research results of the Belgian Network DYSCO (Dynamical Systems, Control, and Optimization), funded by the Interuniversity Attraction Poles Programme, initiated by the Belgian State, Science Policy Office. The scientific responsibility rests with its authors. Research supported by: (1) Research Council K.U.Leuven: GOA-Ambiorics, CoE EF/05/006 Optimization in Engineering (OPTEC), (2) F.W.O.: (a) project G.0321.06, (b) Research Communities ICCoS, ANMMM and MLDM, (3) the Belgian Federal Science Policy Office: IUAP P6/04 (DYSCO, “Dynamical systems, control and optimization”, 2007–2011), (4) EU: ERNSI. M. Ishteva is supported by a K.U.Leuven doctoral scholarship (OE/06/25, OE/07/17, OE/08/007), L. De Lathauwer is supported by “Impulsfinanciering Campus Kortrijk (2007–2012)(CIF1)” and STRT1/08/023.     

On a characteristic equation of well-poised Bailey chains

In this paper, we find by inverse technique two solutions of a system of linear equations which together serve as a sufficient and necessary condition for well-poised Bailey chains. Using these two solutions, we establish a new well-poised Bailey chain, two usual Bailey chains, and a well-poised extension of Bailey’s lemma. Their applications to q-series are also investigated. X. Ma was supported by Natural Science Foundation of China (No. 10771156).     

On Existence and Multiplicity of Solutions for Elliptic Equations Involving the p-Laplacian

In the present paper, the following Dirichlet problem and Neumann problem involving the p-Laplacian

Some new scales of weight characterizations of the class <Emphasis Type="Italic">B</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

We present an equivalence theorem, which includes all known characterizations of the class B _p , i.e., the weight class of Ariño and Muckenhoupt, and also some new equivalent characterizations. We also give equivalent characterizations for the classes B _p ^* , B _∞ ^* and RB _p , and prove and apply a “gluing lemma” of independent interest.     

The sharp Jackson inequality in the spaceL p on the sphere

The sharp Jackson inequality in the spaceL _p, 1≤p<2, on the unit Euclidean sphereS ⁿ⁻¹ ,n≥3, is proved. Forn=2, it was established by N. I. Chernykh. Translated fromMatematicheskie Zametki, Vol. 66, No. 1, pp. 50–62, July, 1999.     

Corrected asymptotics for a multi-server queue in the Halfin-Whitt regime

To investigate the quality of heavy-traffic approximations for queues with many servers, we consider the steady-state number of waiting customers in an M/D/s queue as s→∞. In the Halfin-Whitt regime, it is well known that this random variable converges to the supremum of a Gaussian random walk. This paper develops methods that yield more accurate results in terms of series expansions and inequalities for the probability of an empty queue, and the mean and variance of the queue length distribution. This quantifies the relationship between the limiting system and the queue with a small or moderate number of servers. The main idea is to view the M/D/s queue through the prism of the Gaussian random walk: as for the standard Gaussian random walk, we provide scalable series expansions involving terms that include the Riemann zeta function.      

On the K-stability of complete intersections in polarized manifolds

We consider the problem of existence of constant scalar curvature Kähler metrics on complete intersections of sections of vector bundles. In particular we give general formulas relating the Futaki invariant of such a manifold to the weight of sections defining it and to the Futaki invariant of the ambient manifold. As applications we give a new Mukai–Umemura–Tian like example of Fano 5-fold admitting no Kähler–Einstein metric, and a strong evidence of K-stability of complete intersections in Grassmannians.     

On quasi-convex mappings of order α in the unit ball of a complex Banach space

In this paper, a class of biholomorphic mappings named quasi-convex mapping of order α in the unit ball of a complex Banach space is introduced. When the Banach space is confined to ℂ ⁿ , we obtain the relation between this class of mappings and the convex mappings. Furthermore, the growth and covering theorems of this class of mappings are given on the unit ball of a complex Banach space X. Finally, we get the second order terms coefficient estimations of the homogeneous expansion of quasi-convex mapping of order α defined on the polydisc in ℂ ⁿ and on the unit ball in a complex Banach space, respectively. Dedicated to Professor Sheng GONG on the occasion of his 75th birthday     

On the complexity of the independent set problem in triangle graphs

We consider the complexity of the maximum (maximum weight) independent set problem within triangle graphs, i.e., graphs G satisfying the following triangle condition: for every maximal independent set I in G and every edge uv in G−I, there is a vertex w∈I such that {u,v,w} is a triangle in G. We also introduce a new graph parameter (the upper independent neighborhood number) and the corresponding upper independent neighborhood set problem. We show that for triangle graphs the new parameter is equal to the independence number. We prove that the problems under consideration are NP-complete, even for some restricted subclasses of triangle graphs, and provide several polynomially solvable cases for these problems within triangle graphs. Furthermore, we show that, for general triangle graphs, the maximum independent set problem and the upper independent neighborhood set problem cannot be polynomially approximated within any fixed constant factor greater than one unless P=NP.