Related papers: Elementary fractal geometry. 5. Weak separation is…
Separability is one of the most basic and important topological properties. In this paper, the separability in (strongly) topological gyrogroups is studied. It is proved that every first-countable left {\omega}-narrow strongly topological…
Fractal scatterings in weak solitary wave interactions is analyzed for generalized nonlinear Schr\"odiger equations (GNLS). Using asymptotic methods, these weak interactions are reduced to a universal second-order map. This map gives the…
In this article we introduce the {\it cylindrical construction} for graphs and investigate its basic properties. We state a main result claiming a weak tensor-like duality for this construction. Details of our motivations and applications…
We discuss the abstract structure of sequential weak measurement (WM) of general observables. In all orders, the sequential WM correlations without post-selection yield the corresponding correlations of the Wigner function, offering direct…
This paper analyzes independence concepts for sets of probability measures associated with directed acyclic graphs. The paper shows that epistemic independence and the standard Markov condition violate desirable separation properties. The…
For an iterated function system (IFS) of simillitidues, we define two graphs on the representing symbolic space. We show that if the self-similar set $K$ has positive Lebesgue measure or the IFS satisfies the weak separation condition, then…
F. Escalante and T. Gallai studied in the seventies the structure of different kind of separations and cuts between a vertex pair in a (possibly infinite) graph. One of their results is that if there is a finite separation, then the optimal…
Symmetrically self-similar graphs are an important type of fractal graph. Their Green functions satisfy order one iterative functional equations. We show when the branching number of a generating cell is two, either the graph is a star…
The weak minor G of a graph G is the graph obtained from G by a sequence of edge-contraction operations on G. A weak-minor-closed family of upper embeddable graphs is a set G of upper embeddable graphs that for each graph G in G, every weak…
We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
Accurate segmentation of long and thin tubular structures is required in a wide variety of areas such as biology, medicine, and remote sensing. The complex topology and geometry of such structures often pose significant technical…
Let $\beta>0$. Motivated by jumbled graphs defined by Thomason, the celebrated expander mixing lemma and Haemers's vertex separation inequality, we define that a graph $G$ with $n$ vertices is a weakly $(n,\beta)$-graph if $\frac{|X|…
According to the Furstenberg-Zimmer structure theorem, every measure-preserving system has a maximal distal factor, and is weak mixing relative to that factor. Furstenberg and Katznelson used this structural analysis of measure-preserving…
An $n$-vertex graph $G$ is weakly $F$-saturated if $G$ contains no copy of $F$ and there exists an ordering of all edges in $E(K_n) \setminus E(G)$ such that, when added one at a time, each edge creates a new copy of $F$. The minimum size…
A quasivariety has the weak ES property when the epimorphisms between its finitely generated members are surjective. A characterization of quasivarieties with the weak ES property is obtained and a method for detecting failures of this…
We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We characterize the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove…
We outline necessary and sufficient condition to the existence of extrmas of a function on a self-similar set, and we describe discrete gradient algorithm to find the extrema.
The self-similarity properties of fractals are studied in the framework of the theory of entire analytical functions and the $q$-deformed algebra of coherent states. Self-similar structures are related to dissipation and to noncommutative…
Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…