相关论文: Algebraic k-systems of curves

Let $S_{g}$ denote the genus $g$ closed orientable surface. For $k\in \mathbb{N}$, a $k$-system is a collection of pairwise non-homotopic simple closed curves such that no two intersect more than $k$ times. Juvan-Malni\v{c}-Mohar…

Aougab and Gaster [Math. Proc. Cambridge Philos. Soc. 174 (2023), 569-584] proved that any set of simple closed curves on the torus, where any two are non-homotopic and intersect at most k times, has a maximum size of $k+O(\sqrt{k}\log k)$.…

A system of simple closed curves on a surface of genus $g$ is said to be sparse if their average pairwise intersection number does not exceed one. We show that the maximal size of a sparse curve systems grows roughly like a function of type…

Let $S_g$ denote the closed orientable surface of genus $g$. We construct exponentially many mapping class group orbits of collections of $2g+1$ simple closed curves on $S_g$ which pairwise intersect exactly once, extending a result of the…

We study the structure of collections of algebraic curves in three dimensions that have many curve-curve incidences. In particular, let $k$ be a field and let $\mathcal{L}$ be a collection of $n$ space curves in $k^3$, with…

A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set $K$ of the Desarguesian plane $PG(2,q)$ is obtained. The case where $K$ is a maximal $(k,n)$-arc is considered to greater extent.

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

A triangulation of a surface is k-irreducible if every non-contractible curve has length at least k and any edge contraction breaks this property. Equivalently, every edge belongs to a non-contractible curve of length k and there are no…

In this paper, we continue the study of intersections of closed curves on translation surfaces, initiated in by S. Cheboui, A. Kessi and D. Massart for a family of arithmetic Veech surfaces and the author, E. Lanneau and D. Massart for a…

We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…

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 show that any set of distinct homotopy classes of simple closed curves on the torus that pairwise intersect at most $k$ times has size $k + O(\sqrt{k} \log k)$. Prior to this work, a lemma of Agol, together with the state of the art…

We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…

Przytycki has shown that the size $\mathcal{N}_{k}(S)$ of a maximal collection of simple closed curves that pairwise intersect at most $k$ times on a topological surface $S$ grows at most as a polynomial in $|\chi(S)|$ of degree…

It is known for a long time that a nonsingular real algebraic curve of degree 2k in the projective plane cannot have more than 7/2*k^2-9/4*k+3/2$ even ovals. We show here that this upper bound is asymptotically sharp, that is to say we…

Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…

Given a set $S$ of $n$ points in $\mathbb{R}^d$, a $k$-set is a subset of $k$ points of $S$ that can be strictly separated by a hyperplane from the remaining $n-k$ points. Similarly, one may consider $k$-facets, which are hyperplanes that…

The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In: Towards a…

A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by deleting fewer than $k$ vertices. The block number $\beta(G)$ of $G$ is the maximum integer $k$ for which $G$ contains a…

The gonality of a smooth geometrically connected curve over a field $k$ is the smallest degree of a nonconstant $k$-morphism from the curve to the projective line. In general, the gonality of a curve of genus $g \ge 2$ is at most $2g - 2$.…