Computing the topological entropy of maps of the interval with three monotone pieces

An algorithm is presented for computing the topological entropy of a piecewise monotone map of the interval having three monotone pieces. The accuracy of the algorithm is discussed and some graphs of the topological entropy obtained using the algorithm are displayed. Some of the ideas behind the algorithm have application to piecewise monotone functions with more than three monotone pieces.     

一类函数增量的局部渐近性质

文章研究了一类函数增量的局部渐近性质,发现这类函数增量的局部渐近性对于一元实函数,二元及多元实函数,向量值函数和复函数在一定条件下都会保持不变,进而提出了两个相关的猜想:此类函数增量的渐近性是关于函数变换的拓扑不变量。     

Acyclic edge coloring of 2‐degenerate graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a′(G). A graph is called 2‐degenerate if any of its induced subgraph has a vertex of degree at most 2. The class of 2‐degenerate graphs properly contains series–parallel graphs, outerplanar graphs, non ? regular subcubic graphs, planar graphs of girth at least 6 and circle graphs of girth at least 5 as subclasses. It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that a′(G)?Δ + 2, where Δ = Δ(G) denotes the maximum degree of the graph. We prove the conjecture for 2‐degenerate graphs. In fact we prove a stronger bound: we prove that if G is a 2‐degenerate graph with maximum degree Δ, then a′(G)?Δ + 1. © 2010 Wiley Periodicals, Inc. J Graph Theory 69: 1–27, 2012     

The Max-Flow Min-Cut theorem for countable networks

We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to each other, in the sense that the flow saturates the cut and is zero on the reverse cut. If the network does not contain infinite trails then this flow can be chosen to be mundane, i.e. to be a sum of flows along finite paths. We show that in the presence of infinite trails there may be no orthogonal pair of a cut and a mundane flow. We finally show that for locally finite networks there is an orthogonal pair of a cut and a flow that satisfies Kirchhoff's first law also for ends.     

The DFS-heuristic for orthogonal graph drawing

In this paper, we present a new heuristic for orthogonal graph drawings, which creates drawings by performing a depth-first search and placing the nodes in the order they are encountered. This DFS-heuristic works for graphs with arbitrarily high degrees, and particularly well for graphs with maximum degree 3. It yields drawings with at most one bend per edge, and a total number of m−n+1 bends for a graph with n nodes and m edges; this improves significantly on the best previous bound of m−2 bends.     

Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs

Robert E. Jamison characterized chordal graphs by the edge set of every k-cycle being the symmetric difference of k−2 triangles. Strongly chordal (and chordal bipartite) graphs can be similarly characterized in terms of the distribution of triangles (respectively, quadrilaterals). These results motivate a definition of ‘strongly chordal bipartite graphs’, forming a class intermediate between bipartite interval graphs and chordal bipartite graphs.     

Topology and geometry of nematic braids

Topological analysis of disclinations in nematic liquid crystals is an interesting and diverse topic that goes from strict mathematical theorems to applications in elaborate systems found in experiments and numerical simulations. The theory of nematic disclinations is shown from both the geometric and topological perspectives. Entangled disclination line networks are analyzed based on their shape and the behavior of their cross section. Methods of differential geometry are applied to derive topological results from reduced geometric information. For nematic braids, systems of −1/2 disclination loops, created by inclusion of homeotropic colloidal particles, a formalism of rewiring is constructed, allowing comparison and construction of an entire set of different conformations. The disclination lines are described as ribbons and a new topological invariant, the self-linking number, is introduced. The analysis is generalized from a constant −1/2 profile to general profile variations, while retaining the geometric treatment. The workings of presented topological statements are demonstrated on simple models of entangled nematic colloids, estimating the margins of theoretical assumptions made in the formal derivations, and reviewing the behavior of the disclinations not only under topological, but also under free-energy driven constraints.     

Effective manipulation of Andreev bound states,zero mode Majorana fermion and Josephson current in a superconductor–normal–superconductor junction on the surface of a topological insulator

We study the effective manipulation of the Andreev bound states (ABS), zero mode Majorana fermion and Josephson current (JC) in a superconductor–normal–superconductor junction on the surface of a topological insulator in unexplored regime of parameters. It is found that the energy of the ABS changes dramatically with the phase difference between both superconductors (SCs) in a certain range of the incident angle of quasiparticles. It is shown that the velocity of Majorana fermion and the JC can be effectively tuned in a wide range of the chemical potential in the normal region (_μN${\mu }_N$) and the separation width (L  ) of the two SCs. In addition, we expose that the critical JC and its product with the normal resistance are, respectively, a quarter and the same to those in a graphene-based Josephson junction. The dependence of the critical JC on the chemical potential in the superconducting region is not monotonous: it increases (decreases) for small (large) _μN${\mu }_N$.