Related papers: Nodal surfaces in $\mathbb{P}^3$ and coding theory

We study the maximal Salem degree of automorphisms of K3 surfaces via elliptic fibrations. By generalizing \cite{EOY14}, we establish a characterization of such maximum in terms of elliptic fibrations with infinite automorphism groups. As…

We prove the birational superrigidity and the nonrationality of a cyclic triple cover of $\mathbb{P}^{2n}$ branched over a nodal hypersurface of degree $3n$ for $n\ge 2$. In particular, the obtained result solves the problem of the…

Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let $g$ be an embedding…

We suggest an enhancement to structural coding through the use of (a) causally bound codes, (b) basic constructs of graph theory and (c) statistics. As is the norm with structural coding, the codes are collected into categories. The…

We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…

We study linear systems of surfaces in $\mathbb{P}^3$ singular along general lines. Our purpose is to identify and classify special systems of such surfaces, i.e., those nonempty systems where the conditions imposed by the multiple lines…

The page number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the…

Let k be a field of characteristic other than 2,3. We prove that there are no geometrically smooth quartic surfaces in IP^3 with more than 64 lines. As a key step, we derive the sharp bound that any line meets at most 20 other lines on a…

Let $X$ be an algebraic variety, defined over the rationals. This paper gives upper bounds for the number of rational points on $X$, with height at most $B$, for the case in which $X$ is a curve or a surface. In the latter case one excludes…

Three classes of binary linear codes with at most four nonzero weights were constructed in this paper, in which two of them are projective three-weight codes. As applications, $s$-sum sets for any odd $ s > 1$ were constructed.

In social networks the {\sc Strong Triadic Closure} is an assignment of the edges with strong or weak labels such that any two vertices that have a common neighbor with a strong edge are adjacent. The problem of maximizing the number of…

We study hyperplane sections of smooth polarized $K3$-surfaces that split into unions of lines. We describe the dual adjacency graphs of such sections and find sharp upper bounds on their number. In most cases (starting from degree $6$), we…

We construct a hypersurface of degree 5 in projective space $\PP^8(\CC)$ which contains exactly 23436 ordinary nodes and no further singularities. This limits the maximum number $\mu_{8}(5)$ of ordinary nodes a hyperquintic in $\PP^8(\CC)$…

With its boundary tracing out a link or knot in 3D, the Seifert surface is a 2D surface of core importance to topological classification. We propose the first-ever experimentally realistic setup where Seifert surfaces emerge as the boundary…

We give some explicit upper bounds on the effective birationality of the canonical or anti-canonical system for a singular surface. In particular, we show that for any surface $X$ with $\epsilon$-lc singularity and the canonical divisor…

In general, not much is known about the arithmetic of K3 surfaces. Once the geometric Picard number, which is the rank of the Neron-Severi group over an algebraic closure of the base field, is high enough, more structure is known and more…

In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

Given a birational parameterization $\phi: \mathbb{P}_k^2 - rightarrow \mathbb{P}_k^3$ of an algebraic surface $\mathscr S\subset \mathbb{P}_k^3$, we bound the number of 1-dimensional fibers of the canonical projection of the graph of…

If a hyperbolic 3-manifold admits an exceptional Dehn filling, then the length of the slope of that Dehn filling is known to be at most six. However, the bound of six appears to be sharp only in the toroidal case. In this paper, we…