Related papers: Convex hull lattices point generated

In this paper we give several methods to construct curves over finite fields with many points and illustrate this with examples of the results.

Imprecise measurements of a point set P = (p1, ..., pn) can be modelled by a family of regions F = (R1, ..., Rn), where each imprecise region Ri contains a unique point pi. A retrieval models an accurate measurement by replacing an…

The Sylvester-Gallai theorem states that for a finite set of points in the plane, if every line determined by any two of these points also contains a third, then the set is necessarily made of collinear points. In this paper, we first…

We describe a new way to construct finite geometric objects. For every k we obtain a symmetric configuration E(k-1) with k points on a line. In particular, we have a constructive existence proof for such configurations. The method is very…

A family of fuzzy orbifolds are generated by looking at sub-algebras of the fuzzy sphere. One of them is actually commutative and can be mapped exactly onto a lattice. The others are fuzzy approximations of S^2/Z_N where Z_N is the cyclic…

An algorithm is developed for efficiently constructing the Lorentz covariant effective three-point vertices of the decay of a particle into two daughter particles in which all the masses and spins of the three particles can be arbitrary.…

The notion of ball convexity, considered in finite dimensional real Banach spaces, is a natural and useful extension of usual convexity; one replaces intersections of half-spaces by suitable intersections of balls. A subset $S$ of a normed…

A spherical set is called convex if for every pair of its points there is at least one minimal geodesic segment that joins these points and lies in the set. We prove that for n >= 3 a complete locally-convex (topological) immersion of a…

We develop a circle of ideas involving pairs of lines in the plane, intersections of hyperbolically rotated elliptical cones and the locus of the centers of rectangles inscribed in lines in the plane.

Each straight infinite line defined by two vertices of a finite square point lattice contains (covers) these two points and a - possibly empty - subset of points that happen to be collinear to these. This work documents vertex subsets of…

We prove that every finite family of convex sets in the plane satisfying the $(4,3)$-property can be pierced by $9$ points. This improves the bound of $13$ proved by Gy\'arf\'as, Kleitman, and T\'oth in 2001.

In this article we propose a generalization of the 2-dimensional notions of convexity resp. being star-shaped to symplectic vector spaces. We call such curves symplectically convex resp. symplectically star-shaped. After presenting some…

We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exist a convex…

We provide an example for the generating matrix $A$ of a two-dimensional lattice $\Gamma = A\mathbb{Z}^2$, such that the following holds: For any sufficiently smooth and localized mother wavelet $\psi$, there is a constant…

The lattice stick number of knots is defined to be the minimal number of straight sticks in the cubic lattice required to construct a lattice stick presentation of the knot. We similarly define the lattice stick number $s_{L}(G)$ of spatial…

We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…

We investigate new convex relaxations for the pooling problem, a classic nonconvex production planning problem in which input materials are mixed in intermediate pools, with the outputs of these pools further mixed to make output products…

Let $P$ be a set of $n$ points on the plane in general position. We say that a set $\Gamma$ of convex polygons with vertices in $P$ is a convex decomposition of $P$ if: Union of all elements in $\Gamma$ is the convex hull of $P,$ every…