Related papers: Elementary fractal geometry. 5. Weak separation is…
In this article we define a special class of weak expectations for a representation of a separable unital C*-algebra, called decomposable weak expectation. We give necessary and sufficient conditions for such kind of weak expectations to…
For a semisimple multiring category with left duals, we prove that the unit object is simple if and only if the tensor functors by any non-zero algebra are separable (resp. faithful, resp. Maschke, resp. dual Maschke, resp. conservative).…
We consider a definition of a weakly convex set which is a generalization of the notion of a weakly convex set in the sense of Vial and a proximally smooth set in the sense of Clarke, from the case of the Hilbert space to a class of Banach…
We proved in a previous work that Cattani-Sassone's higher dimensional transition systems can be interpreted as a small-orthogonality class of a topological locally finitely presentable category of weak higher dimensional transition…
We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this "fractal" property contributes to the spectacular properties of the homomorphism…
A closed convex subset of a normed linear space is said to have the strong separation property if it can be strongly separated from every other disjoint closed and convex set by a closed hyperplane. In this paper we give some results on the…
We study the problems of bounding the number weak and strong independent sets in $r$-uniform, $d$-regular, $n$-vertex linear hypergraphs with no cross-edges. In the case of weak independent sets, we provide an upper bound that is tight up…
One says that a pair of sets $(S,Q)$ in $\mathbb{R}$ is 'annihilating' if no function can be concentrated on $S$ while having its Fourier transform concentrated on $Q$. One uses to distinguish between weak and strong annihilation types. It…
We identify a strong structural obstruction to Uniform Separation in constructive arithmetic. The mechanism is independent of semantic content; it emerges whenever two distinct evaluator predicates are sustained in parallel and inference…
A graph $G$ is weakly $\gamma$-closed if every induced subgraph of $G$ contains one vertex $v$ such that for each non-neighbor $u$ of $v$ it holds that $|N(u)\cap N(v)|<\gamma$. The weak closure $\gamma(G)$ of a graph, recently introduced…
The Strong Exponential Time Hypothesis (SETH) is a standard assumption in (fine-grained) parameterized complexity and many tight lower bounds are based on it. We consider a number of reasonable weakenings of the SETH, with sources from (i)…
In \cite{Elek} we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associate a type $II_1$-von Neumann algebra to such graph sequences.…
In this paper, we present an effective method to characterize completely when a disconnected fractal square has only finitely many connected components. Our method is to establish some graph structures on fractal squares to reveal the…
In this paper we obtain new results regarding the chain conditions in the Pixley-Roy hyperspaces $\mathscr{F}[X]$. For example, if $c(X)$ and $R(X)$ denote the cellularity and weak separation number of $X$ (see Section~[4]) and we define…
A domination-based identification problem on a graph $G$ is one where the objective is to choose a subset $C$ of the vertex set of $G$ such that $C$ has both, a domination property, that is, $C$ is either a dominating or a total-dominating…
Assuming Schanuel's Conjecture we prove that for any variety V over the algebraic closure over the rational numbers, of dimension n and with dominant projections, there exists a generic point in V. We obtain in this way many instances of…
For fractals on Riemannian manifolds, the theory of iterated function systems often does not apply well directly, as fractal sets are often defined by relations that are multivalued or non-contractive. To overcome this difficulty, we…
We consider an optical diffraction grating in which the spatial distribution of open slits forms a fractal set. The Fraunhofer diffraction patterns through the fractal grating are obtained analytically for the simplest triad Cantor type and…
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…
The visible problem is related to the arithmetic on the fractals. The visibility of self-similar set has been studied in the past. In this work, we investigate the visibility of non-self-similar sets. We begin by analyzing the structure of…