Abstract
AbstractGiven a lattice $$L\subseteq \mathbb Z^m$$
L
⊆
Z
m
and a subset $$A\subseteq \mathbb R^m$$
A
⊆
R
m
, we say that a point in A is lonely if it is not equivalent modulo $$L$$
L
to another point of A. We are interested in identifying lonely points for specific choices of $$L$$
L
when A is a dilated standard simplex, and in conditions on $$L$$
L
which ensure that the number of lonely points is unbounded as the simplex dilation goes to infinity.
Funder
Austrian Science Fund
European Research Council
KAW Wallenberg Academy Fellowship
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference17 articles.
1. Aparicio Monforte, A., Kauers, M.: Formal Laurent series in several variables. Expo. Math. 31(4), 350–367 (2013)
2. Beck, M., Robins, S.: Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra. Undergraduate Texts in Mathematics. Springer, New York (2007)
3. Graduate Texts in Mathematics;T Becker,1993
4. Buchberger, B., Kauers, M.: Gröbner basis. Scholarpedia 5(10), # 7763 (2010)
5. Coppersmith, D., Davenport, J.: Polynomials whose powers are sparse. Acta Arith. 58(1), 79–87 (1991)