English
Related papers

Related papers: Curves on the torus intersecting at most k times

200 papers

Let X be a set definable in a sharply o-minimal structure. We consider the problem of counting the number of points where X intersects algebraic varieties V over Q of dimension k < codim X, as a function of T := deg(V) + h(V), where h(V) is…

Number Theory · Mathematics 2026-04-17 Gal Binyamini , Noriko Hirata-Kohno , Makoto Kawashima , Yuval Salant

We prove that, as $m$ grows, any family of $m$ homotopically distinct closed curves on a surface induces a number of crossings that grows at least like $(m \log m)^2$. We use this to answer two questions of Pach, Tardos and Toth related to…

Geometric Topology · Mathematics 2025-04-02 Alfredo Hubard , Hugo Parlier

A family $\mathcal F$ has covering number $\tau$ if the size of the smallest set intersecting all sets from $\mathcal F$ is equal to $\tau$. Let $M(n,k,\tau)$ stand for the size of the largest intersecting family $\mathcal F$ of $k$-element…

Combinatorics · Mathematics 2023-05-09 Peter Frankl , Andrey Kupavskii

A digraph $G$ is \emph{$k$-geodetic} if for any pair of (not necessarily distinct) vertices $u,v \in V(G)$ there is at most one walk of length $\leq k$ from $u$ to $v$ in $G$. In this paper we determine the largest possible size of a…

Combinatorics · Mathematics 2022-03-29 James Tuite , Grahame Erskine , Nika Salia

We study the connection between the degree sequence of a $k$-uniform hypergraph and the size of its largest matching. Let $\mathcal{F}$ be a $k$-uniform hypergraph on $n$ vertices and let $d_1 \ge d_2 \ge \dots \ge d_n$ be the vertex…

Combinatorics · Mathematics 2026-05-28 Haixiang Zhang , Mengyu Cao , Mei Lu

We study the relationship between the lengths of closed geodesics on hyperbolic surfaces and their topological complexity, measured by the self-intersection number. In particular, we provide explicit upper bounds for the length $s_k(X)$ of…

Geometric Topology · Mathematics 2025-12-01 Changjie Chen

We discuss a special case of a family of means defined using intersections of osculating hyperplanes to curves in R^n. Let C be the curve in R^n with vector equation x_{k}(t)=t(ln t)^{k-1},k=1,...,n. Let O_{k} be the osculating hyperplane…

Classical Analysis and ODEs · Mathematics 2014-07-30 Alan Horwitz

We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…

alg-geom · Mathematics 2008-02-03 G. Ellingsrud , S. A. Strømme

We investigate the number of nodal intersections of random Gaussian Laplace eigenfunctions on the standard two-dimensional flat torus ("arithmetic random waves") with a fixed real-analytic reference curve with nonvanishing curvature. The…

Mathematical Physics · Physics 2014-07-01 Zeev Rudnick , Igor Wigman

This paper focuses on intersection of closed curves on translation surfaces. Namely, we investigate the question of determining the intersection of two closed curves of a given length on such surfaces. This question has been investigated in…

Geometric Topology · Mathematics 2024-09-04 Julien Boulanger , Irene Pasquinelli

Let $Y_{3,2}$ be the $3$-uniform hypergraph with two edges intersecting in two vertices. Our main result is that any $n$-vertex 3-uniform hypergraph with at least $\binom{n}{3} - \binom{n-m+1}{3} + o(n^3)$ edges contains a collection of $m$…

Combinatorics · Mathematics 2021-10-12 Luyining Gan , Jie Han , Lin Sun , Guanghui Wang

Given an undirected graph $G$ with $m$ edges, $n$ vertices, and non-negative edge weights, and given an integer $k\geq 2$, we show that a $(2k-1)$-approximate distance oracle for $G$ of size $O(kn^{1 + 1/k})$ and with $O(\log k)$ query time…

Discrete Mathematics · Computer Science 2012-10-03 Christian Wulff-Nilsen

We prove the first nontrivial worst-case lower bounds for two closely related problems. First, $\Omega(n^{3/2})$ degree-1 reductions, series-parallel reductions, and $\Delta$Y transformations are required in the worst case to reduce an…

Computational Geometry · Computer Science 2015-10-05 Hsien-Chih Chang , Jeff Erickson

Let $\Theta_{k_1,\cdots,k_\ell}$ denote the generalized theta graph, which consists of $\ell$ internally disjoint paths with lengths $k_1,\cdots, k_{\ell}$, connecting two fixed vertices. We estimate the corresponding extremal number…

Combinatorics · Mathematics 2023-02-21 Xiao-Chuan Liu , Xu Yang

The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph $G$ has as vertex set the set of all possible $k$-colourings of $G$ and two colourings are adjacent if they differ on the colour of exactly one vertex. Cereceda conjectured…

Discrete Mathematics · Computer Science 2018-10-02 Eduard Eiben , Carl Feghali

We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…

Algebraic Geometry · Mathematics 2024-10-01 Samuel Lidz , Zachary Lihn , Adam Melrod

This paper proves an elementary topological fact about closed curves on surfaces, namely that by carefully smoothing an intersection point, one can reduce self-intersection by exactly $1$. This immediately implies a positive answer to a…

Geometric Topology · Mathematics 2023-09-13 Hugo Parlier

We show that if $X$ is a toric scheme over a regular commutative ring $k$ then the direct limit of the $K$-groups of $X$ taken over any infinite sequence of nontrivial dilations is homotopy invariant. This theorem was previously known for…

K-Theory and Homology · Mathematics 2017-03-24 Guillermo Cortiñas , Christian Haesemeyer , Mark E. Walker , Charles Weibel

Consider the process where the $n$ vertices of a square $2$-dimensional torus appear consecutively in a random order. We show that typically the size of the $3$-core of the corresponding induced unit-distance graph transitions from $0$ to…

Combinatorics · Mathematics 2026-01-23 Ivailo Hartarsky , Lyuben Lichev

We show a generalization of the crossing lemma for multi-graphs drawn on orientable surfaces in which pairs of edges are assumed to be drawn by non-homotopic simple arcs which pairwise cross at most $k$ times.

Combinatorics · Mathematics 2025-06-24 Alfredo Hubard , Hugo Parlier
‹ Prev 1 3 4 5 6 7 10 Next ›