Non-abelian analogs of lattice rounding
Keyword(s):
AbstractLattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of non-abelian analogs of lattice rounding involving matrix groups. In one direction, we consider an algorithm for solving a normed word problem when the inputs are random products over a basis set, and give theoretical justification for its success. In another direction, we prove a general inapproximability result which essentially rules out
2008 ◽
Vol 11
(01)
◽
pp. 21-31
◽
Keyword(s):
2010 ◽
Vol 467
(2129)
◽
pp. 1468-1490
◽
Keyword(s):
2012 ◽
Vol 26
(05)
◽
pp. 1260004
◽
2011 ◽
Vol 89
(11)
◽
pp. 1403-1409
◽
Keyword(s):
2020 ◽
Keyword(s):
1973 ◽
Vol 16
(2)
◽
pp. 249-256
◽