Related papers: Minkowski complexes and convex threshold dimension

The theory of complex dimensions of fractal strings developed by Lapidus and van Frankenhuijsen has proven to be a powerful tool for the study of Minkowski measurability of fractal subsets of the real line. In a very general setting, the…

In this paper, we deal with the successive inner and outer radii with respect to Orlicz Minkowski sum. The upper and lower bounds for the radii of the Orlicz Minkowski sum of two convex bodies are established.

We extend the construction of a spectral triple for k-Minkowski space, previously given for the two-dimensional case, to the general n-dimensional case. This takes into account the modular group naturally arising from the symmetries of the…

Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…

In this article we carry out a detailed investigation of the geometric nature of the points at infinity of Minkowski superspace. It turns out that there are several sets of points forming the superconformal boundary of Minkowski superspace:…

We associate convex regions in R^n to m-primary graded sequences of subspaces, in particular m-primary graded sequences of ideals, in a large class of local algebras (including analytically irreducible local domains). These convex regions…

In this work we prove a Brunn-Minkowski-type inequality in the context of symplectic geometry and discuss some of its applications.

Existing theories on deep nonparametric regression have shown that when the input data lie on a low-dimensional manifold, deep neural networks can adapt to the intrinsic data structures. In real world applications, such an assumption of…

We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…

We prove the log-Brunn-Minkowski conjecture for convex bodies with symmetries to $n$ independent hyperplanes, and discuss the equality case and the uniqueness of the solution of the related case of the logarithmic Minkowski problem. We also…

In this note we consider two topics involving the relationship between the symplectic capacity and the mean width of convex bodies in $\mathbb{R}^{2n}$. We first describe an alternative path from the symplectic Brunn-Minkowski inequality of…

Given a convex body $Q$ (structuring element) and a set $A$ in a Euclidean space, we consider the $Q$-Minkowski content of $A$. It is defined as the usual isotropic Minkowski content of $A$, but where the Euclidean ball is replaced by $Q$.…

In this short note we explain why the log-Brunn-Minkowski conjecture is correct for complex convex bodies. We do this by relating the conjecture to the notion of complex interpolation, and appealing to a general theorem by…

Since the end of the 19th century, and after the works of F. Klein and H. Poincar\'e, it is well known that models of elliptic geometry and hyperbolic geometry can be given using projective geometry, and that Euclidean geometry can be seen…

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r<d$, as a (recursively defined)…

The first two authors of this paper asserted in Lemma 4 of "New Farkas-type constraint qualifications in convex infinite programming" (DOI: 10.1051/cocv:2007027) that a given reverse convex inequality is consequence of a given convex system…

We consider subsets of the (symbolic) sequence space that are invariant under the action of the semigroup of multiplicative integers. A representative example is the collection of all 0-1 sequences $(x_k)$ such that $x_k x_{2k}=0$ for all…

We consider the problem of minimizing convex combinations of the first two eigenvalues of the Dirichlet-Laplacian among open sets of $R^N$ of fixed measure. We show that, by purely elementary arguments, based on the minimality condition, it…

We give a proof to the following theorem, which is well-known among experts: A connected subcomplex $W$ of a finite dimensional CAT(0) cubed complex $X$ is convex if and only if Lk$(v, W)$ is a full subcomplex of Lk$(v, X)$ for every vertex…

We discuss the definition and measurability questions of random fractals and find under certain conditions a formula for upper and lower Minkowski dimensions. For the case of a random self-similar set we obtain the packing dimension.