English
Related papers

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

200 papers

We show that $m$ points and $n$ two-dimensional algebraic surfaces in $\mathbb{R}^4$ can have at most $O(m^{\frac{k}{2k-1}}n^{\frac{2k-2}{2k-1}}+m+n)$ incidences, provided that the algebraic surfaces behave like pseudoflats with $k$ degrees…

Combinatorics · Mathematics 2018-07-18 Joshua Zahl

Consider a subset [1,2,...,n]x[1,2,...,n] of the plane integer lattice. Take any non self-intersecting n^2-gon built on it (straight angles are allowed). The square of a side length is a positive integer. It is thus natural to ask how large…

Combinatorics · Mathematics 2024-05-21 Oliver Mantas Ališauskas , Giedrius Alkauskas , Valdas Dičiūnas

The new result of this paper connected with the following problem: Consider a supporting hyperplane of a regular simplex and its re ected image at this hyperplane. When will be the volume of the convex hull of these two simplices maximal?…

Metric Geometry · Mathematics 2018-11-30 Ákos G. Horváth

A hypersurface $M$ in $\mathbb{R}^n$, $n \geq 4$, has central ovaloid property if $M$ intersects some hyperplane transversally along an ovaloid and every such ovaloid on $M$ has central symmetry. We show that a complete, connected, smooth…

Differential Geometry · Mathematics 2016-05-11 Metin Alper Gur

For an arbitrary convex quadrilateral $ABCD$ with area ${\cal A}$ and perimeter $p$, we define two points $I_1, I_2$ on its Newton line that serve as incenters. These points are the centers of two circles with radii $r_1, r_2$ that are…

History and Overview · Mathematics 2017-12-07 Nikolaos Dergiades , Dimitris M. Christodoulou

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

Combinatorics · Mathematics 2007-05-23 David Orden , Francisco Santos

In this paper we investigate partial spreads of $H(2n-1,q^2)$ through the related notion of partial spread sets of hermitian matrices, and the more general notion of constant rank-distance sets. We prove a tight upper bound on the maximum…

Combinatorics · Mathematics 2013-06-05 Rod Gow , Michel Lavrauw , John Sheekey , Frédéric Vanhove

Twinned chain polytopes form a broad class of non-centrally symmetric reflexive polytopes and exhibit intriguing structures. In the present paper, we show that the number of facets of $d$-dimensional twinned chain polytopes is at most…

Combinatorics · Mathematics 2025-12-01 Aki Mori , Kenta Mori , Hidefumi Ohsugi

Let $k\ge 3$ be an odd integer and let $n$ be a sufficiently large integer. We prove that the maximum number of edges in an $n$-vertex $k$-uniform hypergraph containing no $2$-regular subgraphs is $\binom{n-1}{k-1} + \lfloor\frac{n-1}{k}…

Combinatorics · Mathematics 2018-01-24 Jie Han , Jaehoon Kim

We show that a central linear mapping of a projectively embedded Euclidean $n$-space onto a projectively embedded Euclidean $m$-space is decomposable into a central projection followed by a similarity if, and only if, the least singular…

Algebraic Geometry · Mathematics 2012-10-09 Hans Havlicek

We prove that a minimal $t$-fold blocking set in a finite projective plane of order $n$ has cardinality at most \[\frac{1}{2} n\sqrt{4tn - (3t + 1)(t - 1)} + \frac{1}{2} (t - 1)n + t.\] This is the first general upper bound on the size of…

Combinatorics · Mathematics 2018-12-14 Anurag Bishnoi , Sam Mattheus , Jeroen Schillewaert

We present explicit constructions of centrally symmetric 2-neighborly d-dimensional polytopes with about 3^{d/2} = (1.73)^d vertices and of centrally symmetric k-neighborly d-polytopes with about 2^{c_k d} vertices where c_k=3/20 k^2 2^k.…

Metric Geometry · Mathematics 2012-04-20 Alexander Barvinok , Seung Jin Lee , Isabella Novik

Let $E_d(n)$ be the maximum number of pairs that can be selected from a set of $n$ points in $R^d$ such that the midpoints of these pairs are convexly independent. We show that $E_2(n)\geq \Omega(n\sqrt{\log n})$, which answers a question…

Combinatorics · Mathematics 2011-08-26 Konrad J. Swanepoel , Pavel Valtr

An ordinary hypersphere of a set of points in real $d$-space, where no $d+1$ points lie on a $(d-2)$-sphere or a $(d-2)$-flat, is a hypersphere (including the degenerate case of a hyperplane) that contains exactly $d+1$ points of the set.…

Combinatorics · Mathematics 2021-02-11 Aaron Lin , Konrad Swanepoel

We show that the only nonlocal $s$-minimal cones in $\R^2$ are the trivial ones for all $s \in (0,1)$. As a consequence we obtain that the singular set of a nonlocal minimal surface has at most $n-3$ Hausdorff dimension.

Analysis of PDEs · Mathematics 2012-02-07 Ovidiu Savin , Enrico Valdinoci

In this paper, we study geometry of totally real minimal surfaces in the complex hyperquadric $Q_{N-2}$, and obtain some characterizations of the harmonic sequence generated by these minimal immersions. For totally real flat surfaces that…

Differential Geometry · Mathematics 2020-01-09 Ling He , Xiaoxiang Jiao , Mingyan Li

In this article, we generalize our previous results joint with Pedro Gaspar to higher dimensions, prove the existence of (infinitely many) eternal weak mean curvature flows in $S^{n+1}$ (for all $n \geq 2$) connecting a Clifford…

Differential Geometry · Mathematics 2023-10-26 Jingwen Chen

We improve Larman's bound on the diameter of a polytope by showing that if $\Delta$ is a normal simplicial complex, all of whose missing faces have size at most $r$, then the diameter of the facet-ridge graph of $\Delta$ is not larger than…

Combinatorics · Mathematics 2013-03-28 Isabella Novik

Recent results in quantization theory show that the mean-squared expected distortion can reach a rate of convergence of $\mathcal{O}(1/n)$, where $n$ is the sample size [see, e.g., IEEE Trans. Inform. Theory 60 (2014) 7279-7292 or Electron.…

Statistics Theory · Mathematics 2015-04-02 Clément Levrard

A well-known result by Kant [Algorithmica, 1996] implies that n-vertex outerplane graphs admit embedding-preserving planar straight-line grid drawings where the internal faces are convex polygons in $O(n^2)$ area. In this paper, we present…

Computational Geometry · Computer Science 2025-08-28 Michael A. Bekos , Giordano Da Lozzo , Fabrizio Frati , Giuseppe Liotta , Antonios Symvonis