Search results for " programmi"

showing 10 items of 1629 documents

New isoperimetric estimates for solutions to Monge - Ampère equations

2009

Abstract We prove some sharp estimates for solutions to Dirichlet problems relative to Monge–Ampere equations. Among them we show that the eigenvalue of the Dirichlet problem, when computed on convex domains with fixed measure, is maximal on ellipsoids. This result falls in the class of affine isoperimetric inequalities and shows that the eigenvalue of the Monge–Ampere operator behaves just the contrary of the first eigenvalue of the Laplace operator.

Dirichlet problemMonge-Ampère operatoreigenvalue.Mathematics::Complex VariablesApplied MathematicsMathematical analysisMathematics::Analysis of PDEsMonge–Ampère equationMonge-Ampère equationMathematics::Spectral TheoryMeasure (mathematics)Operator (computer programming)Settore MAT/05 - Analisi MatematicaAffine isoperimetric inequaltieRayleigh–Faber–Krahn inequalityAffine isoperimetric inequalitiesIsoperimetric inequalityLaplace operatorMathematical PhysicsAnalysisEigenvalues and eigenvectorsMathematics
researchProduct

Aggregation of Risk Level Assessments Based on Fuzzy Equivalence Relation

2017

The paper deals with the problem of aggregation of risk level assessments. We describe the technique of a risk level evaluation taking into account values of the risk level obtained for objects which are in some sense equivalent. For this purpose we propose to use the construction of a general aggregation operator based on the corresponding fuzzy equivalence relation. Numerical example of the investment risk level aggregation using an equivalence relation obtained on the basis of different macroeconomic factors for countries of one region is considered.

Discrete mathematics0209 industrial biotechnologyMathematical optimizationRisk levelBasis (linear algebra)Financial risk02 engineering and technologyFuzzy equivalence relation020901 industrial engineering & automationOperator (computer programming)0202 electrical engineering electronic engineering information engineeringEquivalence relation020201 artificial intelligence & image processingMathematics
researchProduct

The Steiner Traveling Salesman Problem and its extensions

2019

Abstract This paper considers the Steiner Traveling Salesman Problem, an extension of the classical Traveling Salesman Problem on an incomplete graph where not all vertices have demand. Some extensions including several depots or location decisions are introduced, modeled and solved. A compact integer linear programming formulation is proposed for each problem, where the routes are represented with two-index decision variables, and parity conditions are modeled using cocircuit inequalities. Exact branch-and-cut algorithms are developed for all formulations. Computational results obtained confirm the good performance of the algorithms. Instances with up to 500 vertices are solved optimally.

Discrete mathematics050210 logistics & transportation021103 operations researchInformation Systems and ManagementGeneral Computer ScienceComputer science05 social sciences0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchTravelling salesman problemIndustrial and Manufacturing EngineeringGraphVertex (geometry)Modeling and Simulation0502 economics and businessInteger programmingBranch and cutMathematicsofComputing_DISCRETEMATHEMATICSEuropean Journal of Operational Research
researchProduct

On ergodic operator means in Banach spaces

2016

We consider a large class of operator means and prove that a number of ergodic theorems, as well as growth estimates known for particular cases, continue to hold in the general context under fairly mild regularity conditions. The methods developed in the paper not only yield a new approach based on a general point of view, but also lead to results that are new, even in the context of the classical Cesaro means.

Discrete mathematicsAlgebra and Number Theory010102 general mathematicsContext (language use)010103 numerical & computational mathematicsFinite-rank operatorShift operatorCompact operator01 natural sciencesStrictly singular operatorFunctional Analysis (math.FA)Mathematics - Functional AnalysisOperator (computer programming)Multiplication operatorFOS: MathematicsErgodic theory0101 mathematicsAnalysisMathematics
researchProduct

Some integral type fixed point theorems in Non-Archimedean Menger PM-Spaces with common property (E.A) and application of functional equations in dyn…

2013

In this paper, we prove some integral type common fixed point theorems for weakly compatible mappings in Non-Archimedean Menger PM-spaces employing common property (E.A). Some examples are furnished which demonstrate the validity of our results. We extend our main result to four finite families of self-mappings employing the notion of pairwise commuting. Moreover, we give an application which supports the usability of our main theorem.

Discrete mathematicsAlgebra and Number TheoryWeakly compatible mappingApplied MathematicsFixed-point theoremNon-Archimedean Menger PM-spaceT-normt-normFixed pointType (model theory)Fixed pointCommon property (E.A)Dynamic programmingComputational MathematicsMenger's theoremSettore MAT/05 - Analisi MatematicaCommon propertyPairwise comparisonGeometry and TopologyProperty (E.A)AnalysisMathematics
researchProduct

Fixed Point Theorems with Applications to the Solvability of Operator Equations and Inclusions on Function Spaces

2015

1Department of Mathematics, King Abdulaziz University, P.O. Box 80203, Jeddah 21589, Saudi Arabia 2Department of Mathematical Analysis, University of Valencia, Spain 3Centre Universitaire Polydisciplinaire, Kelaa des Sraghna, Morocco 4Universite Cadi Ayyad, Laboratoire de Mathematiques et de Dynamique de Populations, Marrakech, Morocco 5Department of Mathematics and Computer Science, University of Palermo, Via Archirafi 34, 90123 Palermo, Italy

Discrete mathematicsAlgebraOperator (computer programming)Article SubjectFunction spacelcsh:MathematicsFixed-point theoremlcsh:QA1-939AnalysisMathematicsJournal of Function Spaces
researchProduct

Domains of accretive operators in Banach spaces

2016

LetD(A)be the domain of anm-accretive operatorAon a Banach spaceE. We provide sufficient conditions for the closure ofD(A)to be convex and forD(A)to coincide withEitself. Several related results and pertinent examples are also included.

Discrete mathematicsApproximation propertyGeneral Mathematics010102 general mathematicsBanach spaceClosure (topology)Finite-rank operatorResolvent formalism01 natural sciencesDomain (mathematical analysis)010101 applied mathematicsOperator (computer programming)0101 mathematicsC0-semigroupMathematicsProceedings of the Royal Society of Edinburgh: Section A Mathematics
researchProduct

Semigroups of composition operators and integral operators in spaces of analytic functions

2013

We study the maximal spaces of strong continuity on BMOA and the Bloch space B for semigroups of composition operators. Characterizations are given for the cases when these maximal spaces are V MOA or the little Bloch B0. These characterizations are in terms of the weak compactness of the resolvent function or in terms of a specially chosen symbol g of an integral operator Tg. For the second characterization we prove and use an independent result, namely that the operators Tg are weakly compact on the above mentioned spaces if and only if they are compact.

Discrete mathematicsBloch spaceCompact spaceOperator (computer programming)Nuclear operatorGeneral MathematicsOperator theoryFourier integral operatorCompact operator on Hilbert spaceMathematicsResolvent
researchProduct

New spaces of matrices with operator entries

2019

In this paper, we will consider matrices with entries in the space of operators $\mathcal{B}(H)$, where $H$ is a separable Hilbert space and consider the class of matrices that can be approached in the operator norm by matrices with a finite number of diagonals. We will use the Schur product with Toeplitz matrices generated by summability kernels to describe such a class and show that in the case of Toeplitz matrices it can be identified with the space of continuous functions with values in $\mathcal B(H)$. We shall also introduce matriceal versions with operator entries of classical spaces of holomorphic functions such as $H^\infty(\mathbb{D})$ and $A(\mathbb{D})$ when dealing with upper t…

Discrete mathematicsClass (set theory)010102 general mathematics010103 numerical & computational mathematicsSpace (mathematics)01 natural sciencesToeplitz matrixFunctional Analysis (math.FA)Mathematics - Functional AnalysisMathematics (miscellaneous)Operator (computer programming)FOS: Mathematics47L10 46E40 (Primary) 47A56 15B05 46G10 (Secondary)Hadamard product0101 mathematicsVector-valued functionComputer Science::DatabasesSeparable hilbert spaceMathematicsSchur multiplier
researchProduct

Padding and the expressive power of existential second-order logics

1998

Padding techniques are well-known from Computational Complexity Theory. Here, an analogous concept is considered in the context of existential second-order logics. Informally, a graph H is a padded version of a graph G, if H consists of an isomorphic copy of G and some isolated vertices. A set A of graphs is called weakly expressible by a formula ϕ in the presence of padding, if ϕ is able to distinguish between (sufficiently) padded versions of graphs from A and padded versions of graphs that are not in A.

Discrete mathematicsComputational complexity theoryComputer sciencePaddingExpressive powerExistentialismGraphVertex (geometry)CombinatoricsLogical programmingComplexity classIsomorphismUnary functionMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct