自由Rota-Baxter代数的因子分解

近年来,Rota-Baxter代数在数学和物理学中有着广泛的应用,受到越来越多的关注,自由Rota-Baxter代数分别用括号字,根树以及Motzkin路径得到了构造.因子分解在代数学中是一个很重要的问题.本文主要考虑用括号字构造的自由RotaBaxter代数,得到了自由Rota-Baxter代数中基元素的因子分解.     

On the Minimum Number of Spanning Trees in k‐Edge‐Connected Graphs

We show that a k‐edge‐connected graph on n vertices has at least spanning trees. This bound is tight if k is even and the extremal graph is the n‐cycle with edge multiplicities . For k odd, however, there is a lower bound , where . Specifically, and . Not surprisingly, c₃ is smaller than the corresponding number for 4‐edge‐connected graphs. Examples show that . However, we have no examples of 5‐edge‐connected graphs with fewer spanning trees than the n‐cycle with all edge multiplicities (except one) equal to 3, which is almost 6‐regular. We have no examples of 5‐regular 5‐edge‐connected graphs with fewer than spanning trees, which is more than the corresponding number for 6‐regular 6‐edge‐connected graphs. The analogous surprising phenomenon occurs for each higher odd edge connectivity and regularity.     

Leaf‐Critical and Leaf‐Stable Graphs

The minimum leaf number ml(G) of a connected graph G is defined as the minimum number of leaves of the spanning trees of G if G is not hamiltonian and 1 if G is hamiltonian. We study nonhamiltonian graphs with the property for each or for each . These graphs will be called ‐leaf‐critical and l‐leaf‐stable, respectively. It is far from obvious whether such graphs exist; for example, the existence of 3‐leaf‐critical graphs (that turn out to be the so‐called hypotraceable graphs) was an open problem until 1975. We show that l‐leaf‐stable and l‐leaf‐critical graphs exist for every integer , moreover for n sufficiently large, planar l‐leaf‐stable and l‐leaf‐critical graphs exist on n vertices. We also characterize 2‐fragments of leaf‐critical graphs generalizing a lemma of Thomassen. As an application of some of the leaf‐critical graphs constructed, we settle an open problem of Gargano et al. concerning spanning spiders. We also explore connections with a family of graphs introduced by Grünbaum in correspondence with the problem of finding graphs without concurrent longest paths.     

Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs

For any graph G, let be the number of spanning trees of G, be the line graph of G, and for any nonnegative integer r, be the graph obtained from G by replacing each edge e by a path of length connecting the two ends of e. In this article, we obtain an expression for in terms of spanning trees of G by a combinatorial approach. This result generalizes some known results on the relation between and and gives an explicit expression if G is of order and size in which s vertices are of degree 1 and the others are of degree k. Thus we prove a conjecture on for such a graph G.     

Resistance characterizations of equiarboreal graphs

A weighted (unweighted) graph $G$ is called equiarboreal if the sum of weights (the number) of spanning trees containing a given edge in $G$ is independent of the choice of edge. In this paper, we give some resistance characterizations of equiarboreal weighted and unweighted graphs, and obtain the necessary and sufficient conditions for $k$-subdivision graphs, iterated double graphs, line graphs of regular graphs and duals of planar graphs to be equiarboreal. Applying these results, we obtain new infinite families of equiarboreal graphs, including iterated double graphs of 1-walk-regular graphs, line graphs of triangle-free 2-walk-regular graphs, and duals of equiarboreal planar graphs.     

多体动力学程序切断铰的处理方法

多体系统动力学从非树系统派生出树系统的计算需要进行切断铰的处理。切断铰约束方程的形成是进行多体系统程序编写时的重要部分,其处理过程复杂,需要一定的技巧。本文引入了约束正交补轴的概念,详细介绍了几种典型(旋转铰、万向节、棱柱铰、旋转棱柱组合铰)切断铰位移约束方程、速度约束方程、加速度约束方程的形成方法,并给出了详细的程序化过程,该方法适用于任何类型的切断铰。最后给出相应算例,结果表明本文的方法能快速、正确地形成切断铰约束方程。     

Use of a tree‐structured hierarchical model for estimation of location and uncertainty in multivariate spatial data

Analysis and modeling of spatial data are of considerable interest in many applications. However, the prediction of geographical features from a set of chemical measurements on a set of geographically distinct samples has never been explored. We report a new, tree‐structured hierarchical model for the estimation of geographical location of spatially distributed samples from their chemical measurements. The tree‐structured hierarchical modeling used in this study involves a set of geographic regions stored in a hierarchical tree structure, with each nonterminal node representing a classifier and each terminal node representing a regression model. Once the tree‐structured model is constructed, given a sample with only chemical measurements available, the predicted regional location of the sample is gradually restricted as it is passed through a series of classification steps. The geographic location of the sample can be predicted using a regression model within the terminal subregion. We show that the tree‐structured modeling approach provides reasonable estimates of geographical region and geographic location for surface water samples taken across the entire USA. Further, the location uncertainty, an estimate of a probability that a test sample could be located within a pre‐estimated, joint prediction interval that is much smaller than the terminal subregion, can also be assessed. Copyright © 2014 John Wiley & Sons, Ltd.     

Thompson＇s Group F and the Linear Group GL∞（Z）

The authors study the finite decomposition complexity of metric spaces of H, equipped with different metrics, where H is a subgroup of the linear group GL_∞(ℤ). It is proved that there is an injective Lipschitz map φ: (F, d _S ) → (H, d), where F is the Thompson’s group, dS the word-metric of F with respect to the finite generating set S and d a metric of H. But it is not a proper map. Meanwhile, it is proved that φ: (F, d _S ) → (H, d ₁) is not a Lipschitz map, where d ₁ is another metric of H.