Related papers: A remark on approximation of open sets with regula…
We prove that an open set $\Omega \subset \mathbb{R}^n$ can be approximated by smooth sets of uniformly bounded perimeter from the interior if and only if the open set $\Omega$ satisfies \begin{align*} &\qquad…
We show that a densely defined closable operator $A$ such that the resolvent set of $A^2$ is not empty is necessarily closed. This result is then extended to the case of a polynomial $p(A)$. We also generalize a recent result by…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
For a definable continuous mapping $f$ from a definable connected open subset $\Omega$ of $\mathbb R^n$ into $\mathbb R^n,$ we show that the following statements are equivalent: (i) The mapping $f$ is open. (ii) The fibers of $f$ are finite…
This article introduces innovative classes of open sets in \(\mathbb{R}^{N}\), where \(N=2, 3\), characterized by a geometric property associated with the inward normal. The focus lies on proving compactness results for the Hausdorff…
A celebrated and deep result of Green and Tao states that the primes contain arbitrarily long arithmetic progressions. In this note I provide a straightforward argument demonstrating that the primes get arbitrarily close to arbitrarily long…
This is a straightforward introduction to the properties of polynomials in many variables that do not vanish in the open upper half plane. Such polynomials generalize many of the well-known properties of polynomials with all real roots.
In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid. A key to the proof is the definition…
A connected covering is a design system in which the corresponding {\em block graph} is connected. The minimum size of such coverings are called {\em connected coverings numbers}. In this paper, we present various formulas and bounds for…
We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…
In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…
Shape estimation and object reconstruction are common problems in image analysis. Mathematically, viewing objects in the image plane as random sets reduces the problem of shape estimation to inference about sets. Currently existing…
It is shown that the formula for the variance of combined series yields surprisingly simple proofs of some well known variance bounds.
Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is…
In this paper, we study some properties of $*-$open and $*-$closed subsets of a space. The collection of all $*-$open subsets of a space $X$ form a topology on $X$ which is denoted by $^{*}O(X)$. We investigate the relations between…
It is proved that: each collectively order continuous set of operators from an Archimedean OVS with a generating cone to an OVS is collectively order bounded; and each collectively order to norm bounded set of operators from an ordered…
Classification, up to isomorphism, of algebras from a non-empty subset of the variety of $n$- dimensional algebras is presented. It is shown that these algebras have only trivial automorphism and if the basic field is algebraically closed…
We show that any $d\geq3$ pairwise-disjoint open sets $A_1$, ..., $A_d\subset\widehat{\mathbb{C}}$ sharing a common boundary $J$ can be simultaneously approximated by the $d$ attracting basins $\mathcal{A}_1$, ..., $\mathcal{A}_d$ of a…
We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.
A well-known result of Bollob\'as says that if $\{(A_i, B_i)\}_{i=1}^m$ is a set pair system such that $|A_i| \le a$ and $|B_i| \le b$ for $1 \le i \le m$, and $A_i \cap B_j \ne \emptyset$ if and only if $i \ne j$, then $m \le {a+b \choose…