Related papers: Defining rough sets using tolerances compatible wi…
Let $\Gamma$ be a countable discrete amenable group, and let $A=l^\infty(\Gamma) \rtimes \Gamma$ or $A = \mathrm{C}(M) \rtimes \Gamma$, where $(M, \Gamma)$ is the universal minimal set of $\Gamma$. It is shown that if $a, b \in A \otimes…
Logarithmic Conformal Field Theories (LCFT) play a key role, for instance, in the description of critical geometrical problems (percolation, self avoiding walks, etc.), or of critical points in several classes of disordered systems…
We introduce a notion of rectifiability modeled on Carnot groups. Precisely, we say that a subset E of a Carnot group M and N is a subgroup of M, we say E is N-rectifiable if it is the Lipschitz image of a positive measure subset of N.…
Preferential equality is an equivalence relation on fuzzy subsets of finite sets and is a generalization of classical equality of subsets. In this paper we introduce a tightened version of the preferential equality on fuzzy subsets and…
Benjelloun et al. \cite{BGSWW} considered the Entity Resolution (ER) problem as the generic process of matching and merging entity records judged to represent the same real world object. They treated the functions for matching and merging…
While any infimum in a poset can also be computed as a supremum, and vice versa, categorical limits and colimits do not always approximate each other. If I approach a point from below, and you approach it from above, then we will surely…
The main purpose of this paper is to study the lattice structure of variable precision rough sets. The notion of variation in precision of rough sets have been further extended to variable precision rough set with variable classification…
Recently a problem concerning the equivalence of joint measurability and coexistence of quantum observables was solved [15]. In this paper we generalize two known joint measurability results from sharp observables to the class of extreme…
We study approximations of theories both in general context and with respect to some natural classes of theories. Some kinds of approximations are considered, connections with finitely axiomatizable theories and minimal generating sets of…
In this paper, we define locally matchable subsets of a group which is extracted from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
Many fundamental problems in artificial intelligence, knowledge representation, and verification involve reasoning about sets and relations between sets and can be modeled as set constraint satisfaction problems (set CSPs). Such problems…
We show that, for a certain large class of power-bounded $o$-minimal $\mathcal{L}_T$-theories $T$ whose field of exponents is infinite-dimensional as a vector space over the rationals, any definable set in a $T$-convex valued field…
Two triangle meshes are conformally equivalent if for any pair of incident triangles the absolute values of the corresponding cross-ratios of the four vertices agree. Such a pair can be considered as preimage and image of a discrete…
We completely characterize definable linear orders in o-minimal structures expanding groups. For example, let (P,<_p) be a linear order definable in the real field R. Then (P,<_p) embeds definably in (R^{n+1},<_l), where <_l is the…
We start an analysis of geometric properties of a structure relative to a reduct. In particular, we look at definability of groups and fields in this context. In the relatively one-based case, every definable group is isogenous to a…
Adoption of machine learning models in healthcare requires end users' trust in the system. Models that provide additional supportive evidence for their predictions promise to facilitate adoption. We define consistent evidence to be both…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
Measurable sets are defined as those locally approximable, in a certain sense, by sets in the given algebra (or ring). A corresponding measure extension theorem is proved. It is also shown that a set is locally approximable in the mentioned…
We discuss the role of approximate U(1)_R symmetries for the understanding of hierarchies in Nature. Such symmetries may explain a suppressed expectation value of the superpotential and provide us with a solution to the MSSM mu problem. We…
We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a "composable constraint encoding". We show that every composable constraint encoding…