Related papers: Constructing large k-systems on Surfaces

We investigate $k$-nets with $k\geq 4$ embedded in the projective plane $PG(2,\mathbb{K})$ defined over a field $\mathbb{K}$; they are line configurations in $PG(2,\mathbb{K})$ consisting of $k$ pairwise disjoint line-sets, called…

Let $k$, $t$ and $m$ be positive integers. A $k$-multiset of $[m]$ is a collection of $k$ integers from the set $\{1,...,m\}$ in which the integers can appear more than once. We use graph homomorphisms and existing theorems for intersecting…

The note shows how $G^k$ (geometrically continuous surface) constructions yield $C^k$ iso-geometric elements also at irregular quad mesh points where three or more than four elements come together.

Mutual visibility in graphs requires pairs of vertices to be connected by shortest paths that avoid all other vertices of a prescribed set, a condition that is often overly restrictive. In this paper, we introduce a new variant, called…

We consider flat families of reduced curves on a smooth surface S such that each member C has the same number of singularities of fixed singularity types and the corresponding (locally closed) subscheme H of the Hilbert scheme of S. We are…

We are interested in the algebraic intersection of closed curves of a given length on translation surfaces. Namely, we study the quantity KVol which measures how many times can two closed curves of a given length intersect. In this paper,…

We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…

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$,…

We classify compact Riemann surfaces of genus $g$, where $g-1$ is a prime $p$, which have a group of automorphisms of order $\rho(g-1)$ for some integer $\rho\ge 1$, and determine isogeny decompositions of the corresponding Jacobian…

This paper studies the obstructions to deforming a map from a complex variety to another variety which is an immersion of codimension one. We extend the classical notion of semiregularity of subvarieties to maps between varieties, and show…

In this paper we give for all $n \geq 2$, d>0, $g \geq 0$ necessary and sufficient conditions for the existence of a pair (X,C), where X is a K3 surface of degree 2n in $\matbf{P}^{n+1}$ and C is a smooth (reduced and irreducible) curve of…

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…

Suppose an orientation preserving action of a finite group $G$ on the closed surface $\Sigma_g$ of genus $g>1$ extends over the 3-torus $T^3$ for some embedding $\Sigma_g\subset T^3$. Then $|G|\le 12(g-1)$, and this upper bound $12(g-1)$…

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

A $k$-graph system $\textbf{H}=\{H_i\}_{i\in[m]}$ is a family of not necessarily distinct $k$-graphs on the same $n$-vertex set $V$ and a $k$-graph $H$ on $V$ is said to be $\textbf{H}$-transversal provided that there exists an injection…

The famous K\H{o}nig-Egerv\'ary theorem is equivalent to the statement that the matching number equals the vertex cover number for every induced subgraph of some graph if and only if that graph is bipartite. Inspired by this result, we…

The Severi variety V_{n,d} of a smooth projective surface S is defined as the subvariety of the linear system |O_S(n)|, which parametrizes curves with d nodes. We show that, for a general surface S of degree k in P^3 and for all n>k-1,…

The aim of these notes is to explain the remarkable formula found by Yau and Zaslow to express the number of rational curves on a K3 surface. Projective K3 surfaces fall into countably many families F(g) (g>0); a surface in F(g) admits a…

A $k$-connectivity oracle for a graph $G=(V,E)$ is a data structure that given $s,t \in V$ determines whether there are at least $k+1$ internally disjoint $st$-paths in $G$. For undirected graphs, Pettie, Saranurak & Yin [STOC 2022, pp.…