Papers
Topics
Authors
Recent
Search
2000 character limit reached

On systems of equations in free abelian groups

Published 28 Jan 2014 in math.GR | (1401.7092v1)

Abstract: In this paper we study the asymptotic probability that a random system of equations in free abelian group $\mathbb{Z}m$ of rank $m$ is solvable. Denote $SAT(\mathbb{Z}m, k, n)$ and $SAT_{\mathbb{Q}m}(\mathbb{Z}m, k, n)$ the sets of all systems of $n$ equations in $k$ variables in the group $\mathbb{Z}m$ solvable in $\mathbb{Z}m$ and $\mathbb{Q}m$ respectively. We show that asymptotic density of the set $SAT_{\mathbb{Q}m}(\mathbb{Z}m, k, n)$ is equal to $1$ for $n \leq k$, and is equal to $0$ for $n > k$. For $n < k$ we give nontrivial estimates for upper and lower asymptotic densities of the set $SAT(\mathbb{Z}m, k, n)$. When $n > k$ the set $SAT(\mathbb{Z}m, k, n)$ is negligible. Also for $n \leq k$ we provide some connection between asymptotic density of the set $SAT(\mathbb{Z}m, k, n)$ and sums over full rank matrices involving their greatest divisors.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.