相关论文: Localizations of infinite subsets of omega
Locating a target is key in many applications, namely in high-stakes real-world scenarios, like detecting humans or obstacles in vehicular networks. In scenarios where precise statistics of the measurement noise are unavailable,…
The present paper is devoted to new, improved bounds for the eigenfunctions of random operators in the localized regime. We prove that, in the localized regime with good probability, each eigenfunction is exponentially decaying outside a…
Fix a set-theoretic universe $V$. We look at small extensions of $V$ as generalised degrees of computability over $V$. We also formalise and investigate the complexity of certain methods one can use to define, in $V$, subclasses of degrees…
The goal of ordinal embedding is to represent items as points in a low-dimensional Euclidean space given a set of constraints in the form of distance comparisons like "item $i$ is closer to item $j$ than item $k$". Ordinal constraints like…
Ordinal embedding aims at finding a low dimensional representation of objects from a set of constraints of the form "item $j$ is closer to item $i$ than item $k$". Typically, each object is mapped onto a point vector in a low dimensional…
In this paper we present a technical lemma about localization at countable infinitely many prime ideals. We apply this lemma to get many results about the finiteness of associated prime ideals of local cohomology modules.
The concepts of localizable set, localization of a ring and a module at a localizable set are introduced and studied. Localizable sets are generalization of Ore sets and denominator sets, and the localization of a ring/module at a…
Let $X$ be a ringed space together with the data $M$ of a set $M_x$ of prime ideals of $\O_{X,x}$ for each point $x \in X$. We introduce the localization of $(X,M)$, which is a locally ringed space $Y$ and a map of ringed spaces $Y \to X$…
Finding models for linear-time properties is a central problem in verification and planning. We study the distribution of linear-time models by investigating the density of linear-time properties over the space of ultimately periodic words.…
We prove that almost all real numbers (with respect to Lebesgue measure) are approximated by the convergents of their $\beta$-expansions with the exponential order $\beta^{-n}$. Moreover, the Hausdorff dimensions of sets of the real numbers…
Many approaches in the field of machine learning and data analysis rely on the assumption that the observed data lies on lower-dimensional manifolds. This assumption has been verified empirically for many real data sets. To make use of this…
We generalize the notions of $\beta$- and $\lambda$-maps to general selections of sublocales, obtaining different classes of localic maps. These new classes of maps are used to characterize almost normality, extremal disconnectedness,…
Relaxation theorems for multiple integrals on W^{1,p}(\Omega;\RR^m), where p\in]1,\infty[, are proved under general conditions on the integrand L:\MM\to[0,\infty] which is Borel measurable and not necessarily finite. We involve a…
This work developes a quantitative framework for describing the overcompleteness of a large class of frames. A previous paper introduced notions of localization and approximation between two frames $\mathcal{F} = \{f_i\}_{i \in I}$ and…
In this paper, the classification task for a family of sets representing the realisation of some random set models is solved. Both unsupervised and supervised classification methods are utilised using the similarity measure between two…
We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…
We study the localization of bosonic atoms in an optical lattice, which interact in a spatially confined region. The classical theory predicts that there is no localization below a threshold value for the strength of interaction that is…
Within a mathematically rigorous model, we analyse the curse of dimensionality for deterministic exact similarity search in the context of popular indexing schemes: metric trees. The datasets $X$ are sampled randomly from a domain $\Omega$,…
Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…
We prove a couple of results on local continuous extension of proper holomorphic maps $F:D \rightarrow \Omega$, $D, \Omega \varsubsetneq \mathbb{C}^n$, making local assumptions on $\partial{D}$ and $\partial{\Omega}$. The first result…