Search results for "Combinatorics"

showing 10 items of 1770 documents

New Results on the Mixed General Routing Problem

2005

[EN] In this paper, we deal with the polyhedral description and the resolution of the Mixed General Routing Problem. This problem, in which the service activity occurs both at some of the nodes and at some of the arcs and edges of a mixed graph, contains a large number of important arc and node routing problems as special cases. Here, a large family of facet-defining inequalities, the Honeycomb inequalities, is described. Furthermore, a cutting-plane algorithm for this problem that incorporates new separation procedures for the K-C, Regular Path-Bridge, and Honeycomb inequalities is presented. Branch and bound is invoked when the final solution of the cutting-plane procedure is fractional. …

Mathematical optimizationmedicine.medical_specialtyBranch and boundPolyhedral combinatoricsMixed graphHoneycomb (geometry)Mixed rural postman problemManagement Science and Operations ResearchPolyhedral combinatoricsComputer Science ApplicationsRural postman problemVehicle routing problemmedicineDestination-Sequenced Distance Vector routingRouting (electronic design automation)General routing problemMATEMATICA APLICADACutting-plane methodMathematics
researchProduct

Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies

2015

International audience; Embedded systems have become an essential part of our lives, thanks to their evolution in the recent years, but the main drawback is their power consumption. This paper is focused on improving the memory allocation of embedded systems to reduce their power consumption. We propose a parallel variable neighborhood search algorithm for the dynamic memory allocation problem, and compare it with the state of the art. Computational results and statistical tests applied show that the proposed algorithm produces significantly better outcomes than the previous algorithm in shorter computing time.

Mathematical optimizationparallelismmetaheuristicsC dynamic memory allocationComputer sciencebusiness.industryApplied Mathematics[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]Static memory allocationPower consumptionEmbedded systemDiscrete Mathematics and Combinatoricsdynamic memory allocation problemembedded systemsState (computer science)businessMetaheuristicvariable neighborhood searchVariable neighborhood searchDrawbackStatistical hypothesis testing
researchProduct

A new definition of well-behaved discrimination functions

2009

Abstract A discrimination function shows the probability or degree with which stimuli are discriminated from each other when presented in pairs. In a previous publication [Kujala, J.V., & Dzhafarov, E.N. (2008). On minima of discrimination functions. Journal of Mathematical Psychology , 52 , 116–127] we introduced a condition under which the conformity of a discrimination function with the law of Regular Minimality (which says, essentially, that “being least discriminable from” is a symmetric relation) implies the constancy of the function’s minima (i.e., the same level of discriminability of every stimulus from the stimulus least discriminable from it). This condition, referred to as “well…

Mathematical psychologyApplied Mathematicsmedia_common.quotation_subjectHausdorff spaceTransitive closureStimulus (physiology)ConformityCombinatoricsMaxima and minimaSymmetric relationTransfinite inductionGeneral Psychologymedia_commonMathematicsJournal of Mathematical Psychology
researchProduct

Additive properties of fractal sets on the parabola

2023

Let $0 \leq s \leq 1$, and let $\mathbb{P} := \{(t,t^{2}) \in \mathbb{R}^{2} : t \in [-1,1]\}$. If $K \subset \mathbb{P}$ is a closed set with $\dim_{\mathrm{H}} K = s$, it is not hard to see that $\dim_{\mathrm{H}} (K + K) \geq 2s$. The main corollary of the paper states that if $0 0$. This information is deduced from an $L^{6}$ bound for the Fourier transforms of Frostman measures on $\mathbb{P}$. If $0 0$, then there exists $\epsilon = \epsilon(s) > 0$ such that $$ \|\hat{\mu}\|_{L^{6}(B(R))}^{6} \leq R^{2 - (2s + \epsilon)} $$ for all sufficiently large $R \geq 1$. The proof is based on a reduction to a $\delta$-discretised point-circle incidence problem, and eventually to the $(s,2s)$-…

Mathematics - Classical Analysis and ODEsGeneral MathematicsFurstenberg setsClassical Analysis and ODEs (math.CA)FOS: MathematicsFourier'n sarjatadditive energiesMathematics - Combinatorics28A80 11B30Combinatorics (math.CO)ArticlesFourier transformsFrostman measuresAnnales Fennici Mathematici
researchProduct

Quasiregular ellipticity of open and generalized manifolds

2014

We study the existence of geometrically controlled branched covering maps from \(\mathbb R^3\) to open \(3\)-manifolds or to decomposition spaces \(\mathbb {S}^3/G\), and from \(\mathbb {S}^3/G\) to \(\mathbb {S}^3\).

Mathematics - Complex VariablesApplied Mathematics010102 general mathematicsquasiregular mappingsdecomposition spacesGeometric Topology (math.GT)Metric Geometry (math.MG)01 natural sciencesCombinatoricsMathematics - Geometric Topologysemmes metricsComputational Theory and MathematicsMathematics - Metric Geometryquasiregular ellipticity0103 physical sciencesFOS: Mathematics30C65 (Primary) 30L10 (Secondary)010307 mathematical physicsBranched covering0101 mathematicsComplex Variables (math.CV)AnalysisMathematics
researchProduct

Open and Discrete Maps with Piecewise Linear Branch Set Images are Piecewise Linear Maps

2018

The image of the branch set of a piecewise linear (PL)‐branched cover between PL 𝑛n‐manifolds is a simplicial (𝑛−2)(n−2)‐complex. We demonstrate that the reverse implication also holds: an open and discrete map 𝑓:𝕊𝑛→𝕊𝑛f:Sn→Sn with the image of the branch set contained in a simplicial (𝑛−2)(n−2)‐complex is equivalent up to homeomorphism to a PL‐branched cover. peerReviewed

Mathematics - Complex VariablesGeneral MathematicsImage (category theory)010102 general mathematicsGeometric Topology (math.GT)01 natural sciencesHomeomorphismPiecewise linear functionSet (abstract data type)CombinatoricsfunktioteoriaMathematics - Geometric TopologyCover (topology)0103 physical sciencesFOS: MathematicsHigh Energy Physics::Experiment010307 mathematical physicsComplex Variables (math.CV)0101 mathematicstopologiaMathematics
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

The Calderon problem in transversally anisotropic geometries

2016

We consider the anisotropic Calderon problem of recovering a conductivity matrix or a Riemannian metric from electrical boundary measurements in three and higher dimensions. In the earlier work \cite{DKSaU}, it was shown that a metric in a fixed conformal class is uniquely determined by boundary measurements under two conditions: (1) the metric is conformally transversally anisotropic (CTA), and (2) the transversal manifold is simple. In this paper we will consider geometries satisfying (1) but not (2). The first main result states that the boundary measurements uniquely determine a mixed Fourier transform / attenuated geodesic ray transform (or integral against a more general semiclassical…

Mathematics - Differential GeometryGeodesicGeneral MathematicsBoundary (topology)Conformal map01 natural sciencessymbols.namesakeMathematics - Analysis of PDEsFOS: Mathematics[MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP]0101 mathematicsMathematicsCalderón problemRiemannian manifoldApplied Mathematicsta111010102 general mathematicsMathematical analysiscomplex geometrical optics solutionInverse problemRiemannian manifold010101 applied mathematicsboundary control methodFourier transformDifferential Geometry (math.DG)Transversal (combinatorics)Metric (mathematics)symbolsinverse boundary value problemAnalysis of PDEs (math.AP)
researchProduct

The Linearized Calderón Problem in Transversally Anisotropic Geometries

2017

In this article we study the linearized anisotropic Calderon problem. In a compact manifold with boundary, this problem amounts to showing that products of harmonic functions form a complete set. Assuming that the manifold is transversally anisotropic, we show that the boundary measurements determine an FBI type transform at certain points in the transversal manifold. This leads to recovery of transversal singularities in the linearized problem. The method requires a geometric condition on the transversal manifold related to pairs of intersecting geodesics, but it does not involve the geodesic X-ray transform which has limited earlier results on this problem.

Mathematics - Differential GeometryGeodesicGeneral MathematicsNEUMANN MAPBoundary (topology)Type (model theory)01 natural scienceslaw.inventionMathematics - Analysis of PDEslinearized anisotropic Calderón problemlaw35R30 35J25111 MathematicsFOS: Mathematics0101 mathematicsMathematics010102 general mathematicsMathematical analysisInverse problem010101 applied mathematicsHarmonic functionDifferential Geometry (math.DG)Transversal (combinatorics)Gravitational singularityMathematics::Differential GeometryINVERSE PROBLEMManifold (fluid mechanics)Analysis of PDEs (math.AP)
researchProduct

Isometries of nilpotent metric groups

2016

We consider Lie groups equipped with arbitrary distances. We only assume that the distance is left-invariant and induces the manifold topology. For brevity, we call such object metric Lie groups. Apart from Riemannian Lie groups, distinguished examples are sub-Riemannian Lie groups and, in particular, Carnot groups equipped with Carnot-Carath\'eodory distances. We study the regularity of isometries, i.e., distance-preserving homeomorphisms. Our first result is the analyticity of such maps between metric Lie groups. The second result is that if two metric Lie groups are connected and nilpotent then every isometry between the groups is the composition of a left translation and an isomorphism.…

Mathematics - Differential GeometryIsometriesPure mathematicsA ne transformationsGeneral Mathematics22E25 53C30 22F30Group Theory (math.GR)01 natural sciencesisometriesMathematics - Metric GeometryetäisyysFOS: MathematicsMathematics (all)Mathematics::Metric GeometryA ne transformations; Isometries; Nilpotent groups; Nilradical; Mathematics (all)0101 mathematicsdistanceMathematicsLie groupsmatematiikkamathematicsta111010102 general mathematicsLie groupMetric Geometry (math.MG)nilpotent groupsnilradicalComposition (combinatorics)Manifoldaffine transformationsNilpotentDifferential Geometry (math.DG)Nilpotent groupsMetric (mathematics)IsometryNilradicalIsomorphismMathematics - Group TheoryCounterexampleJournal de l’École polytechnique — Mathématiques
researchProduct