相关论文: Algebraic k-systems of curves

A graph $G$ is {$k$-crossing-critical} if $cr(G)\ge k$, but $cr(G\setminus e)<k$ for each edge $e\in E(G)$, where $cr(G)$ is the crossing number of $G$. It is known that for any $k$-crossing-critical graph $G$, $cr(G)\le 2.5k+16$ holds, and…

This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

A curve of genus g is maximal Mumford (MM) if it has g+1 ovals and g tropical cycles. We construct full-dimensional families of MM curves in the Hilbert scheme of canonical curves. This rests on first-order deformations of graph curves…

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

Given a minimal surface equipped with a generically finite map to an Abelian variety, we give an optimal bound on the canonical degree of a rational or an elliptic curve. As a corollary, we obtain the finiteness of rational and elliptic…

A $(\delta\geq k_1,\delta\geq k_2)$-partition of a graph $G$ is a vertex-partition $(V_1,V_2)$ of $G$ satisfying that $\delta(G[V_i])\geq k_i$ for $i=1,2$. We determine, for all positive integers $k_1,k_2$, the complexity of deciding…

Suppose $R$ is a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$ such that $q+q^{-1}$ is invertible. For an oriented surface $\Sigma$, let $\mathcal{S}(\Sigma;R)$ denote the Kauffman bracket skein algebra of…

A graph $G$ is equimatchable if any matching in $G$ is a subset of a maximum-size matching. It is known that any $2$-connected equimatchable graph is either bipartite or factor-critical. We prove that for any vertex $v$ of a $2$-connected…

We describe each multiple curve on the orientable surface of genus-$g$ with $n$ punctures and one boundary component by using this multiple curve's geometric intersection number with the embedded curves in this surface.

We investigate the Jacobian decomposition of some algebraic curves over finite fields with genus $4$, $5$ and $10$. As a corollary, explicit equations for curves that are either maximal or minimal over the finite field with $p^2$ elements…

We find new examples of complex surfaces with countably many non-isomorphic algebraic structures. Here is one such example: take an elliptic curve $E$ in $\mathbb P^2$ and blow up nine general points on $E$. Then the complement $M$ of the…

If K' and K are convex bodies of the plane such that K' is a subset of K then the perimeter of K' is not greater than the perimeter of K. We obtain the following generalization of this fact. Let K be a convex compact body of the plane with…

The genus g of an F_{q^2}-maximal curve satisfies g=g_1:=q(q-1)/2 or g\le g_2:= [(q-1)^2/4]. Previously, such curves with g=g_1 or g=g_2, q odd, have been characterized up to isomorphism. Here it is shown that an F_{q^2}-maximal curve with…

We prove that the number of tangencies between the members of two families, each of which consists of $n$ pairwise disjoint curves, can be as large as $\Omega(n^{4/3})$. We show that from a conjecture about forbidden $0$-$1$ matrices it…

A recolouring sequence, between $k$-colourings $\alpha$ and $\beta$ of a graph $G$, transforms $\alpha$ into $\beta$ by recolouring one vertex at a time, such that after each recolouring step we again have a proper $k$-colouring of $G$. The…

A $\frac{1}{k}$-majority $l$-edge-colouring of a graph $G$ is a colouring of its edges with $l$ colours such that for every colour $i$ and each vertex $v$ of $G$, at most $\frac{1}{k}$'th of the edges incident with $v$ have colour $i$. We…

We show that the largest size of a collection of simple closed curves pairwise intersecting at most once on an orientable surface of Euler characteristic $\chi$ grows quadratically in $|\chi|$. This resolves a longstanding question of…

We construct a complex algebraic surface with geometric genus $p_g=3$, irregularity $q=0$, self-intersection of the canonical divisor $K^2=24$ and canonical map of degree $24$ onto $\mathbb P^2$.

The $k$-deck of a graph is its multiset of induced subgraphs on $k$ vertices. We prove that $n$-vertex graphs with maximum degree $2$ have the same $k$-decks if each cycle has at least $k+1$ vertices, each path component has at least $k-1$…