Related papers: Geometric Spanning Cycles in Bichromatic Point Set…
We analyse three codimension-two bifurcations occurring in nonsmooth systems, when a non-hyperbolic cycle (fold, flip, and Neimark-Sacker cases, both in continuous- and discrete-time) interacts with one of the discontinuity boundaries…
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
Circular coloring is a constraints satisfaction problem where colors are assigned to nodes in a graph in such a way that every pair of connected nodes has two consecutive colors (the first color being consecutive to the last). We study…
We present the first utterly self-supervised network for dense correspondence mapping between non-isometric shapes. The task of alignment in non-Euclidean domains is one of the most fundamental and crucial problems in computer vision. As 3D…
We study some global aspects of the bifurcation of an equivariant family of volume-contracting vector fields on the three-dimensional sphere. When part of the symmetry is broken, the vector fields exhibit Bykov cycles. Close to the…
We show how to test the bipartiteness of an intersection graph of n line segments or simple polygons in the plane, or of balls in R^d, in time O(n log n). More generally we find subquadratic algorithms for connectivity and bipartiteness…
A geodesic cycle is a closed curve that connects finitely many points along geodesics. We study geodesic cycles on the sphere in regard to their role in equal-weight quadrature rules and approximation.
We formulate a new geometrical string on the euclidean lattice. It is possible to find such spin systems with local interaction which reproduce the same surface dynamics.In the three-dimensional case this spin system is a usual Ising…
We study the relative Hilbert scheme of a family of nodal (or smooth) curves, over a base of arbitrary dimension, via its (birational) cycle map, going to the relative symmetric product. We show the cycle map is the blowing up of the…
Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\bf \#P}-complete even if the graph is known to be planar \cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric…
We analyse the intersection of positively and negatively sectional-hyperbolic sets for flows on compact manifolds. First we prove that such an intersection is hyperbolic if the intersecting sets are both transitive (this is false without…
A problem that is simple to state in the context of spherical geometry, and that seems rather interesting, appears to have been unexamined to date in the mathematical literature. The problem can also be recast as a problem in the real…
K\'{a}rolyi, Pach, and T\'{o}th proved that every 2-edge-colored straight-line drawing of the complete graph contains a monochromatic plane spanning tree. It is open if this statement generalizes to other classes of drawings, specifically,…
Given an $r$-edge-colouring of the edges of a graph $G$, we say that it can be partitioned into $p$ monochromatic cycles when there exists a set of $p$ vertex-disjoint monochromatic cycles covering all the vertices of $G$. In the literature…
In this short note, we use flag algebras to prove that the number of colour alternating 6-cycles in a red/blue colouring of a large clique is asymptotically maximized by a uniformly random colouring. This settles the first open case of a…
We study dynamics and bifurcations of two-dimensional reversible maps having non-transversal heteroclinic cycles containing symmetric saddle periodic points. We consider one-parameter families of reversible maps unfolding generally the…
Convection structures in binary fluid mixtures are investigated for positive Soret coupling in the driving regime where solutal and thermal contributions to the buoyancy forces compete. Bifurcation properties of stable and unstable…
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is…
It is well-known that an undirected graph has no odd cycle if and only if it is bipartite. A less obvious, but similar result holds for directed graphs: a strongly connected digraph has no odd cycle if and only if it is bipartite. Can this…
In the 1970s, Erdos asked whether the chromatic number of intersection graphs of line segments in the plane is bounded by a function of their clique number. We show the answer is no. Specifically, for each positive integer $k$, we construct…