Related papers: On the intersection of fractal cubes
Compositional graphoids are fundamental discrete structures which appear in probabilistic reasoning, particularly in the area of graphical models. They are semigraphoids which satisfy the Intersection and Composition properties. These…
The attractors of iterated function systems are usually obtained as the Hausdorff limit of any non-empty compact subset under iteration. In this note we show that an iterated function system on a boundedly compact metric space has compact,…
We consider blood flow in a vessel with an attached capillary system. The latter is modeled with the help of a corresponding fractal graph whose edges are supplied with ordinary differential equations obtained by the dimension-reduction…
Let $f$ be a transcendental entire function of finite order which has an attracting periodic point $z_0$ of period at least $2$. Suppose that the set of singularities of the inverse of $f$ is finite and contained in the component $U$ of the…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
The intersection graph of a family of sets $\{S_{1},S_{2},\ldots,S_{n}\}$ is a graph whose vertex set is $\{S_{1},S_{2},\ldots,S_{n}\}$ and two distinct vertices are adjacent if the intersection of the corresponding sets is non-empty.…
A collection $ \Delta $ of simple closed curves on an orientable surface is an algebraic $ k $-system if the algebraic intersection number $\langle \alpha,\beta \rangle$ is equal to $k $ in absolute value for every $ \alpha , \beta \in…
Fekete, Jord\'an and Kaszanitzky [4] characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their…
For a graph property $\mathcal{P}$ and a common vertex set $V = \{1, 2, \ldots, n\}$, a family of graphs on $V$ is \emph{$\mathcal{P}$-intersecting} iff $G \cap H$ satisfies $\mathcal{P}$ for all $G,H$ in the family. Addressing a question…
We show that the detection of geometric intersection in an arbitrary representation of the mapping class group of surface implies the injectivity of that representation up to center, and vice versa. As an application, we discuss the…
A version of the Krull Intersection Theorem states that for Noetherian domains, the Krull intersection $ki(I)$ of every proper ideal $I$ is trivial; that is $$ ki(I):=\displaystyle\bigcap_{n=1}^\infty I^n = \{0\}. $$ We investigate the…
We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…
In this paper we present the novel qualities of entanglement of formation for general (so also infinite dimensional) quantum systems. A major benefit of our presentation is a rigorous description of entanglement of formation. In particular,…
Suppose a graph-directed iterated function system consists of maps f_e with upper estimates of the form d(f_e(x),f_e(y)) <= r_e d(x,y). Then the fractal dimension of the attractor K_v of the IFS is bounded above by the dimension associated…
The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…
Fractons are anyons classified into equivalence classes and they obey a specific fractal statistics. The equivalence classes are labeled by a fractal parameter or Hausdorff dimension $h$. We consider this approach in the context of the…
We study touching cones of a (not necessarily closed) convex set in a finitedimensional real Euclidean vector space and we draw relationships to other concepts in Convex Geometry. Exposed faces correspond to normal cones by an antitone…
Ballistic particles interacting with irregular surfaces are representative of many physical problems in the Knudsen diffusion regime. In this paper, the collisions of ballistic particles interacting with an irregular surface modeled by a…
Derangements are a popular topic in combinatorics classes. We study a generalization to face derangements of the n-dimensional hypercube. These derangements can be classified as odd or even, depending on whether the underlying isometry is…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if,…