The Indecomposable Solutions of Linear Congruences

arXiv1703.03708MaRDI QIDQ6284179FDOQ6284179

Authors: Klaus Pommerening 

Publication date: 10 March 2017

Abstract: This article considers the minimal non-zero (= indecomposable) solutions of the linear congruence $1cdot{x}_1+cdots+(m-1)cdot{x}_{m-1}equiv0pmodm$ for unknown non-negative integers $x_1,ldots,x_n$, and characterizes the solutions that attain the Eggleton-ErdH{o}s bound. Furthermore it discusses the asymptotic behaviour of the number of indecomposable solutions. The results have direct interpretations in terms of zero-sum sequences and invariant theory.

Mathematics Subject Classification ID

Congruences in many variables (11D79)

This page was built for publication: The Indecomposable Solutions of Linear Congruences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284179)