English
Related papers

Related papers: Arcs on spheres intersecting at most twice

200 papers

We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.

Commutative Algebra · Mathematics 2007-05-23 Margherita Barile

A set of sets is called a family. Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $1 \leq…

Combinatorics · Mathematics 2021-01-25 Peter Borg , Carl Feghali

The notion of cross intersecting set pair system of size $m$, $\Big(\{A_i\}_{i=1}^m, \{B_i\}_{i=1}^m\Big)$ with $A_i\cap B_i=\emptyset$ and $A_i\cap B_j\ne\emptyset$, was introduced by Bollob\'as and it became an important tool of extremal…

Combinatorics · Mathematics 2022-07-26 Zoltán Füredi , András Gyárfás , Zoltán Király

Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets $R$ and $B$ with $|R|=|B|$, the perfect matching that matches points of $R$ with points of $B$, and maximizes the total \emph{squared} Euclidean distance of the…

Computational Geometry · Computer Science 2019-11-26 Sergey Bereg , Oscar Chacón-Rivera , David Flores-Peñaloza , Clemens Huemer , Pablo Pérez-Lantero , Carlos Seara

We investigate arcs on a pair of pants and present an algorithm to compute the self-intersection number of an arc. Additionally, we establish bounds for the self-intersection number in terms of the word length. We also prove that the…

Geometric Topology · Mathematics 2024-07-26 Nhat Minh Doan , Hanh Vo

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…

Geometric Topology · Mathematics 2013-01-04 Justin Malestein , Igor Rivin , Louis Theran

In this paper, we study gapsets and we focus on obtaining information on how the maximum distance between to consecutive elements influences the behaviour of the set. In particular, we prove that the cardinality of the set of gapsets with…

Combinatorics · Mathematics 2022-01-25 Gilberto B. Almeida Filho , Matheus Bernardini

In this paper, we generalize the so called Korchm\'aros--Mazzocca arcs, that is, point sets of size $q+t$ intersecting each line in $0, 2$ or $t$ points in a finite projective plane of order $q$. For $t\neq 2$, this means that each point of…

Combinatorics · Mathematics 2020-08-25 Bence Csajbók , Zsuzsa Weiner

The midpoint set M(S) of a set S of points is the set of all midpoints of pairs of points in S. We study the largest cardinality of a midpoint set M(S) in a finite-dimensional normed space, such that M(S) is contained in the unit sphere,…

Metric Geometry · Mathematics 2011-08-26 Konrad J. Swanepoel

We prove that for every integer $t\geq 1$, the class of intersection graphs of curves in the plane each of which crosses a fixed curve in at least one and at most $t$ points is $\chi$-bounded. This is essentially the strongest…

Combinatorics · Mathematics 2017-10-05 Alexandre Rok , Bartosz Walczak

We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes.

Commutative Algebra · Mathematics 2015-11-24 Margherita Barile , Antonio Macchia

An arc in $\Z^2_n$ is defined to be a set of points no three of which are collinear. We describe some properties of arcs and determine the maximum size of arcs for some small $n$.

Combinatorics · Mathematics 2017-05-11 Zofia Stępień , Lucjan Szymaszkiewicz

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…

Combinatorics · Mathematics 2025-10-01 Doowon Koh , Ben Lund , Chuandong Xu , Semin Yoo

Given $n$ continuous open curves in the plane, we say that a pair is touching if they have only one interior point in common and at this point the first curve does not get from one side of the second curve to its other side. Otherwise, if…

Combinatorics · Mathematics 2017-08-31 Janos Pach , Geza Toth

In 1991 S{\o}rensen proposed a conjecture for the maximum number of points on the intersection of a surface of degree $d$ and a non-degenerate Hermitian surface in $\PP^3(\Fqt)$. The conjecture was proven to be true by Edoukou in the case…

Algebraic Geometry · Mathematics 2020-02-06 Peter Beelen , Mrinmoy Datta

A digraph X=(V, E) is max-\lambda, if \lambda(X)=\delta(X). A digraph X is super-\lambda if every minimum cut of X is either the set of inarcs of some vertex or the set of outarcs of some vertex. In this paper, we will prove that for all…

Combinatorics · Mathematics 2014-02-21 Yuhu Liu , Jixiang Meng

A star-simple drawing of a graph is a drawing in which adjacent edges do not cross. In contrast, there is no restriction on the number of crossings between two independent edges. When allowing empty lenses (a face in the arrangement induced…

Computational Geometry · Computer Science 2020-08-26 Stefan Felsner , Michael Hoffmann , Kristin Knorr , Irene Parada

For $n > 2k \geq 4$ we consider intersecting families $\mathcal F$ consisting of $k$-subsets of $\{1, 2, \ldots, n\}$. Let $\mathcal I(\mathcal F)$ denote the family of all distinct intersections $F \cap F'$, $F \neq F'$ and $F, F'\in…

Combinatorics · Mathematics 2021-08-03 Peter Frankl , Sergei Kiselev , Andrey Kupavskii

We prove an analogue of the classical Erd\H{o}s-Ko-Rado theorem for intersecting sets of permutations in finite 2-transitive groups. Given a finite group G acting faithfully and 2-transitively on the set X, we show that an intersecting set…

Combinatorics · Mathematics 2015-07-24 Karen Meagher , Pablo Spiga , Pham Huu Tiep

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…