Related papers: Liaison Linkages
In a previous work of the authors, a result to algorithmically compute the topology types of the level curves of an algebraic surface, is given. From this result, here we derive applications based on level curves to determine some…
Let $X$ be either a general hypersurface of degree $n+1$ in $\mathbb P^n$ or a general $(2,n)$ complete intersection in $\mathbb P^{n+1}, n\geq 4$. We construct balanced rational curves on $X$ of all high enough degrees. If $n=3$ or $g=1$,…
Methods from algebra and algebraic geometry have been used in various ways to study linkages in kinematics. These methods have failed so far for the study of linkages with helical joints (joints with screw motion), because of the presence…
This study introduces a new type of general helix called associated helix which is associated to a special surface curve. The basic idea is to determinate the parametric form of an associated helix by means of Darboux frame and surface…
We provide a visual and intuitive introduction to effectively calculating in 2-groups along with explicit examples coming from non-abelian 1- and 2-form gauge theory. In particular, we utilize string diagrams, tools similar to tensor…
In this paper we show that states, transitions and behavior of concurrent systems can often be modeled as sheaves over a suitable topological space. In this context, geometric logic can be used to describe which local properties (i.e.…
We consider saddle connections on a translation surface in a hyperelliptic connected component of a stratum that do not intersect the interior of a distinguished saddle connection. For this restricted set of saddle connections, we show that…
We present a complete theory of higher-order autonomous contact mechanics, which allows us to describe higher-order dynamical systems with dissipation. The essential tools for the theory are the extended higher-order tangent bundles, ${\rm…
We review the construction of Lagrangians for higher spin fields of mixed symmetry in the framework of graded geometry. The main advantage of the graded formalism in this context is that it provides universal expressions, in the sense that…
A classification of spanning surfaces for alternating links is provided up to genus, orientability, and a new invariant that we call aggregate slope. That is, given an alternating link, we determine all possible combinations of genus,…
We introduce homotopy lattice gauge fields (HLGFs), a version of gauge fields over a discretized base, based on a notion of higher parallel transport that enriches the usual parallel transport along paths on a lattice to also consider…
A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively upon its vertices. A classic theorem of Mader asserts that every connected vertex-transitive graph is maximally edge-connected. We generalise…
The genus of a maximal curve over a finite field with r^2 elements is either g_0=r(r-1)/2 or less than or equal to g_1=(r-1)^2/4. Maximal curves with genus g_0 or g_1 have been characterized up to isomorphism. A natural genus to be studied…
We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number…
This paper focuses on studying the configuration spaces of graphs realised in $\mathbb C^2$, such that the configuration space is, after normalisation, one dimensional. If this is the case, then the configuration space is, generically, a…
In this paper a tight lower bound for algebraic connectivity of graphs (second smallest eigenvalue of the Laplacian matrix of the graph) based on connection-graph-stability method is introduced. The connection-graph-stability score for each…
In this paper, we study $\mathbb{A}^1$-connected varieties from log geometry point of view, and prove a criterion for $\mathbb{A}^1$-connectedness. As applications, we provide many interesting examples of $\mathbb{A}^1$-connected varieties…
We introduce an optimal transport based approach for comparing undirected graphs with non-negative edge weights and general vertex labels, and we study connections between the resulting linear program and the graph isomorphism problem. Our…
We solve several problems that involve imposing metrics on surfaces. The problem of a strip with a linear metric gradient is formulated in terms of a Lagrangean similar to those used for spin systems. We are able to show that the low energy…
Let $k$ be a perfect field, and $X$ an irreducible smooth projective curve over $k$. We give a criterion for a vector bundle over $X$ to admit a logarithmic connection singular over a finite subset of $X$ with given residues, where residues…