Related papers: Minimum weight disk triangulations and fillings
This paper is interested in the computation of stresses within jammed packings of rigid polygonal cells. The cells are considered to follow a Tresca friction law. First, a constrained minimization problem is introduced where the friction…
A compact packing is a set of non-overlapping discs where all the holes between discs are curvilinear triangles. There is only one compact packing by discs of size $1$. There are exactly $9$ values of $r$ which allow a compact packing by…
We consider the analogue of Rayleigh's conjecture for the clamped plate in Euclidean space weighted by a log-convex density. We show that the lowest eigenvalue of the bi-Laplace operator with drift in a given domain is bounded below by a…
This paper contains examples of closed aspherical manifolds obtained as a by-product of recent work by the author [arXiv:math.GR/0509490] on the relative strict hyperbolization of polyhedra. The following is proved. (I) Any closed…
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide formulae for the minimum Wiener index of simple triangulations and quadrangulations with connectivity at least $c$, and…
We are interested in the following problem of covering the plane by a sequence of congruent circular disks with a constraint on the distance between consecutive disks. Let $(\mathcal{D}_n)_{n \in \mathbb N}$ be a sequence of closed unit…
In a wireless sensor network, the virtual backbone plays an important role. Due to accidental damage or energy depletion, it is desirable that the virtual backbone is fault-tolerant. A fault-tolerant virtual backbone can be modeled as a…
We describe an algorithm that, given a 3-manifold M, outputs a finite set containing all minimal volume k-component hyperbolic link complements in M. A key step, that might be of independent interest, is an algorithm that, given two…
We establish combinatorial versions of various classical systolic inequalities. For a smooth triangulation of a closed smooth manifold, the minimal number of edges in a homotopically non-trivial loop contained in the $1$-skeleton gives an…
We prove that given a three manifold with an arbitrary metric $(M^3, g)$ of positive Ricci curvature, there exists a sweepout of $M$ by surfaces of genus $\leq 3$ and areas bounded by $C vol(M^3, g)^{2/3}$. We use this result to construct a…
We consider the problem of covering the boundary of a simple polygon on n vertices using the minimum number of geodesic unit disks. We present an O(n \log^2 n+k) time 2-approximation algorithm for finding the centers of the disks, with k…
In this paper, the following two theorems are proved: $(1)$ every spherical convex body $W$ of constant width $\Delta (W) \geq \frac{\pi}{2}$ may be covered by a disk of radius $\Delta(W) + \arcsin \left( \frac{2\sqrt{3}}{3} \cdot \cos…
For every $n\ge 3$ we determine the minimum number of edges of graph with $n$ vertices such that for any non edge $xy$ there exits a hamiltonian cycle containing $xy$.
In this paper, we address the minimum-area rectangular and square annulus problem, which asks a rectangular or square annulus of minimum area, either in a fixed orientation or over all orientations, that encloses a set $P$ of $n$ input…
In this paper, we prove that the smallest even sets in ${\rm PG}(n,q)$, i.e. sets that intersect every line in an even number of points, are cylinders with a hyperoval as base. This fits into a more general study of dual projective…
Previous studies has shown that for a weighted undirected graph having $n$ vertices and $m$ edges, a minimal weight spanning tree can be found with $O^*(\sqrt{mn})$ calls to the weight oracle. The present note shows that a given spanning…
In the weak-coupling limit, kappa_0 going to infinity, the partition function of simplicial quantum gravity is dominated by an ensemble of triangulations with the ratio N_0/N_D close to the upper kinematic limit. For a combinatorial…
We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…
We determine the minimal volume of arithmetic hyperbolic orientable n-dimensional orbifolds (compact and non-compact) for every odd dimension n>3. Combined with the previously known results it solves the minimal volume problem for…
The distance of a graph from being triangle-free is a fundamental graph parameter, counting the number of edges that need to be removed from a graph in order for it to become triangle-free. Its corresponding computational problem is the…