Questions about the properties of vector spaces and linear transformations, including linear systems in general.

learn more… | top users | synonyms

0
votes
0answers
27 views

Estimating the shift in the $\lambda_{max}$ of a matrix under a diagonal perturbation

Given a matrix $A$ and a diagonal matrix $D$, what ways do we have to estimate, $\lambda_{max}(A+D) - \lambda_{max}(A)$? (Feel free to make other assumptions about the matrices that they are all ...
-5
votes
0answers
37 views

Function that outputs only 1 or 0 depending on sign of variable? [on hold]

Is there a single variable (preferably simple) function which equals 0 for any positive input and 1 for any negative input, or vice versa?
1
vote
0answers
39 views

Avoiding the range of a bivariate integer function or Diophantine function

I have a bivariate integer function $f(x,y)=5+23x+7y+30xy$ where $x,y \geq 0$ and are integers. The lattice points of this function, or its range contain a large number of values. I'm trying to see if ...
3
votes
1answer
58 views

Number of linearly bisected subsets in finite vector space $F_2^n$

We consider the $n$-dimenstional finite vector space $\mathbb{F}_2^{n}$ over the finite field of two elements. For a subset $A\subseteq \mathbb{F}_2^{n}$ of even size $|A|=2m$ and a linear form ...
3
votes
1answer
130 views

On the search for an explicit form of a particular integral

Let $f$ be integrable over the interval $(0, 1)$, and $$I_n = \int_0^{1} x^n f(x) \, \mathrm{d}x.$$ Suppose $f(x) = f(1-x)$; we can then show that $$I_n = \sum_{k=0}^{n} \binom{n}{k} (-1)^k \, ...
4
votes
0answers
83 views

An inequality from the “Interlacing-1” paper

This question is in reference to this paper, http://annals.math.princeton.edu/wp-content/uploads/annals-v182-n1-p07-p.pdf (or its arxiv version, http://arxiv.org/abs/1304.4132) For the argument to ...
-3
votes
0answers
45 views

How to find $B$ by solving the following linear system: $s_k$ $B$ ${s_k}^T$ $=1,$ [on hold]

How to find $B$ by solving the following linear system: $s_k$ $B$ ${s_k}^T$ $=1,$ $\qquad$ for $k=1 ... ,p$. Where $s_k$ is a $1\times3$ row_vector from the matrix $S= [s_1 ... ...
0
votes
0answers
63 views

A question in compact set

Definitions: ${A_j},{\Delta _j} \in {C^{n \times n}},(j = 0,1,2....m)$ ${\rm{P(}}\lambda {\rm{) = }}{{\rm{A}}_m}{\lambda ^m} + .....{A_1}\lambda + {A_0}$ is a matrix polynomial, and $\lambda $ is ...
0
votes
0answers
46 views

Equivalence classes of pairs linear transformations

Consider the set of 4-tuples: $$S_{(x, y), k} = \{ (a_i, b_i, a_j, b_j) : \|a_ixb_i - a_jyb_j\|_F^2 = k \}$$ for $a \in GL(m, \mathbb{R})$, $b \in GL(n, \mathbb{R})$, $x, y \in \mathbb{R}^{m \times ...
-5
votes
0answers
53 views

$A = \left\{ {{P_\Delta }(\lambda ):\left\| {{\Delta _j}} \right\| \le \varepsilon ,j = 0,1,2…m} \right\} \Rightarrow$A is closed [closed]

Suppose ${P_\Delta }(\lambda ) = ({A_m} + {\Delta _m}){\lambda ^m} + ....... + ({A_1} + {\Delta _1}){\lambda ^1} + ({A_0} + {\Delta _0})$ is a matrix polynomial, and $\lambda $ is a complex ...
-5
votes
0answers
45 views

Let $A = \left\{ {\lambda \in C:{v^*}P(\lambda )v = 0,v \in C,{v^*}v = 1} \right\}$ Why is $A$ always closed? [closed]

Let ${\rm{P(}}\lambda {\rm{) = }}{{\rm{A}}_m}{\lambda ^m} + .....{A_1}\lambda + {A_0}$ a matrix polynomial(${A_j} \in {C^{n \times n}},j = 0,1,2....m$), and $A = \left\{ {\lambda \in ...
0
votes
0answers
92 views

Can we have different methods for Lp spaces? [closed]

I know this question is not related to research but I need to know; would someone please help? Consider I have some time samples and it is known to be summation of sinusoidal. Problem is to estimates ...
-2
votes
0answers
42 views

A question in numerical range of matrix polynomial [closed]

Let $${\rm{P(}}\lambda {\rm{) = }}{{\rm{A}}_m}{\lambda ^m} + .....{A_1}\lambda + {A_0}$$ a matrix polynomial(${A_j} \in {C^{n \times n}},j = 0,1,2....m$), and $$A = \left\{ {\lambda \in ...
5
votes
0answers
83 views
+50

Biggest (or large) rectangle in a polytope

I need an efficient method to construct a (hyper)rectangle inside a polytope with a lot of dimensions (say $100 < d < 1000$). Ideally I'd want the biggest possible rectangle, but as I don't ...
0
votes
0answers
21 views

Arithmetical complexity of substitution method for solving systems of linear equations [closed]

Let us have a system of linear equations (say m equations, n variables, over the reals, perhaps just m=n). How many basic operations in the reals do we need to perform to solve the system by the ...
0
votes
0answers
30 views

Positive-definite and positive semi-definite matrixes sum [closed]

I'm doing an exercise of numerical analysis that ask me to demonstrate a particular sum of matrixes. From Wikipedia, I know that: M and N are two matrixes: if M is positive definite and r > 0 is ...
14
votes
2answers
477 views

Matrix equation $XAXBXC=I$

Let $A,B,C$ be unitary matrices. Does there always exist a unitary matrix $X$ such that $$(XA)(XB)(XC)=I,$$ where $I$ is the identity matrix? The quadratic equation $(XA)(XB)=I$ has the solution ...
6
votes
0answers
138 views
+50

When is a polynomial ring free over a graded subalgebra?

Keep the setting of my previous question and let $I := k[x_1, \dots, x_n] \cdot A_{>0}$ be an ideal of the algebra $k[x_1, \dots, x_n]$ generated by the set $A_{>0}$. It is clear that $I$ is a ...
-1
votes
0answers
47 views

Orbit closures of symmetric bilinear form [migrated]

Let $A$ and $B$ be two real symmetric matrices in $M_n(\mathbb{R})$. I would like to learn about necessary and sufficient conditions for knowing when $B \in \overline{GL_n(\mathbb{R})\cdot A}$; where: ...
4
votes
3answers
134 views

Is an associative division algebra required for this phenomenon?

For which integers $d \geq 1$ can we find real matrices $R_1, \dotsc, R_d$ of size $d \times d$ such that for any unit vector $v \in \mathbb{R}^d$, $$R_1 v, \dotsc, R_d v$$ is an orthonormal basis? ...
5
votes
0answers
119 views

Mapping the standard $(n!-1)$-simplex into $GL_n(\mathbb C)$

Let $\Delta^{n!-1}$ be the standard $(n!-1)$-simplex whose vertices are indexed by the elements of the symmetric group $S_n$, that is \begin{equation} \Delta^{n!-1} = \left\{ (t_\sigma)_{\sigma\in ...
2
votes
1answer
253 views

Is there an algorithm to test whether a vector is an eigenvector of a power of a matrix?

Given a square matrix $A\in k^{n\times n}$ and a vector $x\in k^n$ over some field $k$, is there an algorithm to test whether there are $s\in\mathbb{N}$ and $\lambda\in k$ such that $A^sx=\lambda x$? ...
4
votes
2answers
64 views

Integral roots of circulant matrix

When does the circulant matrix have only integral roots? For example: all roots of the adjacency matrix of the complete graph $K_n$ are integer, which its adjacency matrix is circulant, but in case ...
0
votes
1answer
80 views

Is there relation between vector valued RKHS and interpolation space?

Vector valued RKHS which is covered extensively in the book "Pick Interpolation and Hilbert function spaces" . In a different context interpolation space is defined in the wikipedia link: ...
2
votes
0answers
179 views

Largest eigenvalues distribution of tridiagonal symmetric random matrix

I would like to find the largest eigenvalue distribution of the following tridiagonal symmetric random matrix in an analytic way. All the ${\lambda}_i$ are distributed the same way with chi-square ...
0
votes
0answers
24 views

The Condition Number of a Scaled Vandermonde

Let $V(x_1,..,x_n)$ be the Vandermonde induced by $x_1,..,x_n$ and Let $\tilde{V} = V(\frac{x_1}{h},...,\frac{x_n}{h})$. My intuition says that the condition number should be invariant to such ...
3
votes
1answer
204 views

Does there exist a norm on continuous real-valued function space?

I know the space of continuous real-valued function on closed set can be given a norm by integral. How about the continuous funcion on the real line? It may be non-integrable, like f(x)=x^2. So, does ...
1
vote
0answers
73 views

Can we have extension of Mercer theorem to interpolation? [closed]

This question is related to Mercer theorem, Reproducible kernel Hilbert space(RKHS) and interpolation. The wikipedia links are https://en.wikipedia.org/wiki/Mercer%27s_theorem and ...
0
votes
1answer
88 views

Reference request: Strong Connectivity and the Incidence Matrix

Question: What would be a good reference for characterizations of strong connectivity of a digraph in terms of its incidence matrix? Details: Consider a digraph $(V, E)$ with vertex set $$V = ...
1
vote
0answers
95 views

Maximizing sum of matrices

Over the last few months, I've been trying to find the solution to a research-related problem I'm having. However, my research is not in mathematics, and my progress toward reaching a solution has ...
1
vote
1answer
84 views

Transversality in Morse theory, linear algebra version

I am working on a product in Morse-Bott homology which has led me to the following considerations and unanswered question. I would be very grateful if anyone could help. Suppose $H:\mathbb{R}^n \to ...
12
votes
1answer
404 views

Maximal Number of Pairs of Orthogonal vectors in a set of $n$ vectors in $\mathbb{R}^3$

Suppose you are given a set of $n$ non-zero vectors in $\mathbb{R}^3$. What is the maximum number of pairs of them that are orthogonal? The current guess is $\le 2n$. EDIT: I forgot to add that no ...
1
vote
0answers
49 views

Finding optimal linear transformation for intersection of convex polytopes

I previously posted this on MathSE and am now trying here. I have the following situation, as shown in the following diagram: $W=\{w_i\}_{i=1..|W|}$ is a set of vertices (show in diagram in ...
3
votes
1answer
206 views

Polynomial with the smallest area

Let $P_n(t) = p_0 + p_1 t + \cdots + p_n t^n$ be a polynomial (with real coefficients) of degree $n$ in the variable $t$. I am interested in the quantity $$\Phi_n = \min_{\sum_{i=1}^n p_i^2 = 1} ...
6
votes
1answer
129 views

Varieties parametrizing skew-symmetric matrices

Let $V$ be a vector space of dimension $n$ and let us consider the projective space $\mathbb{P}(\bigwedge^2V)$ parametrizing skew-symmetric matrices. Let $M\in\mathbb{P}(\bigwedge^2V)$, for any ...
-1
votes
0answers
47 views

Spectral radius of principal submatrices for the case of hermitian matrix

A principal submatrix of a matrix $\mathbf{A}\in\mathbb{C}^{N\times N}$ is any submatrix from $\mathbf{A}$ for which the same rows and columns have been eliminated. Assume $\mathbf{A}$ is hermitian, ...
2
votes
0answers
96 views

Rank–nullity theorem for finite von Neumann algebras

The rank-nullity theorem states that for $U, V$ finite dimensional vector spaces and $T:U \to V$ a linear map $$\dim(U) = \dim(im(T)) + \dim(ker(T)) $$ Let $M \subset B(H) $ be a finite von Neumann ...
0
votes
1answer
74 views

The weird projection from SO(2n)/B to maximal isotropic grassmannian

Take the generalized flag variety $SO(2n,\mathbb{C})/B$, considered as the moduli of isotropic flags (according to the form $\langle e_i, e_{2n+1-j}\rangle=\delta_{ij}$) $$F_1\subset F_2\subset\cdots ...
5
votes
4answers
351 views

Deceptive linear algebra problem

Does anyone recognize this problem? There are $2p$ equations and $2p$ unknowns, and it feels like a classic, but I've never encountered it before: Given $d_1, d_2, \ldots d_p$, find $a_1, a_2, \ldots ...
0
votes
1answer
58 views

Possible lower bound in quantum many body system with non-local terms

I am asking a question related to Lieb-Robinson bound and nonlocality. As we know from Lieb-Robinson theorem (see e.g. http://arxiv.org/abs/1008.5137): Suppose a Hamiltonian system is local, i.e. ...
2
votes
1answer
100 views

Sampling from random totally unimodular matrices of a particular type?

Is there a way to parametrize totally unimodular $(3n+2)\times(2n+2)$ matrices of form $$\begin{bmatrix} \pm1 & \pm1 & 0 & 0 &\dots & 0 & 0 & 0 & 0\\ A_{2n} & ...
6
votes
2answers
112 views

Existence and characterization of transitive matrices?

We call a matrix $M \in \mathbb{R}^{d \times d}$ transitive if it satisfies the following: For any three vectors $u, v, w$ in $\mathbb{R}^d$. If $u^T M v > 0$ and $v^T M w > 0$ then $u^TMw ...
2
votes
0answers
98 views

Vector inequation problem [closed]

$${A_i} = \left( {\begin{array}{*{20}{c}}{{A_{i1}}}\\{{A_{i2}}}\\ \vdots \\{{A_{in}}}\end{array}} \right),{B_i} = \left( {\begin{array}{*{20}{c}}{{B_{i1}}}\\{{B_{i2}}}\\ \vdots ...
1
vote
0answers
67 views

How to calculate $det(X^TX)$ efficiently, update one column of X each time [closed]

$X_{1} = (A, b)$, where $X_{1}$ is a $n\times p$ matrix, $A$ is a $n\times (p-1)$ and $b$ is $n\times1$. First calculate $\det(X_{1}^T X_{1})$, then update $b$ with $c$, st. $X_{2} = (A, c)$ and ...
2
votes
0answers
99 views

Lights Out game over GF(p)

On Jaap's Puzzle Page http:// www.jaapsch.net/puzzles/lomath.htm#domtilings Theorem 7 says: If standard Lights Out is played on a m x n grid-like board, ...
0
votes
1answer
211 views

Determinants of tensors [closed]

Consider a tensor of dimension $[d]\times[d]\times[d]$ which is symmetric with respect to every permutation of the indices. Are there any $\textbf{explicit}$ formulas for notions like determinant-like ...
0
votes
2answers
242 views

Linear Algebra classic books [closed]

I'm learning linear algebra at the moment, so I'm looking for some great old classic books. Something like Fermat's or Gauss books of some great mathematians. I don't really like the nowadays books ...
7
votes
3answers
234 views

Generalized Characteristic Polynomial with Unimodular Roots

Let us define a diagonal matrix $\mathbf{D}(z) = diag(z^{m_1}, \dots, z^{m_N})$ with $z\in\mathbb{C}$ and positive integers $m_1, \dots, m_N$. The generalized characteristic polynomial of a matrix ...
1
vote
0answers
129 views

Symplectic spectrum

I have a question about a step in the proof of the following theorem from symplectic geometry. The theorem is: Given any ellipsoid $E:=\{ w \in \mathbb{R}^{2n}; \sum_{i,j =1}^{2n} a_{ij}w_iw_j \le ...
1
vote
0answers
122 views

Oriented volume and determinants: Circularity [duplicate]

One often reads about oriented volumes as a motivation for determinants. In two dimensions you can scetch some nice pictures which may convince students that it is a good idea to have a closer look at ...