English
Related papers

Related papers: A refined lower bound theorem for $d$-polytopes wi…

200 papers

The Lasserre's reconstruction algorithm is extended to the D-polytopes with the construction of their shape space. Thus, the areas of d-skeletons $(1\leq d\leq D)$ can be expressed as functions of the areas and normal bi-vectors of the…

General Relativity and Quantum Cosmology · Physics 2022-01-19 Gaoping Long , Yongge Ma

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.

Combinatorics · Mathematics 2010-06-01 Antoine Deza , Tamon Stephen , Feng Xie

We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer…

Optimization and Control · Mathematics 2015-02-19 Sönke Behrends , Ruth Hübner , Anita Schöbel

Given a lower envelope in the form of an arbitrary sequence $u$, let $LSP(u, d)$ denote the maximum length of any subsequence of $u$ that can be realized as the lower envelope of a set of polynomials of degree at most $d$. Let $sp(m, d)$…

Combinatorics · Mathematics 2016-06-07 Jesse Geneson

We address the following generalization $P$ of the Lowner-John ellipsoid problem. Given a (non necessarily convex) compact set $K\subset R^n$ and an even integer $d$, find an homogeneous polynomial $g$ of degree $d$ such that $K\subset…

Optimization and Control · Mathematics 2014-12-24 Jean-Bernard Lasserre

We give essentially tight bounds for, $\nu(d,k)$, the maximum number of distinct neighbourhoods on a set $X$ of $k$ vertices in a graph with twin-width at most~$d$. Using the celebrated Marcus-Tardos theorem, two independent works [Bonnet…

Combinatorics · Mathematics 2023-08-08 Édouard Bonnet , Florent Foucaud , Tuomo Lehtilä , Aline Parreau

The number of faces of the convex hull of $n$ independent and identically distributed random points chosen on the boundary of a smooth convex body in $\mathbb{R}^d$ is investigated. In dimensions two and three the number of $k$-faces is…

Probability · Mathematics 2025-09-25 Matthias Reitzner , Mathias Sonnleitner

We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…

Combinatorics · Mathematics 2007-05-23 Torsten Schöneborn

A smooth rigidity inequalitiy provides an explicit lower bound for the $(d+1)$-st derivatives of a smooth function $f$, which holds, if $f$ exhibits certain patterns, forbidden for polynomials of degree $d$. The main goal of the present…

Classical Analysis and ODEs · Mathematics 2021-06-15 Yosef Yomdin

We prove that for $k \in \mathbb{N}$ and $d \leq 2k+2$, if a graph has maximum average degree at most $2k + \frac{2d}{d+k+1}$, then $G$ decomposes into $k+1$ pseudoforests, where one of the pseudoforests has all connected components having…

Combinatorics · Mathematics 2019-06-27 Logan Grout , Benjamin Moore

Let $K$ be a convex body in $\Bbb R^{d}$ and $K_{t}$ its floating bodies. There is a polytope with at most $n$ vertices that satisfies $$ K_{t} \subset P_{n} \subset K $$ where $$ n \leq e^{16d} \frac{vol_{d}(K \setminus K_{t})}{t\…

Metric Geometry · Mathematics 2015-06-26 Carsten Schütt

There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…

Combinatorics · Mathematics 2007-05-23 Fu Liu

The polytope $ASM_n$, the convex hull of the $n\times n$ alternating sign matrices, was introduced by Striker and by Behrend and Knight. A face of $ASM_n$ corresponds to an elementary flow grid defined by Striker, and each elementary flow…

Combinatorics · Mathematics 2025-03-17 Elizabeth A. Dinkelman , Walter D. Morris

Let $d$ and $n$ be positive integers with $n \geq d + 1$ and $\tau_{1}, ..., \tau_{n}$ integers with $\tau_{1} < ... < \tau_{n}$. Let $C_{d}(\tau_{1}, ..., \tau_{n}) \subset \RR^{d}$ denote the cyclic polytope of dimension $d$ with $n$…

Combinatorics · Mathematics 2019-02-20 Takayuki Hibi , Akihiro Higashitani , Lukas Katthän , Ryota Okazaki

Given two univalent harmonic mappings $f_1$ and $f_2$ on $\mathbb{D}$, which lift to minimal surfaces via the Weierstrass-Enneper representation theorem, we give necessary and sufficient conditions for $f_3=(1-s)f_1+sf_2$ to lift to a…

Differential Geometry · Mathematics 2007-05-23 Michael Dorff , Stephen Taylor

The Birkhoff polytope B(n) is the convex hull of all (n x n) permutation matrices, i.e., matrices where precisely one entry in each row and column is one, and zeros at all other places. This is a widely studied polytope with various…

Combinatorics · Mathematics 2013-04-16 Andreas Paffenholz

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

Algebraic Geometry · Mathematics 2021-07-20 Alexander J. Sutherland

In terms of the number of triangles, it is known that there are more than exponentially many triangulations of surfaces, but only exponentially many triangulations of surfaces with bounded genus. In this paper we provide a first geometric…

Combinatorics · Mathematics 2018-05-10 Karim Adiprasito , Bruno Benedetti

We give a formula for the smallest degree of a non-Koszul relation on $x_1^{d_1}, \ldots, x_n^{d_n}, (x_1+\ldots +x_n)^{d_{n+1}}\in k[x_1, \ldots, x_n]$ (under certain assumptions on $d_1, \ldots, d_{n+1}$) where $k$ is a field of positive…

Commutative Algebra · Mathematics 2015-10-05 Adela Vraciu

For any positive real number $p$, the $p$-frame potential of $N$ unit vectors $X:=\{\mathbf x_1,\ldots,\mathbf x_N\}\subset \mathbb R^d$ is defined as ${\rm FP}_{p,N,d}(X)=\sum_{i\neq j}|\langle \mathbf x_i,\mathbf x_j\rangle |^p$. In this…

Functional Analysis · Mathematics 2020-07-29 Zhiqiang Xu , Zili Xu
‹ Prev 1 8 9 10 Next ›