Related papers: Nested perfect toroidal arrays
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…
Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\in\mathbb{F}^{N\times N}$ and a vector $b$, it is known that in the worst case $\Theta(N^2)$ operations over $\mathbb{F}$ are needed to…
We study ternary sequences associated with a multidimensional continued fraction algorithm introduced by the first author. The algorithm is defined by two matrices and we show that it is measurably isomorphic to the shift on the set…
We derive a formula for the the modular class of a Lie algebroid with a regular twisted Poisson structure in terms of a canonical Lie algebroid representation of the image of the Poisson map. We use this formula to compute the modular…
We propose a set of convex low rank inducing norms for a coupled matrices and tensors (hereafter coupled tensors), which shares information between matrices and tensors through common modes. More specifically, we propose a mixture of the…
In this paper, we investigate the sample size requirement for a general class of nuclear norm minimization methods for higher order tensor completion. We introduce a class of tensor norms by allowing for different levels of coherence, which…
The modular design of planar phased arrays arranged on orthogonal polygon-shaped apertures is addressed and a new method is proposed to synthesize domino-tiled arrays fitting multiple, generally conflicting, requirements. Starting from an…
The determinant method of Kasteleyn gives a method of computing the number of perfect matchings of a planar bipartite graph. In addition, results of Bernardi exhibit a bijection between spanning trees of a planar bipartite graph and…
Modern datasets are often in the form of matrices or arrays,potentially having correlations along each set of data indices. For example, data involving repeated measurements of several variables over time may exhibit temporal correlation as…
We obtain a complete characterization of \emph{topologically exact patterns} on \emph{triods}. Based on their \emph{rotation number} $\rho$, these \emph{exact patterns} are grouped into three classes: \emph{slow} ($\rho < \frac{1}{3}$),…
This paper establishes the exact comparison complexity of finding an element repeated $n$ times in a $2n$-element array containing $n+1$ distinct values, under the equality-comparison model with $O(1)$ extra space. We present a simple…
The conventional topological description given by the fundamental group of nematic order parameter does not adequately explain the entangled defect line structures that have been observed in nematic colloids. We introduce a new topological…
Orientable sequences of order n are infinite periodic sequences with symbols drawn from a finite alphabet of size k with the property that any particular subsequence of length n occurs at most once in a period in either direction. They were…
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…
During their investigation of power-sequence terraces, Anderson and Preece briefly mention a construction of a terrace for the cyclic group $\mathbb{Z}_n$ when $n$ is odd and $2n+1$ is prime; it is built using the discrete logarithm modulo…
For a lower triangular matrix $(t_{n,k})$ we call the matrices with respective entries $(t_{2n-k,n})$ and $(t_{2n,n+k})$ the vertical and the horizontal halves. In this note, we discuss Riordan arrays whose halves are closely related to the…
We introduce a notion of parity for transversals, and use it to show that in Latin squares of order $2 \bmod 4$, the number of transversals is a multiple of 4. We also demonstrate a number of relationships (mostly congruences modulo 4)…
The identification of repeating patterns in discrete grids is rudimentary within symbolic reasoning, algorithm synthesis and structural optimization across diverse computational domains. Although statistical approaches targeting noisy data…
Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to…
We study rank 2 torus-equivariant torsion-free sheaves on the complex projective space. For reflexive sheaves we derive a simple formula for the Chern polynomial, and in the general torsion-free case we introduce an iterative construction…