Littérature scientifique sur le sujet « R-convexity »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « R-convexity ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "R-convexity"
Zhang, Tao, Alatancang Chen, Bo-Yan Xi et Huan-Nan Shi. « The relationship between r-convexity and Schur-convexity and its application ». Journal of Mathematical Inequalities, no 3 (2023) : 1145–52. http://dx.doi.org/10.7153/jmi-2023-17-74.
Texte intégralZhao, Feng-Zhen. « The log-convexity of $r$-derangement numbers ». Rocky Mountain Journal of Mathematics 48, no 3 (juin 2018) : 1031–42. http://dx.doi.org/10.1216/rmj-2018-48-3-1031.
Texte intégralNikoufar, Ismail. « A Perspective Approach for Characterization of Lieb Concavity Theorem ». Demonstratio Mathematica 49, no 4 (1 décembre 2016) : 463–69. http://dx.doi.org/10.1515/dema-2016-0040.
Texte intégralQuast, Peter, et Makiko Sumi Tanaka. « Convexity of reflective submanifolds in symmetric $R$-spaces ». Tohoku Mathematical Journal 64, no 4 (2012) : 607–16. http://dx.doi.org/10.2748/tmj/1356038981.
Texte intégralHou, Qing-Hu, et Zuo-Ru Zhang. « Asymptotic r-log-convexity and P-recursive sequences ». Journal of Symbolic Computation 93 (juillet 2019) : 21–33. http://dx.doi.org/10.1016/j.jsc.2018.04.012.
Texte intégralYu-Liang, Shen. « On the weak uniform convexity of $Q(R)$ ». Proceedings of the American Mathematical Society 124, no 6 (1996) : 1879–82. http://dx.doi.org/10.1090/s0002-9939-96-03317-5.
Texte intégralRekic-Vukovic, Amra, et Nermin Okicic. « A convexity in R^2 with river metric ». Gulf Journal of Mathematics 15, no 2 (12 novembre 2023) : 25–39. http://dx.doi.org/10.56947/gjom.v15i2.1226.
Texte intégralSayed, Osama, El-Sayed El-Sanousy et Yaser Sayed. « On (L,M)-fuzzy convex structures ». Filomat 33, no 13 (2019) : 4151–63. http://dx.doi.org/10.2298/fil1913151s.
Texte intégralAlmutairi, Ohud, et Adem Kılıçman. « Generalized Integral Inequalities for Hermite–Hadamard-Type Inequalities via s-Convexity on Fractal Sets ». Mathematics 7, no 11 (6 novembre 2019) : 1065. http://dx.doi.org/10.3390/math7111065.
Texte intégralGeschke, Stefan, et Menachem Kojman. « Convexity numbers of closed sets in $\mathbb R^n$ ». Proceedings of the American Mathematical Society 130, no 10 (25 mars 2002) : 2871–81. http://dx.doi.org/10.1090/s0002-9939-02-06437-7.
Texte intégralThèses sur le sujet "R-convexity"
Cotsakis, Ryan. « Sur la géométrie des ensembles d'excursion : garanties théoriques et computationnelles ». Electronic Thesis or Diss., Université Côte d'Azur, 2024. http://www.theses.fr/2024COAZ5007.
Texte intégralThe excursion set EX(u) of a real-valued random field X on R^d at a threshold level u ∈ R is the subset of the domain R^d on which X exceeds u. Thus, the excursion set is random, and its distribution at a fixed level u is determined by the distribution of X. Being subsets of R^d, excursion sets can be studied in terms of their geometrical properties as a means of obtaining partial information about the distributional properties of the underlying random fields.This thesis investigates(a) how the geometric measures of an excursion set can be inferred from a discrete sample of the excursion set, and(b) how these measures can be related back to the distributional properties of the random field from which the excursion set was obtained.Each of these points are examined in detail in Chapter 1, which provides a broad overview of the results found throughout the remainder of this manuscript. The geometric measures that we study (for both excursion sets and deterministic subsets of R^d) when addressing point (a) are the (d − 1)-dimensional surface area measure, the reach, and the radius of r-convexity. Each of these quantities can be related to the smoothness of the boundary of the set, which is often difficult to infer from discrete samples of points. To address this problem, we make the following contributions to the field of computational geometry:• In Chapter 2, we identify the bias factor in using local counting algorithms for computing the (d − 1)-dimensional surface area of excursion sets over a large class of tessellations of R^d. The bias factor is seen to depend only on the dimension d and not on the precise geometry of the tessellation.• In Chapter 3, we introduce a pseudo-local counting algorithm for computing the perimeter of excursion sets in two-dimensions. The proposed algorithm is multigrid convergent, and features a tunable hyperparameter that can be chosen automatically from accessible information.• In Chapter 4, we introduce the β-reach as a generalization of the reach, and use it to prove the consistency of an estimator for the reach of closed subsets of R^d. Similarly, we define a consistent estimator for the radius of r-convexity of closed subsets of R^d. New theoretical relationships are established between the reach and the radius of r-convexity.We also study how these geometric measures of excursion sets relate to the distribution of the random field.• In Chapter 5, we introduce the extremal range: a local, geometric statistic that characterizes the spatial extent of threshold exceedances at a fixed level threshold u ∈ R. The distribution of the extremal range is completely determined by the distribution of the excursion set at the level u. We show how the extremal range is distributionally related to the intrinsic volumes of the excursion set. Moreover, the limiting behavior of the extremal range at large thresholds is studied in relation to the peaks-over-threshold stability of the underlying random field. Finally, the theory is applied to real climate data to measure the degree of asymptotic independence present, and its variation throughout space.Perspectives on how these results may be improved and expanded upon are provided in Chapter 6
Livres sur le sujet "R-convexity"
Berkovitz, Leonard David. Convexity and optimization in R [superscript n]. New York : J. Wiley, 2002.
Trouver le texte intégralChapitres de livres sur le sujet "R-convexity"
Rapcsák, Tamás. « Geodesic Convexity on R + n ». Dans Nonconvex Optimization and Its Applications, 167–83. Boston, MA : Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6357-0_10.
Texte intégralDemetriou, Ioannis C., et Evangelos E. Vassiliou. « On Distributed-Lag Modeling Algorithms by r-Convexity and Piecewise Monotonicity ». Dans Optimization in Science and Engineering, 115–40. New York, NY : Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4939-0808-0_6.
Texte intégralMartínez-Pérez, Alvaro, Luis Montejano et Deborah Oliveros. « Extremal Results on Intersection Graphs of Boxes in $${\mathbb R}^d$$ R d ». Dans Convexity and Discrete Geometry Including Graph Theory, 137–44. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-28186-5_11.
Texte intégralFlavin, J. N. « Convexity considerations for the biharmonic equation in plane polars with applications to elasticity ». Dans Nonlinear Elasticity and Theoretical Mechanics, 39–50. Oxford University PressOxford, 1994. http://dx.doi.org/10.1093/oso/9780198534860.003.0004.
Texte intégralActes de conférences sur le sujet "R-convexity"
Wang, Ming-Zheng, et Wen-Li Li. « On Convexity of Service-Level Measures of the Discrete (r,Q) Inventory System ». Dans Second International Conference on Innovative Computing, Informatio and Control (ICICIC 2007). IEEE, 2007. http://dx.doi.org/10.1109/icicic.2007.414.
Texte intégral