English
Related papers

Related papers: Universal sequences of lines in $\mathbb R^d$

200 papers

We prove that for every $d\geq 3$ the homomorphism order of the class of line graphs of finite graphs with maximal degree $d$ is universal. This means that every finite or countably infinite partially ordered set may be represented by line…

Combinatorics · Mathematics 2014-04-22 Jiří Fiala , Jan Hubička , Yangjing Long

The gonality sequence $(\gamma_r)_{r\geq1}$ of a finite graph / metric graph / algebraic curve comprises the minimal degrees $\gamma_r$ of linear systems of rank $r$. For the complete graph $K_d$, we show that $\gamma_r = kd - h$ if…

Combinatorics · Mathematics 2017-03-08 Filip Cools , Marta Panizzut

By a curve in R^d we mean a continuous map gamma:I -> R^d, where I is a closed interval. We call a curve gamma in R^d at most k crossing if it intersects every hyperplane at most k times (counted with multiplicity). The at most d crossing…

Metric Geometry · Mathematics 2013-11-25 Imre Barany , Jiri Matousek , Attila Por

In this paper we obtain an explicit formula for the number of degree d curves in two dimensional complex projective space, passing through (d(d+3)/2 -k) generic points and having a codimension k singularity, where k is at most 7. In the…

Algebraic Geometry · Mathematics 2025-02-21 Somnath Basu , Ritwik Mukherjee

We study linear series on a general curve of genus $g$, whose images are exceptional with regard to their secant planes. Working in the framework of an extension of Brill-Noether theory to pairs of linear series, we prove that a general…

Algebraic Geometry · Mathematics 2010-04-05 Ethan Cotterill

In this paper we obtain an explicit formula for the number of curves in two dimensional complex projective space, of degree d, passing through d(d+3)/2-(k+1) generic points and having one node and one codimension k singularity, where k is…

Algebraic Geometry · Mathematics 2015-12-29 Somnath Basu , Ritwik Mukherjee

In this paper we consider the question of determining the geometric genera of irreducible curves lying on a very general surface $S$ of degree $d$ at least 5 in $\mathbb{P}^3$ (the cases $d \leqslant 4$ are well known). We introduce the set…

Algebraic Geometry · Mathematics 2015-03-30 Ciro Ciliberto , Flaminio Flamini , Mikhail Zaidenberg

The line generated by two distinct points, $x$ and $y$, in a finite metric space $M=(V,d)$, denoted by $\overline{xy}^M$, is the set of points given by $$\overline{xy}^M:=\{z\in V: d(x,y)=|d(x,z)\pm d(z,y)|\}.$$ A 2-set $\{x,y\}$ such that…

Combinatorics · Mathematics 2018-11-16 Martín Matamala , José Zamora

A special class of metrics, called universal metrics, solve all gravity theories defined by covariant field equations purely based on the metric tensor. Since we currently lack the knowledge of what the full of quantum-corrected field…

General Relativity and Quantum Cosmology · Physics 2016-08-24 Metin Gurses , Tahsin Cagri Sisman , Bayram Tekin

Using the Semple bundle construction, we derive an intersection-theoretic formula for the number of simultaneous contacts of specified orders between members of a generic family of degree $d$ plane curves and finitely many fixed curves. The…

alg-geom · Mathematics 2008-02-03 Susan Jane Colley , Gary Kennedy

For $d\geq 2$ and any norm on $\mathbb R^d$, we prove that there exists a set of $n$ points that spans at least $(\tfrac d2-o(1))n\log_2n$ unit distances under this norm for every $n$. This matches the upper bound recently proved by Alon,…

Combinatorics · Mathematics 2025-10-03 Josef Greilhuber , Carl Schildkraut , Jonathan Tidor

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

Combinatorics · Mathematics 2014-12-30 Pierre Aboulker , Xiaomin Chen , Guangda Huzhang , Rohan Kapadia , Cathryn Supko

A d-dimensional framework is an embedding of the vertices and edges of a graph in Euclidean space. A d-dimensional framework is globally rigid if every other d-dimensional framework with the same edge lengths has the same pairwise distances…

Metric Geometry · Mathematics 2010-12-30 Matthew Jacobs

An increasing sequence of integers is said to be universal for knots and links if every knot and link has a projection to the sphere such that the number of edges of each complementary face of the projection comes from the given sequence.…

Geometric Topology · Mathematics 2008-12-16 Colin Adams , Reiko Shinjo , Kokoro Tanaka

A little-known and highly economical characterization of the real interval [0, 1], essentially due to Freyd, states that the interval is homeomorphic to two copies of itself glued end to end, and, in a precise sense, is universal as such.…

Category Theory · Mathematics 2010-11-10 Tom Leinster

In this note we introduce the notion of $(b,d)$-geprofi sets and study their basic properties. These are sets of $bd$ points in $\mathbb{P}^4$ whose projection from a general point to a hyperplane is a full intersection, i.e., the…

We report on the problem of the existence of complex and real algebraic curves in the plane with prescribed singularities up to analytic and topological equivalence. The question is whether, for a given positive integer $d$ and a finite…

Algebraic Geometry · Mathematics 2020-08-07 Gert-Martin Greuel , Eugenii Shustin

We solve a randomized version of the following open question: is there a strictly convex, bounded curve \gamma in the plane such that the number of rational points on \gamma, with denominator $n$, approaches infinity with $n$? Although this…

Metric Geometry · Mathematics 2019-02-20 Nick Gravin , Fedor Petrov , Sinai Robins , Dmitry Shiryaev

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

Combinatorics · Mathematics 2024-01-12 Noga Alon , Natalie Dodson , Carmen Jackson , Rose McCarty , Rajko Nenadov , Lani Southern

A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15. Conversely,…

Computational Geometry · Computer Science 2013-08-28 Jean Cardinal , Michael Hoffmann , Vincent Kusters
‹ Prev 1 2 3 10 Next ›