Related papers: Path-Connectedness in Global Bifurcation Theory
We study isoperimetric problems modeled on the liquid drop model, with nonlocal interactions under a volume constraint. While balls are natural critical points, we show that, for an unbounded sequence of radii, non-spherical solutions…
If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a canonical decomposition into 2.5-connected components. These…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
We show, under some natural conditions, that the set of abelian points on the non-anomalous subset of a closed irreducible subvariety $X$ intersected with the union of connected algebraic subgroups of codimension at least $\dim X$ in a…
This paper analyzes the structure of the set of nodal solutions of a class of one-dimensional superlinear indefinite boundary values problems with an indefinite weight functions in front of the spectral parameter. Quite astonishingly, the…
We apply a recent duality theorem for tangles in abstract separation systems to derive tangle-type duality theorems for width-parameters in graphs and matroids. We further derive a duality theorem for the existence of clusters in large data…
Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…
Separation logics are widely used for verifying programs that manipulate complex heap-based data structures. These logics build on so-called separation algebras, which allow expressing properties of heap regions such that modifications to a…
A non-autonomous version of the standard map with a periodic variation of the parameter is introduced and studied. Symmetry properties in the variables and parameters of the map are found and used to find relations between rotation numbers…
The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…
The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced…
In his volume [5] on "Symmetry Breaking for Compact Lie Groups" Mike Field quotes a private communication by Jorge Ize claiming that any bifurcation problem with absolutely irreducible group action would lead to bifurcation of steady…
One of the goals of science is to understand the relation between a whole and its parts, as exemplified by the problem of certifying the entanglement of a system from the knowledge of its reduced states. Here, we focus on a different but…
We study a global invariant for path structures. The invariant is obtained as a secondary invariant from a Cartan connection on a canonical bundle associated to a path structure. It is computed in examples which are defined in terms of…
Classical blockmodel is known as the simplest among models of networks with community structure. The model can be also seen as an extremely simply example of interconnected networks. For this reason, it is surprising that the percolation…
We prove two general decomposition theorems for fixed-point invariants: one for the Lefschetz number and one for the Reidemeister trace. These theorems imply the familiar additivity results for these invariants. Moreover, the proofs of…
There are few examples of non-autonomous vector fields exhibiting complex dynamics that may be proven analytically. We analyse a family of periodic perturbations of a weakly attracting robust heteroclinic network defined on the two-sphere.…
When a dynamical system is subject to a periodic perturbation, the averaging method can be applied to obtain an autonomous leading order "guiding system", placing the time dependence at higher orders. Recent research focused on…
Our ability to control a whole network can be achieved via a small set of driver nodes. While the minimum number of driver nodes needed for control is fixed in a given network, there are multiple choices for the driver node set. A quantity…
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…