Related papers: A General Method to Determine Limiting Optimal Sha…
This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…
We generalize optimal inequalities of C. Loewner and M. Gromov, by proving lower bounds for the total volume in terms of the homotopy systole and the stable systole. Our main tool is the construction of an area-decreasing map to the Jacobi…
This paper concerns the construction and analysis of a numerical scheme for a mixed discrete-continuous fragmentation equation. A finite volume scheme is developed, based on a conservative formulation of a truncated version of the…
In this paper, we study the anisotropic Minkowski problem. It is a problem of prescribing the anisotropic Gauss-Kronecker curvature for a closed strongly convex hypersurface in Euclidean space as a function on its anisotropic normals in…
This paper develops and compares algorithms to compute inner approximations of the Minkowski sum of convex polytopes. As an application, the paper considers the computation of the feasibility set of aggregations of distributed energy…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
For a Minkowski centered convex compact set $K$ we define $\alpha(K)$ to be the smallest possible factor to cover $K \cap (-K)$ by a rescalation of $\mathrm{conv} (K\cup (-K))$ and give a complete description of the possible values of…
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
A unified approach used to generalize classical Brunn-Minkowski type inequalities to Lp Brunn-Minkowski type inequalities, called the Lp transference principle, is refined in this paper. As illustrations of the effectiveness and…
A polytope $P$ is a {\em model} for a combinatorial problem on finite graphs $G$ whose variables are indexed by the edge set $E$ of $G$ if the points of $P$ with (0,1)-coordinates are precisely the characteristic vectors of the subset of…
For causal graphs we propose a definition of proper time which for small scales is based on the concept of volume, while for large scales the usual definition of length is applied. The scale where the change from "volume" to "length" occurs…
Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up…
We introduce a new infinite family of regular graphs admitting nested solutions in the edge-isoperimetric problem for all their Cartesian powers. The obtained results include as special cases most of previously known results in this area.
We give an asymptotic formula for the minimum number of edges contained in triangles in a graph having n vertices and e edges. Our main tool is a generalization of Zykov's symmetrization method that can be applied for several graphs…
Minkowski's second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski's bound by replacing the volume by the lattice point…
The aim of this paper is to study properties of sections of convex bodies with respect to different types of measures. We present a formula connecting the Minkowski functional of a convex symmetric body K with the measure of its sections.…
We introduce the dual isoperimetrix which solves the isoperimetric problem in the dual Brunn-Minkowski theory. We then show how the dual isoperimetrix is related to the isoperimetrix from the Brunn-Minkowski theory.
In this paper we prove the existence of isoperimetric regions of any volume in Riemannian manifolds with Ricci bounded below assuming Gromov--Hausdorff asymptoticity to the suitable simply connected model of constant sectional curvature.…