Related papers: Basic nets in the projective plane
We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient…
The Brownian net, which has recently been introduced by Sun and Swart [SS08], and independently by Newman, Ravishankar and Schertzer [NRS08], generalizes the Brownian web by allowing branching. In this paper, we study the structure of the…
By using the viewpoint of modern computational algebraic geometry, we explore properties of the optimization landscapes of the deep linear neural network models. After clarifying on the various definitions of "flat" minima, we show that the…
Grid diagrams encode useful geometric information about knots in S^3. In particular, they can be used to combinatorially define the knot Floer homology of a knot K in S^3, and they have a straightforward connection to Legendrian…
We propose an unexpected twist to description of the geometry and topology of configurations of n straight lines considered as a whole 3D entity (because the lines are inseparably linked pairwise while having linking numbers 1/2 or -1/2)…
We give an explicit construction of complex maps whose nodal line have the form of lemniscate knots. We review the properties of lemniscate knots, defined as closures of braids where all strands follow the same transverse (1, $\ell$)…
We give a short uniform proof of centrality of $\mathrm K_2(\Phi,\,R)$ for all simply-laced root systems $\Phi$ of rank $\geq3$.
Recently, so-called treebased phylogenetic networks have gained considerable interest in the literature, where a treebased network is a network that can be constructed from a phylogenetic tree, called the base tree, by adding additional…
Rota's basis conjecture states that in any square array of vectors whose rows are bases of a fixed vector space the vectors can be rearranged within their rows in such a way that afterwards not only the rows are bases, but also the columns.…
There is a map, defined and studied by Jones, from Thompson's group $F$ to knots. Jones proved that every knot is in the image of this map -- that is, that every knot can be seen as the "knot closure" of a Thompson group element. We…
There has been wide interest in understanding which properties of base graphs of matroids extend to base-cobase graphs of matroids. A significant result of Naddef and Pulleyblank (1984) shows that the $1$-skeleton of any $(0,1)$-polytope is…
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…
We present a conceptually clear and algorithmically useful framework for parameterizing the costs of tensor network contraction. Our framework is completely general, applying to tensor networks with arbitrary bond dimensions, open legs, and…
We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every…
We establish several useful commutative diagrams consisting of low term exact sequences attached to {\Grot} spectral sequences, which extends and integrates the previous ones appeared in literature such as Alexei~N. Skorobogatov [Beyond the…
In a projective plane PG(2,K) defined over an algebraically closed field K of characteristic 0, we give a complete classification of 3-nets realizing a finite group. An infinite family, due to Yuzvinsky, arises from plane cubics and…
Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…
We prove the following generalization of the Cartwright-Littlewood fixed point theorem. Suppose $ h\colon~{\mathbb R}^{2}\to{\mathbb R}^{2} $ is an orientation preserving planar homeomorphism, and $ X $ is an acyclic continuum. Let $ C $ be…
Families of alternating knots (links) and tangles are studied using as building block the conway defined as the twisting of two strands. The regular representation of knots assumes the projection has the minimal number of overpassings, and…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…