Related papers: On Intersections of Cantor Sets: Self-Similarity
Let S be a subring of the ring R. We investigate the question of whether S intersected by U(R) is equal to U(S) holds for the units. In many situations our answer is positive. There is a special emphasis on the case when R is a full matrix…
A coordinate cone in R^n is an intersection of some coordinate hyperplanes and open coordinate half-spaces. A semi-monotone set is a defnable in an o-minimal structure over the reals, open bounded subset of R^n such that its intersection…
We consider algebras in a modular tensor category C. If the trace pairing of an algebra A in C is non-degenerate we associate to A a commutative algebra Z(A), called the full centre, in a doubled version of the category C. We prove that two…
The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…
The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…
In this paper we prove that among pairs $K,\,K' \subset \mathbb{C}$ of conformal dynamically defined Cantor sets with sum of Hausdorff dimensions $HD(K)+HD(K')>2$, there is an open and dense subset of such pairs verifying…
In musical compositions that include vocals, lyrics significantly contribute to artistic expression. Consequently, previous studies have introduced the concept of a recommendation system that suggests lyrics similar to a user's favorites or…
We prove that for all $s\in(0,d)$ and $c\in (0,1)$ there exists a self-similar set $E\subset \mathbb{R}^d$ with Hausdorff dimension $s$ such that $\mathcal{H}^s(E)=c|E|^s$. This answers a question raised by Zhiying Wen[16].
Research on computational argumentation is currently being intensively investigated. The goal of this community is to find the best pro and con arguments for a user given topic either to form an opinion for oneself, or to persuade others to…
Interchanging character and co-character groups of a torus $T$ over a field $k$ introduces a contravariant functor $T \rightarrow \widehat{T}$. Interpreting $\rho:T\rightarrow {\mathbb C}^\times$, half the sum of positive roots for $T$ a…
In relation to the Erd\H os similarity problem (show that for any infinite set $A$ of real numbers there exists a set of positive Lebesgue measure which contains no affine copy of $A$) we give some new examples of infinite sets which are…
Proper continued fractions are generalized continued fractions with positive integer numerators $a_i$ and integer denominators with $b_i\geq a_i$. In this paper we study the strength of approximation of irrational numbers to their…
A family $\mathcal{A}$ of sets is said to be intersecting if every two sets in $\mathcal{A}$ intersect. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be cross-intersecting if each set in $\mathcal{A}$ intersects each set in…
Using uniformization, Cantor type sets can be regarded as boundaries of rooted trees. In this setting, we show that the trace of a first-order Sobolev space on the boundary of a regular rooted tree is exactly a Besov space with an explicit…
Two cross caps in Euclidean $3$-space are said to be formally isometric if their Taylor expansions of the first fundamental forms coincide by taking a suitable local coordinate system. For a given $C^\infty$ cross cap $f$, we give a method…
A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…
In this paper, we show that the existence of certain first-countable compact-like extensions is equivalent to the equality between corresponding cardinal characteristics of the continuum. For instance, $\mathfrak b=\mathfrak s=\mathfrak c$…
A measurable relation algebra is a relation algebra in which the identity element is a sum of atoms that can be measured in the sense that the "size" of each such atom can be defined in an intuitive and reasonable way (within the framework…
A famous conjecture of Ryser states that any $r$-partite set system has transversal number at most $r-1$ times their matching number. This conjecture is only known to be true for $r\leq3$ in general, for $r\leq5$ if the set system is…
According to Cantor, a set is a collection into a whole of defined and separate (we shall say distinct) objects. So, a natural question is ``How to treat as `sets' collections of indistinguishable objects?". This is the aim of quasi-set…