Related papers: Two Colored Diagrams for Central Configurations of…
Planar piecewise linear systems with two linearity zones separated by a straight line and with a periodic orbit at infinity are considered. By using some changes of variables and parameters, a reduced canonical form with five parameters is…
A vertex coloring of a given simple graph $G=(V,E)$ with $k$ colors ($k$-coloring) is a map from its vertex set to the set of integers $\{1,2,3,\dots, k\}$. A coloring is called perfect if the multiset of colors appearing on the neighbours…
We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the…
We discuss approximations of the vertex coupling on a star-shaped quantum graph of $n$ edges in the singular case when the wave functions are not continuous at the vertex and no edge-permutation symmetry is present. It is shown that the…
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…
We consider a continuum model for the dynamics of systems of self propelling particles with kinematic constraints on the velocities. The model aims to be analogous to a discrete algorithm used in works by T. Vicsek et al. In this paper we…
Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for…
Given a graph $G$ and a positive integer $k$, the 2-Load coloring problem is to check whether there is a $2$-coloring $f:V(G) \rightarrow \{r,b\}$ of $G$ such that for every $i \in \{r,b\}$, there are at least $k$ edges with both end…
In the present work, we consider the problem of a system of few vortices $N \leq 5$ as it emerges from its experimental realization in the field of atomic Bose-Einstein condensates. Starting from the corresponding equations of motion, we…
We develop a structural approach to simultaneous embeddability in temporal sequences of graphs, inspired by graph minor theory. Our main result is a classification theorem for 2-connected temporal sequences: we identify five obstruction…
An elementary method is described for finding the coordination sequences for a tiling, based on coloring the underlying graph. We illustrate the method by first applying it to the two kinds of vertices (tetravalent and trivalent) in the…
A pseudoline arrangement graph is a planar graph induced by an embedding of a (simple) pseudoline arrangement. We study the corresponding graph realization problem and properties of pseudoline arrangement graphs. In the first part, we give…
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.
In this training course report, I briefly present the one- and two-matrix models as tools for the study of conformal field theories with boundaries. In a first part, after a short historical presentation of random matrices, I present the…
Pointwise accurate numerical methods are constructed and analysed for three classes of singularly perturbed first order transport problems. The methods involve piecewise-uniform Shishkin meshes and the numerical approximations are shown to…
List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list colouring of permutation graphs with a bounded…
We prove that the two-colouring number of any planar graph is at most 8. This resolves a question of Kierstead et al. [SIAM J. Discrete Math.~23 (2009), 1548--1560]. The result is optimal.
Nonlinear evolution of a continuous spectrum of unstable waves near the first bifurcation point in circular Couette flow has been investigated. The disturbance is represented by a Fourier integral over all possible axial wavenumbers, and an…
In this paper we extend previous results on convergent perturbative solutions of the Schroedinger equation of a class of periodically time-dependent two-level systems. The situation treated here is particularly suited for the investigation…
We describe the various types of singularities that can arise for second order rational mappings and we discuss the historical and present-day, practical, role the singularity confinement property plays as an integrability detector. In…