English
Related papers

Related papers: Optimality of Gerver's Sofa

200 papers

In this paper we study the geometry of the Severi varieties parametrizing curves on the rational ruled surface $\fn$. We compute the number of such curves through the appropriate number of fixed general points on $\fn$, and the number of…

alg-geom · Mathematics 2008-02-03 Ravi Vakil

Given $n$ lines in general position in the plane, how many bounded triangular faces can the arrangement have? We construct a straight-line affine arrangement of $19$ lines satisfying the conditions of the iterative construction by…

Combinatorics · Mathematics 2026-04-27 Roman Parpalak , Denis Utkin

A new closed-form solver is proposed minimizing the algebraic error optimally, in the least-squares sense, to estimate the relative planar motion of two calibrated cameras. The main objective is to solve the over-determined case, i.e., when…

Computer Vision and Pattern Recognition · Computer Science 2019-12-16 Levente Hajder , Daniel Barath

We study the moduli space of Gieseker semi-stable sheaves on the complex projective plane supported on sextic curves and having Euler characteristic one. We determine locally free resolutions of length one for all such sheaves. We decompose…

Algebraic Geometry · Mathematics 2011-09-27 Mario Maican

We investigate the influence of uniformly positive scalar curvature on the size of a non-collapsed Ricci limit space coming from a sequence of $n$-manifolds with non-negative Ricci curvature and uniformly positive scalar curvature. We prove…

Differential Geometry · Mathematics 2024-10-28 Jinmin Wang , Zhizhang Xie , Bo Zhu , Xingyu Zhu

Motivated by previous computations in Garcia, Stichtenoth and Xing (2000) paper ,we discuss the spectrum $\mathbf{M}(q^2)$ for the genera of maximal curves over finite fields of order $q^2$ with $7\leq q\leq 16$. In particular, by using a…

Algebraic Geometry · Mathematics 2016-09-16 Nazar Arakelian , Saeed Tafazolian , Fernando Torres

Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…

Computational Geometry · Computer Science 2010-09-16 Amol Aggarwal

By making use of the classification of real simple Lie algebra, we get the maximum of the squared length of restricted roots case by case, thus we get the upper bounds of sectional curvature for irreducible Riemannian symmetric spaces of…

Differential Geometry · Mathematics 2007-05-23 Xusheng Liu

We develop a stabilized cut finite element method for the convection problem on a surface based on continuous piecewise linear approximation and gradient jump stabilization terms. The discrete piecewise linear surface cuts through a…

Numerical Analysis · Mathematics 2015-11-10 Erik Burman , Peter Hansbo , Mats G. Larson , Sara Zahedi

We study the convergence and divergence of the wavelet expansion of a function in a Sobolev or a Besov space from a multifractal point of view. In particular, we give an upper bound for the Hausdorff and for the packing dimension of the set…

Functional Analysis · Mathematics 2019-03-13 Frédéric Bayart

We exhibit generically nonreduced components of the Hilbert scheme of at least $21$ points on a smooth variety of dimension at least four. The result was announced in~[Jelisiejew__open_problems] and answers a question~[Problem~3.8, AIMPL].…

Algebraic Geometry · Mathematics 2024-07-01 Joachim Jelisiejew

We give a sharp bound on the number of automorphisms of a stable curve of a given genus and describe all curves attaining this bound.

Algebraic Geometry · Mathematics 2007-05-23 Michael A. van Opstall , Razvan Veliche

Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum…

Information Theory · Computer Science 2011-07-22 Arun Padakandla , Rajesh Sundaresan

Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2,…

Metric Geometry · Mathematics 2007-05-23 Greg Martin

In this talk we show that any spherically symmetric spacetime admits locally a maximal spacelike slicing. The above condition is reduced to solve a decoupled system of first order quasi-linear partial differential equations. The solution…

General Relativity and Quantum Cosmology · Physics 2015-05-18 Isabel Cordero-Carrión , José María Ibáñez , Juan Antonio Morales-Lladosa

The cevian triangle corresponding to an interior point $M$ of a triangle is the triangle determined by the feet of the three cevians concurrent at $M$. It is known that the area of the cevian triangle for an interior point $M$ of a triangle…

Metric Geometry · Mathematics 2026-04-14 Yagub N. Aliyev

In this paper we establish the optimal multilinear restriction estimate for n-1 hypersurfaces with some curvature, where $n$ is the dimension of the underlying space. The result is sharp up to the endpoint and the role of curvature is made…

Classical Analysis and ODEs · Mathematics 2020-03-02 Ioan Bejenaru

This paper considers the problem of smoothing convex functions and sets, seeking the nearest smooth convex function or set to a given one. For convex cones and sublinear functions, a full characterization of the set of all optimal…

Optimization and Control · Mathematics 2025-08-22 Thabo Samakhoana , Benjamin Grimmer

In this paper we consider a generalization of a well known result by Veronese about rational normal curves. More precisely, given a collection of linear spaces in $\PP^n$ we study the existence of rational normal curves intersecting each…

Algebraic Geometry · Mathematics 2014-02-26 E. Carlini , M. V. Catalisano

We provide a new upper bound for traveling salesman problem (TSP) in cubic graphs, i.e. graphs with maximum vertex degree three, and prove that the problem for an $n$-vertex graph can be solved in $O(1.2553^n)$ time and in linear space. We…

Data Structures and Algorithms · Computer Science 2012-12-03 Maciej Liskiewicz , Martin R. Schuster