Orientable edge colorings of graphs

An edge coloring of a graph is orientable if and only if it is possible to orient the edges of the graph so that the color of each edge is determined by the head of its corresponding oriented arc. The goals of this paper include finding a forbidden substructure characterization of orientable colorings and giving a linear time recognition algorithm for orientable colorings.An edge coloring is lexical if and only if it is possible to number the vertices of the graph so that the color of each edge is determined by its lower endpoint. Lexical colorings are, of course, the orientable colorings in which the underlying orientation is acyclic. Lexical colorings play an important role in Canonical Ramsey theory, and it is this standpoint that motivates the current study.     

Orientable imbedding of line graphs

In this paper we compute the orientable genus of the line graph of a graph G, when G is a tree and a 2-edge connected graph, all the vertices of which have their degrees equal to 2, 3, 6, or 11 modulo 12, and either G can be imbedded with triangular faces only or G is a bipartite graph which can be imbedded with squares only as faces. In the other cases, we give an upper bound of the genus of line graphs. In this way, we solve the question of the Hamiltonian genus of the complete graph K_n, for every n ≥ 3.     

可定向曲面上两个地图的交叉数

In this paper, we discuss the crossing numbers of two one-vertex maps on orientable surfaces. By using a reductive method, we give the crossing number of two one-vertex maps with one face on an orientable surface and the crossing number of a one-vertex map with one face and a one-vertex map with two faces on an orientable surface. This provides a lower bound for the crossing number of two general maps on an orientable surface.     

图的可定向嵌入的标根可数性

给定一族图G,可定向曲面上存在多少个以其中某个图为基础图的标根地图？采用图的自同构群对图在可定向曲面上的嵌入集合进行分类，该文解决了这个问题，同时得到了求解计数函数f^r(M)的一种新的方法。     

可定向闭曲面上保定向的周期映射

讨论可定向闭曲面上保定向周期映射的共轭类分类问题.Kulkarni(1997)指出:亏格g大于3时,曲面上任意周期大于或等于4g的周期映射共轭于两类周期映射中某个映射的幂.之后Hirose(2010)得到:亏格g大于12时,曲面上任意周期大于或等于3g的周期映射共轭于4类周期映射中某个映射的幂.本文在此基础上研究了周期大于或等于3(g-1)的情形:当亏格g大于21时,得到了和Hirose相似的结论,且找出了更多不能被包含在前面所讲的4类周期映射中的情形.     

具有年龄结构的捕食种群系统的最优收获策略

分析了一类基于年龄结构的食饵-捕食者系统的最优收获问题．证明了系统非负解的存在唯一性、解对控制变量的连续依赖性．讨论了最优策略的存在性,利用法锥和Dubovitskii-Milyutin理论导出了最优性条件．     

Tracking of Mechanical System Parameters by Phase-Locked Loops

The eigenfrequencies of a mechanical system depend on several parameters such as mass-, damping-, stiffness-distribution and boundary conditions. Variation of these parameters results in variation of the Frequency Response Function (FRF). An eigenfrequency can be tracked by resonant excitation with a Phase-Locked Loop (PLL) in order to monitor a certain parameter. As an example, a cantilever beam with a time-variant mass at its end is analyzed. In this contribution, the FRF of this beam will be derived, which is the prerequisite for the following resonant excitation. The modified PLL-design for the resonant excitation of higher modes will be explained and finally tested at the state-space model of the beam. (© 2010 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

有向图在可定向曲面上的嵌入性

Bonnington,Conder和Morton在2002年给出了有向图嵌入亏格的基本性质,并提出了如下问题:如何刻划有向嵌入是上可嵌入的?是否存在类似刻划图的上可嵌入中使用的叮裂树的结果?受此问题的启发,收稿给出了一类有向图在可定向曲面上是上可嵌入的性质.作为直接推论,可得到已有的反棱境图是上可嵌入的结论.另外得到了一些新的上可嵌入的图类.     

灯笼图的可定向嵌入亏格分布

本文主要利用联树法研究了图的亏格多项式,得到了一类新图(灯笼图)的嵌入亏格分布.证明了灯笼图和偶梯图的亏格分布具有相同的递推关系,从而得到了灯笼图的嵌入亏格分布的精确解.     

Systems of Polynomials for Detecting Orientable Matroids

We study systems of polynomial equations that correspond to a matroid M. Each of these systems has a zero solution if and only if M is orientable. Since determining if a matroid is orientable is NP-complete with respect to the size of the input data, determining if these systems have solutions is also NP-complete. However, we show that one of the associated polynomial systems corresponding to M is linear if M is a binary matroid and thus it may be determined if binary matroids are orientable in polynomial time given the circuits and cocircuits of said matroid as the input. In the case when M is not binary, we consider the associated system of non-linear polynomials. In this case Hilbertʼs Nullstellensatz gives us that M is non-orientable if and only if a certain certificate to the given polynomials system exists. We wish to place bounds on the degree of these certificates in future research.     

Families of Dot-Product Snarks on Orientable Surfaces of Low Genus

We introduce a generalized dot product and provide some embedding conditions under which the genus of a graph does not rise under a dot product with the Petersen graph. Using these conditions, we disprove a conjecture of Tinsley and Watkins on the genus of dot products of the Petersen graph and show that both Grünbaum’s Conjecture and the Berge-Fulkerson Conjecture hold for certain infinite families of snarks. Additionally, we determine the orientable genus of four known snarks and two known snark families, construct a new example of an infinite family of snarks on the torus, and construct ten new examples of infinite families of snarks on the 2-holed torus; these last constructions allow us to show that there are genus-2 snarks of every even order n ≥ 18.     

一类弹性振动系统的控制问题

本文讨论具结构阻尼系数的细长体飞行器的弹性振动方程支配系统的最优控制问题 .本文将结构阻尼系数作为控制变量 ,以“范数最小”来衡量其最优性 .证明了弹性振动系统存在唯一的最优控制元     

Numerical Optimal Harvesting for an Age-Dependent Prey-Predator System

In this article, we develop a numerical study of an optimal harvesting problem for age-dependent prey-predator system. Here, the rates of growth and decay as well as the interaction effect between species are assumed to be depending on age, time and space. Existence, uniqueness, and necessary conditions for the optimal control are assured in case of a small final time T. The discrete parabolic nonlinear dynamical systems are obtained by using a finite difference semi-implicit scheme. Then a numerical algorithm is developed to approximate the optimal harvesting effort and the optimal harvest. Results of the numerical tests are given.     

A Polynomial Invariant of Graphs On Orientable Surfaces

We consider cyclic graphs, that is, graphs with cyclic ordersat the vertices, corresponding to 2-cell embeddings of graphsinto orientable surfaces, or combinatorial maps. We constructa three variable polynomial invariant of these objects, thecyclic graph polynomial, which has many of the useful propertiesof the Tutte polynomial. Although the cyclic graph polynomialgeneralizes the Tutte polynomial, its definition is very different,and it depends on the embedding in an essential way. 2000 MathematicalSubject Classification: 05C10.     

The Mean Curvature of a Transversely Orientable Foliation

In this work we study a codimension-one C^∞-foliation ${cal F}$ of a complete Riemannian manifold M. We assume that ${cal F}$ is transversely orientable. Under this hypothesis, we show that the mean curvature function of ${cal F}$ has a superior limit. Using this result, we find a necessary and sufficient condition for the foliation ${cal F}$ to be totally geodesic.     

Optimal Control of an Elastic Tyre-Damper System with Road Contact

We study an elastic tyre with a wheel rim that is suspended at the chassis of a car by means of a spring-damper element. This quarter car model may be controlled by varying the damping constant of the electrorheological damper. Our mathematical model yields a coupled ODE-PDE problem with a free boundary at the tyre-road contact. In this study we approximate the tyre by the Hertz contact stress formula. The resulting optimal control problem with control constraints is solved numerically. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

闭光滑流形上的高阶线性微-积分方程

利用积分变换技巧,作者给出了C~n中闭光滑可定向流形上一个新的Bochner-Martinelli型积分的高阶偏导数的奇异积分的Hadamard主值,获得了高阶奇异积分的Plemelj公式和合成公式,还讨论了相应的变系数线性微分积分方程的正则化,证明其可转化为一类等价的Fredholm方程。并且指出其特征方程当给出一组适当的边值条件时,在L~*中存在唯一解。     

On Morse--Smale Diffeomorphisms with Four Periodic Points on Closed Orientable Manifolds

We study Morse--Smale diffeomorphisms of n-manifolds with four periodic points which are the only periodic points. We prove that for n= 3 these diffeomorphisms are gradient-like and define a class of diffeomorphisms inevitably possessing a nonclosed heteroclinic curve. For n 4, we construct a complete conjugacy invariant in the class of diffeomorphisms with a single saddle of codimension one.     

可定向曲面上具有较短不可收缩圈图嵌入的唯一性

拓扑图论中的一个基本问题就是要决定图在一个(可定向)曲面上的嵌入之数目(既嵌入的柔性问题).H.Whitney的经典结果表明:一个3-连通图至多有一个平面嵌入;C.Thomassen的LEW-嵌入(大边宽度)理论将这一结果推广到一般的可定向曲面.本文给出了几个关于一般可定向曲面上嵌入图的唯一性定理.结果表明:一些具有大的面迹的可定向嵌入仍然具有唯一性.这在本质上推广了C.Thomassen在LEW-嵌入方面的工作.