English
Related papers

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

200 papers

Two families $\mathcal A$ and $\mathcal B$ of $k$-subsets of an $n$-set are called cross-intersecting if $A\cap B\ne\emptyset$ for all $A\in \mathcal A, B\in \mathcal B $. Strengthening the classical Erd\H os-Ko-Rado theorem, Pyber proved…

Combinatorics · Mathematics 2017-12-01 Peter Frankl , Andrey Kupavskii

Suppose you have a family of Lagrangian submanifolds $L_t$ and an auxiliary Lagrangian $K$. Suppose that $K$ intersects some of the $L_t$ more than the minimal number of times. Can you eliminate surplus intersection (surplusection) with all…

Symplectic Geometry · Mathematics 2024-12-09 Georgios Dimitroglou Rizell , Jonathan David Evans

We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with…

Geometric Topology · Mathematics 2007-05-23 Vladimir Turaev

Let $n,s,k$ be three positive integers such that $1\leq s\leq(n-k+1)/k$ and let $[n]=\{1,\ldots,n\}$. Let $H$ be a $k$-graph with vertex set $\{1,\ldots,n\}$, and let $e(H)$ denote the number of edges of $H$. Let $\nu(H)$ and $\tau(H)$…

Combinatorics · Mathematics 2021-05-26 Mingyang Guo , Hongliang Lu , Dingjia Mao

Let $(S,H)$ be a general primitively polarized $K3$ surface. We prove the existence of curves in $|\mathcal O_S(nH)|$ with $A_k$-singularities and corresponding to regular points of the equisingular deformation locus. Our result is optimal…

Algebraic Geometry · Mathematics 2014-11-27 Concettina Galati , Andreas Leopold Knutsen

For any $k\ge 3$ and $\ell \in [k-1]$ such that $(k,\ell) \ne (3,1)$, we show that any sufficiently large $k$-graph $G$ must contain a Hamilton $\ell$-cycle provided that it has no isolated vertices and every set of $k-1$ vertices contained…

Combinatorics · Mathematics 2025-12-10 Shoham Letzter , Arjun Ranganathan

Let G be a complex reductive algebraic group. We study complete intersections in a spherical homogeneous space G/H defined by a generic collection of sections from G-invariant linear systems. Whenever nonempty, all such complete…

Algebraic Geometry · Mathematics 2015-06-11 Kiumars Kaveh , A. G. Khovanskii

Let $K/k$ be an extension of number fields. We describe theoretical results and computational methods for calculating the obstruction to the Hasse norm principle for $K/k$ and the defect of weak approximation for the norm one torus…

Number Theory · Mathematics 2021-01-07 André Macedo , Rachel Newton

We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…

Geometric Topology · Mathematics 2013-02-28 Nariya Kawazumi , Yusuke Kuno

We prove that the following problem has the same computational complexity as the existential theory of the reals: Given a generic self-intersecting closed curve $\gamma$ in the plane and an integer $m$, is there a polygon with $m$ vertices…

Computational Geometry · Computer Science 2019-08-28 Jeff Erickson

Let K be a fixed number field and G its absolute Galois group. We give a bound C(K), depending only on the degree, the class number and the discriminant of K, such that for any elliptic curve E defined over K and any prime number p strictly…

Number Theory · Mathematics 2010-07-28 Agnès David

Let $k$ and $m$ be positive integers. A collection of $k$-multisets from $\{1,..., m \}$ is intersecting if every pair of multisets from the collection is intersecting. We prove that for $m \geq k+1$, the size of the largest such collection…

Combinatorics · Mathematics 2011-11-23 Karen Meagher , Alison Purdy

Let C be a smooth cubic curve in the complex projective plane. We show that for every positive integer k, there are only finite number of rational curves of degree k each intersects the cubic C at exactly one point. The number of such…

alg-geom · Mathematics 2008-02-03 Geng Xu

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

Combinatorics · Mathematics 2022-09-07 Stefan Steinerberger

Let $\cC$ be a set of curves in the plane such that no three curves in $\cC$ intersect at a single point and every pair of curves in $\cC$ intersect at exactly one point which is either a crossing or a touching point. J\'anos Pach…

Combinatorics · Mathematics 2026-03-23 Eyal Ackerman , Balázs Keszegh

Let $\mathcal{M}_g$ be the moduli space of hyperbolic surfaces of genus $g$ endowed with the Weil-Petersson metric. In this paper, we show that for any $\epsilon>0$, as $g\to \infty$, for a generic surface in $\mathcal{M}_g$, the error term…

Geometric Topology · Mathematics 2025-06-06 Yunhui Wu , Yuhao Xue

For two oriented simple closed curves on a compact orientable surface with a connected boundary we introduce a simple computation of a value in the first homology group of the surface, which detects in some cases that the geometric…

Geometric Topology · Mathematics 2016-12-07 Ryosuke Yamamoto

Curves in ${\mathbb R}^n$ for which the ratios between two consecutive curvatures are constant are characterized by the fact that their tangent indicatrix is a geodesic in a flat torus. For $n= 3,4$, spherical curves of this kind are also…

Differential Geometry · Mathematics 2007-05-23 J. Monterde

We prove that for every $n$-vertex graph $G$, the extension complexity of the correlation polytope of $G$ is $2^{O(\mathrm{tw}(G) + \log n)}$, where $\mathrm{tw}(G)$ is the treewidth of $G$. Our main result is that this bound is tight for…

Discrete Mathematics · Computer Science 2018-10-19 Pierre Aboulker , Samuel Fiorini , Tony Huynh , Marco Macchia , Johanna Seif

A family of subsets of $\{1,\ldots,n\}$ is called {\it intersecting} if any two of its sets intersect. A classical result in extremal combinatorics due to Erd\H{o}s, Ko, and Rado determines the maximum size of an intersecting family of…

Combinatorics · Mathematics 2017-11-30 Peter Frankl , Andrey Kupavskii
‹ Prev 1 8 9 10 Next ›