Related papers: A remark on approximation of open sets with regula…
We show that the closure of the value set of a real linear recurrence sequence is the union of a countable set and a finite collection of intervals. Conversely, any finite collection of closed intervals is the closure of the value set of…
We prove that every pointed closed convex set in $\mathbb{R}^n$ is the intersection of all the rational closed halfspaces that contain it. This generalizes a previous result by the authors for compact convex sets.
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
The kernel of analysis, to me anyway, is the following idea: A point is arbitrarily close to a set if every neighborhood of the point intersects the set. Defining ``arbitrarily close'' in this way provides a foundation for classical results…
The aim of this paper is to define and study $\mathcal{B}$-open sets and related properties. A $\mathcal{B}$-open set is, roughly speaking, a generalization of a $b$-open set, which is in turn a generalization of a pre-open set and a…
Let a $R$-body be a closed set, complement of union of open balls of radius $R$ in the Euclidean space. Properties generalizing similar ones for convex sets are proved for the family of $R$-bodies; properties for the family of sets…
Several results about the union-closed sets conjecture are presented.
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
A definable set in a pair (K, k) of algebraically closed fields is co-analyzable relative to the subfield k of the pair if and only if it is almost internal to k. To prove this and some related results for tame pairs of real closed fields…
Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.
We prove that for any non-symmetric irreducible divisible convex set, the proximal limit set is the full projective boundary.
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
We study the properties of the set where a generalized function of bounded variation has infinite approximate limit, highlighting in this way the main geometric difference with functions of bounded variation. To this aim we prove a new…
The abstract boundary uses sets of curves with the bounded parameter property (b.p.p.) to classify the elements of the abstract boundary into regular points, singular points, points at infinity and so on. To study how the classification…
Sets in R^n in which every pair of elements x, y can be connected by a path in the set of length bounded by a constant multiple of the distance between x and y are considered.
We prove that if a set $B$ in a Banach space $X$ can be written as an increasing, countable union $B=\cup_n B_n$ of sets $B_n$ such that no $B_n$ is uniform boundedness deciding, then also $B$ is not uniform boundedness deciding. From this…
We prove Union-Closed sets conjecture.
Let X be a normed linear space. We examine if every open, convex and unbounded subset of X is equal to the union of a family of open straight half lines. The answer is affirmative if and only if X is finite dimensional.
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…