Related papers: Seifert surfaces in open books, and a new coding a…

We attach two binary codes to a projective nodal surface (the strict code K and, for even degree d, the extended code K' ) to investigate the `Nodal Severi varieties F(d, n) of nodal surfaces in P^3 of degree d and with n nodes, and their…

We show that a dynamically convex Reeb flow on the standard tight lens space $(L(p, 1),\xi_{\mathrm{std}})$, $p>1,$ admits a $p$-unknotted closed Reeb orbit $P$ which is the binding of a rational open book decomposition with disk-like…

In this paper, we study the structure of braid graphs in simply-laced Coxeter systems. We prove that every reduced expression has a unique factorization as a product of so-called links, which in turn induces a decomposition of the braid…

Positional encodings are a common component of neural scene reconstruction methods, and provide a way to bias the learning of neural fields towards coarser or finer representations. Current neural surface reconstruction methods use a…

We will show how to obtain a linear code from a configuration of affine lines in general position and a suitable set of rational points. We will also explain a new decoding algorithm based on the configuration, which seems to be quite…

This paper aims to provide an unsupervised modelling approach that allows for a more flexible representation of text embeddings. It jointly encodes the words and the paragraphs as individual matrices of arbitrary column dimension with unit…

We prove that if $L$ is a non-trivial alternating link embedded (without crossings) in a closed surface $F\subset S^3$, then $F$ has a compressing disk whose boundary intersects $L$ in no more than two points. Moreover, whenever the surface…

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

Let $T$ denote a binding component of an open book $(\Sigma, \phi)$ compatible with a closed contact 3-manifold $(M, \xi)$. We describe an explicit open book $(\Sigma', \phi')$ compatible with $(M, \zeta)$, where $\zeta$ is the contact…

We define the basket number, the flat plumbing number and the flat plumbing basket number of a link. Then we provide some upperbounds for these plumbing numbers by using Seifert's algorithm. We study the relation between these plumbing…

In this paper, we construct several new quantum Floquet codes on compact, orientable, as well as non-orientable surfaces. In order to obtain such codes, we identify these surfaces with hyperbolic polygons and examine hyperbolic semi-regular…

For a branched cover between two closed orientable surfaces, the Riemann-Hurwitz formula relates the Euler characteristics of the surfaces, the total degree of the cover, and the total length of the partitions of the degree given by the…

In this study, we define some new types of ruled surfaces called slant ruled surfaces. We give some characterizations for a regular ruled surface to be a slant ruled surface in Euclidean 3- space. We show that if the slant ruled surface is…

We answer a question of Livingston from 1982 by producing Seifert surfaces of the same genus for a knot in $S^3$ that do not become isotopic when their interiors are pushed into $B^4$. In particular, we identify examples where the surfaces…

This paper presents a method to obtain geometric registrations between high-genus ($g\geq 1$) surfaces. Surface registration between simple surfaces, such as simply-connected open surfaces, has been well studied. However, very few works…

We introduce a new canonical form of lattices called the systematic normal form (SNF). We show that for every lattice there is an efficiently computable "nearby" SNF lattice, such that for any lattice one can solve lattice problems on its…

We use an extension of Gordon-Litherland pairing to thickened surfaces to give a topological characterization of alternating links in thickened surfaces. If $\Sigma$ is a closed oriented surface and $F$ is a compact unoriented surface in…

Inspired by some new advances on normal factor graphs (NFGs), we introduce NFGs as a simple and intuitive diagrammatic approach towards encoding some concepts from linear algebra. We illustrate with examples the workings of such an approach…

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a…