Role of the Soffer bound in determination of transversity and the tensor charge
Not Available
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Not Available
Abstract We analyze constraints from perturbative unitarity and crossing on the leading contributions of higher-dimension operators to the four-graviton amplitude in four spacetime dimensions, including constraints that follow from distinct helicity configurations. We focus on the leading-order effect due to exchange by massive degrees of freedom which makes the amplitudes of interest infrared finite. In particular, we place a bound on the coefficient of the R 3 operator that corrects the graviton three-point amplitude in terms of the R 4 coefficient. To test the constraints we obtain nontrivial effective field-theory data by computing and taking the large-mass expansion of the one-loop minimally-coupled four-graviton amplitude with massive particles up to spin 2 circulating in the loop. Remarkably, we observe that the leading EFT coefficients obtained from both string and one-loop field-theory amplitudes lie in small islands. The shape and location of the islands can be derived from the dispersive representation for the Wilson coefficients using crossing and assuming that the lowest-spin spectral densities are the largest. Our analysis suggests that the Wilson coefficients of weakly-coupled gravitational physical theories are much more constrained than indicated by bounds arising from dispersive considerations of 2 → 2 scattering. The one-loop four-graviton amplitudes used to obtain the EFT data are computed using modern amplitude methods, including generalized unitarity, supersymmetric decompositions and the double copy.
We discuss various formal aspects of contour deformations used to alleviate sign problems; most importantly, relating these contour deformations to a certain convex optimization problem. As a consequence of this connection we describe a general method for proving upper bounds on the average phase achievable by the contour deformation method. Using this method we show that Abelian lattice Yang-Mills in two spacetime dimensions possesses, for many values of the complex coupling, an exponential sign problem that cannot be removed via any contour deformation. Published by the American Physical Society 2024
Existing generator parameterization methods, typically developed for large turbine generator units, are difficult to apply to small kW-level diesel generators in microgrid applications. Here, this article presents a model parameterization method that estimates a complete set of kW-level diesel generator parameters simultaneously using only load-step-change tests with limited measurement points. This method provides a more cost-efficient and robust approach to achieve high-fidelity modeling of diesel generators for microgrid dynamic simulation. A two-stage hybrid box-constrained Levenberg-Marquardt (H-BCLM) algorithm is developed to search the optimal parameter set given the parameter bounds. A heuristic algorithm, namely Generalized Opposition-based Learning Genetic Algorithm (GOL-GA), is applied to identify proper initial estimates at the first stage, followed by a modified Levenberg-Marquardt algorithm designed to fine tune the solution based on the first-stage result. The proposed method is validated against dynamic simulation of a diesel generator model and field measurements from a 16kW diesel generator unit.
Some results of studies of convergence and accuracy of finite element approximations of certain nonlinear problems encountered in finite elasticity are presented. A general technique for obtaining error bounds is also described together with an existence theorem. Numerical results obtained by solving a representative problem are also included.
A model was developed for the prediction of rain attenuation statistics for 8 rain rate climate regions spanning all land regions from the equator to the poles. The model uses empirically determined rain rate distributions for each climate region and an empirical model to estimate path averaged rain rate for given values of point rain rate. Attenuation distribution observations were compared with model predictions. Good agreement was obtained for earth-space paths at 0.1 percent of the year. At the extremes, 0.01 and 1 percent of the year the observations were generally within the model estimate bounds but the agreement is not as good as at 0.1 percent of the year. The discrepancies are attributed to the limited duration of the attenuation observations and to the limited number of rain rate distribution observations.
It is found that the near ionopause environs play a crucial role in the tail formation process at both Venus and G-Z and that draping at the two very different sized bodies occurs on ionopause scale sizes. On the other hand, ion densities, downtail mass fluxes, tailward J x B forces, and lobe betas are factors of about 10,000, 50, 100, and 20 times greater in the G-Z tail than in Venus', while bulk flow speeds and ion temperatures are factors of about 15 and 240 times lower. These large quantitative differences in the properties within the two magnetotails are attributable to the significantly greater upstream mass loading of the solar wind by the extended neutral atmosphere at G-Z (comets in general) compared to the gravitationally bound atmosphere of Venus.
When a controller is implemented in a digital computer, with A/D and D/A conversion, the numerical errors of the computation can drastically affect the performance of the control system. There exists realizations of a given controller transfer function yielding arbitrarily large effects from computational errors. Since, in general, there is no upper bound, it is important to have a systematic way of reducing these effects. Optimum controller designs are developed which take account of the digital round-off errors in the controller implementation and in the A/D and D/A converters. These results provide a natural extension to the Linear Quadratic Gaussian (LQG) theory since they reduce to the standard LQG controller when infinite precision computation is used. But for finite precision the separation principle does not hold.
There exist realizations of a given controller transfer function yielding arbitrarily large effects from computational errors. Since, in general, there is no upper bound, it is important to have a systematic way of reducing these effects. Optimum controller designs are developed which take into account the digital round-off errors in the controller implementation and in the A/D and D/A converters. These results provide a natural extension to the LQG (linear quadratic Gaussian) theory since they reduce to the standard LQG controller when infinite-precision computation is used, but for finite precision the separation principle does not hold.
When applying homogenization techniques to problems involving lattice structures, it is necessary to extend certain functions defined on a perforated domain to a simply connected domain. This paper provides general extension operators which preserve bounds on derivatives of order l. Only the special case of honeycomb structures is considered.
We consider a posteriori error estimates for finite volume and finite element methods on arbitrary meshes subject to prescribed error functionals. Error estimates of this type are useful in a number of computational settings: (1) quantitative prediction of the numerical solution error, (2) adaptive meshing, and (3) load balancing of work on parallel computing architectures. Our analysis recasts the class of Godunov finite volumes schemes as a particular form of discontinuous Galerkin method utilizing broken space approximation obtained via reconstruction of cell-averaged data. In this general framework, weighted residual error bounds are readily obtained using duality arguments and Galerkin orthogonality. Additional consideration is given to issues such as nonlinearity, efficiency, and the relationship to other existing methods. Numerical examples are given throughout the talk to demonstrate the sharpness of the estimates and efficiency of the techniques. Additional information is contained in the original.
We point out a problem with the formulation and derivations of sum rules for quark fragmentation functions that impacts their validity in QCD, but which potentially points toward an improved understanding of final states in inclusive hard processes. Fragmentation functions give the distribution of final-state hadrons arising from a parton exiting a hard scattering, and the sum rules for momentum, electric charge, etc. express conservation of these quantities. The problem arises from a mismatch between the quark quantum numbers of the initial quark and the fact that all observed final-state hadrons are confined bound states with color zero. We point that, in a confining theory like QCD, the Wilson line in the operator definition of a fragmentation function entails that the final state in a fragmentation function includes a bound state in the external field generated by the Wilson line. We justify this with the aid of general features of string hadronization. The anomalous bound states are restricted to fractional momentum z = 0 . They tend to invalidate sum rules like the one for charge conservation when applied to the fragmentation functions inferred from experimental data but not the momentum sum rule. We propose to exploit our ideas in future studies as a way to relate the fragmentation functions extracted from inclusive cross sections to more detailed nonperturbative descriptions of final state hadronization. We also describe scenarios wherein the traditional sum rules might remain approximately valid with a reasonably high degree of accuracy. Published by the American Physical Society 2024
Point containment queries for regions bound by watertight geometric surfaces, i.e., closed and without self-intersections, can be evaluated straightforwardly with a number of well-studied algorithms. When this assumption on domain geometry is not met, such methods are either unusable, or prone to misclassifications that can lead to cascading errors in downstream applications. More robust point classification schemes based on generalized winding numbers have been proposed, as they are indifferent to these imperfections. However, existing algorithms are limited to point clouds and collections of linear elements. We extend this methodology to encompass more general curved shapes with an algorithm that evaluates the winding number scalar field over unstructured collections of rational parametric curves. In particular, we evaluate the winding number for each curve independently, making the derived containment query robust to how the curves are arranged. We ensure geometric fidelity in our queries by treating each curve as equivalent to an adaptively constructed polyline that provably has the same generalized winding number at the point of interest. Our algorithm is numerically stable for points that are arbitrarily close to the model, and explicitly treats points that are coincident with curves. We demonstrate the improvements in computational performance granted by this method over conventional techniques as well as the robustness induced by its application.
Approximate computing techniques, which trade off the computation accuracy of an algorithm for better performance and energy efficiency, have been successful in reducing computation and power costs in several domains. However, error sensitive applications in high-performance computing are unable to benefit from existing approximate computing strategies that are not developed with guaranteed error bounds. While approximate computing techniques can be developed for individual high-performance computing applications by domain specialists, this often requires additional theoretical analysis and potentially extensive software modification. Hence, the development of low-level error-bounded approximate computing strategies that can be introduced into any high-performance computing application without requiring additional analysis or significant software alterations is desirable. In this paper, we provide a contribution in this direction by proposing a general framework for designing error-bounded approximate computing strategies and apply it to the dot product kernel to develop \bf qdot---an error-bounded approximate dot product kernel. Following the introduction of qdot, here we perform a theoretical analysis that yields a deterministic bound on the relative approximation error introduced by qdot. Empirical tests are performed to illustrate the tightness of the derived error bound and to demonstrate the effectiveness of qdot on a synthetic dataset, as well as two scientific benchmarks---the conjugate gradient (CG) and power methods. In some instances, using qdot for the dot products in CG can result in many components being quantized to half precision without increasing the iteration count required for convergence to the same solution as CG using a double precision dot product.
A conservative data transfer (remap) between two meshes is an important step of arbitrary Lagrangian-Eulerian (ALE) hydrodynamics simulations. High-order numerical methods for ALE simulations require both high-order (curvilinear) meshes and high-order remap algorithms. Here we develop a conservative and bounds-preserving method for accurate remapping of discrete fields on generalized polygonal meshes with curvilinear edges. The properties of the proposed method are studied theoretically and numerically for various (smooth and non-smooth) mesh deformations and discrete fields that represent smooth and discontinuous functions.
We give rigorous analytical results on the temporal behavior of two-point correlation functions—also known as dynamical response functions or Green’s functions—in closed many-body quantum systems. We show that in a large class of translation-invariant models the correlation functions factorize at late times $\langle$A ( t ) B$\rangle$ β → $\langle$ A$\rangle$ β $\langle$ B$\rangle$ β , thus proving that dissipation emerges out of the unitary dynamics of the system. We also show that for systems with a generic spectrum the fluctuations around this late-time value are bounded by the purity of the thermal ensemble, which generally decays exponentially with system size. For autocorrelation functions we provide an upper bound on the timescale at which they reach the factorized late time value. Remarkably, this bound is only a function of local expectation values and does not increase with system size. We give numerical examples that show that this bound is a good estimate in nonintegrable models, and argue that the timescale that appears can be understood in terms of an emergent fluctuation-dissipation theorem. Our study extends to further classes of two point functions such as the symmetrized ones and the Kubo function that appears in linear response theory, for which we give analogous results.
Infrared fixed points of gauge theories provide intriguing targets for the modern conformal bootstrap program. In this work we provide some preliminary evidence that a family of gauged fermionic CFTs saturate bootstrap bounds and can potentially be solved with the conformal bootstrap. We start by considering the bootstrap for SO( N ) vector 4-point functions in general dimension D . In the large N limit, upper bounds on the scaling dimensions of the lowest SO( N ) singlet and traceless symmetric scalars interpolate between two solutions at Δ = D/ 2 – 1 and Δ = D – 1 via generalized free field theory. In 3D the critical O ( N ) vector models are known to saturate the bootstrap bounds and correspond to the kinks approaching Δ = 1 / 2 at large N . We show that the bootstrap bounds also admit another infinite family of kinks \( {\mathcal{T}}_D \) , which at large N approach solutions containing free fermion bilinears at Δ = D – 1 from below. The kinks \( {\mathcal{T}}_D \) appear in general dimensions with a D -dependent critical N * below which the kink disappears. We also study relations between the bounds obtained from the bootstrap with SO( N ) vectors, SU( N ) fundamentals, and SU( N ) × SU( N ) bi-fundamentals. We provide a proof for the coincidence between bootstrap bounds with different global symmetries. We show evidence that the proper symmetries of the underlying theories of \( {\mathcal{T}}_D \) are subgroups of SO( N ), and we speculate that the kinks \( {\mathcal{T}}_D \) relate to the fixed points of gauge theories coupled to fermions.
The Bekenstein bound posits a maximum entropy for matter with finite energy confined to a spatial region. It is often interpreted as a fundamental limit on the information that can be stored by physical objects. In this work, we test this interpretation by asking whether the Bekenstein bound imposes constraints on a channel's communication capacity, a context in which information can be given a mathematically rigorous and operationally meaningful definition. We study specifically the Unruh channel that describes a stationary Alice exciting different species of free scalar fields to send information to an accelerating Bob, who is confined to a Rindler wedge and exposed to the noise of Unruh radiation. We show that the classical and quantum capacities of the Unruh channel obey the Bekenstein bound that pertains to the decoder Bob. In contrast, even at high temperatures, the Unruh channel can transmit a significant number of zero-bits , which are quantum communication resources that can be used for quantum identification and many other primitive protocols. Therefore, unlike classical bits and qubits, zero-bits and their associated information processing capability are generally not constrained by the Bekenstein bound. However, we further show that when both the encoder and the decoder are restricted, the Bekenstein bound does constrain the channel capacities, including the zero-bit capacity.