相关论文: Localizations of infinite subsets of omega
We introduce a new method for building models of CH, together with $\Pi_2$ statements over $H(\omega_2)$, by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only $\aleph_1$-many of…
Segmentation of objects in microscopy images is required for many biomedical applications. We introduce object-centric embeddings (OCEs), which embed image patches such that the spatial offsets between patches cropped from the same object…
We study the relationship between Amoeba forcing (the partial order which generically adds a measure one set of random reals) and projective measurability. Given a universe V of set theory and a forcing notion P in V we say that V is…
Any model of ZFC + GCH has a generic extension (made with a poset of size aleph_2) in which the following hold: MA + 2^{aleph_0}= aleph_2+ there exists a Delta^2_1-well ordering of the reals. The proof consists in iterating posets designed…
Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…
Answering a question of Harrington, we show that there exists a proper forcing notion, which adds a minimal real $\eta \in \prod_{i<\omega} n^*_i$, which is eventually different from any old real in $\prod_{i<\omega} n^*_i$, where the…
Given a set $\Omega$ and a proximity function $\phi: \Omega \times \Omega \to \mathbb R^+$, we define a new metric for $\Omega$ by considering a path distance in $\Omega$, that is considered as a complete graph. We analyze the properties of…
Fragments of first-order logic over words can often be characterized in terms of finite monoids or finite semigroups. Usually these algebraic descriptions yield decidability of the question whether a given regular language is definable in a…
For a fixed ring, different classes of ring epimorphisms and localisation maps are compared. In fact, we provide sufficient conditions for a ring epimorphism to be a universal localisation. Furthermore, we consider recollements induced by…
We prove that if $\Omega\subseteq\mathbb{R}^N$ is a set with finite perimeter with $\mathscr{H}^{N-1}(\partial \Omega\setminus\partial^* \Omega)=0$, then any set of finite perimeter $E\subseteq\mathbb{R}^N$ can be approximated by a…
Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are $k$-Means, Geometric…
A structure M is pregeometric if the algebraic closure is a pregeometry in all M' elementarily equivalent to M. We define a generalisation: structures with an existential matroid. The main examples are superstable groups of U-rank a power…
Assuming that ORD is $\omega +\omega $-Erd\"os we show that if a class forcing amenable to $L$ (an $L$-forcing) has a generic then it has one definable in a set-generic extension of $L[O^\#]$. In fact we may choose such a generic to be {\it…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…
Potts models, which can be used to analyze dependent observations on a lattice, have seen widespread application in a variety of areas, including statistical mechanics, neuroscience, and quantum computing. To address the intractability of…
The interleaving distance, although originally developed for persistent homology, has been generalized to measure the distance between functors modeled on many posets or even small categories. Existing theories require that such a poset…
This paper presents a method for future localization: to predict a set of plausible trajectories of ego-motion given a depth image. We predict paths avoiding obstacles, between objects, even paths turning around a corner into space behind…
The standard notion of poset probability of a finite poset P involves calculating, for incomparable $\alpha$, $\beta$ in P, the number of linear extensions of P for which $\alpha$ precedes $\beta$. The fraction of those linear extensions…
Place classification is a fundamental ability that a robot should possess to carry out effective human-robot interactions. It is a nontrivial classification problem which has attracted many research. In recent years, there is a high…