Vector-covering systems of arithmetic sequences
From MaRDI portal
Let \(v=(v_1, \ldots, v_m)\) be a vector with nonzero real elements. A system of congruences \(a_i\pmod {n_i} \) is said \(v\)-covering if \(\sum v_i f_i(n)=1\) for all \(n\), where \( f_i(n)=1\) or \(0\) according to \(n \equiv a_i\pmod{n_i}\) or not. Several properties of common dis joint systems (the case \(v_i=1\) for all \(i\) ) are generalized to vector-covering systems, e.g. their characterizations by exponential sums and Bernoulli polynomials or the theorem stating that the moduli \(n_i\) cannot be all distinct.
Recommendations
- On exactly covering systems of arithmetic sequences
- Covering the integers by arithmetic sequences
- Vectorial functions and covering sequences
- On properties of systems of arithmetic sequences
- Sequence Covering Arrays and Linear Extensions
- Structure along arithmetic patterns in sequences of vectors
- Covering the integers by arithmetic sequences. II
- Recurring sequences over vector spaces
- Arithmetical sequences and systems of functional equations
- On sequences in vector lattices
Cites work
Cited in
(6)- Sequence Covering Arrays and Linear Extensions
- Vector-covering systems with a single triple of equal moduli
- scientific article; zbMATH DE number 597736 (Why is no real title available?)
- scientific article; zbMATH DE number 740352 (Why is no real title available?)
- Vectorial functions and covering sequences
- Algebraic approaches to periodic arithmetical maps
This page was built for publication: Vector-covering systems of arithmetic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068789)