Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 124 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 79 tok/s Pro
Kimi K2 206 tok/s Pro
GPT OSS 120B 435 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

On systems of equations in free abelian groups (1401.7092v1)

Published 28 Jan 2014 in math.GR

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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