Related papers: On an algorithm for receiving Sudoku matrices
Matrix multiplication is a fundamental task in almost all computational fields, including machine learning and optimization, computer graphics, signal processing, and graph algorithms (static and dynamic). Twin-width is a natural complexity…
There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…
We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too) and prove that this problem is NP-complete
We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
This short course offers a new perspective on randomized algorithms for matrix computations. It explores the distinct ways in which probability can be used to design algorithms for numerical linear algebra. Each design template is…
We present a polynomial time algorithm, which solves a nonstandard Variation of the well-known PARTITION-problem: Given positive integers $n, k$ and $t$ such that $t \geq n$ and $k \cdot t = {n+1 \choose 2}$, the algorithm partitions the…
The iterative method of Sinkhorn allows, starting from an arbitrary real matrix with non-negative entries, to find a so-called 'scaled matrix' which is doubly stochastic, i.e. a matrix with all entries in the interval (0, 1) and with all…
The Consecutive Ones Property is an important notion for binary matrices, both from a theoretical and applied point of view. Tucker gave in 1972 a characterization of matrices that do not satisfy the Consecutive Ones Property in terms of…
The Sudoku puzzle has achieved worldwide popularity recently, and attracted great attention of the computational intelligence community. Sudoku is always considered as Satisfiability Problem or Constraint Satisfaction Problem. In this…
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it…
In many applications including integer-forcing linear multiple-input and multiple-output (MIMO) receiver design, one needs to solve a successive minima problem (SMP) on an $n$-dimensional lattice to get an optimal integer coefficient matrix…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
The basic result of this note is a statement about the existence of families of partitions of the set of natural numbers with some favourable properties, the n-optimal matrices of partitions. We use this to improve a decomposition result…
We study the problem of circular seriation, where we are given a matrix of pairwise dissimilarities between $n$ objects, and the goal is to find a {\em circular order} of the objects in a manner that is consistent with their dissimilarity.…
Generalizing stack sorting and $c$-sorting for permutations, we define the permutree sorting algorithm. Given two disjoint subsets $U$ and $D$ of $\{2, \dots, n-1\}$, the $(U,D)$-permutree sorting tries to sort the permutation $\pi \in…
After reviewing the group structure and representation theory for the dihedral group $D_{2n},$ we consider an intertwining operator $\Phi_\rho$ from the group algebra $\mathbb{C}[D_{2n}]$ into a corresponding space of semi-magic matrices.…
In this paper we describe an algorithm for generating all the possible $PIW(m,n,k)$ - integer $m\times n$ Weighing matrices of weight $k$ up to Hadamard equivalence. Our method is efficient on a personal computer for small size matrices, up…
This paper presents a systematic method to solve difficult 9 x 9 Sudoku puzzles by hand. While computer algorithms exist to solve these puzzles, these algorithms are not good for human's to use because they involve too many steps and…
In this paper we relate a number of parsing algorithms which have been developed in very different areas of parsing theory, and which include deterministic algorithms, tabular algorithms, and a parallel algorithm. We show that these…