Related papers: Zero-dilation indices and numerical ranges

Let $T$ be a tree with $n$ vertices. To each edge of $T$, we assign a weight which is a positive definite matrix of some fixed order, say, $s$. Let $D_{ij}$ denote the sum of all the weights lying in the path connecting the vertices $i$ and…

In DOI:10.1017/etds.2022.2 the author proved that for each integer $k$ there is an implicit number $M > 0$ such that if $b_1, \cdots , b_k$ are multiplicatively independent integers greater than $M$, there are infinitely many integers whose…

Let $f(x) \in \bbz[x]$ and consider the index divisibility set $D = \{n \in \bbn : n \mid f^n(0)\}$. We present a number of properties of $D$ in the case that $(f^n(0))_{n=1}^\infty$ is a rigid divisibility sequence, generalizing a number…

An $n$ by $n$ skew-symmetric type $(-1,1)$-matrix $K=[k_{i,j}]$ has $1$'s on the main diagonal and $\pm 1$'s elsewhere with $k_{i,j}=-k_{j,i}$. The largest possible determinant of such a matrix $K$ is an interesting problem. The literature…

A KMS matrix is one of the form $$J_n(a)=[{array}{ccccc} 0 & a & a^2 &... & a^{n-1} & 0 & a & \ddots & \vdots & & \ddots & \ddots & a^2 & & & \ddots & a 0 & & & & 0{array}]$$ for $n\ge 1$ and $a$ in $\mathbb{C}$. Among other things, we…

We consider the problem of finding $A_2(n,\{d_1,d_2\})$ defined as the maximal size of a binary (non-linear) code of length $n$ with two distances $d_1$ and $d_2$. Binary codes with distances $d$ and $d+2$ of size…

We give some necessary conditions for maximality of $0/1$-determinant. Let ${\bf M}$ be a nondegenerate $0/1$-matrix of order $n$. Denote by $\bf A$ the matrix of order $n+1$ which appears from ${\bf M}$ after adding the $(n+1)$th row…

A problem in zero-sum theory is to determine all pairs $(k,n)$ for which every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While all other cases have been solved more than a decade ago, the case when $k$ equals $4$ and…

We study the space of all $d$-tuples of unitaries $u=(u_1,\ldots, u_d)$ using dilation theory and matrix ranges. Given two $d$-tuples $u$ and $v$ generating C*-algebras $\mathcal A$ and $\mathcal B$, we seek the minimal dilation constant…

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

Consider S_n, the symmetric group on n letters, and let maj pi denote the major index of a permutation pi in S_n. Given positive integers k,l and nonnegative integers i,j, define m_n^{k,l}(i,j) := number of pi in S_n such that maj pi = i…

For a given nonnegative matrix $A=(A_{ij})$, the matrix scaling problem asks whether $A$ can be scaled to a doubly stochastic matrix $D_1AD_2$ for some positive diagonal matrices $D_1,D_2$.The Sinkhorn algorithm is a simple iterative…

For $n\ge 5$, we prove that every $n\times n$ matrix $M=(a_{i,j})$ with entries in $\{-1,1\}$ and absolute discrepancy $|\mathrm{disc}(M)|=|\sum a_{i,j}|\le n$ contains a zero-sum square except for the split matrix (up to symmetries). Here,…

The distance matrix $\mathcal{D}$ of a connected graph $G$ is the matrix indexed by the vertices of $G$ which entry $\mathcal{D}_{i,j}$ equals the distance between the vertices $v_i$ and $v_j$. The distance signless Laplacian matrix…

This paper provides a survey of results on the greatest prime factor, the number of distinct prime factors, the greatest squarefree factor and the greatest m-th powerfree part of a block of consecutive integers, both without any assumption…

This paper is devoted to studying difference indices of quasi-regular difference algebraic systems. We give the definition of difference indices through a family of pseudo-Jacobian matrices. Some properties of difference indices are proved.…

Consider rectangular matrices over a commutative ring R. Assume the ideal of maximal minors factorizes, I_m(A)=J_1*J_2. When is A left-right equivalent to a block-diagonal matrix? (When does the module/sheaf Coker(A) decompose as the…

The aim of this paper is to study the matrix discrepancy problem. Assume that $\xi_1,\ldots,\xi_n$ are independent scalar random variables with finite support and $\mathbf{u}_1,\ldots,\mathbf{u}_n\in \mathbb{C}^d$. Let $\mathcal{C}_0$ be…

The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the…

The {\em overlap number} of a finite $(d+1)$-uniform hypergraph $H$ is defined as the largest constant $c(H)\in (0,1]$ such that no matter how we map the vertices of $H$ into $\R^d$, there is a point covered by at least a $c(H)$-fraction of…