Related papers: Self-dual Maps III: projective links
Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…
In 2019, Schneidermann and Teicher showed that the Kirk invariant classifies two-component link maps of two-spheres in the four-sphere up to link homotopy. In this paper, we construct a three-component link homotopy invariant. We construct…
We show that the automorphisms of the flag space associated with a 3-dimensional projective space can be characterized as bijections preserving a certain binary relation on the set of flags in both directions. From this we derive that there…
In analogy with the well-known 2-linkage tractor-trailer problem, we define a 2-linkage problem in the plane with novel non-holonomic ``no-slip'' conditions. Using constructs from sub-Riemannian geometry, we look for geodesics corresponding…
We introduce a natural notion of quaternionic map between almost quaternionic manifolds and we prove the following, for maps of rank at least one: 1) A map between quaternionic manifolds endowed with the integrable almost twistorial…
This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another…
We extend the minimal model theorem to the 3-dimensional schemes which are projective and have semistable reduction over the spectrum of a Dedekind ring.
We study orientifold projections of families of four-dimensional $\mathcal{N}=1$ toric quiver gauge theories. We restrict to quivers that have the unusual property of being associated with multiple periodic planar diagrams which give rise,…
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction function of two vertices denotes the similarity or proximity of the…
In this article we consider networks, which for a given time period can have one link broken. Which new link should we build so the closeness of the resulting network satisfies some optimal criteria? We consider different criteria for…
This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are…
The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…
We investigate an `assumption of projectivity' that is appropriate to the self-dual axiomatic formulation of three-dimensional projective space.
We study the existence of branched coverings between closed $3$-manifolds, with emphasis on universal knots and links. We prove that the only closed $3$-manifolds that admit a universal link are spherical. Furthermore, we distinguish…
Relative self-linking and linking "numbers" for pairs of knots in oriented 3-manifolds are defined in terms of intersection invariants of immersed surfaces in 4-manifolds. The resulting concordance invariants generalize the usual…
In this note we make use of some properties of vector fields on a manifold to give an alternate proof to [3] for the equivalence between connections and parallel transport on vector bundles over manifolds. Out of the proof will emerge a new…
Heteroclinic cycles and networks are structures in dynamical systems composed of invariant sets and connecting heteroclinic orbits, and can be robust in systems with invariant subspaces. The usual method for analysing the stability of…
Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…
We revisit the problem of designing optimal, individually rational matching mechanisms (in a general sense, allowing for cycles in directed graphs), where each player --- who is associated with a subset of vertices --- matches as many of…
We construct configuration spaces for cyclic covers of the projective line that admit extra automorphisms and we describe the locus of curves with given automorphism group. As an application we provide examples of arbitrary high genus that…