Related papers: Liaison Linkages
Connecting curves have been shown to organize the rotational structure of strange attractors in three-dimensional dynamical systems. We extend the description of connecting curves and their properties to higher dimensions within the special…
We bound the genus of a projective curve lying on a complete intersection surface in terms of its degree and the degrees of the defining equations of the surface on which it lies.
Just as gauge theory describes the parallel transport of point particles using connections on bundles, higher gauge theory describes the parallel transport of 1-dimensional objects (e.g. strings) using 2-connections on 2-bundles. A 2-bundle…
A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the…
We bound the number of fixed points of an automorphism of a real curve in terms of the genus and the number of connected components of the real part of the curve. Using this bound, we derive some consequences concerning the maximum order of…
We prove that the separated curve complex of a closed orientable surface of genus g is (g-3)-connected. We also obtain a connectivity property for a separated curve complex of the open surface that is obtained by removing a finite set from…
Given a graph $G$, a configuration space of $G$ can be thought of as the set of all possible configurations of "robots" which can move throughout $G$, subject to some constraints. We introduce a type of configuration space which we call…
A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is…
We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…
Optimizing gait stability for legged robots is a difficult problem. Even on level surfaces, effectively traversing across different textures (e.g., carpet) rests on dynamically tuning parameters in multidimensional space. Inspired by…
The configuration space of a mechanical linkage, consisting of rigid bodies moving in space constrained by joints, is defined by algebraic conditions. If these equations do not define a complete intersection, then the dimension of the…
Shape matching has been a long-studied problem for the computer graphics and vision community. The objective is to predict a dense correspondence between meshes that have a certain degree of deformation. Existing methods either consider the…
We constructs a new network by superposition of hexahedron , which are scale-free, highly sparse,disassortative ,and maximal planar graphs. The network degree distribution, agglomeration coefficient and degree of correlation are computed…
We give a sharp bound on the number of automorphisms of a stable curve of a given genus and describe all curves attaining this bound.
Computational studies of basic models of strongly-correlated electron systems can provide guidance in the search for new materials as well as insight into the physical mechanisms responsible for their properties. Here, we illustrate this by…
In this PhD thesis, we give a new geometric approach to higher Teichm\"uller theory. In particular we construct a geometric structure on surfaces, generalizing the complex structure, and we explore its link to Hitchin components. The…
The author determines the structure of automorphism groups of smooth plane curves of degree at least four. Furthermore, he gives some upper bounds for the order of automorphism groups of smooth plane curves and classifies the cases with…
We investigate string graphs through the lens of graph product structure theory, which describes complicated graphs as subgraphs of strong products of simpler building blocks. A graph $G$ is called a string graph if its vertices can be…
In the framework of the Hough transform technique to detect curves in images, we provide a bound for the number of Hough transforms to be considered for a successful optimization of the accumulator function in the recognition algorithm.…
We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…