Search results for "MS"

showing 10 items of 39361 documents

Derivation of a Homogenized Two-Temperature Model from the Heat Equation

2014

This work studies the heat equation in a two-phase material with spherical inclusions. Under some appropriate scaling on the size, volume fraction and heat capacity of the inclusions, we derive a coupled system of partial differential equations governing the evolution of the temperature of each phase at a macroscopic level of description. The coupling terms describing the exchange of heat between the phases are obtained by using homogenization techniques originating from [D. Cioranescu, F. Murat: Coll\`ege de France Seminar vol. 2. (Paris 1979-1980) Res. Notes in Math. vol. 60, pp. 98-138. Pitman, Boston, London, 1982.]

01 natural sciencesHomogenization (chemistry)Heat capacity010305 fluids & plasmasTwo temperatureMathematics - Analysis of PDEsThermal nonequilibrium models0103 physical sciencesFOS: Mathematics[MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP]0101 mathematicsScalingMSC 35K05 35B2776T05 (35Q79 76M50)35K05 35B27 76T05 (35Q79 76M50)MathematicsNumerical AnalysisHomogenizationPartial differential equationInfinite diffusion limitApplied MathematicsHeat equationMathematical analysis010101 applied mathematicsComputational MathematicsThermal non-equilibrium modelsModeling and SimulationVolume fractionHeat equationAnalysisAnalysis of PDEs (math.AP)
researchProduct

Discrete spectral incoherent solitons in nonlinear media with noninstantaneous response

2011

International audience; We show theoretically that nonlinear optical media characterized by a finite response time may support the existence of discrete spectral incoherent solitons. The structure of the soliton consists of three incoherent spectral bands that propagate in frequency space toward the low-frequency components in a discrete fashion and with a constant velocity. Discrete spectral incoherent solitons do not exhibit a confinement in the space-time domain, but exclusively in the frequency domain. The kinetic theory describes in detail all the essential properties of discrete spectral incoherent solitons: A quantitative agreement has been obtained between simulations of the kinetic…

01 natural sciencesoptical instabilitiesSchrödinger equation010309 opticssymbols.namesakeand lossesQuantum mechanics0103 physical sciencesDispersion (optics)Dynamics of nonlinear optical systemsOptical solitonssolitons010306 general physicsPropagationNonlinear Schrödinger equationNonlinear Sciences::Pattern Formation and SolitonsPhysics[PHYS.PHYS.PHYS-OPTICS]Physics [physics]/Physics [physics]/Optics [physics.optics][ PHYS.PHYS.PHYS-OPTICS ] Physics [physics]/Physics [physics]/Optics [physics.optics]and optical spatio-temporal dynamicsscatteringWave equationAtomic and Molecular Physics and OpticsSupercontinuumNonlinear systemFrequency domainsymbolsoptical chaos and complexitySolitonnonlinear guided waves
researchProduct

On two classes of finite supersoluble groups

2017

ABSTRACTLet ℨ be a complete set of Sylow subgroups of a finite group G, that is, a set composed of a Sylow p-subgroup of G for each p dividing the order of G. A subgroup H of G is called ℨ-S-semipermutable if H permutes with every Sylow p-subgroup of G in ℨ for all p∉π(H); H is said to be ℨ-S-seminormal if it is normalized by every Sylow p-subgroup of G in ℨ for all p∉π(H). The main aim of this paper is to characterize the ℨ-MS-groups, or groups G in which the maximal subgroups of every Sylow subgroup in ℨ are ℨ-S-semipermutable in G and the ℨ-MSN-groups, or groups in which the maximal subgroups of every Sylow subgroup in ℨ are ℨ-S-seminormal in G.

010101 applied mathematicsCombinatoricsDiscrete mathematicsComplement (group theory)Finite groupAlgebra and Number TheoryLocally finite group010102 general mathematicsSylow theoremsOrder (group theory)0101 mathematics01 natural sciencesMathematicsCommunications in Algebra
researchProduct

A comprehensive probabilistic analysis of approximate SIR‐type epidemiological models via full randomized discrete‐time Markov chain formulation with…

2020

Spanish Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P; Generalitat Valenciana, Grant/Award Number: APOSTD/2019/128; Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P

010101 applied mathematicsDiscrete mathematicsMarkov chainDiscrete time and continuous timeGeneral Mathematics010102 general mathematicsGeneral EngineeringProbabilistic analysis of algorithms0101 mathematicsType (model theory)01 natural sciencesMathematicsMathematical Methods in the Applied Sciences
researchProduct

On Whitham and Related Equations

2017

The aim of this paper is to study, via theoretical analysis and numerical simulations, the dynamics of Whitham and related equations. In particular, we establish rigorous bounds between solutions of the Whitham and Korteweg–de Vries equations and provide some insights into the dynamics of the Whitham equation in different regimes, some of them being outside the range of validity of the Whitham equation as a water waves model.

010101 applied mathematicsPhysicsRange (mathematics)Nonlinear Sciences::Exactly Solvable and Integrable SystemsWhitham equationApplied Mathematics010102 general mathematicsMathematical analysis0101 mathematicsNonlinear Sciences::Pattern Formation and Solitons01 natural sciencesStudies in Applied Mathematics
researchProduct

Partially hyperbolic diffeomorphisms with a uniformly compact center foliation: the quotient dynamics

2016

We show that a partially hyperbolic$C^{1}$-diffeomorphism$f:M\rightarrow M$with a uniformly compact$f$-invariant center foliation${\mathcal{F}}^{c}$is dynamically coherent. Further, the induced homeomorphism$F:M/{\mathcal{F}}^{c}\rightarrow M/{\mathcal{F}}^{c}$on the quotient space of the center foliation has the shadowing property, i.e. for every${\it\epsilon}>0$there exists${\it\delta}>0$such that every${\it\delta}$-pseudo-orbit of center leaves is${\it\epsilon}$-shadowed by an orbit of center leaves. Although the shadowing orbit is not necessarily unique, we prove the density of periodic center leaves inside the chain recurrent set of the quotient dynamics. Other interesting proper…

010101 applied mathematicsPure mathematicsMSC: 37D30 37C15Applied MathematicsGeneral Mathematics010102 general mathematics[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS][ MATH.MATH-DS ] Mathematics [math]/Dynamical Systems [math.DS]0101 mathematics01 natural sciencesQuotientMathematics
researchProduct

Inverse problems for $p$-Laplace type equations under monotonicity assumptions

2016

We consider inverse problems for $p$-Laplace type equations under monotonicity assumptions. In two dimensions, we show that any two conductivities satisfying $\sigma_1 \geq \sigma_2$ and having the same nonlinear Dirichlet-to-Neumann map must be identical. The proof is based on a monotonicity inequality and the unique continuation principle for $p$-Laplace type equations. In higher dimensions, where unique continuation is not known, we obtain a similar result for conductivities close to constant.

010101 applied mathematicsunique continuation principleMathematics - Analysis of PDEsinverse problems010102 general mathematicsFOS: MathematicsDirichlet-to-Neumann map35J92 35R300101 mathematics01 natural sciencesp-Laplace equationinversio-ongelmatAnalysis of PDEs (math.AP)
researchProduct

Efficient generation of restricted growth words

2013

A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i>1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.

010102 general mathematicsBinary numberValue (computer science)0102 computer and information sciences[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesComputer Science ApplicationsTheoretical Computer SciencePrefixCombinatoricsGray code010201 computation theory & mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Signal ProcessingPartial word0101 mathematicsConstant (mathematics)ComputingMilieux_MISCELLANEOUSWord (group theory)Information SystemsMathematicsInformation Processing Letters
researchProduct

Restricted compositions and permutations: from old to new Gray codes

2011

Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…

0102 computer and information sciences02 engineering and technologyInterval (mathematics)[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesTheoretical Computer ScienceCombinatoricsGray codePermutationsymbols.namesakeInteger020204 information systems[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0202 electrical engineering electronic engineering information engineeringComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematicsExtension (predicate logic)Composition (combinatorics)Cartesian productComputer Science Applications010201 computation theory & mathematicsComputer Science::Computer Vision and Pattern RecognitionBounded functionSignal ProcessingsymbolsInformation Systems
researchProduct

Statistics-preserving bijections between classical and cyclic permutations

2012

Recently, Elizalde (2011) [2] has presented a bijection between the set C"n"+"1 of cyclic permutations on {1,2,...,n+1} and the set of permutations on {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. In this paper, we construct a bijection from C"n"+"1 to S"n that preserves the weak excedance set and that transfers quasi-fixed points into fixed points and left-to-right maxima into themselves. This induces a bijection from the set D"n of derangements to the set C"n"+"1^q of cycles without quasi-fixed points that preserves the weak excedance set. Moreover, we exhibit a kind of discrete continuity between C"n"+"1 and S"n that preserves at each s…

0102 computer and information sciencesFixed point[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesCombinatorial problemsTheoretical Computer ScienceCyclic permutationSet (abstract data type)CombinatoricsBijections[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsDescent (mathematics)Discrete mathematicsStatistics on permutationsMathematics::Combinatorics010102 general mathematicsDescentComputer Science ApplicationsDerangement010201 computation theory & mathematicsExcedenceSignal ProcessingBijectionBijection injection and surjectionMaximaInformation Systems
researchProduct