Related papers: Geometric Spanning Cycles in Bichromatic Point Set…
We show that by coupling complex three-state systems to branched-polymer like ensembles we can obtain models with gamma-string different from one half. It is also possible to study the interpolation between dynamical and crystalline graphs…
A $k$-uniform tight cycle is a $k$-graph with a cyclic order of its vertices such that every $k$ consecutive vertices from an edge. We show that for $k\geq 3$, every red-blue edge-coloured complete $k$-graph on $n$ vertices contains $k$…
As the parameters of a piecewise-smooth system of ODEs are varied, a periodic orbit undergoes a bifurcation when it collides with a surface where the system is discontinuous. Under certain conditions this is a grazing-sliding bifurcation.…
If there exists a cyclic quadrilateral whose sides go through the given four collinear points, then there are infinitely many such quadrilaterals inscribed in the same circle. We give two proofs of this porism; one based on cross-ratios,…
Given S_1, a finite set of points in the plane, we define a sequence of point sets S_i as follows: With S_i already determined, let L_i be the set of all the line segments connecting pairs of points of the union of S_1,...,S_i, and let…
Several classical constructions illustrate the fact that the chromatic number of a graph can be arbitrarily large compared to its clique number. However, until very recently, no such construction was known for intersection graphs of…
In piecewise-smooth differential systems, a hyperbolic limit cycle of a subsystem loses its structural stability if it grazes the switching manifold at a tangent point. Such a cycle is called a grazing loop and in this paper we investigate…
Clustering bifurcations are investigated by considering models of globally coupled map lattices. Typical classes of clustering bifurcations are revealed. The clustering bifurcation thresholds of the coupled system are closely related to the…
By a classical theorem transversal homoclinic points of maps lead to shift dynamics on a maximal invariant set, also referred to as a homoclinic tangle. In this paper we study the fate of homoclinic tangles in parameterized systems from the…
We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require $\Omega(n^\frac{2}{3})$ edges each having $\Omega(n^\frac{1}{3})$ bends in the worst case. The lower bound…
A heterochromatic (or rainbow) graph is an edge-colored graph whose edges have distinct colors, that is, where each color appears at most once. In this paper, I propose a $(g,f)$-chromatic graph as an edge-colored graph where each color $c$…
We study the pattern of activated trajectories in a double well system without detailed balance, in the weak noise limit. The pattern may contain cusps and other singular features, which are similar to the caustics of geometrical optics.…
Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…
Multivariate spatial phenomena are ubiquitous, spanning domains such as climate, pandemics, air quality, and social economy. Cross-correlation between different quantities of interest at different locations is asymmetric in general. This…
Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…
For piecewise-smooth differential systems, in this paper we focus on crossing limit cycles and sliding loops bifurcating from a grazing loop connecting one high multiplicity tangent point. For the low multiplicity cases considered in…
This paper considers synchronous discrete-time dynamical systems on graphs based on the threshold model. It is well known that after a finite number of rounds these systems either reach a fixed point or enter a 2-cycle. The problem of…
We show that any complete $k$-partite graph $G$ on $n$ vertices, with $k \ge 3$, whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distinct colours. We prove this under the necessary assumption…
Systems that are not smooth can undergo bifurcations that are forbidden in smooth systems. We review some of the phenomena that can occur for piecewise-smooth, continuous maps and flows when a fixed point or an equilibrium collides with a…
For an edge-bicolored graph $G$ where each edge is colored either red or blue, a vertex set $S$ is a dual feedback vertex set if $S$ hits all blue cycles and red cycles of $G$. In this paper, we show that a dual feedback vertex set of size…