相关论文: Localizations of infinite subsets of omega

Motivated by secure wireless networking, we consider the problem of placing fixed localizers that enable mobile communication devices to prove they belong to a secure region that is defined by the interior of a polygon. Each localizer views…

We prove that \textsf{P}-points (even strong P-points) and Gruff ultrafilters exist in any forcing extension obtained by adding fewer than $\aleph_{\omega}% $-many random reals to a model of \textsf{CH. }These results improve and correct…

We introduce the notion of a severe right Ore set in the main as a tool to study universal localisations of rings but also to provide a short proof of P. M. Cohn's classification of homomorphisms from a ring to a division ring. We prove…

We study conditions under which an odd symmetry of the integrand leads to localization of the corresponding integral over a (super)manifold. We also show that in many cases these conditions guarantee exactness of the stationary phase…

We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…

Strongly convex sets in Hilbert spaces are characterized by local properties. One quantity which is used for this purpose is a generalization of the modulus of convexity \delta_\Omega of a set \Omega. We also show that \lim_{\epsilon \to 0}…

Let $A$ be a differential graded algebra with cohomology ring $H^*A$. A graded module over $H^*A$ is called \emph{realisable} if it is (up to direct summands) of the form $H^*M$ for some differential graded $A$-module $M$. Benson, Krause…

For a given graph $G$, a "hopset" $H$ with hopbound $\beta$ and stretch $\alpha$ is a set of edges such that between every pair of vertices $u$ and $v$, there is a path with at most $\beta$ hops in $G \cup H$ that approximates the distance…

Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…

The fair division of indivisible goods is not only a subject of theoretical research, but also an important problem in practice, with solutions being offered on several online platforms. Little is known, however, about the characteristics…

The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…

This paper revisits the problem of predicting box locations in object detection architectures. Typically, each box proposal or box query aims to directly maximize the intersection-over-union score with the ground truth, followed by a…

Establishing bounds on the accuracy achievable by localization techniques represents a fundamental technical issue. Bounds on localization accuracy have been derived for cases in which the position of an agent is estimated on the basis of a…

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…

Inspired by CapsNet's routing-by-agreement mechanism with its ability to learn object properties, we explore if those properties in turn can determine new properties of the objects, such as the locations. We then propose a CapsNet…

Intrinsic location functional is a large class of random locations containing locations that one may encounter in many cases, e.g., the location of the path supremum/infimum over a given interval, the first/last hitting time, etc. It has…

We consider generalizations of classical function spaces by requiring that a holomorphic in ${\Omega}$ function satisfies some property when we approach from ${\Omega}$, not the whole boundary, but only a part of it. These spaces endowed…

Localization properties of particles in one-dimensional incommensurate lattices without interaction are investigated with models beyond the tight-binding Aubry-Andr\'e (AA) model. Based on a tight-binding t_1 - t_2 model with finite…

Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…