Related papers: On the intersection of fractal cubes

A $k$-connected set in an infinite graph, where $k > 0$ is an integer, is a set of vertices such that any two of its subsets of the same size $\ell \leq k$ can be connected by $\ell$ disjoint paths in the whole graph. We characterise the…

These are the lecture notes for a course at the Summer School on "Applied Analysis" at the Technical University Chemnitz in September 2011. We start with the definition of a fractal algebra and show that the fractal property is enormously…

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…

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…

We explore the applications of Lorentzian polynomials to the fields of algebraic geometry, analytic geometry and convex geometry. In particular, we establish a series of intersection theoretic inequalities, which we call rKT property, with…

Surfaces with concentric $K$-contours and parallel $K$-contours in Euclidean $3$-space are defined. Crucial examples are presented and characterization of them are given.

Labyrinth fractals are self-similar dendrites in the unit square that are defined with the help of a labyrinth set or a labyrinth pattern. In the case when the fractal is generated by a horizontally and vertically blocked pattern, the arc…

Let X be a complete intersection of two hypersurfaces F_n and F_k in the projective space P^5 of degree n and k respectively with n >= k, such that the singularities of X are nodal and F_k is smooth. We prove that if the threefold X has at…

We study isomorphic properties of two generalizations of intersection bodies, the class of k-intersection bodies and the class of generalized k-intersection bodies. We also show that the Banach-Mazur distance of the k-intersection body of a…

For positive integers $n>k>t$ let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\{1,\ldots,n\}$. Subsets of $\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\mathcal{F}$ is called…

We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…

We consider $k$-graphs on $n$ vertices, that is, $\mathcal{F}\subset \binom{[n]}{k}$. A $k$-graph $\mathcal{F}$ is called intersecting if $F\cap F'\neq \emptyset$ for all $F,F'\in \mathcal{F}$. In the present paper we prove that for $k\geq…

The dynamical Mordell-Lang conjecture concerns the structure of the intersection of an orbit in an algebraic dynamical system and an algebraic variety. In this paper, we bound the size of this intersection for various cases when it is…

Let $F$ be Cayley's ruled cubic surface in a projective three-space over any commutative field $K$. We determine all collineations fixing $F$, as a set, and all cubic forms defining $F$. For both problems the cases $|K|=2,3$ turn out to be…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

We consider the motion by mean curvature of an $n$-dimensional graph over a time-dependent domain in $\mathbb{R}^n$, intersecting $\mathbb{R}^n$ at a constant angle. In the general case, we prove local existence for the corresponding…

In this article we introduce and study the intersection graph of graded ideals of graded rings. The intersection graph of $G-$graded ideals of a graded ring $(R,G)$ is a simple graph, denoted by $Gr_G(R)$, whose vertices are the nontrivial…

A family of subsets $\mathcal{F}\subseteq {[n]\choose k}$ is called intersecting if any two of its members share a common element. Consider an intersecting family, a direct problem is to determine its maximal size and the inverse problem is…

We establish that the intersection number between the horizontal foliations of any two finite-area holomorphic quadratic differentials on an arbitrary Riemann surface is finite. Our main result shows that the intersection number is jointly…

Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(\lambda_s(n)), O(\lambda_{s+1}(n)), and O(\lambda_{s+2}(n)), when the…