Skip to main content
added 108 characters in body
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76

Let $M\in\{0,1\}^{n\times n}$ be a square integer matrix. If we consider $M$ as biadjacency of a balanced bipartite graph on $2n$ vertices having $n$ vertices of color $1$ and $n$ vertices of color $2$ we canonically associate permanent of $M$ to the number of perfect matchings in the graph.

Is there a bipartite graph which is balanced we can associate to the square of the determinant or absolute value of the determinant in a canonical manner without computing the determinant explicitly?

Update Observe the construction of the graph is non-canonical in any known way. It has to be clever.

Let $M\in\{0,1\}^{n\times n}$ be a square integer matrix. If we consider $M$ as biadjacency of a balanced bipartite graph on $2n$ vertices having $n$ vertices of color $1$ and $n$ vertices of color $2$ we canonically associate permanent of $M$ to the number of perfect matchings in the graph.

Is there a bipartite graph which is balanced we can associate to the square of the determinant or absolute value of the determinant in a canonical manner without computing the determinant explicitly?

Let $M\in\{0,1\}^{n\times n}$ be a square integer matrix. If we consider $M$ as biadjacency of a balanced bipartite graph on $2n$ vertices having $n$ vertices of color $1$ and $n$ vertices of color $2$ we canonically associate permanent of $M$ to the number of perfect matchings in the graph.

Is there a bipartite graph which is balanced we can associate to the square of the determinant or absolute value of the determinant in a canonical manner without computing the determinant explicitly?

Update Observe the construction of the graph is non-canonical in any known way. It has to be clever.

deleted 129 characters in body; edited tags; edited title
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76

Is there a reduction from fixed dimension ILPbipartite graph whose determinant corresponds to SVPnumber of perfect matchings?

Integer Linear Program inLet $d$$M\in\{0,1\}^{n\times n}$ be a square integer variables,matrix. If we consider $m$ constraints and representable in$M$ as biadjacency of a balanced bipartite graph on $L$ bits is in$2n$ vertices having $O(d^{\mathsf{poly}(d)}mL)$ time by an algorithm$n$ vertices of Lenstra in https://pubsonline.informs.org/doi/abs/10.1287/moor.8.4.538. Hence incolor $d$ fixed dimensions it is in$1$ and $\mathsf P$

Shortest vector problem in a lattice in$n$ vertices of color $k$ dimensions is$2$ we canonically associate permanent of $\mathsf{NP}$-hard under randomized reductions$M$ to the number of perfect matchings in the graph.

Is there any reduction from $d$ integer variables, $m$ constraints and representable in $L$ bits integer linear programminga bipartite graph which is balanced we can associate to $k=O(\mathsf{poly}(dmL))$-dimensional lattice shortest vector problemthe square of the determinant or absolute value of the determinant in a canonical manner without computing the determinant explicitly?

Is there a reduction from fixed dimension ILP to SVP?

Integer Linear Program in $d$ integer variables, $m$ constraints and representable in $L$ bits is in $O(d^{\mathsf{poly}(d)}mL)$ time by an algorithm of Lenstra in https://pubsonline.informs.org/doi/abs/10.1287/moor.8.4.538. Hence in $d$ fixed dimensions it is in $\mathsf P$

Shortest vector problem in a lattice in $k$ dimensions is $\mathsf{NP}$-hard under randomized reductions.

Is there any reduction from $d$ integer variables, $m$ constraints and representable in $L$ bits integer linear programming to $k=O(\mathsf{poly}(dmL))$-dimensional lattice shortest vector problem?

Is there a bipartite graph whose determinant corresponds to number of perfect matchings?

Let $M\in\{0,1\}^{n\times n}$ be a square integer matrix. If we consider $M$ as biadjacency of a balanced bipartite graph on $2n$ vertices having $n$ vertices of color $1$ and $n$ vertices of color $2$ we canonically associate permanent of $M$ to the number of perfect matchings in the graph.

Is there a bipartite graph which is balanced we can associate to the square of the determinant or absolute value of the determinant in a canonical manner without computing the determinant explicitly?

Post Undeleted by Turbo
Post Deleted by Turbo
Source Link
Turbo
  • 13.9k
  • 1
  • 27
  • 76

Is there a reduction from fixed dimension ILP to SVP?

Integer Linear Program in $d$ integer variables, $m$ constraints and representable in $L$ bits is in $O(d^{\mathsf{poly}(d)}mL)$ time by an algorithm of Lenstra in https://pubsonline.informs.org/doi/abs/10.1287/moor.8.4.538. Hence in $d$ fixed dimensions it is in $\mathsf P$

Shortest vector problem in a lattice in $k$ dimensions is $\mathsf{NP}$-hard under randomized reductions.

Is there any reduction from $d$ integer variables, $m$ constraints and representable in $L$ bits integer linear programming to $k=O(\mathsf{poly}(dmL))$-dimensional lattice shortest vector problem?