Search results for "Null"

A comparison of compatible, finite, and inductive graph properties

1993

Abstract In the theory of hyperedge-replacement grammars and languages, one encounters three types of graph properties that play an important role in proving decidability and structural results. The three types are called compatible, finite, and inductive graph properties. All three of them cover graph properties that are well-behaved with respect to certain operations on hypergraphs. In this paper, we show that the three notions are essentially equivalent. Consequently, three lines of investigation in the theory of hyperedge replacement - so far separated - merge into one.

Rademacher Theorem for Fréchet spaces

2010

Abstract Let X be a separable Frechet space. In this paper we define a class A of null sets in X that is properly contained in the class of Aronszajn null sets, and we prove that a Lipschitz map from an open subset of X into a Gelfand-Frechet space is Gateaux differentiable outside a set belonging to A. This is an extension to Frechet spaces of a result (see [PZ]) due to D. Preiss and L. Zajicek.

On the equivalence of McShane and Pettis integrability in non-separable Banach spaces

2009

Abstract We show that McShane and Pettis integrability coincide for functions f : [ 0 , 1 ] → L 1 ( μ ) , where μ is any finite measure. On the other hand, assuming the Continuum Hypothesis, we prove that there exist a weakly Lindelof determined Banach space X, a scalarly null (hence Pettis integrable) function h : [ 0 , 1 ] → X and an absolutely summing operator u from X to another Banach space Y such that the composition u ○ h : [ 0 , 1 ] → Y is not Bochner integrable; in particular, h is not McShane integrable.

A Note on Algebraic Sums of Subsets of the Real Line

2002

AbstractWe investigate the algebraic sums of sets for a large class of invari-ant ˙-ideals and ˙- elds of subsets of the real line. We give a simpleexample of two Borel subsets of the real line such that its algebraicsum is not a Borel set. Next we show a similar result to Proposition 2from A. Kharazishvili paper [4]. Our results are obtained for ideals withcoanalytical bases. 1 Introduction We shall work in ZFC set theory. By !we denote natural numbers. By 4wedenote the symmetric di erence of sets. The cardinality of a set Xwe denoteby jXj. By R we denote the real line and by Q we denote rational numbers. IfAand Bare subsets of R n and b2R , then A+B= fa+b: a2A^b2Bgand A+ b= A+ fbg. Simila…

Graph languages defined by systems of forbidden structures: A survey

1988

This paper deals with different ways of defining graph languages. These are the so-called forbidden structures. Some results on decision problems, their complexity, and set theoretic closure properties are scetched. A normal form, the minimal systems, are given. Finally the influence of the different kinds of forbidden structures on the descriptive power of the systems is shown.

Relations between structure and estimators in networks of dynamical systems

2011

The article main focus is on the identification of a graphical model from time series data associated with different interconnected entities. The time series are modeled as realizations of stochastic processes (representing nodes of a graph) linked together via transfer functions (representing the edges of the graph). Both the cases of non-causal and causal links are considered. By using only the measurements of the node outputs and without assuming any prior knowledge of the network topology, a method is provided to estimate the graph connectivity. In particular, it is proven that the method determines links to be present only between a node and its “kins”, where kins of a node consist of …

Graph Connectivity, Monadic NP and built-in relations of moderate degree

1995

It has been conjectured [FSV93] that an existential secondoder formula, in which the second-order quantification is restricted to unary relations (i.e. a Monadic NP formula), cannot express Graph Connectivity even in the presence of arbitrary built-in relations.

Images and Preimages of Null Sets

2013

In this chapter we study conditions that guarantee that our mapping maps sets of measure zero to sets of measure zero. We start with the problem in general Sobolev spaces, after which we establish a better result for mappings of finite distortion. Then we introduce a natural class of counterexamples to statements of this type and finally we give a weak condition under which the preimage of a set of measure zero has measure zero for mappings of finite distortion.

Osservazioni sull'esecutività della sentenza pro nullitate matrimonii non confermata dal tribunale d'appello

2004

Do firms share the same functional form of their growth rate distribution? A statistical test

2014

We introduce a new statistical test of the hypothesis that a balanced panel of firms have the same growth rate distribution or, more generally, that they share the same functional form of growth rate distribution. We applied the test to European Union and US publicly quoted manufacturing firms data, considering functional forms belonging to the Subbotin family of distributions. While our hypotheses are rejected for the vast majority of sets at the sector level, we cannot rejected them at the subsector level, indicating that homogenous panels of firms could be described by a common functional form of growth rate distribution.