Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
1 answer
98 views

Only special permutations result in a constant expression when permuting coefficients in a sum involving binomials?

Fix $n\geq 1$ and let $p_k(x) := x^k(x-1)^{n-k}$. Suppose $\pi$ is a permutation on $\{0,1,\dotsc,n\}$, such that $$ \sum_{k=0}^n (-1)^k \binom{n}{k} p_{\pi(k)}(x) \text{ is a constant}. $$ Must it be ...
Per Alexandersson's user avatar
0 votes
0 answers
133 views

On nilpotent singular $\mathbb F_2^{n\times n}$ matrices

Let $M$ be a $0/1$ matrix over $\mathbb F_2^{n\times n}$ with determinant $0$. The set of such singular matrices form a semigroup. The set of nilpotent matrices of size $n\times n$ form a semigroup. ...
Turbo's user avatar
  • 13.9k
17 votes
1 answer
668 views

A coincidence or a fact: determinants of two matrices

While playing around with the MO question Determinant with factorials is not 0? about a determinant of the Hankel matrix of entries $(i+j-2)!$, having the value $\prod_{k=0}^{n-1}k!^2$, I stumbled on ...
T. Amdeberhan's user avatar
3 votes
2 answers
302 views

Vandermonde $V_n$ mod $n$

Consider the all-familiar Vandermonde determinant $V_n(x_1,\dots,x_n)$ of the matrix of $(i,j)$-entries $M_n(i,j)=x_j^{i-1}$ so that $$V_n(x_1,\dots,x_n)=\prod_{1\leq i<j\leq n}(x_j-x_i).$$ Let's ...
T. Amdeberhan's user avatar
14 votes
1 answer
739 views

a Vandermonde-type of determinants summed over permutations

Let $S_n$ be the symmetric group. Consider $$D:=\sum_{\sigma\in S_n} \text{sgn}(\sigma)\cdot \det\begin{pmatrix}1 & a_{\sigma(1)}-0 & (a_{\sigma(1)}-0)^2 & \cdots & (a_{\sigma(1)}-0)^{...
Fan Ge's user avatar
  • 141
0 votes
0 answers
84 views

A permutation statistic and determinantal identity

I'm trying to read this paper, Total positivity, Grassmannians and networks by Postnikov (https://arxiv.org/abs/math/0609764) and I'm stuck on Lemma 5.1, which is essentially an identity about maximal ...
lfy's user avatar
  • 1
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 ...
H A Helfgott's user avatar
  • 20.2k
0 votes
0 answers
185 views

Sum of unit vectors always has a binary span after constrained permutations

Conjecture: Let $e_1 = (1,0,\ldots,0), \ldots , e_{m_1+m_2} = (0,\ldots,0,1)$ be the unit vectors of the standard basis $E$ of $\mathbb{R}^{m_1+m_2}$. An enumeration $ E \cup -E = \{f_1, \ldots, ...
user95393's user avatar
  • 121
2 votes
2 answers
664 views

On $XX'=I$ such that $AX=XB$ is true when $A,B\in\{0,1\}^{n\times n}$

Given real symmetric matrices $A,B\in\{0,1\}^{n\times n}$ is it true that $$AX=XB$$ has a solution of form $X$ a permutation matrix iff a solution with $XX'=I$ exists? We are over reals. It is clear ...
Turbo's user avatar
  • 13.9k
1 vote
1 answer
321 views

Cycles of Permutation Related to Rectangular Matrix Transposition

let the entries of a rectangular matrix $A\in\mathbb{C}^{m\times n}; m,n\in\mathbb{N}$ be stored in row-order in a linear vector $v$, i.e. $A_{i,j}=v_{i*m+j}$ Question: How can the first element ...
Manfred Weis's user avatar
  • 13.2k
6 votes
1 answer
448 views

Counting the (additive) decompositions of a quadratic, symmetric, empty-diagonal and constant-line matrix into permutation matrices

Dear community, I have the following combinatorial question which I will explain in short first and then with some more detail. At the end you will find a very simple example. Short version Le $A \...
herrsimon's user avatar
  • 199