Related papers: The coarse geometry of hexagon decomposition graph…
To investigate the topological structure of Morse flows on the 2-disk we use the planar graphs as destinguished graph of the flow. We assume, that the flow is transversal to the boundary of the 2-disk. We give a list of all planar graph…
In this paper, we consider the intensity surface of a 2D image, we study the evolution of the symmetry sets (and medial axes) of 1-parameter families of iso-intensity curves. This extends the investigation done on 1-parameter families of…
The general theory of parabolic geometries is applied to the study of the normal Cartan connections for all hyperbolic and elliptic 6-dimensional CR-manifolds of codimension two. The geometric meaning of the individual components of the…
Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…
We show how to speed up the computation of isomorphisms of hyperelliptic curves by using covariants. We also obtain new theoretical and practical results concerning models of these curves over their field of moduli.
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…
We investigate the vertex curve, that is the set of points in the hyperbolic region of a smooth surface in real 3-space at which there is a circle in the tangent plane having at least 5-point contact with the surface. The vertex curve is…
Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
We give elementary applications of quasi-homomorphisms to growth problems in groups. A particular case concerns the number of torsion elements required to factorise a given element in the mapping class group of a surface.
We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…
Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$ without CM. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each elliptic curve in $\mathcal{E}$ and an edge for…
We count pseudoholomorphic curves in the higher-dimensional Heegaard Floer homology of disjoint cotangent fibers of a two dimensional disk. We show that the resulting algebra is isomorphic to the Hecke algebra associated to the symmetric…
In this paper the structure of the Cayley graphs and G-graphs of some gyro-groups are studied and some properties of them will be proved. Moreover we review some special gyro-groups including: gyro-commutative gyrogroups, dihedral…
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem (MAX H-COL) are edge-weighted graphs G and the objective is to find…
It is an easy observation that if a graph~$G$ admits a path-decomposition whose parts have small radius, then $G$ contains no large subdivision of $K_{1,3}$ or $K^3$ as a (quasi-)geodesic subgraph. We show that these are in fact the only…
Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…
Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each elliptic curve in the $\mathbb{Q}$-isogeny class…
The basic idea of quantum complexity geometry is to endow the space of unitary matrices with a metric, engineered to make complex operators far from the origin, and simple operators near. By restricting our attention to a finite subgroup of…