✦ LIBER ✦

Splines with maximal zero sets

✍ Scribed by Avraham A Melkman

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 708 KB
Volume: 61
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(77)90175-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Qualified residue difference sets with z

Qualified residue difference sets with zero

✍ Derek Jennings; Kevin Byard 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 230 KB

We previously established that biquadratic qualified residue difference sets exist for primes p if and only if p = 16x 2 + 1 and sextic qualified residue difference sets exist if and only if p = 108x 2 ÷ 1. For example such sets exist for the primes 17 and 109, respectively. In this paper we point o

Matrices with zero line sums and maximal

Matrices with zero line sums and maximal rank

✍ Abraham Berman; B.David Saunders 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 328 KB

Maximal sets of integers with small comm

Maximal sets of integers with small common divisors

✍ John Friedlander 📂 Article 📅 1971 🏛 Springer 🌐 English ⚖ 205 KB

Ranking fuzzy numbers with maximizing se

Ranking fuzzy numbers with maximizing set and minimizing set

✍ Shan-Huo Chen 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Maximal transitive sets with singulariti

Maximal transitive sets with singularities for genericC1vector fields

✍ C. M. Carballo; C. A. Morales; M. J. Pacifico 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 790 KB

Enumerating maximal independent sets wit

Enumerating maximal independent sets with applications to graph colouring

✍ Jesper Makholm Byskov 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 246 KB

We give tight upper bounds on the number of maximal independent sets of size k (and at least k and at most k) in graphs with n vertices. As an application of the proof, we construct improved algorithms for graph colouring and computing the chromatic number of a graph.