Provenance Graphs: Anticipating and Exploiting Schema-Level Data Provenance Daniel Zinn Bertram Ludäscher {dzinn,ludaesch}@ucdavis.edu Abstract. Provenance graphs capture flow and dependency information recorded during scientific workflow runs, which can be used subsequently to interpret, validate, and debug workflow results. In this paper, we propose a new concept, called abstract provenance g...

Extremal problems for graph homomorphisms have recently become a topic of much research. Let hom(G,H) denote the number of homomorphisms from G to H. A natural set of problems arises when we fix an image graph H and determine which graph(s) G on n vertices and m edges maximize hom(G,H). We prove that if H is loop-threshold, then, for every n and m, there is a threshold graph G with n vertices a...

Infinite presentations are given for all of the higher Torelli groups of once-punctured surfaces. In the case of the classical Torelli group, a finite presentation of the corresponding groupoid is also given. Furthermore, the first Johnson homomorphism, which is defined from the classical Torelli group to the third exterior power of the homology of the surface, is shown to lift to an explicit c...

This paper attempts to generalize universal algebras on classical sets to $L$-sets when $L$ is a GL-quantale. Some basic notions of fuzzy universal algebra on an $L$-set are introduced, such as subalgebra, quotient algebra, homomorphism, congruence, and direct product etc. The properties of them are studied. $L$-valued power algebra is also introduced and it is shown there is an onto homomorphi...

A sharp threshold for resonant capture of an ensemble of trapped particles driven by chirped frequency oscillations is analyzed. It is shown that at small temperatures T, the capture probability versus driving amplitude is a smoothed step function with the step location and width scaling as alpha(3/4) (alpha being the chirp rate) and (alphaT)(1/2), respectively. Strong repulsive self-fields red...

Because of the associativity of fusion products ⊠, the above hypothesis is equivalent to the condition that for each irreducible module W , there is an irreducible module W̃ such that HomV (W̃ ⊠ W,V ) 6= 0. In the previous paper [6], we have introduced a concept of ”Semi-Rigidity” and then proved that if W is semi-rigid, then W is flat for the fusion products ⊠, that is, 0 → W ⊠ A → W ⊠ B → W ⊠ C...

The rst systematic treatment of weighted extended tree transducers (wxtt) over countably complete semirings is provided. It is proved that the extension in the left-hand sides of a wxtt can be simulated by the inverse of a linear and nondeleting tree homomorphism. In addition, a characterization of weighted tree transformations computed by bottomup wxtt in terms of bimorphisms is provided. Back...

Graph homomorphisms are used to study good characterizations for coloring problems (Trans. Amer. Math. Soc. 384 (1996), 1281–1297; Discrete Math. 22 (1978), 287–300). Particularly, the following concept arises in this context: A pair of graphs (A, B) is called a homomorphism duality if for any graph G either there exists a homomorphism σ : A→ G or there exists a homomorphism τ : G → B but not b...

In this paper we define $varphi$-Connes module amenability of a dual Banach algebra $mathcal{A}$ where $varphi$ is a bounded $w_{k^*}$-module homomorphism from $mathcal{A}$ to $mathcal{A}$. We are mainly concerned with the study of $varphi$-module normal virtual diagonals. We show that if $S$ is a weakly cancellative inverse semigroup with subsemigroup $E$ of idemp...