中文
相关论文

相关论文: The maximum number of intersections of two polygon…

200 篇论文

It was conjectured by Edoukou in 2008 that a non-degenerate Hermitian threefold in $\mathbb{P}^4 (\mathbb{F}_{q^2})$ has at most $d(q^5+q^2) + q^3 + 1$ points in common with a threefold of degree $d$ defined over $\mathbb{F}_{q^2}$. He…

代数几何 · 数学 2024-06-12 Mrinmoy Datta , Subrata Manna

We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…

环与代数 · 数学 2024-08-20 Gustavo Granja , Aleksandar Milivojevic

I introduce the problem of finding maximal sets of equiangular lines, in both its real and complex versions, attempting to write the treatment that I would have wanted when I first encountered the subject. Equiangular lines intersect in the…

量子物理 · 物理学 2020-09-01 Blake C. Stacey

For a polyhedron $P$ in $\mathbb{R}^d$, denote by $|P|$ its combinatorial complexity, i.e., the number of faces of all dimensions of the polyhedra. In this paper, we revisit the classic problem of preprocessing polyhedra independently so…

计算几何 · 计算机科学 2018-02-20 Luis Barba , Stefan Langerman

Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In…

组合数学 · 数学 2021-02-19 Peter Frankl , Andreas Holmsen , Andrey Kupavskii

In this note we address the problem of determining the maximum number of points of intersection of two arithmetically Cohen-Macaulay curves in $\PP^3$. We give a sharp upper bound for the maximum number of points of intersection of two…

代数几何 · 数学 2007-05-23 R. M. Miro-Roig , K. Ranestad

Let $Q$ be a finite set of points in the plane. For any set $P$ of points in the plane, $S_{Q}(P)$ denotes the number of similar copies of $Q$ contained in $P$. For a fixed $n$, Erd\H{o}s and Purdy asked to determine the maximum possible…

组合数学 · 数学 2011-03-01 Bernardo M. Ábrego , Silvia Fernández-Merchant , David B. Roberts

In this paper, we derive a formula to express the maximum number of non-intersecting diagonals of arbitrary length that can be drawn in n x n square arrays, where n is a multiple of l+1.

组合数学 · 数学 2021-02-02 Marbarisha M. Kharkongor , Joseph Varghese Kureethara

Let p be a puncture of a punctured sphere, and let Q be the set of all other punctures. We prove that the maximal cardinality of a set of arcs pairwise intersecting at most once, which start at p and end in Q, is |X|(|X| + 1). We deduce…

几何拓扑 · 数学 2017-07-26 Christopher Smith , Piotr Przytycki

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…

几何拓扑 · 数学 2013-01-04 Justin Malestein , Igor Rivin , Louis Theran

We find a new lower bound for the maximal number of zeros to harmonic polynomials, $p(z)+\overline{q(z)}$, when ${\rm deg}\, p = n$ and ${\rm deg}\, q = n-2$.

复变函数 · 数学 2015-12-14 Seung-Yeop Lee , Andres Saez

The purpose of this note is to study configurations of lines in projective planes over arbitrary fields having the maximal number of intersection points where three lines meet. We give precise conditions on ground fields F over which such…

Two hexagons in the space are said to intersect heavily if their intersection consists of at least one common vertex as well as an interior point. We show that the number of hexagons on n points in 3-space without heavy intersections is…

度量几何 · 数学 2021-02-02 Jozsef Solymosi , Ching Wong

In this paper, we characterise ovoidal cones by their intersection numbers. We first show that a set of points of $\mathrm{PG}(4,q)$ which intersects planes in $1$, $q+1$ or $2q+1$ points is either an ovoidal cone or a parabolic quadric,…

组合数学 · 数学 2024-02-27 Bart De Bruyn , Geertrui Van de Voorde

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum…

计算几何 · 计算机科学 2013-07-30 David Eppstein , Maarten Löffler

A nonsingular surface of degree $d \geq 2$ in $\mathbb{P}^3$ over $\mathbb{F}_q$ has at most $((d-1)q+1)d$ $\mathbb{F}_q$-lines, and this bound is optimal for $d = 2, \sqrt{q}+1, q+1$.

代数几何 · 数学 2016-08-10 Masaaki Homma , Seon Jeong Kim

We consider an incidence problem in $\mathbb{R}^4$ which asks, for a set of $L$ lines and a set of $S$ planes in general position, what the maximum number of line-plane incidences is. A line-plane incidence is defined as a point where a…

组合数学 · 数学 2023-12-27 Chao Cheng

How many squares are spanned by $n$ points in the plane? Here we study the corresponding maximum possible number $S_{\square}(n)$ of squares and determine the exact values for all $n\le 17$. For $18\le n\le 100$ we give lower bounds for…

组合数学 · 数学 2021-12-24 Sascha Kurz

A basis of the ideal of the complement of a linear subspace in a projective space over a finite field is given. As an application, the second largest number of points of plane curves of degree $d$ over the finite field of $q$ elements is…

代数几何 · 数学 2015-09-09 Masaaki Homma , Seon Jeong Kim

In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with the given support. Moreover, we discuss the tropical counterpart of this problem.

代数几何 · 数学 2020-03-24 Arina Voorhaar