Search results for "Crete"

showing 10 items of 2495 documents

Failure of the local-to-global property for CD(K,N) spaces

2016

Given any K and N we show that there exists a compact geodesic metric measure space satisfying locally the CD(0,4) condition but failing CD(K,N) globally. The space with this property is a suitable non convex subset of R^2 equipped with the l^\infty-norm and the Lebesgue measure. Combining many such spaces gives a (non compact) complete geodesic metric measure space satisfying CD(0,4) locally but failing CD(K,N) globally for every K and N.

Mathematics - Differential GeometryDiscrete mathematicsProperty (philosophy)GeodesicLebesgue measureExistential quantification010102 general mathematicsMetric Geometry (math.MG)Space (mathematics)01 natural sciencesMeasure (mathematics)Theoretical Computer ScienceMathematics (miscellaneous)Mathematics - Metric GeometryDifferential Geometry (math.DG)0103 physical sciencesMetric (mathematics)FOS: Mathematics010307 mathematical physics0101 mathematics53C23 (Primary) 28A33 49Q20 (Secondary)MathematicsANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE
researchProduct

Optimal maps and exponentiation on finite dimensional spaces with Ricci curvature bounded from below

2013

We prove existence and uniqueness of optimal maps on $RCD^*(K,N)$ spaces under the assumption that the starting measure is absolutely continuous. We also discuss how this result naturally leads to the notion of exponentiation.

Mathematics - Differential GeometryExponentiationLower Ricci bounds; Optimal maps; Optimal transport; RCD spaces01 natural sciencesMeasure (mathematics)Combinatoricssymbols.namesakeMathematics - Metric GeometryRCD spacesSettore MAT/05 - Analisi MatematicaFOS: MathematicsOptimal transportMathematics::Metric GeometryUniqueness0101 mathematicsLower Ricci bounds[MATH.MATH-MG]Mathematics [math]/Metric Geometry [math.MG]Ricci curvatureMathematicsDiscrete mathematics010102 general mathematicsMetric Geometry (math.MG)Absolute continuity16. Peace & justice010101 applied mathematicsMathematics::LogicDifferential geometryDifferential Geometry (math.DG)Fourier analysisBounded functionsymbolsOptimal mapsGeometry and Topology
researchProduct

Approximation by mappings with singular Hessian minors

2018

Let $\Omega\subset\mathbb R^n$ be a Lipschitz domain. Given $1\leq p<k\leq n$ and any $u\in W^{2,p}(\Omega)$ belonging to the little H\"older class $c^{1,\alpha}$, we construct a sequence $u_j$ in the same space with $\operatorname{rank}D^2u_j<k$ almost everywhere such that $u_j\to u$ in $C^{1,\alpha}$ and weakly in $W^{2,p}$. This result is in strong contrast with known regularity behavior of functions in $W^{2,p}$, $p\geq k$, satisfying the same rank inequality.

Mathematics - Differential GeometryHessian matrix35B99 46T10Monge-Ampère equationRank (differential topology)Space (mathematics)01 natural sciencesHessian minorssymbols.namesakeMathematics - Analysis of PDEsLipschitz domainFOS: MathematicsMathematics::Metric GeometryAlmost everywhere0101 mathematicsMathematicsosittaisdifferentiaaliyhtälötDiscrete mathematicsSequenceApplied Mathematicsta111010102 general mathematics16. Peace & justiceFunctional Analysis (math.FA)nonlinear approximationMathematics - Functional Analysis010101 applied mathematicsDifferential Geometry (math.DG)symbolsfunktionaalianalyysiAnalysisAnalysis of PDEs (math.AP)Nonlinear Analysis
researchProduct

Counting and equidistribution in Heisenberg groups

2014

We strongly develop the relationship between complex hyperbolic geometry and arithmetic counting or equidistribution applications, that arises from the action of arithmetic groups on complex hyperbolic spaces, especially in dimension $2$. We prove a Mertens' formula for the integer points over a quadratic imaginary number fields $K$ in the light cone of Hermitian forms, as well as an equidistribution theorem of the set of rational points over $K$ in Heisenberg groups. We give a counting formula for the cubic points over $K$ in the complex projective plane whose Galois conjugates are orthogonal and isotropic for a given Hermitian form over $K$, and a counting and equidistribution result for …

Mathematics - Differential GeometryPure mathematicsGeneral MathematicsHyperbolic geometryMathematics::Number Theory[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]11E39 11F06 11N45 20G20 53C17 53C22 53C55chainEquidistribution theorem01 natural sciencesHeisenberg groupequidistributioncommon perpendicularIntegerLight cone0103 physical sciencesHeisenberg groupcubic point0101 mathematicsCygan distanceMertens formulaComplex projective planeMathematicsDiscrete mathematicsAMS codes: 11E39 11F06 11N45 20G20 53C17 53C22 53C55Mathematics - Number TheorySesquilinear formHeisenberg groups010102 general mathematicsHermitian matrixcomplex hyperbolic geometry[MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]sub-Riemannian geometry[MATH.MATH-DG]Mathematics [math]/Differential Geometry [math.DG]counting010307 mathematical physics
researchProduct

Exhaustive generation for permutations avoiding (colored) regular sets of patterns

2019

Abstract Despite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions of regular and colored regular set of forbidden patterns, which are particular cases of right-justified sets of forbidden patterns. We show the (colored) regularity of several sets of forbidden patterns (some of them involving variable length patterns) and we derive a general framework for the efficient generation of permutations avoiding them. The obtained generating algorithms are based on succession functions, a notion which is a byproduct of t…

Mathematics::CombinatoricsFibonacci numberApplied MathematicsPadovan sequence0211 other engineering and technologies021107 urban & regional planningField (mathematics)Context (language use)0102 computer and information sciences02 engineering and technology01 natural sciencesCombinatoricsSet (abstract data type)Colored010201 computation theory & mathematicsEnumerationDiscrete Mathematics and CombinatoricsBinomial transformMathematicsofComputing_DISCRETEMATHEMATICSMathematicsDiscrete Applied Mathematics
researchProduct

The Reconstruction of Polyominoes from Approximately Orthogonal Projections

2001

The reconstruction of discrete two-dimensional pictures from their projection is one of the central problems in the areas of medical diagnostics, computer-aided tomography, pattern recognition, image processing, and data compression. In this note, we determine the computational complexity of the problem of reconstruction of polyominoes from their approximately orthogonal projections. We will prove that it is NP-complete if we reconstruct polyominoes, horizontal convex polyominoes and vertical convex polyominoes. Moreover we will give the polynomial algorithm for the reconstruction of hv-convex polyominoes that has time complexity O(m3n3).

Mathematics::CombinatoricsPolyominoComputational complexity theoryComputer scienceOrthographic projectionRegular polygonVector projectionComputer Science::Computational GeometryCombinatoricsProjection (mathematics)Computer Science::Discrete MathematicsTomographyAlgorithmTime complexityComputer Science::Formal Languages and Automata TheoryImage compression
researchProduct

On the size of the set of unbounded multilinear operators between Banach spaces

2020

Among other results we investigate $\left( \alpha,\beta\right) $-lineability of the set of non-continuous $m$-linear operators defined between normed spaces as a subset of the space of all $m$-linear operators. We also give a partial answer to an open problem on the lineability of the set of non absolutely summing operators.

Mathematics::Functional AnalysisNumerical AnalysisPure mathematicsMultilinear mapAlgebra and Number TheoryOpen problem010102 general mathematicsBanach space010103 numerical & computational mathematicsSpace (mathematics)01 natural sciencesFunctional Analysis (math.FA)Mathematics - Functional AnalysisSet (abstract data type)FOS: MathematicsDiscrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsMathematicsLinear Algebra and its Applications
researchProduct

Some subgroup embeddings in finite groups

2015

In this survey paper several subgroup embedding properties related to some types of permutability are introduced and studied.

Mathematics::Group TheoryMathematics::Combinatoricsnervous systemmusculoskeletal neural and ocular physiologyComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONGrups Teoria demacromolecular substancesÀlgebraMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Potentials, Critical Exponents,and Gibbs Cocycles

2019

Let X be a geodesically complete proper CAT(–1) space, let x0 ∈ X be an arbitrary basepoint, and let Γ be a nonelementary discrete group of isometries of X.

Mathematics::Group TheoryPure mathematicsDiscrete groupMathematics::Metric GeometrySpace (mathematics)Critical exponentMathematics
researchProduct

On minima of discrimination functions

2008

Abstract A discrimination function ψ ( x , y ) assigns a measure of discriminability to stimulus pairs x , y (e.g., the probability with which they are judged to be different in a same-different judgment scheme). If for every x there is a single y least discriminable from x , then this y is called the point of subjective equality (PSE) for x , and the dependence h ( x ) of the PSE for x on x is called a PSE function. The PSE function g ( y ) is defined in a symmetrically opposite way. If the graphs of the two PSE functions coincide (i.e.,  g ≡ h − 1 ), the function is said to satisfy the Regular Minimality law. The minimum level functions are restrictions of ψ to the graphs of the PSE funct…

Maxima and minimaDiscrete mathematicsPerceptual discriminationApplied MathematicsDiscrimination functionGeneral PsychologyMathematicsCounterexampleJournal of Mathematical Psychology
researchProduct