the chadegan metamorphic complex is a wnw-ese- trending antiformal structure located in sanandaj-sirjan structural zone, iran.the inner core of the structure is made of orthogneiss, containing eclogitic lenses. schists and marbles lie structurally above theorthogneiss and crop out in the external limbs of the antiformal dome. two main deformational episodes have been documented in theschists an...

We give a partial description of the (s, t)− p-path polytope of a directed graph D which is the convex hull of the incidence vectors of simple directed (s, t)-paths in D of length p. First, we point out how the (s, t) − p-path polytope is located in the family of path and cycle polyhedra. Next, we give some classes of valid inequalities which are very similar to inequalities which are valid for...

Given a polygonal path P with vertices p1, p2, . . . , pn ∈ Rd and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik) is a t-distance-preserving approximation of P if 1 = i1 < i2 < . . . < ik = n and each straight-line edge (pij , pij+1) of Q approximates the distance between pij and pij+1 along the path P within a factor of t. We present exact and approximation algorithms that compute s...

Let T be a tree in Rd and let ∆ > 0 be a real number. The aim is to preprocess T into a data structure, such that for any polygonal query path Q, we can decide if T contains a path P whose Fréchet distance δF (Q,P ) to Q is at most ∆. For any real number ε > 0, we present an efficient data structure that solves an approximate version of this problem for the case when T is c-packed and each of t...

Proterozoic rocks of the southwestern United States exhibit a variety of tectonometamorphic histories that can all be explained by a characteristic looping style of pressure-temperature (P-T) path. The path is fundamentally clockwise. However, because the rocks were cooled isobarically at 3 kbar after tectonism, the cooling path crosses the prograde path, leading to a geometry with a counterclo...

The path-table P(T ) of a tree T collects information regarding the paths in T: for each vertex v, the row of P(T ) relative to v lists the number of paths containing v of the various lengths. We call this row the path-row of v in T. Two trees having the same path-table (up to reordering the rows) are called path-congruent (or path-isomorphic). Motivated byKelly–Ulam’sReconstructionConjecture a...

We show that the operational semantics for HOPLA is in strong correspondence with its presheaf semantics [2, 1]. The proof is a fairly standard logical relations proof, exploiting the path semantics of the language [3, 4]. Strong correspondence can be proved for full HOPLA by making use of the path semantics to get a logical relations proof off the ground. We’ll use the notation J−K for the pat...

A set P of edge-disjoint paths in a graph G is called an edge-covering of G if every edge of G is contained in a path of P. The path edge-covering number of G is then defined as the smallest number p(G) of paths in such an edge-covering of G. This parameter appeared in the study of certain models of information retrieval structures (see, e. g., [6]). If we are considering a tree T , then it is ...