Related papers: Strange bifurcation diagrams
A corner in a map is an edge-vertex-edge triple consisting of two distinct edges incident to the same vertex. A corneration is a set of corners that covers every arc of the map exactly once. Cornerations in a dart-transitive map generalize…
We present a graphical analysis of the mechanisms underlying the occurrences of bubbling sequences and bistability regions in the bifurcation scenario of a special class of one dimensional two parameter maps. The main result of the analysis…
We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…
In this article we study the notion of supermanifolds families, starting from Green's general classification of supermanifolds. The topics studied divide this article into two distinct parts, labelled I and II respectively. Part I concerns…
We propose to determine the bifurcation diagrams of fixed points using their coordinates as control parameters. This method can lead to exact solutions to otherwise intractable bifurcation problems.
Oscillatory dynamics are ubiquitous in biological networks. Possible sources of oscillations are well understood in low-dimensional systems, but have not been fully explored in high-dimensional networks. Here we study large networks…
We study bifurcations in finite-parameter families of vector fields on $S^2$. Recent papers by Yu. Ilyashenko, N. Goncharuk, Yu. Kudryashov, I. Schurov, and N. Solodovnikov provide examples of (locally generic) structurally unstable…
We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…
The odd diagram of a permutation is a subset of the classical diagram with additional parity conditions. In this paper, we study classes of permutations with the same odd diagram, which we call odd diagram classes. First, we prove a…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
We examine the structure of Farey maps, which are a class of maps (graph embeddings on surfaces) that have received significant attention recently. We describe how they are related to each other through regular coverings and parallel…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
We study bifurcations of non-orientable area-preserving maps with quadratic homoclinic tangencies. We study the case when the maps are given on non-orientable two-dimensional surfaces. We consider one and two parameter general unfoldings…
We study several families of planar quadratic diffeomorphisms near a Bogdanov-Takens bifurcation. For each family, the associate bifurcation diagram can be deduced from the interpolating flow. However, a zone of chaos confined between two…
An undirected graph is said to have \emph{unique neighborhoods} if any two distinct nodes have also distinct sets of neighbors. In this way, the connections of a node to other nodes can characterize a node like an "identity", irrespectively…
Experiments observing the liquid surface in a vertically oscillating container have indicated that modeling the dynamics of such systems require maps that admit states at infinity. In this paper we investigate the bifurcations in such a…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.
In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these…
We make several new contributions to the study of proper holomorphic mappings between balls. Our results include a degree estimate for rational proper maps, a new gap phenomenon for convex families of arbitrary proper maps, and an…