A graph Γ is said to be distance-balanced if for any edge uv of Γ, the number vertices closer u than v equal u, and it called nicely in addition this independent chosen uv. strongly integer k, at distance k from k+1 v. In paper we solve an open problem posed by Kutnar Miklavič (2014) constructing several infinite families nonbipartite graphs which are not distance-balanced. We disprove a conjec...

We recall that a nicely semiramified division algebra is defined to be a defectless finitedimensional valued central division algebra D over a field E with inertial and totally ramified radical-type (TRRT) maximal subfields [7, Definition, page 149]. Equivalent statements to this definition were given in [7, Theorem 4.4] when the field E is Henselian. These division algebras, as claimed in [7, ...

We prove that if Q is a nw-nep forcing then it cannot add a dominating real. We also show that amoeba forcing cannot be P(X)/I if I is an א1-complete ideal. Furthermore, we generalize the results of [Sh 480]. I would like to thank Alice Leonhardt for the beautiful typing. This research was partially supported by the Israel Science Foundation founded by the Israel Academy of Sciences and Humanit...

MOTIVATION Almost all methods of chromosome recognition assume supervised training; i.e. we are given correctly classified chromosomes to start the training phase. Noise, if any, is confined only in the representation of the chromosomes and not in the classification of the chromosomes. During the recognition phase, the problem is simply to calculate the string edit distance of the unknowns to t...

The definition of efficient similarity or dissimilarity measures between graphs is a key problem in structural pattern recognition. This problem is nicely addressed by the graph edit distance, which constitutes one of the most flexible graph dissimilarity measure in this field. Unfortunately, the computation of an exact graph edit distance is known to be exponential in the number of nodes. In t...

We consider problems of estimation of structured covariance matrices, and in particular of matrices with a Toeplitz structure. We follow a geometric viewpoint that is based on some suitable notion of distance. To this end, we overview and compare several alternatives metrics and divergence measures. We advocate a specific one which represents the Wasserstein distance between the corresponding G...

The objective of this work is to show how geodesic propagation techniques known in mathematical morphology can be employed to reconstruct terrain surfaces, and more generally grid data, from contour maps. We present the so-called generalised geodesic distance that was briefly introduced in a previous article. The shortest paths defined by the generalised geodesic distance can be used to linearl...