نتایج جستجو برای: kahane

تعداد نتایج: 157  

2015
Douglas Henrique Milanez Ed C. M. Noyons

Advances concerning publication-level classification system have been demonstrated striking results by dealing properly with emergent, complex and interdisciplinary research areas, such as nanotechnology and nanocellulose. However, less attention has been paid to propose a delineation procedure using specific subjects and understand how it could provide interesting regards about it. This study ...

2002
François Rodier

Boolean functions on the space F2 are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In both cases, the properties of systems depend on the nonlinearity of a boolean function. The nonlinearity is linked to the covering radius of Reed-Muller codes (cf. for instance P. Langevin [9]). It is also an important cryptograp...

2009
Giuseppe Longo

In this text, we will attempt to shortly highlight certain constitutive principles of the particular form of knowledge provided by the digital machine, the modern computer, in its relationship to Mathematics (from which it originates) and to the Natural Sciences (Physics and Biology). Our basic thesis is that the historical and conceptual richness of the theory which enabled the concrete realiz...

2010
BARBARA HEIMAN

Let G be an infinite compact group with dual object 2 Letting 3C0 be the representation space for a G 2, S2(2) is the set [A = (A°) EÏÏ *('3C„): Mil, = 2„dalr(A°A°') < oo}. For A G S2(2), we show that there is a function/in C(G) such that l|/l|œ « CM!12 and Tr(/(o)/(o)') » Tt(A°A°') for every o G 2. In a 1977 paper [3], K. de Leeuw, Y. Katznelson and J.-P. Kahane proved that every square summab...

2012
Tom Wenzel

National Laboratory is an equal opportunity employer. i Acknowledgements We would like to thank those who reviewed earlier drafts of this report, and provided helpful comments and insights: ii iii Executive Summary NHTSA recently completed a logistic regression analysis (Kahane 2012) updating its 2003 and 2010 studies of the relationship between vehicle mass and US fatality risk per vehicle mil...

2006
WOJCIECH CHOJNACKI

We discuss different types of almost periodicity of trajectories of cocycles on compact solenoidal groups in relation to various notions of triviality of these cocycles. Introduction Let G be a compact solenoidal group, that is, a compact Abelian group containing, as a dense subgroup, the image of IR by a continuous homomorphism, say a. We shall assume that G is not a circle by requiring a to b...

1999
Mark Dras

In applications such as translation and paraphrase, operations are carried out on grammars at the meta level. This paper shows how a meta-grammar, defining structure at the meta level, is useful in the case of such operations; in particular, how it solves problems in the current definition of Synchronous TAG (Shieber, 1994) caused by ignoring such structure in mapping between grammars, for appl...

2005
Sourav Chatterjee

We obtain an asymptotically sharp error bound in the classical Sudakov-Fernique comparison inequality for finite collections of gaussian random variables. Our proof is short and selfcontained, and gives an easy alternative argument for the classical inequality, extended to the case of non-centered processes. 1 Statement of the result Gaussian comparison inequalities are among the most important...

2008
Bertrand Duplantier

Truly man is a marvelously vain, diverse, and undulating object. It is hard to found any constant and uniform judgment on him. Michel de Montaigne, Les Essais, Book I, Chapter 1: “By diverse means we arrive at the same end”; in The Complete Essays of Montaigne, Donald M. Frame transl., Stanford University Press (1958). Pour distinguer les choses les plus simples de celles qui sont compliquées e...

Journal: :Discrete Mathematics 1997
Douglas R. Woodall

It is proved that if every subcontraction of a graph G contains a vertex with degree at most k, then the chromatic polynomial of G is positive throughout the interval (k, c~); Kk+l shows that this interval is the largest possible. It is conjectured that the largest real zero of the chromatic polynomial of a z-chromatic planar graph is always less than X. For Z = 2 and 3, constructions are given...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید