English
Related papers

Related papers: Non-central sections of the regular n-simplex

200 papers

The limit of families of two-dimensional conformal field theories has recently attracted attention in the context of AdS/CFT dualities. In our work we analyse the limit of N=(2,2) superconformal minimal models when the central charge…

High Energy Physics - Theory · Physics 2015-06-04 Stefan Fredenhagen , Cosimo Restuccia , Rui Sun

In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…

Metric Geometry · Mathematics 2012-12-27 Alexey Glazyrin

We prove the existence of a one parameter family of minimal embedded hypersurfaces in $R^{n+1}$, for $n \geq 3$, which generalize the well known 2 dimensional "Riemann minimal surfaces". The hypersurfaces we obtain are complete, embedded,…

Differential Geometry · Mathematics 2007-05-23 S. Kaabachi , F. Pacard

We show that the maximum number of pairwise intersecting positive homothets of a $d$-dimensional centrally symmetric convex body, none of which contains the center of another in its interior, is at most $3^{d+1}$. Also, we improve upper…

Metric Geometry · Mathematics 2019-04-15 Alexandr Polyanskii

This paper concerns the facial geometry of the set of $n \times n$ correlation matrices. The main result states that almost every set of $r$ vertices generates a simplicial face, provided that $r \leq \sqrt{\mathrm{c} n}$, where…

Metric Geometry · Mathematics 2018-01-03 Joel A. Tropp

Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of $n$ points in strictly convex normed planes can be constructed in $O(n \log n)$ time. In addition, we confirm that,…

Metric Geometry · Mathematics 2014-11-28 Pedro Martín , Horst Martini

We explore the maximality of the Hilbert square of maximal real surfaces, and find that in many cases the Hilbert square is maximal if and only if the surface has connected real locus. In particular, the Hilbert square of no maximal…

Algebraic Geometry · Mathematics 2025-11-17 Viatcheslav Kharlamov , Rareş Răsdeaconu

It is well known that any planar convex body $A$ permits to inscribe an affine-regular hexagon $H_A$. We prove that the centroid of $A$ belongs to the homothetic image of $H_A$ with ratio $\frac{4}{21}$ and the center in the center of…

Functional Analysis · Mathematics 2022-12-22 Marek Lassak

A double-normal pair of a finite set $S$ of points from Euclidean space is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ that are perpendicular to $pq$. A…

Combinatorics · Mathematics 2015-09-07 János Pach , Konrad J. Swanepoel

In this paper we deal with edge-to-edge, irreducible decompositions of a centrally symmetric convex $(2k)$-gon into centrally symmetric convex pieces. We prove an upper bound on the number of these decompositions for any value of $k$, and…

Metric Geometry · Mathematics 2016-02-09 Júlia Frittmann , Zsolt Lángi

Examples of algebraic surfaces of general type with maximal Picard number are not abundant in the literature. Moreover, most known examples either possess low invariants, lie near the Noether line $K^2=2\chi-6$ or are somewhat scattered. A…

Algebraic Geometry · Mathematics 2024-11-20 Nguyen Bin , Vicente Lorenzo

We give upper bounds on the principal curvatures of a maximal surface of nonpositive curvature in three-dimensional Anti-de Sitter space, which only depend on the width of the convex hull of the surface. Moreover, given a quasisymmetric…

Differential Geometry · Mathematics 2019-05-20 Andrea Seppi

Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2…

Discrete Mathematics · Computer Science 2011-12-16 Stefan Dobrev , Evangelos Kranakis , Danny Krizanc , Oscar Morales-Ponce , Ladislav Stacho

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

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

Probability · Mathematics 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

Non-Euclidean triangle centers can be described using homogeneous coordinates that are proportional to the generalized sines of the directed distances of a given center from the edges of the reference triangle. Identical homogeneous…

Metric Geometry · Mathematics 2024-06-25 Robert A. Russell

We give an explicit construction, based on Hadamard matrices, for an infinite series of floor{sqrt{d}/2}-neighborly centrally symmetric d-dimensional polytopes with 4d vertices. This appears to be the best explicit version yet of a recent…

Metric Geometry · Mathematics 2007-05-23 Julian Pfeifle

It is well-known that the triangulations of the disc with $n+2$ vertices on its boundary are counted by the $n$th Catalan number $C(n)=\frac{1}{n+1}{2n \choose n}$. This paper deals with the generalisation of this problem to any arbitrary…

Combinatorics · Mathematics 2012-03-14 Olivier Bernardi , Juanjo Rué

In 2008, Bukh, Matousek, and Nivasch conjectured that for every n-point set S in R^d and every k, 0 <= k <= d-1, there exists a k-flat f in R^d (a "centerflat") that lies at "depth" (k+1) n / (k+d+1) - O(1) in S, in the sense that every…

Computational Geometry · Computer Science 2012-05-03 Boris Bukh , Gabriel Nivasch

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

Combinatorics · Mathematics 2024-04-24 Arnau Padrol , Eva Philippe , Francisco Santos