Related papers: The filling problem in the cube
In this paper we formulate the problem of packing unequal rectangles/squares into a fixed size circular container as a mixed-integer nonlinear program. Here we pack rectangles so as to maximise some objective (e.g. maximise the number of…
Let $(M^n,g)$ be simply connected, complete, with non-positive sectional curvatures, and $\Sigma$ a 2-dimensional closed integral current (or flat chain mod 2) with compact support in $M$. Let $S$ be an area minimising integral 3-current…
The discrete isoperimetric inequality states that among all n -gons with a fixed area, the regular n -gon has the least perimeter. We prove analogues of the discrete isoperimetric inequality (involving circumradius or inradius) for cyclic…
In this paper, we study online multidimensional bin packing problem when all items are hypercubes. Based on the techniques in one dimensional bin packing algorithm Super Harmonic by Seiden, we give a framework for online hypercube packing…
The isoperimetric problem with a density or weighting seeks to enclose prescribed weighted volume with minimum weighted perimeter. According to Chambers' recent proof of the log-convex density conjecture, for many densities on…
We study quantitative isoperimetric inequalities for two different perimeter-type functionals. We first consider classical capillarity functionals, which measure the perimeter of sets in a Euclidean half-space, assigning a constant weight…
We consider the isoperimetric problem in $\mathbb R^n$ with density for the planar case $n=2$. We show that, if the density is ${\rm C}^{0,\alpha}$, then the boundary of any isoperimetric is of class ${\rm C}^{1,\frac \alpha{3-2\alpha}}$.…
We consider the problem of minimizing the relative perimeter under a volume constraint in an unbounded convex body $C\subset \mathbb{R}^{n+1}$, without assuming any further regularity on the boundary of $C$. Motivated by an example of an…
We prove the existence of isoperimetric regions in $\R^n$ with density under various hypotheses on the growth of the density. Along the way we prove results on the boundedness of isoperimetric regions.
Many intracellular processes continue to oscillate during the cell cycle. Although it is not well-understood how they are affected by discontinuities in the cellular environment, the general assumption is that oscillations remain robust…
We show that the the image of the regular projection of a vertex of a cone over a triangle that minimizes the ratio of the cube of the area of the boundary of the cone and the square of the volume of the cone coincides with the incenter.
We consider the edge- and vertex-isoperimetric probem on finite and infinite hexagonal grids: For a subset W of the hexagonal grid of given cardinality, we give a lower bound for the number of edges between W and its complement, and lower…
Optimal higher-order Sobolev type embeddings are shown to follow via isoperimetric inequalities. This establishes a higher-order analogue of a well-known link between first-order Sobolev embeddings and isoperimetric inequalities. Sobolev…
The contour integrals, occurring in the arbitrary-order phase-integral quantization conditions given in a previous paper, are in the first- and third-order approximations expressed in terms of complete elliptic integrals in the case that…
We investigate the distribution of cells by dimension in cylindrical algebraic decompositions (CADs). We find that they follow a standard distribution which seems largely independent of the underlying problem or CAD algorithm used. Rather,…
We prove isoperimetric inequalities for quotients of $n$-dimensional Affine buildings. We use these inequalities to prove topological overlapping for the 2-dimensional skeletons of these buildings.
We study edge-isoperimetric inequalities in chamber graphs of affine hyperplane arrangements. Our approach is topological: to a set of chambers we associate its thickening in Euclidean space and estimate its edge boundary through the…
We prove a counterpart of the log-convex density conjecture in the hyperbolic plane.
Given a collection $L$ of line segments, we consider its arrangement and study the problem of covering all cells with line segments of $L$. That is, we want to find a minimum-size set $L'$ of line segments such that every cell in the…
Let A be a finite dimensional symmetric cllular algebras. We construct a nilpotent ideal in A. The ideal connects the radicals of cell modules with the radical of the algebra. It also reveals some information on the dimensions of simple…