相关论文: Connectedness of planar self-affine sets associate…

In the paper, we focus on the connectedness of planar self-affine sets $T(A,{\mathcal{D}})$ generated by an integer expanding matrix $A$ with $|\det (A)|=3$ and a collinear digit set ${\mathcal{D}}=\{0,1,b\}v$, where $b>1$ and $v\in…

In this paper, we consider the connectedness of planar self-affine set $T(A,\mathcal{D})$ arising from an integral expanding matrix $A$ with characteristic polynomial $f(x)=x^2+bx+c$ and a digit set $\mathcal{D}=\{0,1,\dots, m\}v$. The…

Let $T(A,\mathcal{D})$ be a self-affine set generated by an expanding matrix $A=\left[\begin{array}{rr} p & 0\cr -a & q \end{array}\right]$ and a product digit set $\mathcal{D}=\{0,1,\dots,m-1\}\times \{0,1,\dots,n-1\}$. We provide a…

Let $A$ be an expanding integer matrix with characteristic polynomial $f(x)=x^{2}+px+q$, and let $\mathcal{D}=\{0,1,\dots,|q|-2,|q|+m\}\mathbf{v}$ be a collinear digit set where $m\geqslant 0, {\mathbf v}\in {\mathbb Z}^2$. It is well known…

We consider the self-affine tiles with collinear digit set defined as follows. Let $A,B\in\mathbb{Z}$ satisfy $|A|\leq B\geq 2$ and $M\in\mathbb{Z}^{2\times2}$ be an integral matrix with characteristic polynomial $x^2+Ax+B$. Moreover, let…

Given any m-dimensional dilation matrix A with rational eigenvalues, we demonstrate the existence of a digit set D such that the attractor T(A,D) of the iterated function system generated by A and D is connected. We give an easily verified…

In this paper, we consider the non-spectral problem for the planar self-affine measures $\mu_{M,D}$ generated by an expanding integer matrix $M\in M_2(\mathbb{Z})$ and a finite digit set $D\subset\mathbb{Z}^2$. Let $p\geq2$ be a positive…

We consider digit systems $(A,\mathcal{D})$, where $ A \in \mathbb{Q}^{n\times n}$ is an expanding matrix and the digit set $\mathcal{D}$ is a suitable subset of $\mathbb{Q}^n$. To such a system, we associate a self-affine set $\mathcal{F}…

Let $M$ be a $3\times 3$ integer matrix which is expanding in the sense that each of its eigenvalues is greater than $1$ in modulus and let $\mathcal{D} \subset \mathbb{Z}^3$ be a digit set containing $|\det M|$ elements. Then the unique…

We compare the dimension of a non-invertible self-affine set to the dimension of the respective invertible self-affine set. In particular, for generic planar self-affine sets, we show that the dimensions coincide when they are large and…

An independent set in a simple graph $G$ is a set of pairwise non-adjacent vertices in $G$. The independence polynomial of $G$, denoted by $I_G$ is defined as $1 + a_1 z + a_2 z^2+\cdots+a_d z^{d}$, where $a_i$ denotes the number of…

Let $\lambda_2$ be the second largest eigenvalue of the adjacency matrix of a connected graph. In 2023, Li and Sun \cite{LiSun1} determined all the connected $\{K_{2,3}, K_4\}$-minor free graphs whose second largest eigenvalue $\lambda_2\le…

Let $M$ be a $3\times 3$ integer matrix each of whose eigenvalues is greater than $1$ in modulus and let $\mathcal{D}\subset\mathbb{Z}^3$ be a set with $|\mathcal{D}|=|\det M|$, called digit set. The set equation $MT = T+\mathcal{D}$…

Let $A$ be an expanding $d\times d$ matrix with integer entries and ${\mathcal D}\subset {\mathbb Z}^d$ be a finite digit set. Then the pair $(A, {\mathcal D})$ defines a unique integral self-affine set $K=A^{-1}(K+{\mathcal D})$. In this…

Somehow, the revised version of our paper \cite{KY} does not appear on journals' home page. Here we present the revised version altered to reflect the corrections and/or additions to that paper. In this note, we consider self-affine…

We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…

Let $P$ be a set of $n\geq 3$ points in general position in the plane. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in…

We describe the structure of 2-connected non-planar toroidal graphs with no K_{3,3}-subdivisions, using an appropriate substitution of planar networks into the edges of certain graphs called toroidal cores. The structural result is based on…

We address the enumeration of q-coloured planar maps counted bythe number of edges and the number of monochromatic edges. We prove that the associated generating function is differentially algebraic,that is, satisfies a non-trivial…

We give a complete classification of the Kronecker (i.e. direct) product graphs that are planar and $3$-connected (i.e. $3$-polytopal). They are all of the form \[H\wedge K_2,\] where $H$ is a $2$-connected graph, possibly non-planar, and…