Related papers: Computation of Maximal Determinants of Binary Circ…
We evaluate determinants of "spiral" matrices, which are matrices in which entries are spiralling from the centre of the matrices towards the outside, with prescribed increments from one entry to the next depending on whether one moves…
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…
In this paper we introduce an algorithm for determining the orbital elements and individual masses of visual binaries. The algorithm uses an optimal point, which minimizes a specific function describing the average length between the…
The computation of determinants plays a central role in diagrammatic Monte Carlo algorithms for strongly correlated systems. The evaluation of large numbers of determinants can often be the limiting computational factor determining the…
We develop a method of reducing the size of quantum minors in the algebra of n x n quantum matrices. The method is used to show that quantum determinantal factor rings of n x n quantum matrices over the complex numbers are maximal orders,…
In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polynomial approximability of the problem.…
This paper is intended to give closed formulae for binomial determinants with consecutive or almost consecutive rows or columns, as well as calculating the generator of left nullspaces defined by some binomial matrices. In the meantime, we…
After analyzing the 4x4 determinant of a matrix, a shortcut was obtained to find such a determinant. Similarly to the Sarrus method for 2x2 or 3x3 determinants, the method consists of laying 19 columns of size 4 each and adding and…
The Hadamard maximal determinant problem asks for the largest n-by-n determinant with entries in {+1,-1}. When n is congruent to 1 (mod 4), the maximal excess construction of Farmakis & Kounias has been the most successful general method…
We present an optimized algorithm calculating determinant for multivariate polynomial matrix on GPU. The novel algorithm provides precise determinant for input multivariate polynomial matrix in controllable time. Our approach is based on…
In this work, we propose an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelations. The problem is formulated as a so-called feasibility problem having…
An equivalence relation in the set of all square binary matrices is described in this work. It is discussed a combinatoric problem about finding the cardinal number and the elements of the factor set according to this relation. We examine…
The Cullis' determinant is a generalization of the ordinary determinant for rectangular matrices. It is defined as the alternating sum of maximal minors of given matrix. In this paper we express the Cullis' determinant of a matrix $X$ as…
Let ${\mathcal D}(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and $\mathcal R(n) = {\mathcal D}(n)/n^{n/2}$ be the ratio of ${\mathcal D}(n)$ to the Hadamard upper bound. Using the probabilistic method, we prove…
This paper proposes a scalable binary CUR low-rank approximation algorithm that leverages parallel selection of representative rows and columns within a deterministic framework. By employing a blockwise adaptive cross approximation…
An algorithm for obtaining all n\times n binary matrices having exactly 2 units in every row and every column is described in the paper. After analysing the work of the algorithm a formula for calculating the number of these matrices has…
We report new world records for the maximal determinant of an n-by-n matrix with entries +/-1. Using various techniques, we beat existing records for n=22, 23, 27, 29, 31, 33, 34, 35, 39, 45, 47, 53, 63, 69, 73, 77, 79, 93, and 95, and we…
The binary rank of a $0,1$ matrix is the smallest size of a partition of its ones into monochromatic combinatorial rectangles. A matrix $M$ is called $(k_1, \ldots, k_m ; n_1, \ldots, n_m)$ circulant block diagonal if it is a block matrix…
The maximal minors of a matrix of indeterminates are a universal Gr\"obner basis by a theorem of Bernstein, Sturmfels and Zelevinsky. On the other hand it is known that they are not always a universal Sagbi basis. By an experimental…
We develop a new algorithm to compute determinants of all possible Hankel matrices made up from a given finite length sequence over a finite field. Our algorithm fits within the dynamic programming paradigm by exploiting new recursive…