Search results for "convexity"

showing 10 items of 57 documents

From Wigner-Yanase-Dyson conjecture to Carlen-Frank-Lieb conjecture

2020

Abstract In this paper we study the joint convexity/concavity of the trace functions Ψ p , q , s ( A , B ) = Tr ( B q 2 K ⁎ A p K B q 2 ) s , p , q , s ∈ R , where A and B are positive definite matrices and K is any fixed invertible matrix. We will give full range of ( p , q , s ) ∈ R 3 for Ψ p , q , s to be jointly convex/concave for all K. As a consequence, we confirm a conjecture of Carlen, Frank and Lieb. In particular, we confirm a weaker conjecture of Audenaert and Datta and obtain the full range of ( α , z ) for α-z Renyi relative entropies to be monotone under completely positive trace preserving maps. We also give simpler proofs of many known results, including the concavity of Ψ p…

ConjectureTrace (linear algebra)General Mathematics010102 general mathematicsRegular polygonPositive-definite matrix01 natural sciencesConvexitylaw.inventionCombinatoricsMonotone polygonInvertible matrixDyson conjecturelaw0103 physical sciences010307 mathematical physics0101 mathematicsMathematicsAdvances in Mathematics
researchProduct

Convex functions on Carnot Groups

2007

We consider the definition and regularity properties of convex functions in Carnot groups. We show that various notions of convexity in the subelliptic setting that have appeared in the literature are equivalent. Our point of view is based on thinking of convex functions as subsolutions of homogeneous elliptic equations.

Convex analysisPure mathematicsCarnot groupsubelliptic equations.49L25Mathematics::Complex VariablesGeneral MathematicsMathematical analysissubelliptic equationsMathematics::Analysis of PDEsHorizontal convexityviscosity convexity35J70Convexitysymbols.namesakeCarnot groupsHomogeneous35J67Convex optimizationsymbolsPoint (geometry)Carnot cycleConvex function22E30Mathematics
researchProduct

Convexities and optimal transport problems on the Wiener space

2013

The aim of this PhD is to study the optimal transportation theory in some abstract Wiener space. You can find the results in four main parts and they are aboutThe convexity of the relative entropy. We will extend the well known results in finite dimension to the Wiener space, endowed with the uniform norm. To be precise the relative entropy is (at least weakly) geodesically 1-convex in the sense of the optimal transportation in the Wiener space.The measures with logarithmic concave density. The first important result consists in showing that the Harnack inequality holds for the semi-group induced by such a measure in the Wiener space. The second one provides us a finite dimensional and dime…

Convexité[ MATH.MATH-GM ] Mathematics [math]/General Mathematics [math.GM][MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM]Monge-Ampère equationConvexityMonge problem[MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM]Dimension infinieTransport optimalLogarithmic concave measureWiener spaceEspace de WienerOptimal transportÉquation de Monge-AmpèreMesure logarithmiquement concaveProblème de MongeInfinite dimension
researchProduct

Information potential for some probability density functions

2021

Abstract This paper is related to the information theoretic learning methodology, whose goal is to quantify global scalar descriptors (e.g., entropy) of a given probability density function (PDF). In this context, the core concept is the information potential (IP) S [ s ] ( x ) : = ∫ R p s ( t , x ) d t , s > 0 of a PDF p(t, x) depending on a parameter x; it is naturally related to the Renyi and Tsallis entropies. We present several such PDF, viewed also as kernels of integral operators, for which a precise relation exists between S[2](x) and the variance Var[p(t, x)]. For these PDF we determine explicitly the IP and the Shannon entropy. As an application to Information Theoretic Learning w…

Discrete mathematics0209 industrial biotechnologyApplied MathematicsComputation020206 networking & telecommunicationsProbability density function02 engineering and technologyExpected valueStatistical powerConvexityComputational Mathematics020901 industrial engineering & automation0202 electrical engineering electronic engineering information engineeringKurtosisEntropy (information theory)MathematicsApplied Mathematics and Computation
researchProduct

Reconstruction of L-convex Polyominoes.

2003

Abstract We introduce the family of L-convex polyominoes, a subset of convex polyominoes whose elements satisfy a special convexity property. We develop an algorithm that reconstructs an L-convex polyomino from the set of its maximal L-polyominoes.

Discrete mathematicsMathematics::CombinatoricsProperty (philosophy)PolyominoApplied MathematicsRegular polygonPolyominoesComputer Science::Computational GeometryConvexityCombinatoricsSet (abstract data type)Computer Science::Discrete MathematicsDiscrete Mathematics and CombinatoricsComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

On computing the degree of convexity of polyominoes

2015

In this paper we present an algorithm which has as input a convex polyomino $P$ and computes its degree of convexity, defined as the smallest integer $k$ such that any two cells of $P$ can be joined by a monotone path inside $P$ with at most $k$ changes of direction. The algorithm uses space $O(m + n)$ to represent a polyomino $P$ with $n$ rows and $m$ columns, and has a running time $O(min(m; r k))$, where $r$ is the number of corners of $P$. Moreover, the algorithm leads naturally to a decomposition of $P$ into simpler polyominoes.

Discrete mathematicsPolyominoDegree (graph theory)Settore INF/01 - InformaticaApplied MathematicsRegular polygonConvexityTheoretical Computer ScienceCombinatoricsMonotone polygonIntegerComputational Theory and MathematicsPath (graph theory)Discrete Mathematics and CombinatoricsGeometry and TopologyRowMathematics
researchProduct

The fixed point property in banach spaces whose characteristic of uniform convexity is less than 2

1993

AbstractWe prove that every Banach space X with characteristic of uniform convexity less than 2 has the fixed point property whenever X satisfies a certain orthogonality condition.

Discrete mathematicsPure mathematicsApproximation propertyEberlein–Šmulian theoremFixed-point theoremUniformly convex spaceGeneral MedicineBanach manifoldFixed-point propertyLp spaceConvexityMathematicsJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
researchProduct

The Bishop–Phelps–Bollobás theorem for operators

2008

AbstractWe prove the Bishop–Phelps–Bollobás theorem for operators from an arbitrary Banach space X into a Banach space Y whenever the range space has property β of Lindenstrauss. We also characterize those Banach spaces Y for which the Bishop–Phelps–Bollobás theorem holds for operators from ℓ1 into Y. Several examples of classes of such spaces are provided. For instance, the Bishop–Phelps–Bollobás theorem holds when the range space is finite-dimensional, an L1(μ)-space for a σ-finite measure μ, a C(K)-space for a compact Hausdorff space K, or a uniformly convex Banach space.

Discrete mathematicsPure mathematicsMathematics::Functional AnalysisApproximation propertyEberlein–Šmulian theoremBanach spaceNorm attainingBishop–Phelps theoremUniform boundedness principleUniform convexityInterpolation spaceOperatorClosed graph theoremReflexive spaceBishop–Phelps theoremAnalysisMathematicsJournal of Functional Analysis
researchProduct

Compound conditionals, Fr\'echet-Hoeffding bounds, and Frank t-norms

2021

Abstract In this paper we consider compound conditionals, Frechet-Hoeffding bounds and the probabilistic interpretation of Frank t-norms. By studying the solvability of suitable linear systems, we show under logical independence the sharpness of the Frechet-Hoeffding bounds for the prevision of conjunctions and disjunctions of n conditional events. In addition, we illustrate some details in the case of three conditional events. We study the set of all coherent prevision assessments on a family containing n conditional events and their conjunction, by verifying that it is convex. We discuss the case where the prevision of conjunctions is assessed by Lukasiewicz t-norms and we give explicit s…

Discrete mathematicsSettore MAT/06 - Probabilita' E Statistica MatematicaLogical independenceFrank t-normsApplied MathematicsLinear systemProbabilistic logicRegular polygon02 engineering and technologyConjunction and disjunctionConditional previsionTheoretical Computer ScienceConvexityFréchet-Hoeffding boundArtificial Intelligence020204 information systems0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingPairwise comparisonCoherenceSoftwareMathematics - ProbabilityCounterexampleMathematicsCorresponding conditional
researchProduct

Nonlinearity in intergenerational income transmission: A cross-country analysis

2016

Abstract The aim of this paper is to explore nonlinearity in intergenerational income transmission. We use a set of occupational tables in different countries to test nonlinearity. We also empirically address how policy variables can affect nonlinearity. Our findings suggest that concavity is supported in those societies with less credit constraints, but with more poverty and income inequality; education has an increasing effect on convexity.

Economics and EconometricsEconomics Econometrics and Finance (miscellaneous)Affect (psychology)Convexitylaw.inventionEducationEconomic inequalitylaw0502 economics and business050602 political science & public administrationEconometricsEconomics050207 economicsIncome inequalitySet (psychology)Credit constraintCross country analysisPublic economicsPoverty05 social sciencesComputer Science::Computers and Society0506 political scienceNonlinear systemBecker–Tomes modelTransmission (mechanics)Settore SECS-P/03 - Scienza Delle FinanzeNonlinearity.
researchProduct