✦ LIBER ✦

Recursivity and geometry of the hypercube

✍ Scribed by Ilda P.F. da Silva

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 225 KB
Volume: 397
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2004.10.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The geometry of sets of orthogonal frequ

The geometry of sets of orthogonal frequency hypercubes

✍ V. C. Mavron; T. P. McDonough; Gary L. Mullen 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract We extend the notion of a framed net, introduced by D. Jungnickel, V. C. Mavron, and T. P. McDonough, J Combinatorial Theory A, 96 (2001), 376–387, to that of a __d__‐framed net of type ℓ, where __d__ ≥ 2 and 1 ≤ ℓ ≤ __d__‐1, and we establish a correspondence between __d__‐framed nets o

Affine geometries and sets of equiorthog

Affine geometries and sets of equiorthogonal frequency hypercubes

✍ Ilene H. Morgan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

Equiorthogonal frequency hypercubes are one particular generalization of orthogonal latin squares. A complete set of mutually equiorthogonal frequency hypercubes (MEFH) of order n and dimension d, using m distinct symbols, has n À 1 d am À 1 hypercubes. In this article, we prove that an af®ne geomet

On the Recursivity of Finite Sets

✍ Ronald Harrop 📂 Article 📅 1961 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB 👁 1 views

ON THE mcuitsrvm-OF FINITE SISTS by ROSALD ITARRW in Newcastle upon Tync (England) $j 1 lritrodiiclion In this paprr n n nsgcct, is discussed of tlic relationship between rccursivity aiid intuitive dccitlalilit~~ hi the case of fiiiitc sets, which, altliougli rcfcrred to elsewhere in the literatuw (

Finding intersections of B-spline repres

Finding intersections of B-spline represented geometries using recursive subdivision techniques

✍ Tor Dokken 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Bulky Subgraphs of the Hypercube

✍ Andrei Kotlov 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 91 KB

Symmetric routings of the hypercube

✍ Jean-Claude König; Dominique Sotteau 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 774 KB

In this paper we prove that, for any n and k such that (k-l)C: is even, there exists a set of shortest paths between all the pairs of vertices at distance k of an n-cube such that each vertex is on the same number of paths. We conjecture that there also exists such a set of paths where each edge is