All Questions
Tagged with linear-algebra co.combinatorics
513 questions
1
vote
1
answer
145
views
How many matrices $C \in \mathrm{M}_3(\mathbb{F}_q)$ such that $\det(C-A)=\det(C-B) = 1$?
I am studying the special unit-graph $G$ on $M_3(\mathbb{F}_q).$ Now, I want to estimates the upper bound for the second largest eigenvalue of adjacency matric of $G.$ One of questions that I need is ...
user148117
13
votes
1
answer
311
views
Permanent of the Coxeter matrix of a distributive lattice
Let $L$ be a finite distributive lattice 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 $L$ is defined as the matrix $...
- 26.5k
1
vote
1
answer
221
views
How to find all minimal dependent sets of a set of vectors effectively?
In my research, I need to find the set of all minimal dependent sets of a given set of vectors. One method is to check every subset of the given set. But this method is very slow when the set of ...
- 6,201
6
votes
1
answer
237
views
Determinantal questions on Alternate Sign Matrices
Let $\mathcal{A}_n$ be the set of all Alternating Sign Matrices (ASM) of size $n\times n$. The cardinality $\#\mathcal{A}_n$ is well-known
$$\#\mathcal{A}_n=\prod_{k=0}^{n-1} \frac{(3k+1)!}{(n+k)!}.$$
...
- 43.2k
1
vote
0
answers
130
views
Probabilistic lower bound on largest singular value of matrices
I have a distribution $\mathcal{D}$ that spits out vectors in $\{-1, 1\}^N$. Suppose I have a sample of $H$ of these vectors which I arrange into a matrix $M$ of the form $H \times N$.
Consider the ...
- 1,129
22
votes
2
answers
742
views
A q-rious identity
Let $[x]_q=\frac{1-q^x}{1-q}$, $[n]_q!=[1]_q[2]_q\cdots[n]_q$ and ${\binom{x}{n}}_{q}=\frac{[x]_q[x-1]_q\cdots[x-n+1]_q }{[n]_q!}$.
Computer experiments suggest that
$$\det \left(q^\binom{i-j}{2}\...
- 5,622
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
10
votes
0
answers
399
views
Words and ranks
Let me state two problems that look very much alike. The first one can be solved putting together answers that different people have given to some questions I asked here a few weeks ago. The second ...
- 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
2
votes
1
answer
150
views
Intersection of a lower dimensional space and a discrete set
Let $H\subset \mathbb{R}^n$ with dimension ${\rm dim}(H)=\ell<n$; let $S$ be a finite subset of reals.
My question is the following. Is it correct to say,
$$
{\rm card}(H \cap V)\leqslant |S|^\...
- 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
6
votes
3
answers
651
views
Real orthogonal and sign [closed]
I came across the following conjecture, reading a recent paper in the Monthly, an orthogonal matrix of order $n\neq 0 \pmod 4$ has a nonnegative (up to a scalar) row vector.
It should be straight in ...
- 785
6
votes
1
answer
429
views
Permutations, skew-symmetric forms and degeneracy
Define a skew-symmetric form $(\cdot,\cdot)$ on $\mathbb{R}^{2k}$ by $$(e_i,e_j) = \begin{cases} 1 &\text{if $i<j$},\\ -1 &\text{if $i>j$},\\ 0 & \text{if $i=j$.}\end{cases}$$ Given ...
- 20.2k
2
votes
0
answers
123
views
Mod $2$ of $\#PM(G)$ for arbitrary G?
Permanent mod $2$ of biadjacency gives polynomial time algorithm of $\#PM(G)\mod 2$ of perfect matchings of bipartite graph. Is there a similar efficient strategy for general graphs?
- 13.9k
9
votes
1
answer
384
views
Smith Normal Form of a Cayley Graph of the Symmetric Group
Let $A_n$ be the adjacency matrix of the Cayley graph $\text{Cay}(S_n,C_n)$ where $C_n \subseteq S_n$ is the conjugacy class of $n$-cycles of the symmetric group $S_n$. Since the generating set of ...
- 525
12
votes
2
answers
743
views
Smallest set such that all arithmetic progression will always contain at least a number in a set
Let $S= \left\{ 1,2,3,...,100 \right\}$ be a set of positive integers from $1$ to $100$. Let $P$ be a subset of $S$ such that any arithmetic progression of length 10 consisting of numbers in $S$ will ...
- 179
1
vote
0
answers
127
views
Lower and upper bounds of the distance between two Frobenius numbers
I consider two sequences of numbers: $A=\{a_1,...,a_{m-1},n\}$ and $B=\{n-a_{m-1},...,n-a_1,n\}$, where $a_1 < a_2 < ... < a_{m-1} < n$ and $\gcd(A) = \gcd(B) = 1$.
I investigate the ...
- 13
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
5
votes
2
answers
340
views
How many $\mathbb{Q}$-bases of $\langle\log(1),\dotsc,\log(n)\rangle$ can be built from the set of vectors $\log(1),\cdots,\log(n)$?
How many $\mathbb{Q}$-bases of $\langle\log(1),\dotsc,\log(n)\rangle$ can be built from the set of vectors $\log(1),\dotsc,\log(n)$?
Data for $n=1,2,3,\dotsc$ computed with Sage:
$$1, 1, 1, 2, 2, 5, ...
user6671
3
votes
1
answer
222
views
Maximal disjoint collections and matrix rank
First, a combinatorial question fit for an undergrad course. Say I have a collection $\mathcal{C}$ of non-empty subsets of $S=\{1,\dotsc,n\}$ such that every element of $\mathcal{C}$ has at most $k$ ...
- 20.2k
5
votes
2
answers
1k
views
Cardinality of certain subsets in vector spaces over finite fields
Assume that you have an $n$-dimensional vector space over a finite field (therefore the number of elements in the vector space is finite) and $F$ is a subset of this vector space which contains $m$ ...
- 228
3
votes
0
answers
172
views
Equality of determinants: a direct justification request
Let $I_k$ denote the enumeration of involutions among permutations in $\mathfrak{S}_k$. Here is yet another cute finding for which I ask a:
Question. Is there a direct proof (or interpretation or ...
- 43.2k
7
votes
2
answers
440
views
How to count the number of tensors over a finite field of tensor rank $r$?
For simplicity, work over $\mathbb F_2$ and only consider order-$3$ equilateral tensors. For $r\in\mathbb Z_{>0}$, how many tensors $\mathfrak{T}\in\mathsf{Ten}_{n}^{\otimes 3}(\mathbb F_2)$ are ...
- 161
5
votes
0
answers
150
views
monomer-dimer tiling of a Young diagram
As a modest start, I propose the below problem for a special set of partitions. Perhaps it is known.
Let $\lambda_n=(n,n-1,\dots,2,1)$ be the staircase partition and its corresponding Young diagram $...
- 43.2k
1
vote
1
answer
283
views
Reference request: conditions for the cardinality of the kernel of a linear map from $\mathbb{Z}_m^n \to \mathbb{Z}_m^k$ is a power of $m$
Let $\mathbb{Z}_m = \mathbb{Z}/m\mathbb{Z}$. Let $A$ be an $k \times n$ matrix over $\mathbb{Z}_m$. Let $f: \mathbb{Z}_m^n \to \mathbb{Z}_m^k$ be a linear map defined by $f(x) = Ax$, $x \in \mathbb{Z}...
- 6,201
2
votes
0
answers
185
views
Infinite products from the fake Laver tables-Now with no set theory
We say that a sequence of algebras $(\{1,\dots,2^{n}\},*_{n})_{n\in\omega}$ is an inverse system of fake Laver tables if for $x\in\{1,\dots,2^{n}\}$, we have
$2^{n}*_{n}x=x$,
$x*_{n}1=x+1\mod 2^{n}$,...
1
vote
0
answers
126
views
How many solutions to $p_i|a_{i,1} p_1 + \dotsc + a_{i,n} p_n$?
Consider a system of $n$ divisibility conditions on $n$ prime variables:
$$p_i|a_{i,1} p_1 + \dotsc + a_{i,n} p_n,\;\;\;\;\;1\leq i\leq n,$$
where $a_{i,j}$ are bounded integers. How many solutions ...
- 545
7
votes
1
answer
462
views
On a problem for determinants associated to Cartan matrices of certain algebras
This is a continuation of Classification of algebras of finite global dimension via determinants of certain 0-1-matrices but this time with a concrete conjecture and using the simplification suggested ...
- 26.5k
3
votes
1
answer
386
views
Determinant of an "almost cyclic" matrix
Let $n\geq 3$, let $Z$ be the matrix of the cyclic shift (the companion matrix of $X^n-1$), and for $\mathbf{d}\in \mathbb{C}^n$ let
$\operatorname{diag}(\mathbf{d})$ be the diagonal matrix with $\...
- 3,255
1
vote
1
answer
160
views
Matrix of powers of pairwise differences
Let $\underline{c}:=\left(c_1,\dots,c_n\right)$ be pairwise distinct complex numbers, and let $k$ be a non-negative integer. Define the matrix $A_{n,k}(\underline{c})$ to contain the $k$-th powers of ...
- 959
2
votes
1
answer
102
views
Maximum number of $0$-$1$ vectors with a given rank
Let $k\ge2$. The maximum number of $0$-$1$ (column) vectors of length $2k-1$ which make a rank $k$ matrix with no zero row nor two identical rows is $2^{k-1}+1$. (The rank is over the rationals.)
I ...
- 33
5
votes
0
answers
357
views
$\text{Determinant}=(\sum \text{Determinant})^2$
Denote by $\delta_{n-1}=(n-1,n-2,\dots,1,0,0,\dots)$ the staircase partition and the embedded partition
$\lambda=(\lambda_1,\lambda_2,\dots)\subset\delta_{n-1}$.
QUESTION 1. Is this true?
$$\det\...
- 43.2k
1
vote
1
answer
151
views
Counting monomials in skew-symmetric+diagonal matrices
This question is motivated by Richard Stanley's answer to this MO question.
Let $g(n)$ be the number of distinct monomials in the expansion of the determinant of an $n\times n$ generic "skew-...
- 43.2k
11
votes
2
answers
558
views
Classification of algebras of finite global dimension via determinants of certain 0-1-matrices
I restrict to the elementary problem that is equivalent to give a classification when Morita-Nakayama algebras have finite global dimension (see the end of this post for some background).
A Morita-...
- 26.5k
2
votes
2
answers
258
views
Equal-valued determinants in search of a proof: Part III
Encouraged by David's proof for my earlier MO question, let's consider a similar problem.
I can prove the below equality by computing each of the two sides, directly. That means, there is an ...
- 43.2k
11
votes
1
answer
579
views
Catalan determinants in search of a proof: Part II
This problem involves the Catalan numbers $C_n=\frac1{n+1}\binom{2n}n$.
I can prove the below equality by computing each of the two sides, directly. That means, there is an algebraic proof.
...
- 43.2k
0
votes
1
answer
43
views
For an one-order Linear Recurrence of a vector sequence, does the corresponding item follow a Linear Recurrence? [closed]
Consider an one-order Linear Recurrence of a vector sequence, such as
$${\bf x}_{n+1}={\bf A}{\bf x}_n$$
where ${\bf x}_n \in \mathbb{R}^m (\forall n)$, and ${\bf A} \in \mathbb{R}^{m\times m}$ and ${\...
- 601
10
votes
2
answers
985
views
Determinantal symmetry: proof requested: Part I
Consider the determinantal function
$$F(a,b,c):=\det\left[\binom{i+j+a+b}{i+a}\right]_{i,j=0}^{c-1}.$$
I would like to ask:
QUESTION. Can you provide an argument, combinatorial or otherwise, to ...
- 43.2k
4
votes
1
answer
4k
views
Why is the matrix of all 1's called "J"? [closed]
I've seen J referenced recently in some discussion about algebraic combinatorics, and it took me a while to figure out it was the matrix of all ones. It came up without definition, and I spent too ...
- 73
2
votes
1
answer
116
views
counting invertible matrices [closed]
Let $T$ be a subset of vector space $Z_2^n$ and $A$ be an element of $GL(2,n)$ means invertible matrices with entries $\{0,1\}.$ Let $T$ be invariant under A. It means for any $t \in T$, $tA \in T$. ...
- 21
3
votes
0
answers
142
views
Combinatorics question
Let $A = (a_{ij})_{1\le i,j\le h}$ be an $h$-by-$h$ non-degenerate upper triangular matrix with entry $a_{11} = 1$. Let $\Phi = \{\alpha_1,\alpha_2,\ldots,\alpha_d\}\subseteq \{1,2,\ldots,h\}=I$ be an ...
- 443
13
votes
0
answers
257
views
Is the set of power matrices decidable?
Let $\text{Mat}(n\times n,\mathbb{Z})$ denote the collection of integer $n\times n$ matrices. We say $M\in \text{Mat}(n\times n,\mathbb{Z})$ is a power matrix if there is an integer $k>1$ and a ...
- 48.9k
3
votes
2
answers
257
views
On $\det[x+(\frac{i\pm j}p)]_{1\le i,j\le(p-1)/2}$ for primes $p\equiv 3\pmod 4$
I have made the followng conjecture on the basis of my computation.
Conjecture. For any prime $p\equiv3\pmod4$ with $p>3$, we have
$$\det\left[x+\left(\frac{i+j}p\right)\right]_{1\le i,j\le(p-1)/2}...
- 15.6k
1
vote
0
answers
66
views
Spherical code for interesection of $k$-sparse vectors and unit sphere
Let us assume $X\in\mathbb{R}^{n\times d}, rank(X)=d$, integer $k\in\mathbb{N},k\ll d$, positive constant $0<\epsilon<1$, and $\mathcal{S}\subset \mathbb{R}^d$ denotes the unit sphere. We also ...
- 187
2
votes
1
answer
496
views
Matrices with distinct columns
Let $M$ be an $n \times m$ matrix over $\mathbb{F}_2$ with no repeated columns, and suppose that $m \leq 2^{n-1}$: i.e., it is possible to have a matrix with fewer rows that still has $m$ unique ...
- 567
6
votes
1
answer
297
views
Covering the finite plane with lines
This is, essentially, a geometrically rendered version of the question I asked a week ago, with the emphases slightly shifted; it seems more natural and appealing (to me, at least) in this form.
Let ...
- 23k
4
votes
0
answers
192
views
Forcing scalar products to avoid prescribed values
Let $p$ be a prime, and $n\ge 1$ an integer number. Suppose that the (not necessarily distinct) vectors $v_1,\dotsc,v_N \in{\mathbb F}_p^n$ satisfy the following condition:
\begin{gather}
\text{For ...
- 23k
2
votes
0
answers
126
views
Maximal number of $S_n$-conjugates living in a hyperplane
Let $v=(a_1,\dots,a_n)\in\mathbb{R}^n$ where the $a_i$ are distinct and positive. For $\sigma\in S_n$, let $\sigma(v)=(a_{\sigma(1)},\dots,a_{\sigma(n)})$. For any hyperplane $H$ through the origin, ...
- 21
4
votes
1
answer
96
views
Separate the trivial partition by a linear hyperspace
Let $e=[1,1,\ldots,1]\in\mathbb{Z}^n$. I am looking for a way to find a vector $a\in\mathbb{Z}^n$ such that:
$\langle a,e\rangle=0$ and
for every nonnegative $v\in\mathbb{Z}^n$ such that $\langle e,v\...
- 3,041