Related papers: The maximum diameter of $d$-dimensional simplicial…
We study a higher-dimensional analogue of the {Random Travelling Salesman Problem}: let the complete $d$-dimensional simplicial complex $K_n^{d}$ on $n$ vertices be equipped with i.i.d.\ volumes on its facets, uniformly random in $[0,1]$.…
It is shown here that the diameter of the $d$-dimensional cyclohedron is not greater than $\lceil 5d/2\rceil-2$. It is also shown that the $5/2$ coefficient in this upper bound is asymptotically sharp. More precisely, the $d$-dimensional…
We explore upper bounds on the covering radius of non-hollow lattice polytopes. In particular, we conjecture a general upper bound of $d/2$ in dimension $d$, achieved by the "standard terminal simplices" and direct sums of them. We prove…
We generalize the maximal diameter sphere theorem due to Toponogov by means of the radial curvature. As a corollary to our main theorem, we prove that for a complete connected Riemannian $n$-manifold $M$ having radial sectional curvature at…
We study the generic volume rigidity of $(d-1)$-dimensional simplicial complexes in $\mathbb R^{d-1}$, and show that the volume rigidity of a complex can be identified in terms of its exterior shifting. In addition, we establish the volume…
A sequence $D = \{d_1,...d_n\}$ is a feasible degree sequence if there is a graph on $\{1,...,n\}$ such that $i$ has degree $d_i$. For such a sequence, $G(D)$ is a graph chosen uniformly at random from those with the given degree sequence.…
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is central in fine-grained complexity. In undirected graphs, the Strong Exponential Time Hypothesis (SETH) yields a lower bound on the time vs.…
The largest possible average diameter of a bounded cell of a simple hyperplane arrangement is conjectured to be not greater than the dimension. We prove that this conjecture holds in dimension 2, and is asymptotically tight in fixed…
We show that for $d\geq 2$ every finite $d$-dimensional simplicial complex is a deformation retract of a $(2d-1)$-dimensional pseudomanifold with boundary. Moreover, it embeds as a retract in a closed $(2d-1)$-dimensional pseudomanifold.
The structure of $k$-diametral point configurations in Minkowski $d$-space is shown to be closely related to the properties of $k$-antipodal point configurations in $\mathbb{R}^d$. In particular, the maximum size of $k$-diametral point…
We use Priestley duality as a new tool to study maximal $d$-spectra of arithmetic frames, both with and without units. We pay special attention to when the maximal $d$-spectrum is compact or Hausdorff. Various necessary and sufficient…
Complex particle is a kind of bilocal particle having unexpected symmetry, which was proposed by the authour. In the present paper, we show that critical dimension of the complex particle in Minkowski spacetime is $D = 4$, while $D = 2, 4$…
In this paper, we consider a generalized version of the rectilinear crossing number problem of drawing complete graphs on a plane. The minimum number of crossing pairs of hyperedges in the $d$-dimensional rectilinear drawing of a…
We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…
In this work we study the maximum relative diameter functional $d_M$ in the class of multi-rotationally symmetric planar convex bodies. A given set $C$ of this class is $k$-rotationally symmetric for $k\in\{k_1,\ldots,k_n\}\subset\nn$, and…
We determine which simplicial complexes have the maximum or minimum sum of Betti numbers and sum of bigraded Betti numbers with a given number of vertices in each dimension.
A well-known conjecture of Simon (1994) states that any pure $d$-dimensional shellable complex on $n$ vertices can be extended to $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the $(n-1)$-dimensional simplex, by attaching one facet at a time…
Building on Whitney's classical method of triangulating smooth manifolds, we show that every compact $d$-dimensional smooth manifold admits a triangulation with dual graph of twin-width at most $d^{O(d)}$. In particular, it follows that…
For each fixed $d\ge 1$, we obtain asymptotic estimates for the number of $d$-representable simplicial complexes on $n$ vertices as a function of $n$. The case $d=1$ corresponds to counting interval graphs, and we obtain new results in this…
In this article we derive an explicit diameter bound for graphs satisfying the so-called curvature dimension conditions $CD(K,n)$. This refines a recent result due to Liu, M\"unch and Peyerimhoff when the dimension $n$ is finite.