Related papers: Geometric Spanning Cycles in Bichromatic Point Set…
We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…
Synchronisation between coupled oscillatory systems is a common phenomenon in many natural as well as technical systems. Varying the strength of coupling often leads to qualitative changes in the complex dynamics of the mutually coupled…
This paper provides both a detailed study of color-dependence of link homologies, as realized in physics as certain spaces of BPS states, and a broad study of the behavior of BPS states in general. We consider how the spectrum of BPS states…
The analysis performed as well as extensive numerical simulations have revealed the possibility of the generation of homoclinic orbits as a result of homoclinic bifurcation in a porous pellet. A method has been proposed for the development…
This article is covered by the article arxiv.1012.0925 We study intersection of two polyhedral spheres without self-intersections in 3-space. We find necessary and sufficient conditions on sequences x = x_1,x_2,...,x_n, y = y_1,y_2,...,y_n…
Based on Nielsen fixed point theory and Gr\"{o}bner-Shirshov basis, we obtain a simple method to compute geometric intersection numbers and self-intersection geometric numbers of loops on surfaces.
An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…
We study combinatorial indicators related to the characteristic phase transitions associated with coloring a graph optimally and finding a maximum independent set. In particular, we investigate the role of the acyclic orientations of the…
The dynamics of two active nonlinear resonators coupled to a linear resonator is studied theoretically. Possible stationary states and its dynamical stability are considered in detail. The spontaneous symmetry breaking is found and it is…
Given an $n$ vertex graph whose edges have colored from one of $r$ colors $C=\{c_1,c_2,\ldots,c_r\}$, we define the Hamilton cycle color profile $hcp(G)$ to be the set of vectors $(m_1,m_2,\ldots,m_r)\in [0,n]^r$ such that there exists a…
Hexagonal circle patterns with constant intersection angles are introduced and studied. It is shown that they are described by discrete integrable systems of Toda type. Conformally symmetric patterns are classified. Circle pattern analogs…
Given two different self-adjoint extensions of the same symmetric operator, we analyse the intersection of their point spectra. Some simple examples are provided.
Heteroclinic cycles and networks are structures in dynamical systems composed of invariant sets and connecting heteroclinic orbits, and can be robust in systems with invariant subspaces. The usual method for analysing the stability of…
In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which there exists a family of interiorly disjoint paths on a grid in one-to-one correspondence with their vertex set such that two vertices are…
We investigate plane curves intersecting in at most two unibranched points to study the algebraic exceptional set appearing in standard conjectures of diophantine and hyperbolic geometry. Our first result compares the local geometry of two…
In this paper we study cycles in random bipartite graph $G(n,n,p)$. We prove that if $p\gg n^{-2/3}$, then $G(n,n,p)$ a.a.s. satisfies the following. Every subgraph $G'\subset G(n,n,p)$ with more than $(1+o(1))n^2p/2$ edges contains a cycle…
In this work we consider a general non-autonomous hybrid system based on the integrate-and-fire model, widely used as simplified version of neuronal models and other types of excitable systems. Our unique assumption is that the system is…
Drawings of non-planar graphs always result in edge crossings. When there are many edges crossing at small angles, it is often difficult to follow these edges, because of the multiple visual paths resulted from the crossings that slow down…
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Each of them is isomorphic to the intersection graph of a set of axis-parallel boxes in $R^3$. These graphs were also proved to have other…