Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
67 views

System of linear diophantine equations with many small solutions?

Let $n$ be positive integer, $k$,$B$ fixed positive integers. Let $f_i(x_1,x_2...x_n)$ be a system of $n-k$ linearly independent linear equations over the integers. Let $S(f_i,k,B)$ be the set of ...
joro's user avatar
  • 25.4k
1 vote
0 answers
40 views

learning about split cut (Integer Programming)

Here is a part of Integer Programming (Graduate Texts in Mathematics, 271) 2014th Edition. In lemma 5.9, aiming at showing that a finite number of splits ${(\pi, \pi_0)}$ are sufficient to generate ...
Sai He's user avatar
  • 11
3 votes
2 answers
215 views

Is there a closed-form solution for $\max_D \operatorname{Tr}(ADBD)$

Is there a closed-form solution for $$\max_D \operatorname{Tr}(ADBD)$$ where $D$ is a $N\times N$ diagonal matrix with $m<N$ number of $1$'s and the rest are $0$'s, and $A$ and $B$ are real ...
CWC's user avatar
  • 433
1 vote
2 answers
204 views

Only trivial solutions to system of linear diophantine equations possibly related to hamiltonian cycles in graphs

This might be related to counting hamiltonian cycles. @Peter Taylor gave negative result about the one dimensional case, but we believe his attack is not directly applicable to this question. Given ...
joro's user avatar
  • 25.4k
1 vote
0 answers
86 views

Integer programming using the Steinitz lemma

I am trying to implement an algorithm that I read on the paper entitled: "Proximity results and faster algorithms for integer programming using the Steinitz lemma", published by Friedrich ...
Samuel Bismuth's user avatar
0 votes
0 answers
108 views

Solutions to matrix equations in the non-negative integers

For an integer matrix $S$, and an integer vector $y$, I'm looking for solutions to $xS = y$ where the entries in $x$ are in the non-negative integers. I've been doing this with Sage's mixed integer ...
JonHales's user avatar
  • 101
0 votes
0 answers
369 views

Finding a point in the relative interior of the convex hull of a set of integer-valued vectors

Let $X \subset \mathbb{Z}^n$ be the set of integer-valued vectors satisfying a system of linear constraints. We can suppose that $X$ is the set of integral points in a given polyhydral set $Y \subset \...
rasul's user avatar
  • 136
2 votes
0 answers
80 views

Making a polyhedron integral by selecting value for a specific co-ordinate of constraint vector

I am currently trying to solve a binary integer programming(maximization) problem, where the first row of the constraint matrix corresponds to the constraints on the total number of 1's in the vector ...
A.2's user avatar
  • 123
0 votes
0 answers
68 views

A seemingly easy integer programming question

Let $k, m \in \mathbb{Z}_{ > 1}$. Let $a \in \mathbb{Z}_{> 0}^m$ and $t \in \mathbb{Z}^k$. Let $\varepsilon = (\varepsilon_{i,j})_{1 \leq i \leq m \\1 \leq j \leq k}$ be a matrix with entries in ...
Alex's user avatar
  • 501
2 votes
1 answer
191 views

programming to compute kernel quotient image of a $\mathbb{Z}$-module endomorphism

Let the integers $n\geq 2$, $k\geq 1$, $v=0$ or $1$ and $n_1,\cdots,n_k\geq 1$ such that $$ \sum_{i=1}^k n_i+v=n. $$ Define $P_a^b=0$ if both $a,b$ are odd and $P_a^b={{[a/2]}\choose {[(a+b)/2]}}$ ...
Shiquan Ren's user avatar
  • 1,990
6 votes
1 answer
1k views

Speed up Linear programming

I have a linear programming problem like this: minimize $c^t X$ under the constraint that $AX \ge b$. I will need to solve this linear programming problem online many times. I need it to be as fast ...
Robert's user avatar
  • 83
2 votes
1 answer
143 views

Find base of kernel with as many 0 as possible

I have a 400x132 rectangular matrix with only 0 and 1. I am looking for the linear combinations of the columns of the matrix that sum to 0. For example C1 + C2 - C3 = 0. I want to find the linear ...
Robert's user avatar
  • 83
0 votes
0 answers
104 views

Linear system with many solutions from a finite set

Basically I am looking for a linear system with many solutions from a finite set. Choose a finite set of rationals $S$ and fix positive integer $k$. Let $A$ be a linear system with $n$ variables $...
joro's user avatar
  • 25.4k
5 votes
2 answers
487 views

Some weird "system" of inequalities in nonnegative integers.

Suppose I have a bunch of nonnegative integers $(a_{ijkl})_{1 \leq i \leq j \leq k \leq l \leq 17}$ such that for all 17-tuples nonnegative integers $w_t$ (for $1 \leq t \leq 17$) we have that $$\min_{...
Wanderer's user avatar
  • 5,163
4 votes
1 answer
866 views

When is a triangular matrix totally unimodular?

I have a {0,1}, invertible, triangular matrix, that I would like to show is totally unimodular. Are there any known results on the total unimodularity of classes of triangular matrices?
Michael Biro's user avatar
  • 1,182
5 votes
1 answer
603 views

Hermite normal form in families

How does Hermite normal form (over $Z$) vary in families? I.e. if I have an $n\times m$ matrix $M$ whose entries are integral polynomials in some integral variable $x$, how does the Hermite normal ...
Danny Calegari's user avatar