English
Related papers

Related papers: Packing curves on surfaces with few intersections

200 papers

This work revolves around the two following questions: Given a convex body $C\subset\mathbb{R}^d$, a positive integer $k$ and a finite set $S\subset\mathbb{R}^d$ (or a finite Borel measure $\mu$ on $\mathbb{R}^d$), how many homothets of $C$…

Combinatorics · Mathematics 2022-12-06 Oriol Solé Pi

We investigate combinatorial bounds for the total Tjurina numbers of plane curve arrangements. Focusing on arrangements of lines and conics in $\mathbb{P}^2$ that admit only ordinary quasi-homogeneous singularities, we derive new structural…

Algebraic Geometry · Mathematics 2026-02-27 Piotr Pokora

We investigate the local dynamics of a proper superattracting holomorphic germ $f$ in $(\mathbb{C}^2,0)$ possessing a totally invariant line $L$ such that $f^*L = d L$ with $d\ge 2$, and such that $f|_L$ has a superattracting fixed point at…

Dynamical Systems · Mathematics 2025-07-15 Romain Dujardin , Charles Favre , Matteo Ruggiero

Let $n(k_1, k_2)$ be the least integer $n$ such that there exists a graph on $n$ vertices in which every vertex is contained in both a clique of size $k_1$ and an independent set of size $k_2$. Recently, Feige and Pauzner showed that ${n(k,…

Combinatorics · Mathematics 2026-04-24 Veronica Bitonti , Emma Hogan , Tommy Walker Mackay

We provide new upper bounds on N_q(g), the maximum number of rational points on a smooth absolutely irreducible genus-g curve over F_q, for many values of q and g. Among other results, we find that N_4(7) = 21 and N_8(5) = 29, and we show…

Number Theory · Mathematics 2020-07-15 Everett W. Howe , Kristin E. Lauter

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…

Algebraic Geometry · Mathematics 2019-09-13 Erwan Brugallé , Alex Degtyarev , Ilia Itenberg , Frédéric Mangolte

For positive integers $k$, $n$, and $g$ with $k\geq2$, we give a closed-form expression for the $k$-th $\mathbb{Z}_2$-zero-divisor cup length $\mathsf{zcl}_k(SP^n(N_g))$ of the $n$-th symmetric product $SP^n(N_g)$ of the closed…

Algebraic Topology · Mathematics 2026-03-17 Jesús González , Ekansh Jauhari

Extremal problems concerning the number of independent sets or complete subgraphs in a graph have been well studied in recent years. Cutler and Radcliffe proved that among graphs with $n$ vertices and maximum degree at most $r$, where $n =…

Combinatorics · Mathematics 2019-06-11 R. Kirsch , A. J. Radcliffe

For a $k$-graph $\mathcal{F}\subset \binom{[n]}{k}$, the clique number of $\mathcal{F}$ is defined to be the maximum size of a subset $Q$ of $[n]$ with $\binom{Q}{k}\subset \mathcal{F}$. In the present paper, we determine the maximum number…

Combinatorics · Mathematics 2021-01-01 Peter Frankl , Erica L. L. Liu , Jian Wang

Consider a graph $G$ with chromatic number $k$ and a collection of complete bipartite graphs, or bicliques, that cover the edges of $G$. We prove the following two results: \medskip \noindent $\bullet$ If the bicliques partition the edges…

Combinatorics · Mathematics 2009-03-19 Dhruv Mubayi , Sundar Vishwanathan

A topological graph is $k$-quasi-planar if it does not contain $k$ pairwise crossing edges. A 20-year-old conjecture asserts that for every fixed $k$, the maximum number of edges in a $k$-quasi-planar graph on $n$ vertices is $O(n)$. Fox…

Combinatorics · Mathematics 2016-01-28 Andrew Suk , Bartosz Walczak

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g,n) = (3,0)$ or $g + n \geq 5$, then there is an exhaustion of…

Geometric Topology · Mathematics 2019-06-25 Elmas Irmak

We study the function $H_n(C_{2k})$, the maximum number of Hamilton paths such that the union of any pair of them contains $C_{2k}$ as a subgraph. We give upper bounds on this quantity for $k\ge 3$, improving results of Harcos and…

Combinatorics · Mathematics 2023-08-24 John Byrne , Michael Tait

We prove that for a sufficiently ample line bundle $L$ on a surface $S$, the number of $\delta$-nodal curves in a general $\delta$-dimensional linear system is given by a universal polynomial of degree $\delta$ in the four numbers…

Algebraic Geometry · Mathematics 2014-03-25 M. Kool , V. Shende , R. P. Thomas

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Combinatorics · Mathematics 2015-03-20 Ben Green , Terence Tao

We prove that the maximal development of any spherically symmetric spacetime with collisionless matter (obeying the Vlasov equation) or a massless scalar field (obeying the massless wave equation) and possessing a constant mean curvature…

General Relativity and Quantum Cosmology · Physics 2010-11-19 Gregory A. Burnett , Alan D. Rendall

We show that the $n$-point, genus-$g$ correlation functions of topological recursion on any regular spectral curve with simple ramifications grow at most like $(2g - 2 + n)!$ as $g \rightarrow \infty$, which is the expected growth rate.…

Mathematical Physics · Physics 2025-06-16 Gaëtan Borot , Bertrand Eynard , Alessandro Giacchetto

The volume $\mathscr{B}_{\Sigma}^{{\rm comb}}(\mathbb{G})$ of the unit ball -- with respect to the combinatorial length function $\ell_{\mathbb{G}}$ -- of the space of measured foliations on a stable bordered surface $\Sigma$ appears as the…

Geometric Topology · Mathematics 2023-07-07 Gaëtan Borot , Séverin Charbonnier , Vincent Delecroix , Alessandro Giacchetto , Campbell Wheeler

In this paper, we investigate two questions on Kneser graphs $KG_{n,k}$. First, we prove that the union of $s$ intersecting families in ${[n]\choose k}$ has size at most ${n\choose k}-{n-s\choose k}$ for all sufficiently large $n$ that…

Combinatorics · Mathematics 2025-06-05 Eduard Inozemtsev , Andrey Kupavskii

Based on numerical simulations that we have carried out, we provide evidence that for regular polygons with $\sigma= 6j$ sides (with $j=2,3,\dots$), $N(k)=3 k (k+1)+1$ (with $k=1,2,\dots$) congruent disks of appropriate size can be nicely…

Numerical Analysis · Mathematics 2023-05-03 Paolo Amore , Mauricio Carrizalez , Ulises Zarate