Literatura académica sobre el tema "R-convexity"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "R-convexity".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "R-convexity"
Zhang, Tao, Alatancang Chen, Bo-Yan Xi y Huan-Nan Shi. "The relationship between r-convexity and Schur-convexity and its application". Journal of Mathematical Inequalities, n.º 3 (2023): 1145–52. http://dx.doi.org/10.7153/jmi-2023-17-74.
Texto completoZhao, Feng-Zhen. "The log-convexity of $r$-derangement numbers". Rocky Mountain Journal of Mathematics 48, n.º 3 (junio de 2018): 1031–42. http://dx.doi.org/10.1216/rmj-2018-48-3-1031.
Texto completoNikoufar, Ismail. "A Perspective Approach for Characterization of Lieb Concavity Theorem". Demonstratio Mathematica 49, n.º 4 (1 de diciembre de 2016): 463–69. http://dx.doi.org/10.1515/dema-2016-0040.
Texto completoQuast, Peter y Makiko Sumi Tanaka. "Convexity of reflective submanifolds in symmetric $R$-spaces". Tohoku Mathematical Journal 64, n.º 4 (2012): 607–16. http://dx.doi.org/10.2748/tmj/1356038981.
Texto completoHou, Qing-Hu y Zuo-Ru Zhang. "Asymptotic r-log-convexity and P-recursive sequences". Journal of Symbolic Computation 93 (julio de 2019): 21–33. http://dx.doi.org/10.1016/j.jsc.2018.04.012.
Texto completoYu-Liang, Shen. "On the weak uniform convexity of $Q(R)$". Proceedings of the American Mathematical Society 124, n.º 6 (1996): 1879–82. http://dx.doi.org/10.1090/s0002-9939-96-03317-5.
Texto completoRekic-Vukovic, Amra y Nermin Okicic. "A convexity in R^2 with river metric". Gulf Journal of Mathematics 15, n.º 2 (12 de noviembre de 2023): 25–39. http://dx.doi.org/10.56947/gjom.v15i2.1226.
Texto completoSayed, Osama, El-Sayed El-Sanousy y Yaser Sayed. "On (L,M)-fuzzy convex structures". Filomat 33, n.º 13 (2019): 4151–63. http://dx.doi.org/10.2298/fil1913151s.
Texto completoAlmutairi, Ohud y Adem Kılıçman. "Generalized Integral Inequalities for Hermite–Hadamard-Type Inequalities via s-Convexity on Fractal Sets". Mathematics 7, n.º 11 (6 de noviembre de 2019): 1065. http://dx.doi.org/10.3390/math7111065.
Texto completoGeschke, Stefan y Menachem Kojman. "Convexity numbers of closed sets in $\mathbb R^n$". Proceedings of the American Mathematical Society 130, n.º 10 (25 de marzo de 2002): 2871–81. http://dx.doi.org/10.1090/s0002-9939-02-06437-7.
Texto completoTesis sobre el tema "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.
Texto completoThe 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
Libros sobre el tema "R-convexity"
Berkovitz, Leonard David. Convexity and optimization in R [superscript n]. New York: J. Wiley, 2002.
Buscar texto completoCapítulos de libros sobre el tema "R-convexity"
Rapcsák, Tamás. "Geodesic Convexity on R + n". En Nonconvex Optimization and Its Applications, 167–83. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4615-6357-0_10.
Texto completoDemetriou, Ioannis C. y Evangelos E. Vassiliou. "On Distributed-Lag Modeling Algorithms by r-Convexity and Piecewise Monotonicity". En 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.
Texto completoMartínez-Pérez, Alvaro, Luis Montejano y Deborah Oliveros. "Extremal Results on Intersection Graphs of Boxes in $${\mathbb R}^d$$ R d". En 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.
Texto completoFlavin, J. N. "Convexity considerations for the biharmonic equation in plane polars with applications to elasticity". En Nonlinear Elasticity and Theoretical Mechanics, 39–50. Oxford University PressOxford, 1994. http://dx.doi.org/10.1093/oso/9780198534860.003.0004.
Texto completoActas de conferencias sobre el tema "R-convexity"
Wang, Ming-Zheng y Wen-Li Li. "On Convexity of Service-Level Measures of the Discrete (r,Q) Inventory System". En Second International Conference on Innovative Computing, Informatio and Control (ICICIC 2007). IEEE, 2007. http://dx.doi.org/10.1109/icicic.2007.414.
Texto completo