相关论文: The filling problem in the cube
In this article we exhibit the largest constant in a quadratic isoperimetric inequality which ensures that a geodesic metric space is Gromov hyperbolic. As a particular consequence we obtain that Euclidean space is a borderline case for…
We consider the punctured plane with volume density $|x|^\alpha$ and perimeter density $|x|^\beta$. We show that centred balls are uniquely isoperimetric for indices $(\alpha,\beta)$ which satisfy the conditions $\alpha-\beta+1>0$,…
We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…
This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…
We derive formulas for the number of polycubes of size $n$ and perimeter $t$ that are proper in $n-1$ and $n-2$ dimensions. These formulas complement computer based enumerations of perimeter polynomials in percolation problems. We…
In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…
We investigate the filling area conjecture, optimal systolic inequalities, and the related problem of the nonvanishing of certain linking numbers in 3-manifolds.
An efficient integral equation based solver is constructed for the electrostatic problem on domains with cuboidal inclusions. It can be used to compute the polarizability of a dielectric cube in a dielectric background medium at virtually…
In this paper, we deals with isoperimetric-type inequalities for closed convex curves in the Euclidean plane R^2. We derive a family of parametric inequalities involving the following geometric functionals associated to a given convex curve…
We prove a quantitative isoperimetric inequality for the nearly spherical subset of the Bergman ball in $\mathbb{C}^n$. We prove the Fuglede theorem for such sets. This result is a counterpart of a similar result obtained for the hyperbolic…
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…
We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…
This paper focuses on the embeddability of hypercubes in an important class of Cayley graphs, known as augmented cubes. An $n$-dimensional augmented cube $AQ_n$ is constructed by augmenting the $n$-dimensional hypercube $Q_n$ with…
We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…
The quadratic cycle cover problem is the problem of finding a set of node-disjoint cycles visiting all the nodes such that the total sum of interaction costs between consecutive arcs is minimized. In this paper we study the linearization…
We consider capillarity functionals which measure the perimeter of sets contained in a Euclidean half-space assigning a constant weight $\lambda \in (-1,1)$ to the portion of the boundary that touches the boundary of the half-space.…
A perfect Euler cuboid is a rectangular parallelepiped with integer edges, with integer face diagonals, and with integer space diagonal as well. Finding such parallelepipeds or proving their non-existence is an old unsolved mathematical…
Task mapping in modern high performance parallel computers can be modeled as a graph embedding problem, which simulates the mapping as embedding one graph into another and try to find the minimum wirelength for the mapping. Though embedding…
This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…
It is a classical fact in Euclidean geometry that the regular polygon maximizes area amongst polygons of the same perimeter and number of sides, and the analogue of this in non-Euclidean geometries has long been a folklore result. In this…