Search results for "RICS"

showing 10 items of 14086 documents

Une structure o-minimale sans décomposition cellulaire

2008

Resume Nous construisons une extension o-minimale du corps des nombres reels qui n'admet pas la propriete de decomposition cellulaire en classe C ∞ . Pour citer cet article : O. Le Gal, J.-P. Rolin, C. R. Acad. Sci. Paris, Ser. I 346 (2008).

010101 applied mathematicsCombinatorics010102 general mathematicsCell structureGeneral MedicineDecomposition method (constraint satisfaction)0101 mathematicsAlgebraic number field01 natural sciencesMathematicsComptes Rendus Mathematique
researchProduct

F-contractions of Hardy–Rogers-type and application to multistage decision

2016

We prove fixed point theorems for F-contractions of Hardy–Rogers type involving self-mappings defined on metric spaces and ordered metric spaces. An example and an application to multistage decision processes are given to show the usability of the obtained theorems.

010101 applied mathematicsCombinatoricsApplied Mathematics010102 general mathematicslcsh:QA299.6-433F-contractions of Hardy–Rogers type and application to multistage decision processeslcsh:Analysis0101 mathematicsType (model theory)01 natural sciencesAnalysisMathematicsNonlinear Analysis: Modelling and Control
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

Symmetric and finitely symmetric polynomials on the spaces ℓ∞ and L∞[0,+∞)

2018

We consider on the space l∞ polynomials that are invariant regarding permutations of the sequence variable or regarding finite permutations. Accordingly, they are trivial or factor through c0. The analogous study, with analogous results, is carried out on L∞[0,+∞), replacing the permutations of N by measurable bijections of [0,+∞) that preserve the Lebesgue measure.

010101 applied mathematicsCombinatoricsMathematics::CombinatoricsLebesgue measureSymmetric polynomialGeneral Mathematics010102 general mathematics0101 mathematicsInvariant (mathematics)Bijection injection and surjection01 natural sciencesMathematicsMathematische Nachrichten
researchProduct

Global Lp -integrability of the derivative of a quasiconformal mapping

1988

Let f be a quasiconformal mapping of an open bounded set U in Rn into Rn . Then f′ belongs to Lp(U) for some p > n provided that f satisfies (a) U is a uniform domain and fU is a John domain or (b) f is quasisymmetric and U satisfies a metric plumpness condition.

010101 applied mathematicsCombinatoricsQuasiconformal mappingBounded set010102 general mathematicsMathematical analysisMetric (mathematics)General MedicineDerivative0101 mathematics01 natural sciencesDomain (mathematical analysis)MathematicsComplex Variables, Theory and Application: An International Journal
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

Vertical versus horizontal Sobolev spaces

2020

Let $\alpha \geq 0$, $1 < p < \infty$, and let $\mathbb{H}^{n}$ be the Heisenberg group. Folland in 1975 showed that if $f \colon \mathbb{H}^{n} \to \mathbb{R}$ is a function in the horizontal Sobolev space $S^{p}_{2\alpha}(\mathbb{H}^{n})$, then $\varphi f$ belongs to the Euclidean Sobolev space $S^{p}_{\alpha}(\mathbb{R}^{2n + 1})$ for any test function $\varphi$. In short, $S^{p}_{2\alpha}(\mathbb{H}^{n}) \subset S^{p}_{\alpha,\mathrm{loc}}(\mathbb{R}^{2n + 1})$. We show that the localisation can be omitted if one only cares for Sobolev regularity in the vertical direction: the horizontal Sobolev space $S_{2\alpha}^{p}(\mathbb{H}^{n})$ is continuously contained in the vertical Sobolev sp…

010102 general mathematicsMetric Geometry (math.MG)Function (mathematics)Lipschitz continuity01 natural sciencesFunctional Analysis (math.FA)Fractional calculusSobolev spaceCombinatoricsMathematics - Functional AnalysisMathematics - Metric GeometryMathematics - Classical Analysis and ODEsBounded function0103 physical sciencesVertical directionClassical Analysis and ODEs (math.CA)FOS: MathematicsHeisenberg groupOrder (group theory)010307 mathematical physics0101 mathematics46E35 (Primary) 26A33 35R03 43A15 (Secondary)AnalysisMathematics
researchProduct

Random Tensor Theory: Extending Random Matrix Theory to Mixtures of Random Product States

2012

We consider a problem in random matrix theory that is inspired by quantum information theory: determining the largest eigenvalue of a sum of p random product states in $${(\mathbb {C}^d)^{\otimes k}}$$ , where k and p/d k are fixed while d → ∞. When k = 1, the Marcenko-Pastur law determines (up to small corrections) not only the largest eigenvalue ( $${(1+\sqrt{p/d^k})^2}$$ ) but the smallest eigenvalue $${(\min(0,1-\sqrt{p/d^k})^2)}$$ and the spectral density in between. We use the method of moments to show that for k > 1 the largest eigenvalue is still approximately $${(1+\sqrt{p/d^k})^2}$$ and the spectral density approaches that of the Marcenko-Pastur law, generalizing the random matrix…

010102 general mathematicsSpectral densityStatistical and Nonlinear PhysicsMethod of moments (probability theory)01 natural sciencesCombinatorics010104 statistics & probabilitysymbols.namesakeDistribution (mathematics)Product (mathematics)Gaussian integralsymbolsTensor0101 mathematicsRandom matrixMathematical PhysicsEigenvalues and eigenvectorsMathematicsCommunications in Mathematical Physics
researchProduct

Análisis de la utilidad del algoritmo Gradient Boosting Machine (GBM) en la predicción del fracaso empresarial

2018

Este estudio, novedoso en cuanto a la utilizacion de la metodologia basada en la cultura de los algoritmos, prueba la capacidad de la tecnica ‘Gradient Boosting Machine’ (GBM) en la prediccion de l...

010104 statistics & probabilityEconomics and EconometricsAccounting0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing02 engineering and technology0101 mathematics01 natural sciencesFinanceSpanish Journal of Finance and Accounting / Revista Española de Financiación y Contabilidad
researchProduct

Adjusting the Knox test by accounting for spatio-temporal crime risk heterogeneity to analyse near-repeats

2020

The near-repeat phenomenon usually occurs with any crime. Hence, to implement preventive measures, it is of great interest to figure out at which spatio-temporal scale crimes are more likely to be repeated by offenders. The Knox test is the most used statistical tool for evaluating the presence of the near-repeat phenomenon given a dataset of crimes that are located in space and time. The classic version of this test assumes that crime risk is homogeneous in both space and time, although this assumption rarely holds in reality. Therefore, the main goal of this article is to highlight the necessity of adjusting the standard version of the Knox test, including spatial and temporal effects th…

010104 statistics & probabilityGeographyScale (ratio)050901 criminology05 social sciencesEconometrics0509 other social sciences0101 mathematics01 natural sciencesLawTest (assessment)European Journal of Criminology
researchProduct