Global Phase Portraits of Symmetrical Cubic Hamiltonian Systems with a Nilpotent Singular Point

Han et al. [Han et al., Polynomial Hamiltonian systems with a nilpotent critical point, J. Adv. Space Res. 2010, 46, 521–525] successfully studied local behavior of an isolated nilpotent critical point for polynomial Hamiltonian systems. In this paper, we extend the previous result by analyzing the global phase portraits of polynomial Hamiltonian systems. We provide 12 non-topological equivalent classes of global phase portraits in the Poincar´ e disk of cubic polynomial Hamiltonian systems with a nilpotent center or saddle at origin under some conditions of symmetry.     

One-Sided Exact Boundary Null Controllability of Entropy Solutions to a Class of Hyperbolic Systems of Conservation Laws with Characteristics with Constant MultiplicityOne-Sided Exact Boundary Null Controllability of Entropy Solutions to a Class of Hyperbo

This paper proves the local exact one-sided boundary null controllability of entropy solutions to a class of hyperbolic systems of conservation laws with characteristics with constant multiplicity. This generalizes the results in [Li, T. and Yu, L., One-sided exact boundary null controllability of entropy solutions to a class of hyperbolic systems of conservation laws, To appear in Journal de Mathématiques Pures et Appliquées, 2016.]for a class of strictly hyperbolic systems of conservation laws.     

Best Proximity Point Theorems for p-Proximalα-η-β-Quasi Contractions in Metric Spaces with w0-Distance

In this paper,we propose a new class of non-self mappings called p-proximalα-η-β-quasi contraction,and introduce the concepts ofα-proximal admissible mapping with respect toηand(α,d)regular mapping with respect toη.Based on these new notions,we study the existence and uniqueness of best proximity point for this kind of new contractions in metric spaces with w;-distance and obtain a new theorem,which generalize and complement the results in[Ayari,M.I.et al.Fixed Point Theory Appl.,2017,2017:16]and[Ayari,M.I.et al.Fixed Point Theory Appl.,2019,2019:7].We give an example to show the validity of our main result.Moreover,we obtain several consequences concerning about best proximity point and common fixed point results for two mappings,and we present an application of a corollary to discuss the solutions to a class of systems of Volterra type integral equations.     

On a class of almost regular Landsberg metrics

There is a long existing "unicorn" problem in Finsler geometry: whether or not any Landsberg metric is a Berwald metric? Some classes of metrics were studied in the past and no regular non-Berwaldian Landsberg metric was found. However, if the metric is almost regular(allowed to be singular in some directions),some non-Berwaldian Landsberg metrics were found in the past years. All of them are composed by Riemannian metrics and 1-forms. This motivates us to ?nd more almost regular non-Berwaldian Landsberg metrics in the class of general(α, β)-metrics. In this paper, we ?rst classify almost regular Landsberg general(α, β)-metrics into three cases and prove that those regular metrics must be Berwald metrics. By solving some nonlinear PDEs,some new almost regular Landsberg metrics are constructed which have not been described before.     

A NUMERICAL PERTURBATION EXPANSION METHOD FOR THE SOLUTION OF A LIENARD-TYPE INITIAL-VALUE PROBLEM WITH PERIODIC DECAYING FORCING TERM

A numerical perturbation expansion method is developed, analysed and implemented for the numerical solution of a second-order initial-value problem. The differential equation in this problem exhibits cubic damping, a cubic restoring force and a decaying forcing-term which is periodic with constant frequency. The method is compared with the numerical method by Twizell [1]. In fact, the later is first perturbation approximate solution in the present paper.     

Regular maps of graphs of order 4<Emphasis Type="Italic">p</Emphasis>

A 2-cell embedding f : X → S of a graph X into a closed orientable surface S can be described combinatorially by a pair M = (X;ρ ) called a map, where ρ is a product of disjoint cycle permutations each of which is the permutation of the arc set of X initiated at the same vertex following the orientation of S . It is well known that the automorphism group of M acts semi-regularly on the arc set of X and if the action is regular, then the map M and the embedding f are called regular. Let p and q be primes. Du et al. [J. Algebraic Combin., 19, 123-141 (2004)] classified the regular maps of graphs of order pq . In this paper all pairwise non-isomorphic regular maps of graphs of order 4 p are constructed explicitly and the genera of such regular maps are computed. As a result, there are twelve sporadic and six infinite families of regular maps of graphs of order 4 p ; two of the infinite families are regular maps with the complete bipartite graphs K2p,2p as underlying graphs and the other four infinite families are regular balanced Cayley maps on the groups Z4p , Z22 × Zp and D4p .     

Gr?bner bases in difference-differential modules with coefficients in a commutative ring

Insa and Pauer presented a basic theory of Grbner bases for differential operators with coefficients in a commutative ring and an improved version of this result was given by Ma et al.In this paper,we present an algorithmic approach for computing Grbner bases in difference-differential modules with coefficients in a commutative ring.We combine the generalized term order method of Zhou and Winkler with SPoly method of Insa and Pauer to deal with the problem.Our result is a generalization of theories of Insa and Pauer,Ma et al.,Zhou and Winkler and includes them as special cases.     

k-途径正则有向图

In this paper, we define a class of strongly connected digraph, called the k-walk- regular digraph, study some properties of it, provide its some algebraic characterization and point out that the 0-walk-regular digraph is the same as the walk-regular digraph discussed by Liu and Lin in 2010 and the D-walk-regular digraph is identical with the weakly distance-regular digraph defined by Comellas et al in 2004.     

Global Exact Boundary Controllability for Cubic Semi-linear Wave Equations and Klein-Gordon Equations

The authors prove the global exact boundary controllability for the cubic semi-linear wave equation in three space dimensions, subject to Dirichlet, Neumann, or any other kind of boundary controls which result in the well-posedness of the corresponding initial-boundary value problem. The exponential decay of energy is first established for the cubic semi-linear wave equation with some boundary condition by the multiplier method, which reduces the global exact boundary controllability problem to a local one. The proof is carried out in line with [2, 15]. Then a constructive method that has been developed in [13] is used to study the local problem. Especially when the region is star-complemented, it is obtained that the control function only need to be applied on a relatively open subset of the boundary. For the cubic Klein-Gordon equation, similar results of the global exact boundary controllability are proved by such an idea.     

A note on quasi-weakly almost periodic point

Recently, He et al. [On quasi-weakly almost periodic points. Sci. China Math., 56, 597–606(2013)] constructed two binary sub-shifts to solve an open problem posed by Zhou and Feng in[Twelve open problems on the exact value of the Hausdorff measure and on topological entropy: A brief survey of recent results. Nonlinearity, 17, 493–502(2004)]. In this paper, we study more dynamical properties of those two binary sub-shifts. We show that the first one has zero topological entropy and is transitive but not weakly mixing, while the second one has positive topological entropy and is strongly mixing.     

Irreducible pseudo 2-factor isomorphic cubic bipartite graphs

A bipartite graph is pseudo 2-factor isomorphic if the number of circuits in each 2-factor of the graph is always even or always odd. We proved (Abreu et?al., J Comb Theory B 98:432–442, 2008) that the only essentially 4-edge-connected pseudo 2-factor isomorphic cubic bipartite graph of girth 4 is K _3,3, and conjectured (Abreu et?al., 2008, Conjecture 3.6) that the only essentially 4-edge-connected cubic bipartite graphs are K _3,3, the Heawood graph and the Pappus graph. There exists a characterization of symmetric configurations n ₃ due to Martinetti (1886) in which all symmetric configurations n ₃ can be obtained from an infinite set of so called irreducible configurations (Martinetti, Annali di Matematica Pura ed Applicata II 15:1–26, 1888). The list of irreducible configurations has been completed by Boben (Discret Math 307:331–344, 2007) in terms of their irreducible Levi graphs. In this paper we characterize irreducible pseudo 2-factor isomorphic cubic bipartite graphs proving that the only pseudo 2-factor isomorphic irreducible Levi graphs are the Heawood and Pappus graphs. Moreover, the obtained characterization allows us to partially prove the above Conjecture.     

Assouad-Nagata dimension of locally finite groups and asymptotic cones

In this paper we study two problems concerning Assouad-Nagata dimension:

(1)

Is there a metric space of positive asymptotic Assouad-Nagata dimension such that all of its asymptotic cones are of Assouad-Nagata dimension zero? (Dydak and Higes, 2008 [11, Question 4.5]).

(2)

Suppose G is a locally finite group with a proper left invariant metric dG. If dimAN(G,dG)>0, is dimAN(G,dG) infinite? (Brodskiy et al., preprint [6, Problem 5.3]).

The first question is answered positively. We provide examples of metric spaces of positive (even infinite) Assouad-Nagata dimension such that all of its asymptotic cones are ultrametric. The metric spaces can be groups with proper left invariant metrics.The second question has a negative solution. We show that for each n there exists a locally finite group of Assouad-Nagata dimension n. As a consequence this solves for non-finitely generated countable groups the question about the existence of metric spaces of finite asymptotic dimension whose asymptotic Assouad-Nagata dimension is larger but finite.     

Forcing faces in plane bipartite graphs

Let Ω denote the class of connected plane bipartite graphs with no pendant edges. A finite face s of a graph G∈Ω is said to be a forcing face of G if the subgraph of G obtained by deleting all vertices of s together with their incident edges has exactly one perfect matching. This is a natural generalization of the concept of forcing hexagons in a hexagonal system introduced in Che and Chen [Forcing hexagons in hexagonal systems, MATCH Commun. Math. Comput. Chem. 56 (3) (2006) 649-668]. We prove that any connected plane bipartite graph with a forcing face is elementary. We also show that for any integers n and k with n?4 and n?k?0, there exists a plane elementary bipartite graph such that exactly k of the n finite faces of G are forcing. We then give a shorter proof for a recent result that a connected cubic plane bipartite graph G has at least two disjoint M-resonant faces for any perfect matching M of G, which is a main theorem in the paper [S. Bau, M.A. Henning, Matching transformation graphs of cubic bipartite plane graphs, Discrete Math. 262 (2003) 27-36]. As a corollary, any connected cubic plane bipartite graph has no forcing faces. Using the tool of Z-transformation graphs developed by Zhang et al. [Z-transformation graphs of perfect matchings of hexagonal systems, Discrete Math. 72 (1988) 405-415; Plane elementary bipartite graphs, Discrete Appl. Math. 105 (2000) 291-311], we characterize the plane elementary bipartite graphs whose finite faces are all forcing. We also obtain a necessary and sufficient condition for a finite face in a plane elementary bipartite graph to be forcing, which enables us to investigate the relationship between the existence of a forcing edge and the existence of a forcing face in a plane elementary bipartite graph, and find out that the former implies the latter but not vice versa. Moreover, we characterize the plane bipartite graphs that can be turned to have all finite faces forcing by subdivisions.     

The geometry of graphs and some of its algorithmic applications

In this paper we explore some implications of viewing graphs asgeometric objects. This approach offers a new perspective on a number of graph-theoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that respect themetric of the (possibly weighted) graph. Given a graphG we map its vertices to a normed space in an attempt to (i) keep down the dimension of the host space, and (ii) guarantee a smalldistortion, i.e., make sure that distances between vertices inG closely match the distances between their geometric images. In this paper we develop efficient algorithms for embedding graphs low-dimensionally with a small distortion. Further algorithmic applications include:

1. A simple, unified approach to a number of problems on multicommodity flows, including the Leighton-Rao Theorem [37] and some of its extensions. We solve an open question in this area, showing that the max-flow vs. min-cut gap in thek-commodities problem isO(logk). Our new deterministic polynomial-time algorithm finds a (nearly tight) cut meeting this bound.
2. For graphs embeddable in low-dimensional spaces with a small distortion, we can find low-diameter decompositions (in the sense of [7] and [43]). The parameters of the decomposition depend only on the dimension and the distortion and not on the size of the graph.
3. In graphs embedded this way, small balancedseparators can be found efficiently.

Given faithful low-dimensional representations of statistical data, it is possible to obtain meaningful and efficientclustering. This is one of the most basic tasks in pattern-recognition. For the (mostly heuristic) methods used in the practice of pattern-recognition, see [20], especially chapter 6. Our studies of multicommodity flows also imply that every embedding of (the metric of) ann-vertex, constant-degree expander into a Euclidean space (of any dimension) has distortion Ω(logn). This result is tight, and closes a gap left open by Bourgain [12].     

The variety of unary semigroups with associate inverse subsemigroup

In Billhardt et al. (Semigroup Forum 79:101–118, 2009) the authors introduced the notion of an associate inverse subsemigroup of a regular semigroup, extending the concept of an associate subgroup of a regular semigroup, first presented in Blyth et al. (Glasg. Math. J. 36:163–171, 1994). The semigroups of these two classes admit axiomatic characterisations in terms of unary operations and can, therefore, be considered as unary semigroups. In this paper we introduce the notion of unary semigroup with associate inverse subsemigroup [with associate subgroup] and show that the classes of such unary semigroups form varieties.     

Graphes cubiques d'indice trois,graphes cubiques isochromatiques,graphes cubiques d'indice quatre

The process introduced by E. Johnson [Amer. Math. Monthly73 (1966), 52–55] for constructing connected cubic graphs can be modified so as to obtain restricted classes of cubic graphs, in particular, those defined by their chromatic number or their chromatic index. We construct here the graphs of chromatic number three and the graphs whose chromatic number is equal to its chromatic index (isochromatic graphs). We then give results about the construction of the class of graphs of chromatic index four, and in particular, we construct an infinite class of “snarks.”     

Intersection Dimensions of Graph Classes

The intersection dimension of a graphG with respect to a classA of graphs is the minimumk such thatG is the intersection of at mostk graphs on vertex setV(G) each of which belongs toA. We consider the question when the intersection dimension of a certain family of graphs is bounded or unbounded. Our main results are (1) ifA is hereditary, i.e., closed on induced subgraphs, then the intersection dimension of all graphs with respect toA is unbounded, and (2) the intersection dimension of planar graphs with respect to the class of permutation graphs is bounded. We also give a simple argument based on [Ben-Arroyo Hartman, I., Newman, I., Ziv, R.:On grid intersection graphs, Discrete Math.87 (1991) 41-52] why the boxicity (i.e., the intersection dimension with respect to the class of interval graphs) of planar graphs is bounded. Further we study the relationships between intersection dimensions with respect to different classes of graphs.     

An analysis of some linear graph layout heuristics

The worst-case performances of some heuristics for the fixed linear crossing number problem (FLCNP) are analyzed. FLCNP is similar to the 2-page book crossing number problem in which the vertices of a graph are optimally placed on a horizontal “node line” in the plane, each edge is drawn as an arc in one half-plane (page), and the objective is to minimize the number of edge crossings. In FLCNP, the order of the vertices along the node line is predetermined and fixed. FLCNP belongs to the class of NP-hard optimization problems Masuda et al., 1990. In this paper we show that for each of the heuristics described, there exist classes of n-vertex, m-edge graphs which force it to obtain a number of crossings which is a function of n or m when the optimal number is a small constant. This leaves open the problem of finding a heuristic with a constant error bound for the problem.     

On the Constant Metric Dimension of Generalized Petersen Graphs P（n, 4）

In this paper,we consider the family of generalized Petersen graphs P(n,4).We prove that the metric dimension of P(n,4) is 3 when n ≡ 0(mod 4),and is 4 when n = 4k + 3(k is even).For n ≡ 1,2(mod 4) and n = 4k + 3(k is odd),we prove that the metric dimension of P(n,4) is bounded above by 4.This shows that each graph of the family of generalized Petersen graphs P(n,4)has constant metric dimension.     

On the metric dimension of HDN

The concept of metric basis is useful for robot navigation. In graph G, a robot is aware of its current location by sending signals to obtain the distances between itself and the landmarks in G. Its position is determined uniquely in G if it knows its distances to sufficiently many landmarks. The metric basis of G is defined as the minimum set of landmarks such that all other vertices in G can be uniquely determined and the metric dimension of G is defined as the cardinality of the minimum set of landmarks. The major contribution of this paper is that we have partly solved the open problem proposed by Manuel et al. [9], by proving that the metric dimension of $\text{HDN1}(n)$ and $\text{HDN2}(n)$ are either 3 or 4. However, the problem of finding the exact metric dimension of HDN networks is still open.