English
Related papers

Related papers: Maximal cross-ratio degree for 8 points in $\mathb…

200 papers

We determine that the maximum crossing number of $C_3 \times C_3$ is 78, which closes the previously best known range of between 68 and 80. The proof uses several techniques which may be useful in determining the maximum crossing number of…

Combinatorics · Mathematics 2020-05-18 Michael Haythorpe , Alex Newcombe

The \textit{square} of a graph $G$, denoted by $G^2$, is obtained from $G$ by adding an edge to connect every pair of vertices with a common neighbor in $G$. In this paper we prove that for every planar graph $G$ with maximum degree at most…

Combinatorics · Mathematics 2023-08-15 Jiani Zou , Miaomiao Han , Hong-Jian Lai

In a graph $G$, a subset of vertices is a dissociation set if it induces a subgraph with vertex degree at most 1. A maximum dissociation set is a dissociation set of maximum cardinality. The dissociation number of $G$, denoted by $\psi(G)$,…

Combinatorics · Mathematics 2021-08-26 Jianhua Tu , Lei Zhang , Junfeng Du

The point placement problem is to determine the positions of a set of $n$ distinct points, P = {p1, p2, p3, ..., pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points.…

Data Structures and Algorithms · Computer Science 2012-10-16 Md. Shafiul Alam , Asish Mukhopadhyay

We give upper bounds for the number of rational points of bounded anti-canonical height on del Pezzo surfaces of degree at most five over any global field whose characteristic is not equal to two or three. For number fields these results…

Number Theory · Mathematics 2024-01-11 Jakob Glas , Leonhard Hochfilzer

We determine all modular curves $X_0(N)$ with density degree $5$, i.e. all curves $X_0(N)$ with infinitely many points of degree $5$ and only finitely many points of degree $d\leq4$. As a consequence, the problem of determining all curves…

Number Theory · Mathematics 2026-02-20 Maarten Derickx , Wontae Hwang , Daeyeol Jeon , Petar Orlić

The subdegrees of a transitive permutation group are the orbit lengths of a point stabilizer. For a finite primitive permutation group which is not cyclic of prime order, the largest subdegree shares a non-trivial common factor with each…

Group Theory · Mathematics 2012-03-14 Silvio Dolfi , Robert Guralnick , Cheryl Praeger , Pablo Spiga

We estimate the maximal number of integral points which can be on a convex arc in the plane with given length, minimal radius of curvature and initial slope.

Number Theory · Mathematics 2018-10-03 Jean-Marc Deshouillers , Adrián Ubis

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

Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main…

Computational Geometry · Computer Science 2021-10-01 Alan Arroyo , Stefan Felsner

This is a matricial description of all the fine group gradings on the exceptional Lie algebra $o(8,\mathbb C)$. There are fourteen.

Mathematical Physics · Physics 2007-09-04 C. Draper , A. Viruel

We prove that the maximum degree $\Delta_n$ of a random series-parallel graph with $n$ vertices satisfies $\Delta_n/\log n \to c$ in probability, and $\mathbb{E}\, \Delta_n \sim c \log n$ for a computable constant $c>0$. The same result…

Combinatorics · Mathematics 2010-09-01 Michael Drmota , Omer Gimenez , Marc Noy

We show that the maximum number of unit distances or of diameters in a set of n points in d-dimensional Euclidean space is attained only by specific types of Lenz constructions, for all d >= 4 and n sufficiently large, depending on d. As a…

Metric Geometry · Mathematics 2009-03-12 Konrad J Swanepoel

We determine the set $S(d)$ of possible prime orders of $K$-rational points on elliptic curves over number fields $K$ of degree $d$, for $d = 4$, $5$, $6$, and $7$.

Number Theory · Mathematics 2023-03-29 Maarten Derickx , Sheldon Kamienny , William Stein , Michael Stoll

It has been conjectured that the optimal canonical degree of a minimal surface of general type is 36, from a work in the 70's of Beauville who proved that 36 was an upper bound. The highest canonical degree known for the problem was 16 by…

Algebraic Geometry · Mathematics 2021-08-19 Sai-Kee Yeung

For real irreducible algebraic curves of the seventh degree, there are 22 types of singular points of multiplicity six, 174 types of singular points of multiplicity five, and at least 182 types of singular points of multiplicity four. For…

Algebraic Geometry · Mathematics 2019-06-27 Nicholas J. Willis , David A. Weinberg

The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…

Commutative Algebra · Mathematics 2021-01-19 Doan Trung Cuong , Sijong Kwak

For prime powers q<100, we compute new upper and lower bounds on N_q(4), the maximal number of points on a genus-4 curve over a finite field with q elements. We determine the exact value of N_q(4) for 17 prime powers q for which the value…

Algebraic Geometry · Mathematics 2012-03-12 Everett W. Howe

We show, in this first part, that the maximal number of singular points of a normal quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic $2$ is at most $16$. We produce examples with…

Algebraic Geometry · Mathematics 2022-01-24 Fabrizio Catanese

In this paper, by developing several new adjacency lemmas about a path on $4$ or $5$ vertices, we show that the average degree of 7-critical graphs is at least 6. It implies Vizing's planar graph conjecture for planar graphs with maximum…

Combinatorics · Mathematics 2023-01-06 Yan Cao , Rong Luo , Zhengke Miao , Yue Zhao