English
Related papers

Related papers: Strongly Obtuse Rational Lattice Triangles

200 papers

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

Combinatorics · Mathematics 2020-03-11 Chuanqi Xiao , Gyula O. H. Katona

We classify rational surfaces for which the image of the automorphisms group in the group of linear transformations of the Picard group is the largest possible. This answers a question raised by Arthur Coble in 1928, and can be rephrased in…

Algebraic Geometry · Mathematics 2012-01-26 Serge Cantat , Igor Dolgachev

In this article, we investigate the higher topological complexity of oriented Seifert fibered manifolds that are Eilenberg--MacLane spaces $K(G,1)$ with infinite fundamental group $G$. We first refine the cohomological lower bounds for…

Algebraic Topology · Mathematics 2026-02-02 Navnath Daundkar , Rekha Santhanam , Soumyadip Thandar

We establish an explicit criterion for determining whether a $4 \times 4$ upper-triangular matrix is a contraction with respect to the Euclidean operator norm.

Functional Analysis · Mathematics 2025-06-17 Axel Renard

In a previous paper, we proved a number of optimal rigidity results for Riemannian manifolds of dimension greater than four whose curvature satisfy an integral pinching. In this article, we use the same integral Bochner technique to extend…

Differential Geometry · Mathematics 2014-09-01 Vincent Bour , Gilles Carron

In this paper, we show that every graph with $m$ edges admits a 3-partition such that \[ \max_{1 \leq i \leq 3} e(V_i) \leq \frac{m}{9} + \frac{1}{9}h(m) \quad \text{and} \quad e(V_1, V_2, V_3) \geq \frac{2}{3}m + \frac{1}{3}h(m), \] where…

Combinatorics · Mathematics 2025-10-01 Peiru Kuang , Yan Wang

We show under the assumption that the Tate-Shafarevich group of any elliptic curve over the rational numbers is finite that the cubic surface $x_1^3 + p_1p_2x_2^3 + p_2p_3x_3^3 + p_3p_1x_4^3 = 0$ has a rational point, where $p_1, p_2$ and…

Number Theory · Mathematics 2025-10-15 Kazuki Sato

We produce a rational homology 3-sphere that does not smoothly bound either a positive or negative definite 4-manifold. Such a 3-manifold necessarily cannot be rational homology cobordant to a Seifert fibered space or any 3-manifold…

Geometric Topology · Mathematics 2021-01-08 Marco Golla , Kyle Larson

This paper is a continuation of an earlier one, and completes a classification of the configurations of points in a plane lattice that determine angles that are rational multiples of ${\pi}$. We give a complete and explicit description of…

Number Theory · Mathematics 2024-04-04 Roberto Dvornicich , Davide Lombardo , Francesco Veneziano , Umberto Zannier

Here we prove classification results announced in Part I (alg-geom/9711032). We classify maximal hyperbolic root systems of the rank 3 having restricted arithmetic type and a generalized lattice Weyl vector $\rho$ with $\rho^2\ge 0$ (i.e.…

alg-geom · Mathematics 2007-05-23 Viacheslav V. Nikulin

We study the set of rational curves of a certain topological type in general members of certain families of Calabi-Yau threefolds. For some families we investigate to what extent it is possible to conclude that this set is finite. For other…

Algebraic Geometry · Mathematics 2007-05-23 Trygve Johnsen , Andreas Leopold Knutsen

We show that there are 4 infinite families of lattice equable kites, given by corresponding Pell or Pell-like equations, but up to Euclidean motions, there are exactly 5 lattice equable trapezoids (2 isosceles, 2 right, 1 singular) and 4…

General Mathematics · Mathematics 2021-05-04 Christian Aebi , Grant Cairns

In this paper we consider min-max minimal surfaces in three-manifolds and prove some rigidity results. For instance, we prove that any metric on a 3-sphere which has scalar curvature greater than or equal to 6 and is not round must have an…

Differential Geometry · Mathematics 2019-12-19 F. C. Marques , A. Neves

We show how to edge-unfold a new class of convex polyhedra, specifically a new class of prismatoids (the convex hull of two parallel convex polygons, called the top and base), by constructing a nonoverlapping "petal unfolding" in two new…

Computational Geometry · Computer Science 2021-06-29 Vincent Bian , Erik Demaine , Rachana Madhukara

A knot in $S^3$ is rationally slice if it bounds a disk in a rational homology ball. We give an infinite family of rationally slice knots that are linearly independent in the knot concordance group. In particular, our examples are all…

Geometric Topology · Mathematics 2023-02-01 Jennifer Hom , Sungkyung Kang , JungHwan Park , Matthew Stoffregen

Any non-split complex supermanifold is a deformation of a split supermanifold. These deformations are classified by group orbits in a non-abelian cohomology. For the case of a split supermanifold with no global nilpotent even vector fields,…

Complex Variables · Mathematics 2016-01-28 Matthias Kalus

We consider elliptic curves whose coefficients are degree 2 polynomials in a variable t. We prove that for infinitely many values of t the resulting elliptic curve has rank at least 1. All such curves together form an algebraic surface…

Algebraic Geometry · Mathematics 2016-04-12 János Kollár , Massimiliano Mella

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)=2$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

We give an upper bound for the rank $r$ of homogeneous (even) Clifford structures on compact manifolds of non-vanishing Euler characteristic. More precisely, we show that if $r=2^a\cdot b$ with $b$ odd, then $r\le 9$ for $a=0$, $r\le 10$…

Differential Geometry · Mathematics 2019-01-08 Andrei Moroianu , Mihaela Pilca

A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached…

Combinatorics · Mathematics 2014-12-24 Moritz Christmann , Timo de Wolff