Attracting graphs of skew products with non-contracting fiber maps

We study attracting graphs of step skew products from the topological and ergodic points of view where the usual contracting-like assumptions of the fiber dynamics are replaced by weaker merely topological conditions. In this context, we prove the existence of an attracting invariant graph and study its topological properties. We prove the existence of globally attracting measures and we show that (in some specific cases) the rate of convergence to these measures is exponential.

     

Unstable directions and fractal dimension for skew products with overlaps in fibers

A unique feature of smooth hyperbolic non-invertible maps is that of having different unstable directions corresponding to different prehistories of the same point. In this paper we construct a new class of examples of non-invertible hyperbolic skew products with thick fibers for which we prove that there exist uncountably many points in the locally maximal invariant set ?? (actually a Cantor set in each fiber), having different unstable directions corresponding to different prehistories; also we estimate the angle between such unstable directions. We discuss then the Hausdorff dimension of the fibers of ?? for these maps by employing the thickness of Cantor sets, the inverse pressure, and also by use of continuous bounds for the preimage counting function. We prove that in certain examples, there are uncountably many points in ?? with two preimages belonging to ??, as well as uncountably many points having only one preimage in ??. In the end we give examples which, also from the point of view of Hausdorff dimension, are far from being homeomorphisms on ??, as well as far from being constant-to-1 maps on ??.     

Robust chaos in a credit cycle model defined by a one-dimensional piecewise smooth map

We consider a family of one-dimensional continuous piecewise smooth maps with monotone increasing and monotone decreasing branches. It is associated with a credit cycle model introduced by Matsuyama, under the assumption of the Cobb-Douglas production function. We offer a detailed analysis of the dynamics of this family. In particular, using the skew tent map as a border collision normal form we obtain the conditions of abrupt transition from an attracting fixed point to an attracting cycle or a chaotic attractor (cyclic chaotic intervals). These conditions allow us to describe the bifurcation structure of the parameter space of the map in a neighborhood of the boundary related to the border collision bifurcation of the fixed point. Particular attention is devoted to codimension-two bifurcation points. Moreover, the described bifurcation structure confirms that the chaotic attractors of the considered map are robust, that is, persistent under parameter perturbations.     

Absence of C 1- Ω-Explosion in the Space of Smooth Simplest Skew Products

We give a detailed proof of absence of a C ¹- Ω-explosion in the space of C ¹-regular simplest skew products of mappings of an interval (i.e., skew products of mappings of an interval with a closed set of periodic points). We study the influence of C ¹-perturbations (of the class of skew products) to the set of periods of the periodic points of C ¹-regular simplest skew products, and describe the peculiarities of period doubling bifurcations of the periodic points.     

Uniquely orderable interval graphs

Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under which a given interval graph is associated to a unique interval order (up to duality) arises naturally. Fishburn provided a characterisation for uniquely orderable finite connected interval graphs. We show, by an entirely new proof, that the same characterisation holds also for infinite connected interval graphs. Using tools from reverse mathematics, we explain why the characterisation cannot be lifted from the finite to the infinite by compactness, as it often happens.     

Examples of attracting sets of birkhoff type

We discuss an explicit example of a map of the plane R ² with a nontrivial attracting set. In particular, we are concerned with the concept of rotation number introduced by Poincaré for maps of the circle and its subsequent extension by Birkhoff to maps of the annulus. The use of rotation number allows nontrivial attractors to be distinguished. The map we discuss has an attracting set containing a set of orbits with infinitely many different rotation numbers. We obtain the map by considering an Euler iteration of a family of vector fields originally described by Arnold and find that the resulting Euler map undergoes some bifurcations which are analogous to those of the family of vector fields. Specifically, there are Hopf bifurcations where changes of stability of a fixed point result in the creation of an attracting circle. The circle which grows from the fixed point is then shown to undergo structural changes giving nontrivial attracting sets. This arises from Euler map behaviour for which the corresponding vector field behaviour is a heteroclinic saddle connection. It is possible to give an explicit trapping region for the Euler map which contains the attracting set and to describe some of its properties. Finally, an analogy is drawn with attracting sets which arise for forced oscillators.     

Two nonisomorphicK-automorphisms all of whose powers beyond one are isomorphic

As in the earlier example of two nonisomorphicK-automorphisms with isomorphic square by building an appropriate skew product of aK-automorphism that is not Bernoulli with an algebraic fiber, we get all powers beyond one of the two nonisomorphic transformations to be isomorphic. Furthermore, all the isomorphism maps are finite codings of the constructed partition names.     

Non-parametric radially symmetric mean curvature flow with a free boundary

We study the mean curvature flow of radially symmetric graphs with prescribed contact angle on a fixed, smooth hypersurface in Euclidean space. In this paper we treat two distinct problems. The first problem has a free Neumann boundary only, while the second has two disjoint boundaries, a free Neumann boundary and a fixed Dirichlet height. We separate the two problems and prove that under certain initial conditions we have either long time existence followed by convergence to a minimal surface, or finite maximal time of existence at the end of which the graphs develop a curvature singularity. We also give a rate of convergence for the singularity.     

Random interval graphs

In this paper we introduce a notion ofrandom interval graphs: the intersection graphs of real, compact intervals whose end points are chosen at random. We establish results about the number of edges, degrees, Hamiltonicity, chromatic number and independence number of almost all interval graphs.     

Forcing highly connected subgraphs

A theorem of Mader states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. We extend this result to infinite graphs. Here, it is necessary to require not only high degree for the vertices but also high vertex‐degree (or multiplicity) for the ends of the graph, that is, a large number of disjoint rays in each end. We give a lower bound on the degree of vertices and the vertex‐degree of the ends which is quadratic in k, the connectedness of the desired subgraph. In fact, this is not far from best possible: we exhibit a family of graphs with a degree of order 2^k at the vertices and a vertex‐degree of order k log k at the ends which have no k‐connected subgraphs. Furthermore, if in addition to the high degrees at the vertices, we only require high edge‐degree for the ends (which is defined as the maximum number of edge‐disjoint rays in an end), Mader's theorem does not extend to infinite graphs, not even to locally finite ones. We give a counterexample in this respect. But, assuming a lower bound of at least 2k for the edge‐degree at the ends and the degree at the vertices does suffice to ensure the existence (k + 1)‐edge‐connected subgraphs in arbitrary graphs. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 331–349, 2007     

A construction of almost automorphic minimal sets

We describe a general procedure to construct topological extensions of given skew product maps with one-dimensional fibres by blowing up a countable number of single points to vertical segments. This allows to produce various examples of unusual dynamics, including almost automorphic minimal sets of almost periodically forced systems, point-distal but non-distal homeomorphisms of the torus (as first constructed by Rees) or minimal sets of quasiperiodically forced interval maps which are not filled-in.     

On the metric properties of multimodal interval maps and <Emphasis Type="Italic">C</Emphasis><Superscript>2</Superscript> density of Axiom A

In this paper, we shall prove that Axiom A maps are dense in the space of C² interval maps (endowed with the C² topology). As a step of the proof, we shall prove real and complex a priori bounds for (first return maps to certain small neighborhoods of the critical points of) real analytic multimodal interval maps with non-degenerate critical points. We shall also discuss rigidity for interval maps without large bounds. Mathematics Subject Classification (2000) Primary 37E05; Secondary 37F25     

Covering the edges of a graph by three odd subgraphs

We prove that any finite simple graph can be covered by three of its odd subgraphs, and we construct an infinite sequence of graphs where an edge‐disjoint covering by three odd subgraphs is not possible. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 77–82, 2006     

Every transformation is disjoint from almost every non-classical exchange

A natural generalization of interval exchange maps are linear involutions, first introduced by Danthony and Nogueira (Ann Sci École Norm Sup (4) 26(6):645–664, 1993). Recurrent train tracks with a single switch which are called non-classical interval exchanges (Gadre in Ergod Theory Dyn Syst 32(06):1930–1971, 2012), form a subclass of linear involutions without flips. They are analogs of classical interval exchanges, and are first return maps for non-orientable measured foliations associated to quadratic differentials on Riemann surfaces. We show that every transformation is disjoint from almost every irreducible non-classical interval exchange. In the “Appendix”, we prove that for almost every pair of quadratic differentials with respect to the Masur–Veech measure, the vertical flows are disjoint.     

Claw-free graphs. III. Circular interval graphs

Construct a graph as follows. Take a circle, and a collection of intervals from it, no three of which have union the entire circle; take a finite set of points V from the circle; and make a graph with vertex set V in which two vertices are adjacent if they both belong to one of the intervals. Such graphs are “long circular interval graphs,” and they form an important subclass of the class of all claw-free graphs. In this paper we characterize them by excluded induced subgraphs. This is a step towards the main goal of this series, to find a structural characterization of all claw-free graphs.This paper also gives an analysis of the connected claw-free graphs G with a clique the deletion of which disconnects G into two parts both with at least two vertices.     

Transformations of Border Strips and Schur Function Determinants

We introduce the notion of the cutting strip of an outside decomposition of a skew shape, and show that cutting strips are in one-to-one correspondence with outside decompositions for a given skew shape. Outside decompositions are introduced by Hamel and Goulden and are used to give an identity for the skew Schur function that unifies the determinantal expressions for the skew Schur functions including the Jacobi-Trudi determinant, its dual, the Giambelli determinant and the rim ribbon determinant due to Lascoux and Pragacz. Using cutting strips, one obtains a formula for the number of outside decompositions of a given skew shape. Moreover, one can define the basic transformations which we call the twist transformation among cutting strips, and derive a transformation theorem for the determinantal formula of Hamel and Goulden. The special case of the transformation theorem for the Giambelli identity and the rim ribbon identity was obtained by Lascoux and Pragacz. Our transformation theorem also applies to the supersymmetric skew Schur function.     

Computation of symbolic dynamics for one-dimensional maps

In this paper we design and implement rigorous algorithms for computing symbolic dynamics for piecewise-monotone-continuous maps of the interval. The algorithms are based on computing forwards and backwards approximations of the boundary, discontinuity and critical points. We explain how to handle the discontinuities in the symbolic dynamics which occur when the computed partition element boundaries are not disjoint. The method is applied to compute the symbolic dynamics and entropy bounds for the return map of the singular limit of a switching system with hysteresis and the forced Van der Pol equation.     

Algebraic -actions of entropy rank one

We investigate algebraic -actions of entropy rank one, namely those for which each element has finite entropy. Such actions can be completely described in terms of diagonal actions on products of local fields using standard adelic machinery. This leads to numerous alternative characterizations of entropy rank one, both geometric and algebraic. We then compute the measure entropy of a class of skew products, where the fiber maps are elements from an algebraic -action of entropy rank one. This leads, via the relative variational principle, to a formula for the topological entropy of continuous skew products as the maximum of a finite number of topological pressures. We use this to settle a conjecture concerning the relational entropy of commuting toral automorphisms.