Results 1  10
of
243,191
RIGOROUS BOUNDS FOR FORM FACTORS
, 1977
"... Rigorous bounds are described for form factors for scalar and spinor particles using sidewise dispersion relations. Bounds on the large q2 behavior and the DrellYanWest relation are discussed and related to the propagator weight function for possible interpolating fields for the particle involved. ..."
Abstract
 Add to MetaCart
Rigorous bounds are described for form factors for scalar and spinor particles using sidewise dispersion relations. Bounds on the large q2 behavior and the DrellYanWest relation are discussed and related to the propagator weight function for possible interpolating fields for the particle involved.lI.
On the Kertész line: Some rigorous bounds
, 2008
"... We study the Kertész line of the q–state Potts model at (inverse) temperature β, in presence of an external magnetic field h. This line separates two regions of the phase diagram according to the existence or not of an infinite cluster in the FortuinKasteleyn representation of the model. It is know ..."
Abstract
 Add to MetaCart
We study the Kertész line of the q–state Potts model at (inverse) temperature β, in presence of an external magnetic field h. This line separates two regions of the phase diagram according to the existence or not of an infinite cluster in the FortuinKasteleyn representation of the model. It is known that the Kertész line hK(β) coincides with the line of first order phase transition for small fields when q is large enough. Here we prove that the first order phase transition implies a jump in the density of the infinite cluster, hence the Kertész line remains below the line of first order phase transition. We also analyze the region of large fields and prove, using techniques of stochastic comparisons, that hK(β) equals log(q−1)−log(β −βp) to the leading order, as β goes to βp = − log(1−pc) where pc is the threshold for bond percolation.
A rigorous bound on quark distributions in the nucleon
, 2003
"... I deduce an inequality between the helicity and the transversity distribution of a quark in a nucleon, at small energy scales. Then I establish, thanks to the positivity constraint, a rigorous bound on longitudinally polarized valence quark densities, which finds nontrivial applications to dquarks. ..."
Abstract
 Add to MetaCart
I deduce an inequality between the helicity and the transversity distribution of a quark in a nucleon, at small energy scales. Then I establish, thanks to the positivity constraint, a rigorous bound on longitudinally polarized valence quark densities, which finds nontrivial applications to d
Rigorous bounds on the Hausdorff dimension of Siegel disc boundaries
, 1998
"... We calculate rigorous bounds on the Hausdorff dimension of Siegel disc boundaries for maps that are attracted to the critical fixed point of the renormalization operator. This is done by expressing (a piece of) the universal invariant curve of the fixedpoint maps as the limit set of an iterated fun ..."
Abstract
 Add to MetaCart
We calculate rigorous bounds on the Hausdorff dimension of Siegel disc boundaries for maps that are attracted to the critical fixed point of the renormalization operator. This is done by expressing (a piece of) the universal invariant curve of the fixedpoint maps as the limit set of an iterated
Computing Rigorous Bounds to the Accuracy of Calibrated Stereo Reconstruction
, 2004
"... We deal with the problem of computing rigorous bounds to the position of 3D points obtained by stereo triangulation when both the camera matrix and the coordinates of image points are affected by measurement errors. By “rigorous bounds ” we mean that the true unknown 3D points are guaranteed to li ..."
Abstract
 Add to MetaCart
We deal with the problem of computing rigorous bounds to the position of 3D points obtained by stereo triangulation when both the camera matrix and the coordinates of image points are affected by measurement errors. By “rigorous bounds ” we mean that the true unknown 3D points are guaranteed
Rigorous bounds on cryptanalytic time/memory tradeoffs
 In Advances in Cryptology—CRYPTO 2006, volume 4117 of LNCS
, 2006
"... Abstract. In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f: {0, 1,..., N − 1} ↦ → {0, 1,..., N − 1}. The model contains all the known tradeoff techniques as special cases. It is based on the new notion of stateful random graph ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
of hidden states. These bounds hold with an overwhelming probability over the random choice of the function f, and their proofs are based on a rigorous combinatorial analysis. With some additional natural assumptions on the behavior of the online phase of the algorithm, we prove a lower bound on its worst
Rigorous Bounds for TwoFrame Structure from Motion
 ECCV 1996 and NECI TR
, 1993
"... We present an analysis of the problem of recovering motion, particularly rotation, from two image frames. We derive an exact bound on the magnitude of the error in recovering the rotation. With the single weak requirement that the average translational image displacements are smaller than the field ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
of view, we demonstrate rigorously that the error in recovering the rotation is small. A lower bound on the rotation error can be derived which, for reasonable values of the field of view, is very close to the upper bound. Thus the upper bound is in fact a good estimate of the rotation error. We
Obtaining rigorous bounds for topological entropy for discrete time dynamical systems
 In Proc. Int. Symposium on Nonlinear Theory and its Applications, NOLTA’02
, 2002
"... In this work we develop a method for finding rigorous bounds for topological entropy of discrete time dynamical systems based on construction of symbolic dynamics embedded within the considered nonlinear map. In order to prove ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In this work we develop a method for finding rigorous bounds for topological entropy of discrete time dynamical systems based on construction of symbolic dynamics embedded within the considered nonlinear map. In order to prove
improved rigorous bounds on the effective elastic moduli of a composite material
 J. Mech. Phys. Solids
, 1984
"... A NEW METHOD for deriving rigorous bounds on the effective elastic constants of a composite material is presented and used to derive a number of known as well as some new bounds. The new approach is based on a presentation of those constants as a sum of simple poles. The locations and strengths of t ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
A NEW METHOD for deriving rigorous bounds on the effective elastic constants of a composite material is presented and used to derive a number of known as well as some new bounds. The new approach is based on a presentation of those constants as a sum of simple poles. The locations and strengths
Compressed Sensing Phase Transitions: Rigorous Bounds versus Replica Predictions
"... Abstract—In recent work, two different methods have been used to characterize the fundamental limits of compressed sensing. On the one hand are rigorous bounds based on informationtheoretic arguments or the analysis of specific algorithms. On the other hand are exact but heuristic predictions made u ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—In recent work, two different methods have been used to characterize the fundamental limits of compressed sensing. On the one hand are rigorous bounds based on informationtheoretic arguments or the analysis of specific algorithms. On the other hand are exact but heuristic predictions made
Results 1  10
of
243,191