A Bound for a Solution of a Linear Diophantine Problem

DOI10.1112/JLMS/S2-6.1.61MaRDI QIDQ5658128zbMATH OpenOpenAlexFDO

Authors Mordechai Lewin

Publication date 1972

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-6.1.61

Mathematics Subject Classification ID

Linear Diophantine equations (11D04)

Cited in

(11)

• On exponents of primitive matrices
• The complexity of finding common partitions of genomes with predefined block sizes
• A diophantine problem of Frobenius in terms of the least common multiple
• A multiple set version of the \(3k-3\) theorem
• Proof of a conjecture by Erdős and Graham concerning the problem of Frobenius
• A bound connected with primitive matrices
• Bounds for exponents of doubly stochastic primitive matrices
• On a linear diophantine problem for geometrical type sequences
• Some contributions to the Frobenius' Problem
• Skolem's solution to a problem of Frobenius
• \(\omega\)-regular languages are testable with a constant number of queries

This page was built for publication: A Bound for a Solution of a Linear Diophantine Problem

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