Related papers: Defining rough sets using tolerances compatible wi…
In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…
One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum $k$-Edge-Connected Spanning Subgraph problem ($k$-ECSS), as well as nonuniform…
Let $E$ be a directed (i.e., positively generated) ordered vector space endowed with an inner product. In this note, we prove that the following statements are equivalent: i) $E$ is a vector lattice and its norm induced by its inner product…
Problems of probabilistic inference and decision making under uncertainty commonly involve continuous random variables. Often these are discretized to a few points, to simplify assessments and computations. An alternative approximation is…
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…
In this work, we aim at understanding incompleteness in an abstract way via metamathematical properties of formal theories. We systematically examine the relationships between the following twelve important metamathematical properties of…
We give a characterization of subsets of effect algebras, that can be embedded into a range of an observable. To give this characterization, we introduce a new notion of {\em compatibility support mappings.}
Let $X$ be an inner product space, let $G$ be a group of orthogonal transformations of $X$, and let $R$ be a bounded $G$-stable subset of $X$. We define very weak and very strong regularity for such pairs $(R,G)$ (in the sense of…
We study the structure of the set of priority-neutral matchings. These matchings, introduced by Reny (AER, 2022), generalize stable matchings by allowing for priority violations in a principled way that enables Pareto-improvements to stable…
An equiangular tight frame (ETF) is a set of unit vectors whose coherence achieves the Welch bound, and so is as incoherent as possible. They arise in numerous applications. It is well known that real ETFs are equivalent to a certain…
In this paper, based on results of exact learning, test theory, and rough set theory, we study arbitrary infinite families of concepts each of which consists of an infinite set of elements and an infinite set of subsets of this set called…
For a coarse space $(X, \mathcal{E})$, $X^\sharp$ denotes the set of all unbounded ultrafilters on $X$ endowed with the parallelity relation: $p||q$ if there exists $E \in \mathcal{E} $ such that $ E[P]\in q $ for each $P\in p$. If $(X,…
Access control is fundamental to computer security, and has thus been the subject of extensive formal study. In particular, *relative expressiveness analysis* techniques have used formal mappings called *simulations* to explore whether one…
We introduce a new information-theoretic formulation of quantum measurement uncertainty relations, based on the notion of relative entropy between measurement probabilities. In the case of a finite-dimensional system and for any approximate…
In this paper a new equivalence relation $\approx$ to classify the fuzzy subgroups of finite groups is introduced and studied. This generalizes the equivalence relation $\sim$ defined on the lattice of fuzzy subgroups of a finite group that…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
A relational structure $\mathbb{X}$ is called reversible iff each bijective homomorphism from $\mathbb{X}$ onto $\mathbb{X}$ is an isomorphism, and linear orders are prototypical examples of such structures. One way to detect new reversible…
Commensurate scale relations are perturbative QCD predictions which relate observable to observable at fixed relative scale, such as the "generalized Crewther relation", which connects the Bjorken and Gross-Llewellyn Smith deep inelastic…
We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on $\omega_2$ using finite conditions.
Gopal Prasad and A. S. Rapinchuk defined a notion of weakly commensurable lattices in a semisimple group, and gave a classification of weakly commensurable Zariski dense subgroups. A motivation was to classify pairs of locally symmetric…