All Questions
Tagged with co.combinatorics matrices
256 questions
0
votes
0
answers
54
views
Rank decomposition of matrices over $\mathbb F_2$
Given an integer matrix $M\in\mathbb Z^{n\times n}$ of real rank $k$ what is the minimum and maximum number of rank $1$ matrices $B_1$ to $B_t$ we require so that $M\equiv\sum_{i=1}^tB_i\bmod 2$?
If $...
- 13.9k
20
votes
2
answers
1k
views
Euler numbers and permanent of matrices
Motivated by Question 402249 of Zhi-Wei Sun, I consider the permanent of matrices
$$e(n)=\mathrm{per}\left[\operatorname{sgn} \left(\tan\pi\frac{j+k}n \right)\right]_{1\le j,k\le n-1},$$
where $n$ is ...
- 884
11
votes
2
answers
367
views
Kernel of a matrix and the Catalan numbers
Let $B_n$ denote the Boolean lattice of a set with $n \geq 2$ elements and $C_n$ the matrix with entries $c_{i,j}=1$ if $i \leq j$ and $c_{i,j}=0$ else, where $i,j\in B_n$.
Let $M_n:=C_n+C_n^T$ (this ...
- 26.5k
2
votes
2
answers
330
views
Polynomial time algorithm for rigid graph isomorphism
We found, implemented and tested algorithm
for graph isomorphism and it appears to be polynomial
time if the graph is rigid.
Q1 Is the algorithm below correct and polynomial time for rigid graphs?
A ...
- 25.4k
2
votes
1
answer
430
views
At most one perfect matching of a bipartite graph
I. Given biadjacency matrix $A$ of a bipartite graph on $2n$ vertices having $n$ vertices of either color on the constraints the graph either has
$0$ perfect matchings
$1$ perfect matchings
is it ...
- 23
3
votes
0
answers
148
views
Linear combinations of special matrices
I am a hobby computer scientist and I have a problem to which I am searching an efficient algorithm.
Given an integer n, we want to combine some square input-matrices of size n in a way that is ...
- 73
2
votes
0
answers
54
views
Inverting "codimension matrix" for polytopes?
Let $P$ be an abstract polytope. Let's construct its square matrix $A$ as follows. Its lines and columns are labelled by all faces of $P$, of all dimensions. Put $A(F_1,F_2)=t^m$ if $F_1$ is a subface ...
- 765
2
votes
2
answers
193
views
growth of the permanent of some band matrix
Consider such special band matrix of dimension $n$. It is a $0-1$ matrix, and only the first few diagonals are nonzero. Specifically,
$$ H_{ij} = 1 $$
if and only if $|i-j| \leq 2$.
How does the ...
- 265
1
vote
0
answers
37
views
Growth of the number of columns $j=1,\dotsc,p$ such that $\|Ae_j\|_1 > p^\alpha$ for symmetric $A$ with bounded spectrum?
Consider the set $\mathcal S(p)$
of symmetric matrices $A$ of size $p\times p$
with bounded spectrum, say, $\lVert A\rVert_\text{op}\le 10$ and $\lVert A^{-1}\rVert_\text{op}\le 10$.
Let $\alpha>0$ ...
- 1,724
4
votes
1
answer
317
views
On the real and finite field rank of a $0/1$ matrix - I
Let $M\in\{-1,0,+1\}^{n\times n}$ be a matrix of rank $r$.
Consider the matrix $f(M)\in\{0,+1\}^{mn\times mn}$ where $0$ in $M$ is replaced by $m\times m$ all $0$ matrix, $+1$ in $M$ is replaced by $m\...
- 13.9k
3
votes
1
answer
143
views
Reference request: Spectrum of intersection matrices
Let $P(A)$ be the set of all non-empty proper subsets of a finite set $A$. Let $M$ be a matrix indexed by the set in $P(A)$ whose $ij$ the entry is $1$ if the associated sets are disjoint and $0$ ...
- 1,269
34
votes
1
answer
789
views
Which graphs on $n$ vertices have the largest determinant?
This is a question that seems like it should have been studied before, but for some reason I cannot find much at all about it, and so I am asking for any pointers / references etc.
The determinant of ...
- 12.7k
4
votes
2
answers
600
views
Co-trees of a simple graph
Consider fundamental cycles (say $k$ of them) of a specific spanning tree of a simple graph (with $m$ edges) which is also connected and has no one-edge bonds.
Make the graph directed (in an arbitrary ...
- 419
0
votes
0
answers
299
views
Question on rank of matrices over $\mathbb F_2$
$A$ is a square matrix in $\mathbb F_2^{n\times n}$ of rank $k\leq n-1$.
$B$ is a square matrix in $\mathbb F_2^{n\times n}$ of rank $n$.
$T$ is a square matrix in $\mathbb F_2^{n\times n}$ of rank $1$...
- 13.9k
3
votes
0
answers
56
views
Is the outer automorphism group of a finite poset finite when the Coxeter matrix has finite order?
Let $P$ be a finite connected poset.
The Cartan matrix $C_P$ of $P$ is defined as the matrix with entries $c_{i,j}=1$ if $i \leq j$ and $c_{i,j}=0$ else for $i,j \in P$.
The Coxeter matrix of $P$ is ...
- 26.5k
2
votes
0
answers
119
views
Complete graph invariant based on integer programming?
Roughly speaking, we are trying to find complete graph invariant
as the lexicographically first matrix from the permutations
of the adjacency matrix.
Let $G$ be graph, possibly directed graph, of ...
- 25.4k
1
vote
0
answers
131
views
On the order of the Coxeter matrix of a poset
Let $P$ be a finite connected poset.
The Cartan matrix $C_P$ of $P$ is defined as the matrix with entries $c_{i,j}=1$ if $i \leq j$ and $c_{i,j}=0$ else for $i,j \in P$.
The Coxeter matrix of $P$ is ...
- 26.5k
9
votes
1
answer
357
views
Matrix obtained by recursive multiplication and a cyclic permutation
Have you ever seen this matrix? Each row is obtained from the previous one by multiplying each element by the corresponding element of the next cyclic permutation of $(a_1,\dots, a_n)$:
$$\left(
\...
- 93
11
votes
3
answers
591
views
Non-singular matrix with restricted entries
Given a set $S$ of integers with $1 \not\in S$, let us consider the set $\mathcal{M}$ of all the symmetric matrices $M$, such that:
All the diagonal entries of $M$ are equal to $1$.
All the off-...
- 571
2
votes
0
answers
99
views
Lower bound on iterated matrix application
Let $n \in \mathbb Z^2$ such that the non self-adjoint weighted Laplacian is
$$(\Delta u)(n)=u(n_1+1,n_2)-u(n_1-1,n_2) + i( u(n_1,n_2+1)- u(n_1,n_2-1))$$
the adjoint operator is then
$$(\Delta^* u)(n)=...
- 192
2
votes
0
answers
105
views
Cartan matrices of combinatorial algebras
Call a quiver algebra $A=kQ/I$ with connected acyclic $Q$ combinatorial when the following two conditions are satisfied:
For any two points $i,j$ in the quiver of $A$ there is at most one path from $...
- 26.5k
1
vote
1
answer
452
views
About the Hadamard conjecture
On the wikipedia article about Hadamard Matrix it says that "The smallest order that cannot be constructed by a combination of Sylvester's and Paley's methods is $92$"
But it also says that ...
- 27
7
votes
1
answer
198
views
Trace of a matrix associated to posets
Let $P$ be a finite connected poset with $n$ elements. Let $C=(c_{x,y})$ be the $n \times n$ matrix with entry 1 in case $x \leq y$ and 0 else.
The Coxeter matrix of $P$ is defined as the matrix $M_P=-...
- 26.5k
0
votes
1
answer
34
views
Entries of matrix iterates
We consider a matrix
$$A:=\begin{pmatrix} 0 & b & 0 &f \\a & 0 & e & 0 \\ 0 & d & 0 & h \\ c& 0 & g & 0 \end{pmatrix}.$$
This matrix has the interesting ...
- 124
2
votes
0
answers
154
views
What characterizes the incidence matrix of a tripartite hypergraph?
The incidence matrix of a graph $G = (V,E)$ is a matrix with $|V|$ rows and $|E|$ columns, in which element $v,e$ is $1$ if node $v$ is incident to edge $e$, and $0$ otherwise.
In bipartite graphs, ...
- 3,549
3
votes
0
answers
155
views
Frobenius inner product of a zero line-sum matrix and a doubly stochastic matrix
Let $A$, $B$ be two $n\times n$ real matrices.
Let $A$ be a zero line-sum matrix where each row sum and each column sum equals zero, i.e., $$\sum_{i=1}^{n}a_{ij}=\sum_{j=1}^{n}a_{ij}=0 $$ (it seems ...
- 71
0
votes
0
answers
30
views
Signs of difference matrices (sum of submatrices)
Given matrix $A \in \mathbb{R}^{m \times n}$, are there any results related to its difference array
$$A^* \triangleq \left[sign(a_{i,j} + a_{r, s} - a_{r, j} - a_{i, s})\right]_{i<r, j<s}?$$
Or ...
- 75
2
votes
1
answer
308
views
The number of unitary circulant matrices over a finite field $\mathbb{F}_{q^2}$
I asked this question in MSE few days ago but there was no response.
Suppose $\mathbb{F}=\mathbb{F}_{q^2}$, where $q$ is a prime power. The conjugate of elements in $\mathbb{F}$ is defined by $\...
- 379
0
votes
0
answers
45
views
On full rank submatrices of a construction
Take two matrices $T_1$ and $T_2$ in $\mathbb Z^{n\times n}$ with entries uniformly in $[-b,b]\cap\mathbb Z$ at some $b>0$. The matrices will be of rank $n$ each with probability at least $1-\frac1{...
- 1,826
1
vote
1
answer
848
views
Do there exist graphs whose adjacency matrix is positive semi-definite? [closed]
If so, could you provide examples and specify the conditions under which this occurs? Thank you in advance
30
votes
1
answer
1k
views
Sum over 0-1 matrices
I stumbled across the following formula when working on a research problem in theoretical computer science. I am looking for a simple proof of it, or any idea which might prove useful.
I checked its ...
- 303
12
votes
0
answers
321
views
Combinatorial proof of invertibility of a symmetric matrix associated to the ring of matrices over a finite field
Let $F$ be a finite field of $q$ elements with characteristic $p$. Let $M_n(F)$ be the ring of $n\times n$ matrices over $F$. We define a $q^{n^2}\times q^{n^2}$ symmetric matrix $L$ over the ...
- 38.6k
2
votes
1
answer
195
views
Average number of elements of a subset S of a matrix A after inducing the rows and columns of m randomly selected elements from subset S
Let $A_{N{\times}N}$ be an $N{\times}N$ matrix and $\mathcal{S_{k}}$ be a subset of elements in $A$ such that exactly $k$ elements from every row and column in $A$ are in $\mathcal{S_{k}}$. Thus, $\...
4
votes
1
answer
140
views
Counting adjacency matrices
Here is a question that has come up in the context of a problem that involves counting partially ordered sets.
For an adjacency matrix $A$, let $p$ be the sum of elements in the strict upper ...
- 192
4
votes
2
answers
570
views
Are $n \times n$ special orthogonal matrices, all the entries of which have the same absolute value, possible for $n \neq 4$?
As I noted in my preceding question https://math.stackexchange.com/questions/3510189/give-a-general-class-to-which-a-specific-4-times-4-special-orthogonal-matrix
in equation (62) of their recent ...
- 723
5
votes
0
answers
96
views
Partitioning the set of Pauli words into abelian pieces
Let $\sigma_x,\sigma_y,\sigma_z$ be the Pauli matrices. A Pauli word of length $n$ is defined as the tensor product $\otimes_{i=1}^n\sigma_i$ of operators $\sigma_1,\dots,\sigma_n\in\{\mathbf 1,\...
- 4,535
0
votes
0
answers
188
views
A gap problem in elementary additive combinatorics
Given $a,b\in\mathbb N$ define the set $$\chi(a,b)=\{M\in\{0,1\}^{n^a\times n^b}:\mbox{ every row of }M\mbox{ is distinct}\}.$$
Also given ${\bf{x}}=(x_1,\dots,x_{n^b})\in\mathbb Z^{n^b}$ define the ...
- 1,826
2
votes
1
answer
140
views
Minimum local permutation data needed to globally merge locally sorted sequences?
We have $k$ blocks of integer sequences $B_1,\dots,B_k$ where $B_i$ is a sequence $$a_{i,1},\dots,a_{i,n_i}$$ with $a_{i,j}\leq a_{i,j+1}$.
Denote the permutation matrix $M_{\ell,\ell'}$ that merges $...
- 1,826
0
votes
1
answer
150
views
What are all the possibilities of $A$ s.t. $\det(A)=k$?
Suppose we have $A \in M_3(\Bbb N\cup\{0\})$ s.t. sum of the elements of each row is $k $ for some fixed $k\in \Bbb N\cup\{0\}$. What are all the possibilities of $A$ s.t. $\det(A)=k$?
We can start ...
- 103
7
votes
0
answers
177
views
Matrix of high rank mod $2$: must it have a large non-singular minor (with disjoint rows and columns)?
Let $A$ be a $2n$-by-$2n$ matrix with entries in
$\mathbb{Z}/2\mathbb{Z}$ such that, for every $2n$-by-$2n$ diagonal
matrix $D$ with entries in $\mathbb{Z}/2\mathbb{Z}$, the matrix $A+D$
has rank $\...
- 20.2k
1
vote
1
answer
60
views
Rank and edges in a combinatorial graph?
Fix a $d\in\mathbb N$ and consider the matrix $M\in\{0,1\}^{2^d\times d}$ of all $0/1$ vectors of length $d$. Consider the matrix $G\in\{0,1\}^{n\times n}$ whose $ij$ the entry is $0$ if inner product ...
- 13.9k
1
vote
1
answer
684
views
Probability that random Bernoulli matrix is full rank
This is probably known already, but I could not find a quick argument.
Let $M$ be an $n\times m$ binary matrix with iid Bernoulli$(1/2)$ entries, and $n>m$. Tikhomirov recently settled that the ...
- 1,096
3
votes
0
answers
165
views
A combinatorial / geometric interpretation of compositional inversion via matrix inversion
There are several ways of finding the power or Taylor series for the compositional inverse of a function $f(x)$ with $f(0)=0\;$ given its series expansion, e.g., by using the classic Lagrange ...
- 10.5k
11
votes
1
answer
467
views
Correspondence between matrix multiplication and a graph operation of Lovász
In his book "Large networks and graph limits", Lovász describes a multiplication operation (he calls it concatenation) on "bi-labeled graphs". An $(m,n)$ bi-labeled graph is a ...
- 2,339
2
votes
1
answer
140
views
Matrix completion problem with determinant condition?
Given two $\{0,1\}^{n\times n}$ matrices $L$ and $M$ and an integer $m$ is there a polynomial in $n$ algorithm to find a $\{-1,0,+1\}$ matrix $T$ such that $$\mathsf{det}(L+T\odot M)=m$$ where $\odot$ ...
- 13.9k
9
votes
0
answers
270
views
The number of non-singular $n\times n$ matrices over $\mathbb{F}_2$ with exactly $k$ non-zero entries
Suppose $M_{n}^{k}$ is the number of non-singular $n\times n$ matrices over $\mathbb{F}_2$, that have exactly $k$ non-zero entries.
Is there some sort of formula to calculate $M_n^k$?
If $k < n$ ...
- 2,618
26
votes
1
answer
5k
views
Generalization of Cauchy's eigenvalue interlacing theorem?
Cauchy's Interlacing Theorem says that given an $n \times n$ symmetric matrix $A$, let $B$ be an $(n-1) \times (n-1)$ principal submatrix of it, then the eigenvalues of $A$ and those of $B$ interlace.
...
- 571
16
votes
2
answers
504
views
The number of 0-1 normal matrices
Let $A\in\{0,1\}^{n\times n}$ be a $n\times n $ matrix with entries in the discrete set $\{0,1\}$.
My question: What is the number of matrices in $\{0,1\}^{n\times n}$ that are normal, that is, ...
- 2,712
6
votes
1
answer
500
views
Rank and frequency of permutations
(a) Let $[n] = \{1,\dotsc,n\}$, and let $\pi:[n]\to [n]$ be a permutation. Define an $n$-by-$n$ matrix $A=A(\pi)$ as follows: $A_{i,j}=1$ if $j>i$ and $\pi(j)>\pi(i)$, $A_{i,j}=-1$ If $j<i$ ...
- 20.2k
2
votes
2
answers
234
views
Adjacency matrix of total graph
Is there a nice way of relating the adjacency, incidence , Laplacian matrices and other matrices associated to a graph of a total graph with its original graph, or, say, at least relating that of the ...
- 2,089