Related papers: Liaison Linkages
In this Thesis we develop the geometric formulations for higher-order autonomous and non-autonomous dynamical systems, and second-order field theories. In all cases, the physical information of the system is given in terms of a Lagrangian…
We classify the possible torsion structures of rational elliptic curves over quintic number fields. In addition, let E be an elliptic curve defined over Q and let G = E(Q)_tors be the associated torsion subgroup. We study, for a given G,…
In this paper, we study the connectivity of a one-dimensional soft random geometric graph (RGG). The graph is generated by placing points at random on a bounded line segment and connecting pairs of points with a probability that depends on…
There are several notions of gonality for graphs. The divisorial gonality dgon(G) of a graph G is the smallest degree of a divisor of positive rank in the sense of Baker-Norine. The stable gonality sgon(G) of a graph G is the minimum degree…
Graph based representation is widely used in visual tracking field by finding correct correspondences between target parts in consecutive frames. However, most graph based trackers consider pairwise geometric relations between local parts.…
We introduce the concept of a higher algebroid, generalizing the notions of an algebroid and a higher tangent bundle. Our ideas are based on a description of (Lie) algebroids as vector bundle comorphisms - differential relations of a…
Graph rigidity, the study of vertex realizations in $\mathbb{R}^d$ and the motions that preserve the induced edge lengths, has been the focus of extensive research for decades. Its equivalency to graph connectivity for $d=1$ is well known;…
For a smooth manifold $M$, possibly with boundary and corners, and a Lie group $G$, we consider a suitable description of gauge fields in terms of parallel transport, as groupoid homomorphisms from a certain path groupoid in $M$ to $G$.…
Geometric vertex decomposition and liaison are two frameworks that have been used to produce similar results about similar families of algebraic varieties. In this paper, we establish an explicit connection between these approaches. In…
Let $X_0$ be an irreducible smooth projective curve defined over $\overline{\mathbb Q}$ and $\mathbb E$ a vector bundle on $X_0$. We give a criterion for connections on the base change ${\mathbb E}\otimes_{\overline{\mathbb Q}}{\mathbb C}…
The simplest way to make a dynamical system out of a finite connected graph $G$ is to give it a polarization, that is to say a cyclic ordering of the edges incident to a vertex, for each vertex. The phase space $\mathcal{P}(G)$ then…
Many researchers tried to understand/explain the geometric reasons for paradoxical mobility of a mechanical linkage, i.e. the situation when a linkage allows more motions than expected from counting parameters and constraints. Bond theory…
We consider a variant of metrised graphs where the edge lengths take values in a commutative monoid, as a higher-rank generalisation of the notion of a tropical curve. Divisorial gonality, which Baker and Norine defined on combinatorial…
We study the problem of $d$-gonality of the modular curve $X_0(N)$. As a result, we can give an upperbound of the level $N$ by means of $d$. This generalizes Ogg's result on hyperelliptic modular curves ($d = 2$). As a corollary of this…
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
(a) We propose a ``static'' construction procedure for random networks with given correlations of the degrees of the nearest-neighbor vertices. This is an equilibrium graph, maximally random under the constraint that its degree-degree…
The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…
In the theory of configuration spaces, "splitting" usually refers to the phenomenon that the configuration spaces on a manifold and those on its punctured version are closely related cohomologically. We prove a splitting theorem that is…
For a translation surface, we define the systole to be the length of the shortest saddle connection. We give a characterization of the maxima of the systole function on a stratum, and give a family of examples providing local but nonglobal…
We define and make initial study of Lie groupoids equipped with a compatible homogeneity (or graded bundle) structure, such objects we will refer to as weighted Lie groupoids. One can think of weighted Lie groupoids as graded manifolds in…