Search results for " Geometry."

showing 10 items of 2189 documents

A Weitzenböck formula for the damped Ornstein–Uhlenbeck operator in adapted differential geometry

2001

Abstract On the Riemannian path space we consider the Ornstein–Uhlenbeck operator associated to the Dirichlet form E (f,g)=E〈 ∇ f, ∇ g〉 H , where ∇ is the damped gradient and 〈·,·〉 H the scalar product of the Cameron–Martin space H . We prove a corresponding Weitzenbock formula restricted to adapted vector fileds: the Ricci-tensor is shown to be equal to the identity.

Dirichlet formScalar (mathematics)Mathematical analysisOrnstein–Uhlenbeck processGeneral MedicineRiemannian geometrysymbols.namesakeMathematics::ProbabilityDifferential geometrysymbolsVector fieldOrnstein–Uhlenbeck operatorRicci curvatureMathematicsComptes Rendus de l'Académie des Sciences - Series I - Mathematics
researchProduct

Geometry and analysis of Dirichlet forms (II)

2014

Abstract Given a regular, strongly local Dirichlet form E , under assumption that the lower bound of the Ricci curvature of Bakry–Emery, the local doubling and local Poincare inequalities are satisfied, we obtain that: (i) the intrinsic differential and distance structures of E coincide; (ii) the Cheeger energy functional Ch d E is a quadratic norm. This shows that (ii) is necessary for the Riemannian Ricci curvature defined by Ambrosio–Gigli–Savare to be bounded from below. This together with some recent results of Ambrosio–Gigli–Savare yields that the heat flow gives a gradient flow of Boltzman–Shannon entropy under the above assumptions. We also obtain an improvement on Kuwada's duality …

Dirichlet formta111Mathematical analysisGeometryCurvatureUpper and lower boundsDirichlet distributionsymbols.namesakeBounded functionsymbolsMathematics::Metric GeometryMathematics::Differential GeometryAnalysisRicci curvatureEnergy functionalScalar curvatureMathematicsJournal of Functional Analysis
researchProduct

Evolution Problems Associated to Linear Growth Functionals: The Dirichlet Problem

2003

Let Ω be a bounded set inIR N with Lipschitz continuous boundary ∂Ω. We are interested in the problem

Dirichlet problemPure mathematicsBounded setMathematical analysisBoundary (topology)Dirichlet's energyLipschitz continuityElliptic boundary value problemDirichlet kernelsymbols.namesakeDirichlet's principlesymbolsMathematics::Metric GeometryMathematics
researchProduct

On the Ball-Marsden-Slemrod obstruction for bilinear control systems

2019

International audience; In this paper we present an extension to the case of $L^1$-controls of a famous result by Ball--Marsden--Slemrod on the obstruction to the controllability of bilinear control systems in infinite dimensional spaces.

Discrete mathematics010102 general mathematics01 natural sciences010101 applied mathematicsControllabilityAlgebraBilinear controlOptimization and Control (math.OC)Settore MAT/05FOS: MathematicsBall (mathematics)[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]0101 mathematicsMathematics - Optimization and ControlMathematics::Symplectic GeometryMathematics
researchProduct

Point counting on Picard curves in large characteristic

2005

We present an algorithm for computing the cardinality of the Jacobian of a random Picard curve over a finite field. If the underlying field is a prime field Fp, the algorithm has complexity O(p).

Discrete mathematicsAlgebra and Number TheoryApplied MathematicsJacobian varietyGeometryField (mathematics)Computational Mathematicssymbols.namesakeMathematics::Algebraic GeometryFinite fieldPoint countingCardinalityJacobian matrix and determinantsymbolsPicard hornPrime fieldMathematicsMathematics of Computation
researchProduct

An elementary proof of Hilbertʼs theorem on ternary quartics

2012

Abstract In 1888, Hilbert proved that every nonnegative quartic form f = f ( x , y , z ) with real coefficients is a sum of three squares of quadratic forms. His proof was ahead of its time and used advanced methods from topology and algebraic geometry. Up to now, no elementary proof is known. Here we present a completely new approach. Although our proof is not easy, it uses only elementary techniques. As a by-product, it gives information on the number of representations f = p 1 2 + p 2 2 + p 3 2 of f up to orthogonal equivalence. We show that this number is 8 for generically chosen f, and that it is 4 when f is chosen generically with a real zero. Although these facts were known, there wa…

Discrete mathematicsAlgebra and Number TheorySums of squaresQuartic functionElementary proofZero (complex analysis)Algebraic geometryTernary operationEquivalence (measure theory)PolynomialsTopology (chemistry)MathematicsJournal of Algebra
researchProduct

New lower bounds for the minimum distance of generalized algebraic geometry codes

2013

Abstract In this paper, we give a new lower bound for generalized algebraic geometry codes with which we are able to construct some new linear codes having better parameters compared with the ones known in the literature. Moreover, we give a relationship between a family of generalized algebraic geometry codes and algebraic geometry codes. Finally, we propose a decoding algorithm for such a family.

Discrete mathematicsAlgebraic cycleBlock codeAlgebraic function field generalized algebraic geometry codes minimum distanceAlgebra and Number TheoryDerived algebraic geometryFunction field of an algebraic varietyAlgebraic surfaceReal algebraic geometryDimension of an algebraic varietySettore MAT/03 - GeometriaLinear codeMathematicsJournal of Pure and Applied Algebra
researchProduct

An Efficient Algorithm for the Generation of Z-Convex Polyominoes

2014

We present a characterization of Z-convex polyominoes in terms of pairs of suitable integer vectors. This lets us design an algorithm which generates all Z-convex polyominoes of size n in constant amortized time.

Discrete mathematicsAmortized analysisMathematics::CombinatoricsSettore INF/01 - InformaticaPolyominoEfficient algorithmRegular polygonComputer Science::Computational GeometryCharacterization (mathematics)CombinatoricsIntegerComputer Science::Discrete MathematicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYConstant (mathematics)TetrominoZ-convex polyominoes generation.Mathematics
researchProduct

On 2-(n^2,2n,2n-1) designs with three intersection numbers

2007

The simple incidence structure $${\mathcal{D}(\mathcal{A},2)}$$ , formed by the points and the unordered pairs of distinct parallel lines of a finite affine plane $${\mathcal{A}=(\mathcal{P}, \mathcal{L})}$$ of order n > 4, is a 2 --- (n 2,2n,2n---1) design with intersection numbers 0,4,n. In this paper, we show that the converse is true, when n ? 5 is an odd integer.

Discrete mathematicsApplied Mathematics2-designsOrder (ring theory)ParallelComputer Science ApplicationsCombinatoricsIntegerIntersectionIncidence structureSimple (abstract algebra)Affine plane (incidence geometry)Settore MAT/03 - GeometriaMathematics
researchProduct

Some fixed point theorems for generalized contractive mappings in complete metric spaces

2015

We introduce new concepts of generalized contractive and generalized alpha-Suzuki type contractive mappings. Then, we obtain sufficient conditions for the existence of a fixed point of these classes of mappings on complete metric spaces and b-complete b-metric spaces. Our results extend the theorems of Ciric, Chatterjea, Kannan and Reich.

Discrete mathematicsApplied MathematicsFixed-point theoremProduct metricFixed pointComplete metric spaceConvex metric spaceMetric spaceDifferential geometryfixed pointSettore MAT/05 - Analisi Matematicacomplete metric spaceweak C-contractionGeometry and TopologyCoincidence pointMathematicsFixed Point Theory and Applications
researchProduct