Search results for "Bounds"

showing 10 items of 298 documents

Finite renormalization effects in the induceds¯dHvertex

1986

The finite renormalization contributions to the s-bard-italicH-italic vertex are examined in the standard model. They are explicitly shown to cancel each other among diagrams, so that the lower bound on the Higgs-boson mass M-italic/sub H-italic/>325 MeV is not affected by such effects.

PhysicsVertex (graph theory)Computer Science::Information RetrievalHigh Energy Physics::PhenomenologyQuark modelFísicaLie groupElementary particleSymmetry groupUpper and lower boundsRenormalizationStandard Model (mathematical formulation)Quantum mechanicsPhysical Review D
researchProduct

Geometric Origin of the Tennis Racket Effect

2020

The tennis racket effect is a geometric phenomenon which occurs in a free rotation of a three-dimensional rigid body. In a complex phase space, we show that this effect originates from a pole of a Riemann surface and can be viewed as a result of the Picard-Lefschetz formula. We prove that a perfect twist of the racket is achieved in the limit of an ideal asymmetric object. We give upper and lower bounds to the twist defect for any rigid body, which reveals the robustness of the effect. A similar approach describes the Dzhanibekov effect in which a wing nut, spinning around its central axis, suddenly makes a half-turn flip around a perpendicular axis and the Monster flip, an almost impossibl…

Physics[PHYS]Physics [physics]Riemann surfaceGeneral Physics and AstronomyClassical Physics (physics.class-ph)FOS: Physical sciencesMathematical Physics (math-ph)Physics - Classical PhysicsRigid body01 natural sciencesUpper and lower boundssymbols.namesakePerpendicular AxisClassical mechanics[MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph]Phase space0103 physical sciencesRacketsymbolsIdeal (ring theory)Twist010306 general physicscomputerMathematical Physicscomputer.programming_language
researchProduct

Constraints of reduced density-matrix functional theory for the two-dimensional homogeneous electron gas

2011

Reduced density-matrix functional theory (RDMFT) has become an appealing alternative to density-functional theory to describe electronic properties of strongly correlated systems. Here we derive exact conditions for the suitability of RDMFT to describe the two-dimensional homogeneous electron gas, which is the base system for semiconductor quantum dots and quantum Hall devices, for example. Following the method of Cioslowski and Pernal [J. Chem. Phys. 111, 3396 (1999)] we focus on the properties of power functionals of the form $f(n,{n}^{\ensuremath{'}})={(n{n}^{\ensuremath{'}})}^{\ensuremath{\alpha}}$ for the scaling function in the exchange-correlation energy. We show that in order to hav…

Physicsta114Strongly Correlated Electrons (cond-mat.str-el)Order (ring theory)FOS: Physical sciencesQuantum Hall effectCondensed Matter PhysicsUpper and lower boundsElectronic Optical and Magnetic MaterialsBase (group theory)Condensed Matter - Strongly Correlated ElectronsQuantum mechanicsFermi gasScalingEnergy (signal processing)Ansatz
researchProduct

On Inverse Distance Weighting in Pollution Models

2011

When evaluating the impact of pollution, measurements from remote stations are often weighted by the inverse of distance raised to some nonnegative power (IDW). This is derived from Shepard's method of spatial interpolation (1968). The paper discusses the arbitrary character of the exponent of distance and the problem of monitoring stations that are close to the reference point. From elementary laws of physics, it is determined which exponent of distance should be chosen (or its upper bound) depending on the form of pollution encountered, such as radiant pollution (including radioactivity and sound), air pollution (plumes, puffs, and motionless clouds by using the classical Gaussian model),…

PollutionMeteorologymedia_common.quotation_subjectAir pollutionmedicine.disease_causeUpper and lower boundsWeightingMultivariate interpolationsymbols.namesakeInverse distance weightingsymbolsExponentmedicineEnvironmental scienceGaussian network modelPhysics::Atmospheric and Oceanic Physicsmedia_commonSSRN Electronic Journal
researchProduct

Pollution models and inverse distance weighting: some critical remarks

2013

International audience; When evaluating the impact of pollution, measurements from remote stations are often weighted by the inverse of distance raised to some nonnegative power (IDW). This is derived from Shepard's method of spatial interpolation (1968). The paper discusses the arbitrary character of the exponent of distance and the problem of monitoring stations that are close to the reference point. From elementary laws of physics, it is determined which exponent of distance should be chosen (or its upper bound) depending on the form of pollution encountered, such as radiant pollution (including radioactivity and sound), air pollution (plumes, puffs, and motionless clouds by using the cl…

PollutionMeteorologymedia_common.quotation_subjectAir pollutionmedicine.disease_causeWeightingdistance inverseUpper and lower boundsMultivariate interpolationsymbols.namesakeInverse distance weightingStatisticsmedicineIDW[ SHS.ECO ] Humanities and Social Sciences/Economies and financesComputers in Earth Sciences[SHS.ECO] Humanities and Social Sciences/Economics and FinancePhysics::Atmospheric and Oceanic Physicsmedia_commonMathematicsExponentexposant[SHS.ECO]Humanities and Social Sciences/Economics and Finance[SDE.ES]Environmental Sciences/Environmental and SocietyPollutionWeightingpondérationExponentsymbolsShepard[SDE.ES] Environmental Sciences/Environmental and SocietyGaussian network modelInverse distance[ SDE.ES ] Environmental Sciences/Environmental and SocietyInformation Systems
researchProduct

Upper bounds for the zeros of ultraspherical polynomials

1990

AbstractFor k = 1, 2, …, [n2] let xnk(λ) denote the Kth positive zero in decreasing order of the ultraspherical polynomial Pn(λ)(x). We establish upper bounds for xnk(λ). All the bounds become exact when λ = 0 and, in some cases (see case (iii) of Theorem 3.1), also when λ = 1. As a consequence of our results, we obtain for the largest zero xn1(λ)0.. We point out that our results remain useful for large values of λ. Numerical examples show that our upper bounds are quite sharp.

PolynomialMathematics(all)Numerical AnalysisGegenbauer polynomialsDifferential equationGeneral MathematicsApplied MathematicsMathematical analysisZero (complex analysis)Upper and lower boundsCombinatoricssymbols.namesakesymbolsOrder (group theory)Newton's methodAnalysisMathematicsJournal of Approximation Theory
researchProduct

Coherence Checking and Propagation of Lower Probability Bounds

2003

In this paper we use imprecise probabilities, based on a concept of generalized coherence (g-coherence), for the management of uncertain knowledge and vague information. We face the problem of reducing the computational difficulties in g-coherence checking and propagation of lower conditional probability bounds. We examine a procedure, based on linear systems with a reduced number of unknowns, for the checking of g-coherence. We propose an iterative algorithm to determine the reduced linear systems. Based on the same ideas, we give an algorithm for the propagation of lower probability bounds. We also give some theoretical results that allow, by suitably modifying our algorithms, the g-coher…

Probability boxMathematical optimizationSettore MAT/06 - Probabilita' E Statistica MatematicaPosterior probabilitynon relevant gainLaw of total probabilityConditional probabilitybasic setsbasic sets; basic sets.; g-coherence checking; lower conditional probability bounds; non relevant gains; propagationCoherence (statistics)Conditional probability distributiong-coherence checking; lower conditional probability bounds; non relevant gainsImprecise probabilityTheoretical Computer Sciencelower conditional probability boundRegular conditional probabilitynon relevant gainspropagationlower conditional probability boundsGeometry and Topologyg-coherence checkingSoftwareMathematics
researchProduct

Quantum Property Testing for Bounded-Degree Graphs

2011

We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion, we also prove an Omega(N^(1/4)) quantum query lower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantum algorithms follow from a combination of classical property testing techniques due to Goldreich and Ron, derandomization, and the quantum algorithm for element distinctness. The quantum lower bound is obtained by the polynomial method, using novel algebraic techniques and combinatorial analysis to accommodate the graph s…

Property testingDiscrete mathematicsSpeedupTheoryofComputation_GENERAL0102 computer and information sciences16. Peace & justice01 natural sciencesUpper and lower boundsExponential function010201 computation theory & mathematicsComputerSystemsOrganization_MISCELLANEOUSBounded function0103 physical sciencesQuantum algorithmAlgebraic number010306 general physicsQuantumMathematics
researchProduct

A note on the Schur multiplier of a nilpotent Lie algebra

2011

For a nilpotent Lie algebra $L$ of dimension $n$ and dim$(L^2)=m$, we find the upper bound dim$(M(L))\leq {1/2}(n+m-2)(n-m-1)+1$, where $M(L)$ denotes the Schur multiplier of $L$. In case $m=1$ the equality holds if and only if $L\cong H(1)\oplus A$, where $A$ is an abelian Lie algebra of dimension $n-3$ and H(1) is the Heisenberg algebra of dimension 3.

Pure mathematicsAlgebra and Number TheoryDimension (graph theory)Schur multiplier nilpotent Lie algebrasMathematics - Rings and AlgebrasUpper and lower boundsNilpotent Lie algebraSettore MAT/02 - Algebra17B30 17B60 17B99Rings and Algebras (math.RA)Lie algebraFOS: MathematicsSettore MAT/03 - GeometriaAlgebra over a fieldAbelian groupMathematicsSchur multiplier
researchProduct

A priori bounds and multiplicity of solutions for an indefinite elliptic problem with critical growth in the gradient

2019

Let $\Omega \subset \mathbb R^N$, $N \geq 2$, be a smooth bounded domain. We consider a boundary value problem of the form $$-\Delta u = c_{\lambda}(x) u + \mu(x) |\nabla u|^2 + h(x), \quad u \in H^1_0(\Omega)\cap L^{\infty}(\Omega)$$ where $c_{\lambda}$ depends on a parameter $\lambda \in \mathbb R$, the coefficients $c_{\lambda}$ and $h$ belong to $L^q(\Omega)$ with $q>N/2$ and $\mu \in L^{\infty}(\Omega)$. Under suitable assumptions, but without imposing a sign condition on any of these coefficients, we obtain an a priori upper bound on the solutions. Our proof relies on a new boundary weak Harnack inequality. This inequality, which is of independent interest, is established in the gener…

Pure mathematicsApplied MathematicsGeneral Mathematics010102 general mathematicsMultiplicity (mathematics)01 natural sciencesUpper and lower bounds010101 applied mathematicsMathematics - Analysis of PDEsBounded functionFOS: MathematicsA priori and a posteriori[MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP]Boundary value problem0101 mathematicsComputingMilieux_MISCELLANEOUSAnalysis of PDEs (math.AP)35A23 35B45 35J25 35J92Harnack's inequalityMathematics
researchProduct