English
Related papers

Related papers: A subexponential size triangulation of $\mathbb{R}…

200 papers

An extended formulation of a polytope P is a polytope Q which can be projected onto P. Extended formulations of small size (i.e., number of facets) are of interest, as they allow to model corresponding optimization problems as linear…

Combinatorics · Mathematics 2012-07-10 Samuel Fiorini , Volker Kaibel , Kanstantsin Pashkovich , Dirk Oliver Theis

We prove the projective plane $\rp^2$ is an absolute extensor of a finite-dimensional metric space $X$ if and only if the cohomological dimension mod 2 of $X$ does not exceed 1. This solves one of the remaining difficult problems (posed by…

Geometric Topology · Mathematics 2014-10-01 Jerzy Dydak , Michael Levin

Given a polytope $\mathcal{P}$ in $\mathbb{R}^d$ and a subset $U$ of its vertices, is there a triangulation of $\mathcal{P}$ using $d$-simplices that all contain $U$? We answer this question by proving an equivalent and easy-to-check…

Metric Geometry · Mathematics 2018-03-09 Michael Kerber , Robert Tichy , Mario Weitzer

We construct an interesting topological cover of the multiplicative group of the real line, related to Tate's elliptic curve with $q = e^\pi$. We use the language of homological algebra, 2D Lorentz geometry and high-school trigonometry; the…

Geometric Topology · Mathematics 2023-11-14 Jack Morava

Fix two integers $1\leq d<e$. We study the birational geometry of a parameter space for pairs of homogeneous polynomials of degrees $d$ and $e$ in two variables (in which the higher degree polynomial is well defined only up to a multiple of…

Algebraic Geometry · Mathematics 2026-01-19 Olivier Benoist

We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…

Rings and Algebras · Mathematics 2010-12-13 Bob Palais

In this article, we give a combinatorial approach to the exponents of the Moore spaces. Our result states that the projection of the $p^{r+1}$-th power map of the loop space of the $(2n+1)$-dimensional mod $p^r$ Moore space to its atomic…

Algebraic Topology · Mathematics 2015-06-03 Frederick R. Cohen , Roman Mikhailov , Jie Wu

The Erlangian approximation of Markovian fluid queues leads to the problem of computing the matrix exponential of a subgenerator having a block-triangular, block-Toeplitz structure. To this end, we propose some algorithms which exploit the…

Numerical Analysis · Mathematics 2015-02-27 D. A. Bini , S. Dendievel , G. Latouche , B. Meini

Inspired by the analogous result in the algebraic setting (Theorem 1) we show (Theorem 2) that the product $M \times \mathbb{R}P^n$ of a closed and orientable topological manifold $M$ with the $n$-dimensional real projective space cannot be…

Algebraic Topology · Mathematics 2017-12-20 Beniamino Cappelletti Montano , Andrea Loi , Daniele Zuddas

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…

Combinatorics · Mathematics 2015-09-22 Guenter Rote , Francisco Santos , Ileana Streinu

Bennett, Carbery and Tao established nearly optimal $L^1$ trilinear restriction estimates in $\mathbb{R}^{n+1}$ under transversality assumptions only. In this paper we show that the curvature improves the range of exponents, by establishing…

Classical Analysis and ODEs · Mathematics 2016-03-10 Ioan Bejenaru

Let $C\subset \mathbb{P}^n$ be a rational normal curve and let $\ell_O:\mathbb{P}^{n+1}\dashrightarrow \mathbb{P}^n$ be any tangential projection form a point $O\in T_AC$ where $A\in C$. Hence $X:= \ell_O(C)\subset \mathbb{P}^n$ is a…

Algebraic Geometry · Mathematics 2013-12-05 Edoardo Ballico , Alessandra Bernardi

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

Data Structures and Algorithms · Computer Science 2013-12-12 David Rosenbaum

A Riemannian manifold is a called a good rational expander in dimension $i$ if every $i$-cycle bounds a rational $i+1$-chain of comparatively small volume. We construct 3-manifolds which are good expanders in all dimensions. On the other…

Geometric Topology · Mathematics 2024-05-09 Jonathan Zung

A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…

Combinatorics · Mathematics 2015-02-18 Guenter Rote , Francisco Santos , Ileana Streinu

We improve the estimates in the restriction problem in dimension $n \ge 4$. To do so, we establish a weak version of a $k$-linear restriction estimate for any $k$. The exponents in this weak $k$-linear estimate are sharp for all $k$ and…

Classical Analysis and ODEs · Mathematics 2017-11-06 Larry Guth

We show that the problem of finding the measure supported on a compact subset K of the complex plane such that the variance of the least squares predictor by polynomials of degree at most n at a point exterior to K is a minimum, is…

Classical Analysis and ODEs · Mathematics 2022-10-04 L. Bos , N. Levenberg , J. Ortega-Cerda

We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…

Combinatorics · Mathematics 2007-05-24 David Orden , Francisco Santos , Brigitte Servatius , Herman Servatius

We show that the linear map defined by multiplication with a general bi-homogeneous form between two bi-graduated pieces of the first cohomology of a nonsingular quadric in the projective space is of maximal rank. This is the first non…

Algebraic Geometry · Mathematics 2010-06-29 Salvatore Giuffrida , Renato Maggioni , Riccardo Re

An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…

Numerical Analysis · Mathematics 2016-06-28 Daniel Gebremedhin , Charles Weatherford