中文
相关论文

相关论文: Large Collections of Curves Pairwise Intersecting …

200 篇论文

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)$.…

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…

几何拓扑 · 数学 2016-10-21 Tarik Aougab , Ian Biringer , Jonah Gaster

A subset $\mathcal{F}$ of a finite transitive group $G\leq \operatorname{Sym}(\Omega)$ is intersecting if for any $g,h\in \mathcal{F}$ there exists $\omega \in \Omega$ such that $\omega^g = \omega^h$. The \emph{intersection density}…

组合数学 · 数学 2022-11-07 Andriaherimanana Sarobidy Razafimahatratra

We show that finite fields over which there is a curve of a given genus g with its Jacobian having a small exponent, are very rare. This extends a recent result of W. Duke in the case g=1. We also show when g=1 or g=2 that our bounds are…

数论 · 数学 2008-11-06 Kevin Ford , Igor Shparlinski

Let G be a simple graph with vertex set V(G). A subset S of V(G) is independent if no two vertices from S are adjacent. The graph G is known to be a Konig-Egervary if alpha(G) + mu(G)= |V(G)|, where alpha(G) denotes the size of a maximum…

离散数学 · 计算机科学 2015-06-02 Adi Jarden , Vadim E. Levit , Eugen Mandrescu

Let $F_g$ be a closed orientable surface of genus $g$. A set $\Omega = \{ \gamma_1, \dots, \gamma_s\}$ of pairwise non-homotopic simple closed curves on $F_g$ is called a \emph{filling system} or simply a \emph{filling} of $F_g$, if…

几何拓扑 · 数学 2018-05-18 Shiv Parsad , Bidyut Sanki

We present three families of pairs of geometrically non-isomorphic curves whose Jacobians are isomorphic to one another as unpolarized abelian varieties. Each family is parametrized by an open subset of P^1. The first family consists of…

代数几何 · 数学 2010-01-23 Everett W. Howe

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A set $I_0(G) \subseteq V(G)$ is a vertex independent set if no two vertices in $I_0(G)$ are adjacent in $G$. We study $\alpha_1(G)$, which is the maximum cardinality of a set…

组合数学 · 数学 2024-06-25 Zekhaya B. Shozi

In this article we consider compact Riemann surfaces that are uniquely determined by the property of possessing a group of automorphisms of a prescribed order, strengthening uniqueness results proved by Nakagawa. More precisely, we deal…

代数几何 · 数学 2025-02-03 Sebastián Reyes-Carocca , Pietro Speziali

In this paper, we provide upper and lower bounds on the crossing numbers of dense graphs on surfaces, which match up to constant factors. First, we prove that if $G$ is a dense enough graph with $m$ edges and $\Sigma$ is a surface of genus…

组合数学 · 数学 2025-06-12 Alfredo Hubard , Arnaud de Mesmay , Hugo Parlier

Let $\lpt(G)$ be the minimum cardinality of a set of vertices that intersects all longest paths in a graph $G$. Let $\omega(G)$ be the size of a maximum clique in $G$, and $\tw(G)$ be the treewidth of $G$. We prove that $ \lpt(G) \leq…

离散数学 · 计算机科学 2017-12-20 Márcia R. Cerioli , Cristina G. Fernandes , Renzo Gómez , Juan Gutiérrez , Paloma T. Lima

Let $G$ be an intersection graph of $n$ geometric objects in the plane. We show that a maximum matching in $G$ can be found in $O(\rho^{3\omega/2}n^{\omega/2})$ time with high probability, where $\rho$ is the density of the geometric…

计算几何 · 计算机科学 2024-05-02 Édouard Bonnet , Sergio Cabello , Wolfgang Mulzer

Let $G$ be a simple graph with vertex set $V(G)$. A subset $S$ of $V(G)$ is independent if no two vertices from $S$ are adjacent. The graph $G$ is known to be a Konig-Egervary (KE in short) graph if $\alpha(G) + \mu(G)= |V(G)|$, where…

组合数学 · 数学 2016-03-29 Adi Jarden

We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this…

组合数学 · 数学 2019-04-29 Cesar Hernandez-Velez , Gelasio Salazar , Robin Thomas

We study the nef cone of self-products of a curve. When the curve is very general of genus $g>2$, we construct a nontrivial class of self-intersection 0 on the boundary of the nef cone. Up to symmetry, this is the only known nontrivial…

代数几何 · 数学 2021-01-26 Mihai Fulger , Takumi Murayama

An "origami" (or flat structure) on a closed oriented surface, $S_g$, of genus $g \geq 2$ is obtained from a finite collection of unit Euclidean squares by gluing each right edge to a left one and each top edge to a bottom one. The main…

几何拓扑 · 数学 2021-05-11 Hong Chang , Xifeng Jin , William W. Menasco

We show that for any elliptic curve (with j invariant not 0 or 1728) over any field of characteristic different from 2 and 3, there exists an hyperelliptic curve H of genus 5 with two independent maps to the given elliptic curve. We also…

代数几何 · 数学 2013-03-19 Xavier Xarles

A family of closed simple (i.e., Jordan) curves is $m$-intersecting if any pair of its curves have at most $m$ points of common intersection. We say that a pair of such curves touch if they intersect at a single point of common tangency. In…

计算几何 · 计算机科学 2021-11-29 Maya Bechler-Speicher

Let $R$ be a compact, connected, orientable surface of genus $g$, $Mod_R^*$ be the extended mapping class group of $R$, $\mathcal{C}(R)$ be the complex of curves on $R$, and $\mathcal{N}(R)$ be the complex of nonseparating curves on $R$. We…

几何拓扑 · 数学 2007-05-23 Elmas Irmak

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.

几何拓扑 · 数学 2020-08-25 Alev Meral