相关论文: Hyperplane Arrangements with Large Average Diamete…

We determine the maximal non-central hyperplane sections of the n-dimensional $l_1$-ball if the fixed distance of the hyperplane to the origin is between $1 / \sqrt 3$ and $1 / \sqrt 2$. This adds to a result of Liu and Tkocz who considered…

This paper contains a new concept to measure the width and thickness of a convex body in the hyperbolic plane. We compare the known concepts with the new one and prove some results on bodies of constant width, constant diameter and given…

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…

R. Beheshti showed that, for a smooth Fano hypersurface $X$ of degree $\leq 8$ over the complex number field $\mathbb{C}$, the dimension of the space of lines lying in $X$ is equal to the expected dimension. We study the space of conics on…

We derive a new upper bound on the diameter of a polyhedron P = {x \in R^n : Ax <= b}, where A \in Z^{m\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \Delta. More precisely, we…

Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. In a recent work, we have determined the maximal dimension for a linear subspace of $n$ by $n$ symmetric matrices with rank less than or equal to…

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

We obtain several results for (iterated) planar contact manifolds in higher dimensions: (1) Iterated planar contact manifolds are not weakly symplectically semi-fillable. This generalizes a 3-dimensional result of Etnyre to a…

For any H in [0,1), we construct complete, non-proper, stable, simply-connected surfaces with constant mean curvature H embedded in hyperbolic 3-space.

In a convex mosaic in $\mathbb{R} ^d$ we denote the average number of vertices of a cell by $\bar v$ and the average number of cells meeting at a node by $\bar n$. Except for the $d=2$ planar case, there is no known formula prohibiting…

We show that the hyperplane conjecture holds for the classes of $k$-intersection bodies with arbitrary measures in place of volume.

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…

We study symplectic embeddings of ellipsoids into balls. In the main construction, we show that a given embedding of 2m-dimensional ellipsoids can be suspended to embeddings of ellipsoids in any higher dimension. In dimension 6,s if the…

Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-$k$ Delaunay if the…

Higher-dimensional rewriting is founded on a duality of rewrite systems and cell complexes, connecting computational mathematics to higher categories and homotopy theory: the two sides of a rewrite rule are two halves of the boundary of an…

A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…

Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…

We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…