level sets
Recently Published Documents


TOTAL DOCUMENTS

1243
(FIVE YEARS 163)

H-INDEX

56
(FIVE YEARS 5)

Author(s):  
Pedro Huidobro ◽  
Pedro Alonso ◽  
Vladimír Janiš ◽  
Susana Montes

AbstractConvexity is a deeply studied concept since it is very useful in many fields of mathematics, like optimization. When we deal with imprecision, the convexity is required as well and some important applications can be found fuzzy optimization, in particular convexity of fuzzy sets. In this paper we have extended the notion of convexity for interval-valued fuzzy sets in order to be able to cover some wider area of imprecision. We show some of its interesting properties, and study the preservation under the intersection and the cutworthy property. Finally, we applied convexity to decision-making problems.


Author(s):  
Shuyi Lin ◽  
Jinjun Li ◽  
Manli Lou

Let [Formula: see text] denote the largest digit of the first [Formula: see text] terms in the Lüroth expansion of [Formula: see text]. Shen, Yu and Zhou, A note on the largest digits in Luroth expansion, Int. J. Number Theory 10 (2014) 1015–1023 considered the level sets [Formula: see text] and proved that each [Formula: see text] has full Hausdorff dimension. In this paper, we investigate the Hausdorff dimension of the following refined exceptional set: [Formula: see text] and show that [Formula: see text] has full Hausdorff dimension for each pair [Formula: see text] with [Formula: see text]. Combining the two results, [Formula: see text] can be decomposed into the disjoint union of uncountably many sets with full Hausdorff dimension.


Author(s):  
Sergey A. Bashkatov ◽  
Alexander A. Shakhov

In the review article, in the context of discussing the current problem of clarifying the causes of wrong behaviour and developing approaches to its correction based on the analysis of literature sources; the hypothesis is substantiated that behavioural errors in all their diversity are a consequence of the actualisation of sets at different levels of organisation. The scientific novelty of the research is in the fact that in order to achieve this goal, a comparative analysis of wrong behavior has been carried for the first time out from the standpoint of the classical theory of sets by Dimitri Uznadze and from the standpoint of modification of this theory by Aleksandr Asmolov, according to which human activity is stabilised by three types of sets at different levels of organization – operational, purpose and semantic. For the factual argumentation of the results of the analysis, all dissertations (46) that had been defended in Russia over the past 30 years as part of the study of wrong behaviour were studied. In these works, errors are described and discussed, which can be conditionally subdivided into three main large groups – automatic errors, errors of failure to achieve the goal and errors of the meaning of activity. These groups of errors have signs of level sets, and that confirms the hypothesis formulated in this article. The development of approaches to the correction of wrong behaviour on the basis of psychological mechanisms of formation and correction of sets at different levels of organisation within the framework of the concept of set activity by Aleksandr Asmolov.


Author(s):  
Alexander Drewitz ◽  
Alexis Prévost ◽  
Pierre-François Rodriguez

AbstractWe investigate level sets of the Gaussian free field on continuous transient metric graphs $$\widetilde{{\mathcal {G}}}$$ G ~ and study the capacity of its level set clusters. We prove, without any further assumption on the base graph $${\mathcal {G}}$$ G , that the capacity of sign clusters on $$\widetilde{{\mathcal {G}}}$$ G ~ is finite almost surely. This leads to a new and effective criterion to determine whether the sign clusters of the free field on $$\widetilde{{\mathcal {G}}}$$ G ~ are bounded or not. It also elucidates why the critical parameter for percolation of level sets on $$\widetilde{{\mathcal {G}}}$$ G ~ vanishes in most instances in the massless case and establishes the continuity of this phase transition in a wide range of cases, including all vertex-transitive graphs. When the sign clusters on $$\widetilde{{\mathcal {G}}}$$ G ~ do not percolate, we further determine by means of isomorphism theory the exact law of the capacity of compact clusters at any height. Specifically, we derive this law from an extension of Sznitman’s refinement of Lupu’s recent isomorphism theorem relating the free field and random interlacements, proved along the way, and which holds under the sole assumption that sign clusters on $$\widetilde{{\mathcal {G}}}$$ G ~ are bounded. Finally, we show that the law of the cluster capacity functionals obtained in this way actually characterizes the isomorphism theorem, i.e. the two are equivalent.


2021 ◽  
pp. 1-63
Author(s):  
KRZYSZTOF FRĄCZEK ◽  
VERED ROM-KEDAR

Abstract The ergodic properties of two uncoupled oscillators, one horizontal and one vertical, residing in a class of non-rectangular star-shaped polygons with only vertical and horizontal boundaries and impacting elastically from its boundaries are studied. We prove that the iso-energy level sets topology changes non-trivially; the flow on level sets is always conjugated to a translation flow on a translation surface, yet, for some segments of partial energies the genus of the surface is strictly greater than $1$ . When at least one of the oscillators is unharmonic, or when both are harmonic and non-resonant, we prove that for almost all partial energies, including the impacting ones, the flow on level sets is uniquely ergodic. When both oscillators are harmonic and resonant, we prove that there exist intervals of partial energies on which periodic ribbons and additional ergodic components coexist. We prove that for almost all partial energies in such segments the motion is uniquely ergodic on the part of the level set that is not occupied by the periodic ribbons. This implies that ergodic averages project to piecewise smooth weighted averages in the configuration space.


Author(s):  
Paula Saavedra-Nieves ◽  
Rosa M. Crujeiras

AbstractHighest density regions (HDRs) are defined as level sets containing sample points of relatively high density. Although Euclidean HDR estimation from a random sample, generated from the underlying density, has been widely considered in the statistical literature, this problem has not been contemplated for directional data yet. In this work, directional HDRs are formally defined and plug-in estimators based on kernel smoothing and associated confidence regions are proposed. We also provide a new suitable bootstrap bandwidth selector for plug-in HDRs estimation based on the minimization of an error criteria that involves the Hausdorff distance between the boundaries of the theoretical and estimated HDRs. An extensive simulation study shows the performance of the resulting estimator for the circle and for the sphere. The methodology is applied to analyze two real data sets in animal orientation and seismology.


Sign in / Sign up

Export Citation Format

Share Document