English
Related papers

Related papers: The N-queens Problem on a symmetric Toeplitz matri…

200 papers

There exists an exact relationship between the quasi-exactly solvable problems of quantum mechanics and models of square and rectangular random complex matrices. This relationship enables one to reduce the problem of constructing…

High Energy Physics - Theory · Physics 2009-10-28 G. M. Cicuta , A. G. Ushveridze

We study $n$-dimensional matrices with $\{0,1\}$-entries ($n$-cubes) such that all their $2$-dimensional slices are incidence matrices of symmetric designs. A known construction of these objects obtained from difference sets is generalized…

Combinatorics · Mathematics 2025-09-30 Vedran Krčadinac , Mario Osvin Pavčević , Kristijan Tabak

We define {\em incidence matrices} to be zero-one matrices with no zero rows or columns. A classification of incidence matrices is considered for which conditions of symmetry by transposition, having no repeated rows/columns, or…

Combinatorics · Mathematics 2007-05-23 Peter Cameron , Thomas Prellberg , Dudley Stark

We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…

Optimization and Control · Mathematics 2021-02-10 Miguel D. Bustamante , Pauline Mellon , M. Victoria Velasco

Let the columns of a $p \times q$ matrix $M$ over any ring be partitioned into $n$ blocks, $M = [M_1, ..., M_n]$. If no $p \times p$ submatrix of $M$ with columns from distinct blocks $M_i$ is invertible, then there is an invertible $p…

Combinatorics · Mathematics 2011-03-09 Stephan Foldes , Erkko Lehtonen

We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans-Beckman form $QAP(A,B)$, by showing that the identity permutation is optimal when $A$ and $B$ are respectively a Robinson similarity and…

Optimization and Control · Mathematics 2014-12-16 Monique Laurent , Matteo Seminaroti

We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but…

We investigate the symmetric inverse M-matrix problem from a geometric perspective. The central question in this geometric context is, which conditions on the k-dimensional facets of an n-simplex S guarantee that S has no obtuse dihedral…

Rings and Algebras · Mathematics 2015-12-10 Jan Brandts , Apo Cihangir

We study the process of bootstrap percolation on n x n permutation matrices, inspired by the work of Shapiro and Stephens [5]. In this percolation model, cells mutate (from 0 to 1) if at least two of their cardinal neighbors contain a 1,…

Combinatorics · Mathematics 2025-08-05 Mark Huibregtse , Cristobal Lemus-Vidales , David Vella

Suppose that $T_n$ is a Toeplitz matrix whose entries come from a sequence of independent but not necessarily identically distributed random variables with mean zero. Under some additional tail conditions, we show that the spectral norm of…

Probability · Mathematics 2007-10-29 Mark W. Meckes

We give a necessary and sufficient condition on a matrix for its centralizer in $\sf{GL}(n,\mathbb{Z})$ to be polycyclic, or equivalently in this case, not to contain a non-abelian free subgroup. We give a simple condition on the matrix…

Group Theory · Mathematics 2026-04-09 Adem Zeghib

We give an exponential upper and a quadratic lower bound on the number of pairwise non-isotopic simple closed curves can be placed on a closed surface of genus g such that any two of the curves intersects at most once. Although the gap is…

Geometric Topology · Mathematics 2013-01-04 Justin Malestein , Igor Rivin , Louis Theran

Given a set of $n$ men represented by $n$ points lying on a line, and $n$ women represented by $n$ points lying on another parallel line, with each person having a list that ranks some people of opposite gender as his/her acceptable…

Data Structures and Algorithms · Computer Science 2019-10-30 Suthee Ruangwises , Toshiya Itoh

We consider the asymptotic behavior of the eigenvalues of Toeplitz matrices with rational symbol as the size of the matrix goes to infinity. Our main result is that the weak limit of the normalized eigenvalue counting measure is a…

Complex Variables · Mathematics 2009-11-26 Steven Delvaux , Maurice Duits

A quasi-Toeplitz (QT) matrix is a semi-infinite matrix of the form $A=T(a)+E$ where $T(a)$ is the Toeplitz matrix with entries $(T(a))_{i,j}=a_{j-i}$, for $a_{j-i}\in\mathbb C$, $i,j\ge 1$, while $E$ is a matrix representing a compact…

Numerical Analysis · Mathematics 2022-08-17 D. A. Bini , B. Iannazzo , B. Meini , J. Meng , L. Robol

The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…

Algebraic Geometry · Mathematics 2014-03-25 Wouter van Heijst

This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…

Symbolic Computation · Computer Science 2020-10-15 Dong Lu , Dingkang Wang , Fanghui Xiao

For an infinite Toeplitz matrix $T$ with nonnegative real entries we find the conditions, under which the equation $\boldsymbol{x}=T\boldsymbol{x}$, where $\boldsymbol{x}$ is an infinite vector-column, has a nontrivial bounded positive…

Probability · Mathematics 2023-06-22 Vyacheslav M. Abramov

Let $G$ be an undirected graph on $n$ vertices and let $S(G)$ be the set of all $n \times n$ real symmetric matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of $G$. The inverse eigenvalue…

Spectral Theory · Mathematics 2014-01-10 Polona Oblak , Helena Šmigoc

In the natural generalization of tic-tac-toe to an $n \times n \times n$ board where $n \in \mathbb{N}$, it is known that the first player has a winning strategy if $n \leq 4$ and that either player can force a draw if $n \geq 8$. The…

Combinatorics · Mathematics 2025-09-29 John W. Cain , Ioannis M. Raymond , Nora C. Källersjö