相关论文: Butson-Hadamard matrices and Plotkin-optimal p^k-a…

Based on the concept of positive definite functions on finite groups, we present a new necessary condition for the existence of Butson Hadamard matrices $BH(n,q)$. We use this condition to prove some nonexistence results for a sequence of…

The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the corresponding nonnegative factors is difficult;…

Sum-rank-metric codes have wide applications in universal error correction, multishot network coding, space-time coding and the construction of partial-MDS codes for repair in distributed storage. Fundamental properties of sum-rank-metric…

Many interesting examples of complex Hadamard matrices $H\in M_N(\mathbb C)$ can be put, up to the standard equivalence relation for such matrices, in bistochastic form. We discuss here this phenomenon, with a number of computations for…

Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't. In general these varieties are very ill-behaved, but in many cases one can estimate their…

After a seminal paper by Shekeey (2016), a connection between maximum $h$-scattered $\mathbb{F}_q$-subspaces of $V(r,q^n)$ and maximum rank distance (MRD) codes has been established in the extremal cases $h=1$ and $h=r-1$. In this paper, we…

We explore how matrix bootstrap techniques can be used to constrain matrix and tensor models at finite $N$, where $N$ is the dimension of the matrix/tensor, taking a Gaussian model with a quartic interaction as example. For matrix models,…

This paper presents sufficient conditions for Hamiltonian paths and cycles in graphs. Letting $\lambda\left( G\right) $ denote the spectral radius of the adjacency matrix of a graph $G,$ the main results of the paper are: (1) Let $k\geq1,$…

We comment on two randomized algorithms for constructing low-rank matrix decompositions. Both algorithms employ the Subsampled Randomized Hadamard Transform [14]. The first algorithm appeared recently in [9]; here, we provide a novel…

A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…

Linearized Reed-Solomon (LRS) codes are sum-rank metric codes that fulfill the Singleton bound with equality. In the two extreme cases of the sum-rank metric, they coincide with Reed-Solomon codes (Hamming metric) and Gabidulin codes (rank…

We provide an exact analysis of a class of randomized algorithms for solving overdetermined least-squares problems. We consider first-order methods, where the gradients are pre-conditioned by an approximation of the Hessian, based on a…

We study a generalization of the Erd\H{o}s-Falconer distance problem over finite fields. For a graph $G$, two embeddings $p, p': V(G) \to \mathbb{F}_q^d$ of a graph $G$ are congruent if for all edges $(v_i, v_j)$ of $G$ we have that…

For nonexpansive fixed-point problems, Halpern's method with optimal parameters, its so-called H-dual algorithm, and in fact, an infinite family of algorithms containing them, all exhibit the exactly minimax optimal convergence rates. In…

Measuring distances on a lattice in noncommutative geometry involves square, symmetric and real ``three-diagonal'' matrices, with the sum of their elements obeying a supremum condition, together with a constraint forcing the absolute value…

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

A given Hamiltonian matrix H with real spectrum is assumed tridiagonal and non-Hermitian. Its possible Hermitizations via an amended, ad hoc inner-product metric are studied. Under certain reasonable assumptions, all of these metrics are…

Let $\vec{p}\in(0,\,\infty)^n$, $A$ be an expansive dilation on $\mathbb{R}^n$,and $H^{\vec{p}}_A({\mathbb {R}}^n)$ be the anisotropic mixed-norm Hardy space defined via the non-tangential grand maximal function studied by \cite{hlyy20}. In…

Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…

Complex Hadamard matrices H of order 6 are characterized in a novel manner, according to the presence/absence of order 2 Hadamard submatrices. It is shown that if there exists one such submatrix, H is equivalent to a Hadamard matrix where…