English
Related papers

Related papers: The farthest point map on the 4-cube

200 papers

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

Metric Geometry · Mathematics 2020-07-16 Arseniy Akopyan , Herbert Edelsbrunner , Anton Nikitenko

We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…

Dynamical Systems · Mathematics 2007-05-23 Marianne Akian , Stephane Gaubert , Bas Lemmens , Roger Nussbaum

We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors…

Mathematical Physics · Physics 2017-03-08 M. J. Hay , J. Schiff , N. J. Fisch

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz , Alfred Wassermann

The Epstein deformation space parameterizes marked rational maps with prescribed combinatorial and dynamical structure. For the family of quadratic rational maps with a periodic critical cycle of order 4 and an extra critical point not…

Dynamical Systems · Mathematics 2019-03-20 Eriko Hironaka

Flip-graph connectedness is established here for the vertex set of the 4-dimensional cube. It is found as a consequence that this vertex set has 92 487 256 triangulations, partitioned into 247 451 symmetry classes.

Metric Geometry · Mathematics 2017-05-12 Lionel Pournin

We consider the directed Hausdorff distance between point sets in the plane, where one or both point sets consist of imprecise points. An imprecise point is modelled by a disc given by its centre and a radius. The actual position of an…

Computational Geometry · Computer Science 2009-09-30 Christian Knauer , Maarten Löffler , Marc Scherfenberg , Thomas Wolle

We define a pants distance for knotted surfaces in 4-manifolds which generalizes the complexity studied by Blair-Campisi-Taylor-Tomova for surfaces in the 4-sphere. We determine that if the distance computed on a given diagram does not…

It is a classical result that there are $12$ (irreducible) rational cubic curves through $8$ generic points in $\mathbb{P}_{\mathbb{C}}^2$, but little is known about the non-generic cases. The space of $8$-point configurations is…

Algebraic Geometry · Mathematics 2023-09-15 Taylor Brysiewicz , Fulvio Gesmundo , Avi Steiner

In this note, we discuss Hassett maximal cubic fourfolds and construct an explicit irreducible component of maximal dimension sixteen of the locus $\mathcal{Z}$ of Hassett maximal cubic fourfolds. We utilize algebraic and arithmetic methods…

Algebraic Geometry · Mathematics 2026-05-12 Elad Gal , Howard Nuer

Assume we are given a set of parallel line segments in the plane, and we wish to place a point on each line segment such that the resulting point set maximizes or minimizes the area of the largest or smallest triangle in the set. We analyze…

Computational Geometry · Computer Science 2020-12-18 Vahideh Keikha , Maarten Löffler , Ali Mohades

Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network…

Data Structures and Algorithms · Computer Science 2015-03-17 Prosenjit Bose , Jean-Lou De Carufel , Carsten Grimm , Anil Maheshwari , Michiel Smid

We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…

Geometric Topology · Mathematics 2025-02-19 Shintaro Fushida-Hardy

The real roots of the cubic and quartic polynomials are studied geometrically with the help of their respective Siebeck--Marden--Northshield equilateral triangle and regular tetrahedron. The Vi\`ete trigonometric formulae for the roots of…

General Mathematics · Mathematics 2023-09-29 Emil M. Prodanov

The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an…

Optimization and Control · Mathematics 2022-02-04 Romain Ageron

We extend the notion of a star unfolding to be based on a simple quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple, planar polygon: shortest paths from…

Computational Geometry · Computer Science 2008-12-15 Jin-ichi Itoh , Joseph O'Rourke , Costin Vîlcu

The object of this note is the moduli spaces of cubic fourfolds (resp., Gushel-Mukai fourfolds) which contain some special rational surfaces. Under some hypotheses on the families of such surfaces, we develop a general method to show the…

Algebraic Geometry · Mathematics 2021-02-10 Hanine Awada , Michele Bolognesi , Giovanni Stagliano'

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…

Computational Geometry · Computer Science 2021-11-03 Satyan L. Devadoss , Matthew Harvey

Let X be a non-singular projective hypersurface of degree 4, which is defined over the rational numbers. Assume that X has dimension 39 or more, and that X contains a real point and p-adic points for every prime p. Then X is shown to…

Number Theory · Mathematics 2008-01-08 T. D. Browning , D. R. Heath-Brown

We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…

Computational Geometry · Computer Science 2023-08-29 Csaba D. Tóth , Jorge Urrutia , Giovanni Viglietta
‹ Prev 1 4 5 6 7 8 10 Next ›