Related papers: On a formula for all sets of constant width in 3d

In this paper we provide explicit upper and lower bounds on certain $L^2$ $n$-widths, i.e., best constants in $L^2$ approximation. We further describe a numerical method to compute these $n$-widths approximately, and prove that this method…

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

In this note, we first try to prove a uniform lower bound of nodal volume in elliptic homogenization setting. This lower bound is far from optimal. But, we can prove a constant lower bound in dimension two. Motivated by the proof, we extend…

Let $A \in \{ \mathbb{Z}, \mathbb{R} \}$ and $X \subset \mathbb{R}^d$ be a bounded set. Affine transformations given by an automorphism of $\mathbb{Z}^d$ and a translation in $A^d$ are called (affine) $A$-unimodular transformations. The…

We study the dimension and construct a basis for $C^1$-smooth isogeometric function spaces over two-patch domains. In this context, an isogeometric function is a function defined on a B-spline domain, whose graph surface also has a B-spline…

With advances in technology, there has been growing interest in developing effective mapping methods for 3-dimensional objects in recent years. Volumetric parameterization for 3D solid manifolds plays an important role in processing 3D…

The aim of this paper is to give an upper bound for the intrinsic diameter of a surface with boundary immersed in a conformally flat three dimensional Riemannian manifold in terms of the integral of the mean curvature and of the length of…

This paper provides new constructive lower bounds for constant dimension codes, using different techniques such as Ferrers diagram rank metric codes and pending blocks. Constructions for two families of parameters of constant dimension…

A rigidity theory is developed for bar-joint frameworks in $\mathbb{R}^{d+1}$ whose vertices are constrained to lie on concentric $d$-spheres with independently variable radii. In particular, combinatorial characterisations are established…

We study the problem of approximation of 2D set of points. Such type of problems always occur in physical experiments, econometrics, data analysis and other areas. The often problems of outliers or spikes usually make researchers to apply…

3D shape completion is important to enable machines to perceive the complete geometry of objects from partial observations. To address this problem, view-based methods have been presented. These methods represent shapes as multiple depth…

We consider weighted Hardy inequalities involving the distance function to the boundary of a domain in the $N$-dimensional Euclidean space with nonempty boundary. We give a lower bound for the corresponding best Hardy constant for a domain…

This paper estimates the location and the width of the nodal set of the first Neumann eigenfunctions on a smooth convex domain $\Omega \subset \mathbb R^n$, whose length is normalized to be 1 and whose cross-section is contained in a ball…

We propose a neural parameterization of convex sets by learning sublinear (positively homogeneous and convex) functions. Our networks implicitly represent both the support and gauge functions of a convex body. We prove a universal…

We investigate the problem of estimating the 3D shape of an object, given a set of 2D landmarks in a single image. To alleviate the reconstruction ambiguity, a widely-used approach is to confine the unknown 3D shape within a shape space…

We provide a general framework to construct finite dimensional approximations of the space of convex functions, which also applies to the space of c-convex functions and to the space of support functions of convex bodies. We give estimates…

We study the Hamiltonian formulation for a parametrized scalar field in a regular bounded spatial region subject to Dirichlet, Neumann and Robin boundary conditions. We generalize the work carried out by a number of authors on parametrized…

In this paper we establish a gap theorem for the complex geometry of smoothly bounded convex domains which informally says that if the complex geometry near the boundary is close to the complex geometry of the unit ball, then the domain…

We have derived an analytical formulation for estimating the volume of geometries enclosed by implicitly defined surfaces. The novelty of this work is due to two aspects. First we provide a general analytical formulation for all…

This article proposes a mortar type finite element formulation for consistently embedding curved, slender beams, i.e. 1D Cosserat continua, into 3D solid volumes. A consistent 1D-3D coupling scheme for this problem type is proposed, which…