Related papers: Connected components of meanders: I. Bi-rainbow me…
The description of the intersections of components of a Springer fiber is a very complex problem. Up to now only two cases have been described completely. The complete picture for the hook case has been obtained by N. Spaltenstein and J.A.…
In this paper, we consider rainbow connection number of maximal outerplanar graphs(MOPs) on algorithmic aspect. For the (MOP) $G$, we give sufficient conditions to guarantee that $rc(G) = diam(G).$ Moreover, we produce the graph with given…
Resonance tongues are mode-locking regions of parameter space in which stable periodic solutions occur; they commonly occur, for example, near Neimark-Sacker bifurcations. For piecewise-smooth, continuous maps these tongues typically have a…
The alternating knots, links and twists projected on the $S_2$ sphere were identified with the phase space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossings, the edges correspond…
A banded matrix is a real square matrix where nonzero entries appear around the main diagonal. In this article, we consider linear complementarity properties of (variants) of banded matrices. Focusing on triangular matrices and the newly…
A method to construct transition curves using a family of the quartic Bezier spiral is described. The transition curves discussed are S-shape and C-shape of contact, between two separated circles. A spiral is a curve of monotone increasing…
Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…
A representation of finite-dimensional probabilistic models in terms of formally real Jordan algebras is obtained, in a strikingly easy way, from simple assumptions. This provides a framework in which real, complex and quaternionic quantum…
The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is…
We study families of ropes of any codimension that are supported on lines. In particular, this includes all non-reduced curves of degree two. We construct suitable smooth parameter spaces and conclude that all ropes of fixed degree and…
In this paper we study a class of Riemannian metrics on the space of unparametrized curves and develop a method to compute geodesics with given boundary conditions. It extends previous works on this topic in several important ways. The…
Cross-jet transport of passive scalars in a kinematic model of the meandering laminar two-dimensional incompressible flow which is known to produce chaotic mixing is studied. We develop a method for detecting barriers to cross-jet transport…
In this paper we show that the Hilbert scheme $H(3,g)$ of locally Cohen-Macaulay curves in $\Pthree$ of degree three and genus $g$ is connected. In contrast to $H(2,g)$, which is irreducible, $H(3,g)$ generally has many irreducible…
We associate root polytopes to directed graphs and study them by using ribbon structures. Most attention is paid to what we call the semi-balanced case, i.e., when each cycle has the same number of edges pointing in the two directions.…
We develop and analyze a new algorithm to find the connected components of a compact set $I$ from a Lie group $G$ endowed with a left-invariant Riemannian distance. For a given $\delta>0$, the algorithm finds the largest cover of $I$ such…
Answering connectivity queries in semi-algebraic sets is a long-standing and challenging computational issue with applications in robotics, in particular for the analysis of kinematic singularities. One task there is to compute the number…
A meander of order n is a simple closed curve in the plane which intersects a horizontal line transversely at 2n points. (Meanders which differ by an isotopy of the line and plane are considered equivalent.) Let Gamma_n be the Cayley graph…
We classify elliptic curves over the rationals whose N\'eron model over the integers is semi-abelian, with good reduction at p=2, and whose Mordell--Weil group contains an element of order two that stays non-trivial at p=2. Furthermore, we…
A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. A nontrivial connected graph $G$ is rainbow connected if there is a rainbow path connecting any two…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…