Lonely Points in Simplices

by   Maximilian Jaroschek, et al.

Given a lattice L in Z^m and a subset A of R^m, we say that a point in A is lonely if it is not equivalent modulo L to another point of A. We are interested in identifying lonely points for specific choices of L when A is a dilated standard simplex, and in conditions on L which ensure that the number of lonely points is unbounded as the simplex dilation goes to infinity.



page 1

page 2

page 3

page 4


Extraction of cylinders and cones from minimal point sets

We propose new algebraic methods for extracting cylinders and cones from...

Deciding whether a Lattice has an Orthonormal Basis is in co-NP

We show that the problem of deciding whether a given Euclidean lattice L...

Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in R^n

This work investigates the asymptotic behaviour of the gradient approxim...

The Graph Limit of The Minimizer of The Onsager-Machlup Functional and Its Computation

The Onsager-Machlup (OM) functional is well-known for characterizing the...

The convergent Indian buffet process

We propose a new Bayesian nonparametric prior for latent feature models,...

Digital Convex + Unimodular Mapping =8-Connected (All Points but One 4-Connected)

In two dimensional digital geometry, two lattice points are 4-connected ...

A note on the dispersion of admissible lattices

In this note we show that the volume of axis-parallel boxes in R^d which...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.