It is shown that any word of length n is uniquely determined by all its ( n k ) subwords of length k, provided k w 16 7 -nx+5. This improves the bound k wnΓ2x given in B. Manvel et al. (Discrete Math. 94 (1991), 209 219). 1997 Academic Press ## 1. Introduction Given a word X of length n with term
On a reconstruction problem
β Scribed by Bhalchandra D. Thatte
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 86 KB
- Volume
- 137
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
This note supplements an earlier paper of this author, in which the concept of a strong k-hypomorphism between two graphs was defined (Thatte, 1990, Section VI). For k = 1, this is just a hypomorphism. Here it is proved that strongly k-hypomorphic graphs and strongly k-edge hypomorphic directed graphs are isomorphic if k > 1.
Graphs in this note are directed or undirected. By V(G), E(G) and [G] we will denote, respectively, the vertex set, the edge set and the isomorphism class of a graph G. Let
Ek(G)={E~_E(G):
[El=k} and Vk(G)={W~ V(G): IWl=k}.
The following problem was posed in Section VI of .
Let G and H be two m-edge and n-vertex graphs. Let there
π SIMILAR VOLUMES
We give a complete answer to a question raised by Harary and Manvel in 1972 (Bull. Soc. Math. Belg. 24, 375-379) by proving that a finite set A of points in the plane R 2 is uniquely determined up to translation and rotation by a multiple of 908 by 5 of its Γ°j A j Γ 1Γ-element subsets given up to tr
The paper presents a new construction of crossed products of C\*-algebras d and group duals (of compact groups) acting on d using a suitable d-left module as the starting object.
## Abstract This paper deals with some mathematical aspects of magnetic resonance imaging (MRI). MRI is used in diagnostic medicine to measure and display the cross section of, for example, a human organ. In this paper we formulate the MRIβreconstruction problem and solve it aftΓ¨r restating it as a