Related papers: Zero-dilation indices and numerical ranges

If $2 \le d \le k$ and $n \ge dk/(d-1)$, a $d$-cluster is defined to be a collection of $d$ elements of ${[n] \choose k}$ with empty intersection and union of size no more than $2k$. Mubayi conjectured that the largest size of a…

For an arbitrary matrix dilation, any integer n and any integer/semi-integer c, we describe all masks that are symmetric with respect to the point c and have sum rule of order n. For each such mask, we give explicit formulas for wavelet…

A hole is a chordless cycle with at least four vertices. A hole is odd if it has an odd number of vertices. A dart is a graph which vertices $a, b, c, d, e$ and edges $ab, bc, bd, be, cd, de$. Dart-free graphs have been actively studied in…

Let $m>1$ and $\mathfrak{d} \neq 0$ be integers such that $v_{p}(\mathfrak{d}) \neq m$ for any prime $p$. We construct a matrix $A(\mathfrak{d})$ of size $(m-1) \times (m-1)$ depending on only of $\mathfrak{d}$ with the following property:…

Recently, Deutsch and Elizalde studied the largest and the smallest fixed points of permutations. Motivated by their work, we consider the analogous problems in set partitions. Let $A_{n,k}$ denote the number of partitions of $\{1,2,\dots,…

The dichromatic number of a digraph is the minimum integer $k$ such that it admits a $k$-dicolouring, i.e. a partition of its vertices into $k$ acyclic subdigraphs. We say that a digraph $D$ is a super-orientation of an undirected graph $G$…

For every integer $d\ge 1$, there is a unital closed subalgebra $A_d\subset B(H)$ with similarity degree equal precisely to $d$, in the sense of our previous paper. This means that for any unital homomorphism $u\colon A_d\to B(H)$ we have…

In this paper we characterize the nonnegative irreducible tridiagonal matrices and their permutations, using certain entries in their primitive idempotents. Our main result is summarized as follows. Let $d$ denote a nonnegative integer. Let…

Several new verifiable conditions are established for block matrices with scalar diagonal blocks to have the numerical range equal the convex hull of at most k ellipses where k by k is the size of the smaller diagonal block. For k = 2,…

A subalgebra of the full matrix algebra Mn(K), K a field, satisfying the identity [x1, y1][x2, y2]...[xq, yq] = 0 is called a Dq subalgebra of Mn(K). In the paper we deal with the structure, conjugation and isomorphism problems of maximal…

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…

A series of integral lattices parametrised by integers $k,m,n$ are introduced and investigated, where $n$ is the rank of the lattice, including the root lattices described in a uniform way and unimodular lattices such as the Niemeier…

For a ring $R$, the zero-divisor graph is a simple graph $\Gamma(R)$ whose vertex set is the set of all non-zero zero-divisors in a ring $R$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy=0$ or $yx=0$ in $R$. By…

A rank-$r$ integer matrix $A$ is $\Delta$-modular if the determinant of each $r \times r$ submatrix has absolute value at most $\Delta$. The class of $1$-modular, or unimodular, matrices is of fundamental significance in both integer…

Let $ \{X, X_{k,i}; i \geq 1, k \geq 1 \}$ be a double array of nondegenerate i.i.d. random variables and let $\{p_{n}; n \geq 1 \}$ be a sequence of positive integers such that $n/p_{n}$ is bounded away from $0$ and $\infty$. This paper is…

A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by deleting fewer than $k$ vertices. The block number $\beta(G)$ of $G$ is the maximum integer $k$ for which $G$ contains a…

In Communication theory and Coding, it is expected that certain circulant matrices having $k$ ones and $k+1$ zeros in the first row are nonsingular. We prove that such matrices are always nonsingular when $2k+1$ is either a power of a…

Let $\Gamma=(K_{n},H^-)$ be a signed complete graph whose negative edges induce a subgraph $H$. The index of $\Gamma$ is the largest eigenvalue of its adjacency matrix. In this paper we study the index of $\Gamma$ when $H$ is a unicyclic…

Let $\beta > 1$ be a real number and $(\epsilon_1(x, \beta), \epsilon_2(x, \beta), \ldots)$ be the $\beta$-expansion of a point $x \in (0, 1]$. For all $x \in (0,1]$, let $A(D(x))$ be the set of accumulation points of $\frac{-\log_\beta…

The family of primitive binary substitutions defined by $1 \mapsto 0 \mapsto 0 1^m$ with $m\in\mathbb{N}$ is investigated. The spectral type of the corresponding diffraction measure is analysed for its geometric realisation with prototiles…