Related papers: Additive structure in convex sets

Sparse additive modeling is a class of effective methods for performing high-dimensional nonparametric regression. In this work we show how shape constraints such as convexity/concavity and their extensions, can be integrated into additive…

We are discussing the theorem about the volume of a set $A$ of $Z^n$ having a small doubling property $|2A| < Ck, k=|A|$ and oher problems of Structure Theory of Set Addition (Additive Combinatorics).

We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…

We here show that the family of finite-dimensional, discrete-time, passive, linear time-invariant systems can be characterized through the structure of maximal, matrix-convex set, closed under multiplication among its elements. Moreover,…

We say that a tile is $\sigma$-morphic if it tiles the plane in exactly $\aleph_0$ many noncongruent ways (up to an isometry). It is an unsolved problem of whether a $\sigma$-morphic tile exist in the plane. In this note we present a…

A method to define the complex structure and separate the conformal mode is proposed for a surface constructed by two-dimensional dynamical triangulation. Applications are made for surfaces coupled to matter fields such as $n$ scalar fields…

We prove some results concerning the boundary of a convex set in $\H^n$. This includes the convergence of curvature measures under Hausdorff convergence of the sets, the study of normal points, and, for convex surfaces, a generalized Gauss…

We construct a homogeneous subspace of $2^\omega$ whose complement is dense in $2^\omega$ and rigid. Using the same method, assuming Martin's Axiom, we also construct a countable dense homogeneous subspace of $2^\omega$ whose complement is…

For finite sets A and B in the plane, we write A+B to denote the set of sums of the elements of A and B. In addition, we write tr(A) to denote the common number of triangles in any triangulation of the convex hull of A using the points of A…

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

We study the composition of two set-valued functions defined on locally convex topological linear spaces. We assume that these functions map into certain complete lattices of sets that have been used to establish a conjugation theory for…

Within the framework of Berwald-Moor Geometry in H_3, the paper studies the construction of additive poly-angles (bingles and tringles). It is shown that, considering additiveness in the large, there exist an infinity of such poly-angles.

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.

In this paper, we prove several results on the structure of maximal sets $S \subseteq [N]$ such that $S$ mod $p$ is contained in a short arithmetic progression, or the union of short progressions, where $p$ ranges over a subset of primes in…

Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexity is a {\em convex geometry}. In this work we survey…

This brief note corrects some errors in the paper quoted in the title, highlights a combinatorial result which may have been overlooked, and points to further improvements in recent literature.

We discuss a structural approach to subset-sum problems in additive combinatorics. The core of this approach are Freiman-type structural theorems, many of which will be presented through the paper. These results have applications in various…

This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…