Bounds relating the weakly connected domination number to the total domination number and the matching number

Let G=(V,E) be a connected graph. A dominating set S of G is a weakly connected dominating set of G if the subgraph (V,E∩(S×V)) of G with vertex set V that consists of all edges of G incident with at least one vertex of S is connected. The minimum cardinality of a weakly connected dominating set of G is the weakly connected domination number, denoted . A set S of vertices in G is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set of G is the total domination number γ_t(G) of G. In this paper, we show that . Properties of connected graphs that achieve equality in these bounds are presented. We characterize bipartite graphs as well as the family of graphs of large girth that achieve equality in the lower bound, and we characterize the trees achieving equality in the upper bound. The number of edges in a maximum matching of G is called the matching number of G, denoted α^′(G). We also establish that , and show that for every tree T.     

-Difference sequence spaces of fuzzy numbers

In this paper, using the difference operator of order m and an Orlicz function, we introduce and examine some classes of sequences of fuzzy numbers. We give the relations between the strongly Cesàro type convergence and statistical convergence in these spaces. Furthermore, we study some of their properties like completeness, solidity, symmetricity, etc. We also give some inclusion relations related to these classes.     

The clique numbers of regular graphs of matrix algebras are finite

Let F be a field, char(F)≠2, and SGL_n(F), where n is a positive integer. In this paper we show that if for every distinct elements x,yS, x+y is singular, then S is finite. We conjecture that this result is true if one replaces field with a division ring.     

When an argument is the content: Rational number comprehension through conversions across registers

This article reframes previously identified misconceptions about repeating decimals by describing these misconceptions as limited understandings of how mathematics concepts are referenced. In particular, misconceptions about repeating decimals and their quotient of integer representations are recast as limited understandings of mathematics as a discipline that derives its content from representational systems and the denotations they provided. Under this framework, arguments (e.g., proofs) that convert repeating decimals to their quotient of integer representations provide content for “rational number,” which is represented in multiple ways, each offering distinct opportunities for mathematical activity. The notion of an argument as content is illustrated as arguments providing access to a concept. One Grade 8 student’s struggle with understanding rational number is used to illustrate this framework and its implications for teaching and learning.     

The number of periodic solutions of polynomial differential equations

We estimate the number of periodic solutions for special classes ofnth-order ordinary differential equations with variable coefficients. Translated fromMatematicheskie Zametki, Vol. 64, No. 5, pp. 720–727, November, 1998. The author thanks Yu. S. Il'yashenko for setting the problems, permanent advice, and overall support. The author is also thankful to D. A. Panov for numerous discussions. This research was supported by the CRDF Foundation under grant MR1-220, by the INTAS Foundation under grant No. 93-05-07, and by the Russian Foundation for Basic Research under grant No. 95-01-01258.     

Turbulent flow computations on 3D unstructured grids

An edge-based finite element method is presented for the simulation of compressible turbulent flows on unstructured tetrahedral grids. A two equation k–ω turbulence model is employed and the standard Galerkin approach is used for spatial discretisation. Stabilisation of the resulting procedure is achieved by the addition of an appropriate diffusion. An explicit multistage time-stepping scheme is used to advance the solution in time to steady state. The performance of the algorithm is demonstrated for the simulation of a high Reynolds number transonic separated flow over a wing.     

气体分子碰撞的模型无关分析

本文纯粹基于统计平均的思想,模型无关分析导出了气体分子的碰壁数和平均碰撞频率.     

Covering the alternating groups by products of cycle classes

Given integers k,l?2, where either l is odd or k is even, we denote by n=n(k,l) the largest integer such that each element of An is a product of k cycles of length l. For an odd l, k is the diameter of the undirected Cayley graph Cay(An,Cl), where Cl is the set of all l-cycles in An. We prove that if k?2 and l?9 is odd and divisible by 3, then . This extends earlier results by Bertram [E. Bertram, Even permutations as a product of two conjugate cycles, J. Combin. Theory 12 (1972) 368-380] and Bertram and Herzog [E. Bertram, M. Herzog, Powers of cycle-classes in symmetric groups, J. Combin. Theory Ser. A 94 (2001) 87-99].     

A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms

The main goals of this paper are to: i) relate two iteration-complexity bounds derived for the Mizuno-Todd-Ye predictor-corrector (MTY P-C) algorithm for linear programming (LP), and; ii) study the geometrical structure of the LP central path. The first iteration-complexity bound for the MTY P-C algorithm considered in this paper is expressed in terms of the integral of a certain curvature function over the traversed portion of the central path. The second iteration-complexity bound, derived recently by the authors using the notion of crossover events introduced by Vavasis and Ye, is expressed in terms of a scale-invariant condition number associated with m × n constraint matrix of the LP. In this paper, we establish a relationship between these bounds by showing that the first one can be majorized by the second one. We also establish a geometric result about the central path which gives a rigorous justification based on the curvature of the central path of a claim made by Vavasis and Ye, in view of the behavior of their layered least squares path following LP method, that the central path consists of long but straight continuous parts while the remaining curved part is relatively “short”. R. D. C. Monteiro was supported in part by NSF Grants CCR-0203113 and CCF-0430644 and ONR grant N00014-05-1-0183. T. Tsuchiya was supported in part by Japan-US Joint Research Projects of Japan Society for the Promotion of Science “Algorithms for linear programs over symmetric cones” and the Grants-in-Aid for Scientific Research (C) 15510144 of Japan Society for the Promotion of Science.     

Maximum principles for a class of nonlinear second order elliptic differential equations

In this paper we investigate maximum principles for functionals defined on solutions to special partial diff'erential equations of elliptic type, extending results by Payne and Philippin. We apply such maximum principles to investigate one overdetermined problem.