Skip to main content

All Questions

7 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
5 votes
0 answers
129 views

Lattice paths in polytopes

Let $P$ be a polytope in $\mathbb{R}^n$. Let $A_ix = b_i$ be the defining equations of its codimension $1$ faces. Is there an algorithm or some kind of criterion to decide if the lattice points inside ...
Alex's user avatar
  • 501
4 votes
0 answers
242 views

Domination in Nice Lattices

Let an integer vector be nice when it has only two nonzero components, which sum to zero. So (0, 0, 3, 0, -3) and (-1, 0, 1, 0, 0) are examples of nice vectors in $n=5$ dimensions. Call a lattice ...
Dave Pritchard's user avatar
3 votes
0 answers
237 views

Lenstra's integer programming algorithm: Finding a lattice point “near the center”

I have already posted this question on the mathematics forum, but I suspect the question needs more detailed knowledge than most users have; please excuse the duplicate post. Any help is greatly ...
Roegel's user avatar
  • 31
2 votes
0 answers
221 views

Modular inverse computation - avoiding Euclidean algorithm

Modular inverse is known to be computable by Extended Euclidean algorithm which is the reaping the rewards of computing the GCD of two numbers or proving two numbers are coprime. If we already know ...
Turbo's user avatar
  • 13.9k
2 votes
0 answers
120 views

Gap in Successive minima on lattice spanned by rational and integer combination of integer vectors

We are given a rank $r$ matrix $B\in\Bbb Z^{k\times n}$ where $0\leq r\leq k\leq n$ holds. We have $$\mathcal L_\Bbb Z=\{uB\in\Bbb Z^n:u\in\Bbb Z^k\}\subseteq\mathcal L_\Bbb Q=\{uB\in\Bbb Z^n:u\in\...
Turbo's user avatar
  • 13.9k
2 votes
0 answers
92 views

On design of a (preferrably unimodular) matrix

Assume each entry is in $\Bbb Z$. Say we want to solve $Ax=b$ where known $A$ is $n\times n$, unknown $x$ is $n\times1$ and $b$ is $n\times1$. The absolute value of minors of augmented matrix $[A|b]$...
Turbo's user avatar
  • 13.9k
1 vote
0 answers
96 views

Smallest integer lattice point by box measure in a polytope?

Given an integer lattice $\mathcal L\subseteq\mathbb Z^n$ represented by basis $\mathcal B$ and an integer linear program $Ax\leq b$ where $x\in\mathbb Z^n$ is unknown with $A\in\mathbb Z^{m\times n}$ ...
Turbo's user avatar
  • 13.9k