Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
2 answers
227 views

Is a probabilistic implementation of unitaries invertible?

Let $\{p_j\}_j$ be a set of probabilities, $\sum_j p_j = 1$, let $\{h_j\}_j$ be a set of $n \times n$ Hermitian matrices, and define $ad_h(A) $ be the adjoint. Define the following linear mapping $$ E(...
Hans Schmuber's user avatar
8 votes
4 answers
379 views

Traceless Hermitian matrices with simultaneously vanishing Rayleigh quotients

Let $D$ be an integer greater than 1. What is the largest number $N$, such that for all sets of $N$ Hermitian $D\times D$ traceless matrices $M_i$, $i=1,\dots,N$, there exists a non-zero complex ...
Michał Jan's user avatar
7 votes
1 answer
580 views

Sobolev spaces are smooth? Their dual is strictly convex?

Do you know any reference which says something about the: Smoothness of the Sobolev space $W^{1,p}(\Omega)$ i.e. if the duality mapping $J\colon W^{1,p}(\Omega)\to W^{1,p}(\Omega)^*$ is a singleton. ...
Bogdan's user avatar
  • 1,759
0 votes
0 answers
46 views

What's the problem in using spanning Bessel sequences that are not frames to decompose vectors?

This is related to a question I recently asked on math.SE. Consider a subset $G\equiv \{g_k\}_{k\in\mathbb{N} }\subseteq\mathcal H$ in a separable Hilbert space $\mathcal H$, and suppose $G$ spans the ...
glS's user avatar
  • 342
7 votes
2 answers
201 views

When is a linear isomorphism of $M_n(\mathbb{C})$ given by unitary conjugation?

Let $M_n(\mathbb{C})$ represent the space of $n \times n$ matrices over $\mathbb{C}$. We will think of it as a $\mathbb{C}$-vector space. Notice that if $A \in M_n(\mathbb{C})$ is invertible, then the ...
Rahul Sarkar's user avatar
0 votes
0 answers
28 views

Constructing random graphs with given eigenvalues and eigenvectors

In Linial's presentation on SOME PROBLEMS AND RESULTS IN THE GEOMETRY OF GRAPHS, on slide 7, some relations of properties of graphs to the eigenvalues of their adjacency matrix are listed, e.g. if $G$...
Manfred Weis's user avatar
  • 13.2k
0 votes
0 answers
51 views

Degree of determinant of a (non-monic) matrix polynomial

Let $n=2, 3, \dots$ and consider the matrix polynomial $L(\lambda)=\sum_{k=0}^{\ell}A_k\lambda^k$, where $A_k \in \mathbb{C}^{n\times n}$. In the so-called monic case (or that can be made monic by ...
94thomas's user avatar
2 votes
2 answers
127 views

Optimizing a matrix quadratic form with respect to Loewner order

Fix integers $1 \leq k \leq n$. Let $P \in \mathbb{R}^{n \times k}$ be such that $P^T P$ has full rank. Let $\mathcal{X}$ denote the set of unit trace, real $n \times n$ symmetric positive ...
Drew Brady's user avatar
4 votes
1 answer
54 views

Krein-Rutman for integral transforms: proof of convergence to leading eigenvector

Disclaimer: This is a question in functional analysis, on which I don't have much background. It arose from me trying to prove on my own a folklore result in probability theory. Consider an integral ...
Plemath's user avatar
  • 312
3 votes
1 answer
192 views

Vanishing of principal minors implies upper triangular up to permutation

Let $A$ be a square matrix. If $A$ satisfies the following two conditions (1) $A$ is upper triangular (2) all diagonal entries of $A$ are zero then it is easy to see that all principal minors of $A$...
LichenSDU's user avatar
  • 357
0 votes
0 answers
94 views

Infinite sequence of PSD non-moments in two variables

Define a 2d sequence to be a mapping $a: \mathbb{N}^2 \to \mathbb{R}$ (where $\mathbb{N} = \{0, 1, \dots\}$). Here are two definitions of types of 2d sequences: We say that a 2d sequence $a$ is a ...
Eric Neyman's user avatar
4 votes
1 answer
170 views

About $CW(512,16^2)$

Definitions: A weighing matrix $W = W(n,k)$ with weight $k$ is a square matrix of order $n$ and entries $w_{ij}$ in $\{0, \pm 1\}$ such that $WW^T=kI$, where $I$ is the identity matrix. A circulant ...
user369335's user avatar
5 votes
1 answer
279 views

Is there a theorem which provides conditions under which a power series satisfies the reciprocal root sum law?

Kalman - Six ways to sum a series discusses Euler's original proof for the Basel problem $\sum\limits_{n=1}^\infty \frac{1}{n^2}=\frac{\pi^2}{6} $: $$\frac{\sin(\sqrt x)}{\sqrt x} = 1- \frac{x}{3!}+ \...
pie's user avatar
  • 541
3 votes
1 answer
232 views

Non-degeneracy in hyperplane intersections of canonical curves

Let $C$ be a smooth projective non-hyperelliptic curve over $\mathbb{C}$ of genus $g = 4$. The canonical bundle $\omega_C$ induces a canonical embedding $C \longrightarrow \mathbb{CP}^3 $ such that $C$...
zxx's user avatar
  • 343
0 votes
0 answers
50 views

Eigenvalues of functions on finite discrete sets

Suppose I have an arbitrary function on a finite and discrete set $S$ defined as $$f: S \times S \to \mathbb{C}^{|S|\times |S|}.$$ The $|S| \times |S|$ matrix $M$ is defined as $$(M)_{ij}=f(s_i, s_j) \...
aa190903's user avatar
1 vote
1 answer
133 views

Graceful labeling of the complete bipartite graph and its laplacian quadratic form diagonalized

A graceful labeling of a connected simple undirected graph $G=(V,E)$ is a map $f:V\to\lbrace 1,...,|E|+1\rbrace$ such that for all $t\in\lbrace 1,...,|E|\rbrace$ there is a (trivially unique) $\langle ...
Jens Fischer's user avatar
3 votes
1 answer
143 views

A problem about matrix inverse and regularization methods

I'm researching the problem of solving the equation $A\mathbf{x}=\mathbf{b}$ with ill-conditioned matrices. We know that if we solve it directly, like $\mathbf{x}=\mathrm{inv}(A)\ast\mathbf{b}$, then ...
bing's user avatar
  • 33
1 vote
0 answers
80 views

Inequality involving random vectors and absolute values

Let $\mathbb{X}, \mathbb{Y} \subset \mathbb{R}^d$ be finite sets. Suppose random vectors $X \in \mathbb{X}$ and $Y \in \mathbb{Y}$ are sampled according to a joint distribution $\mathbb{P}_{XY}$. ...
Alireza Bakhtiari's user avatar
5 votes
2 answers
189 views

Bisymmetric Hadamard matrices

Definitions: An $n\times n$ Hadamard matrix is a matrix whose entries are either $1$ or $−1$ and whose rows are mutually orthogonal. A symmetric matrix is a square matrix that is equal to its own ...
user369335's user avatar
0 votes
0 answers
68 views

Inequality between product of companion matrices and power of Pisot number

Let $d\geqslant 2$ be an integer and consider a convergent sequence of "companion" matrices $$A_k := \begin{pmatrix} a_{k,1} & a_{k,2} & \cdots & a_{k,d} \\\ & ...
Kermatoni's user avatar
  • 101
7 votes
1 answer
238 views

Hadamard product decomposition with lower rank matrices

Given integers $k$ and $l$ and a matrix $A$ of rank $kl$, can we always find a matrix $B$ of rank $k$ and a matrix $C$ of rank $l$, such that $A$ is the Hadamard product of $B$ and $C$, namely $A=B \...
Yuchen He's user avatar
3 votes
1 answer
157 views

How can discrete Fourier transform approximation prove the completeness of complex exponentials in $L^2(T)$?

I have a question about the completeness of complex exponentials in function spaces. For the discrete set $ S = \{1, 2, \ldots, n\} $, it is clear and intuitive that $ e^{2\pi ikx/n} $ for $ k = 0, 1, ...
Zhang Yuhan's user avatar
1 vote
1 answer
153 views

How to solve for bounds restricting ${\Sigma}$ to symmetric-positive-semi-definiteness?

Scenario I have a equation for a covariance matrix ${\Sigma}$ where everything but a vector of correlations is known aka $x=(x_{1}, \dots, x_{D})$ for $x_{i}\in [-1, 1]$. Problem I know that ${x}$ ...
maxamillianos's user avatar
2 votes
1 answer
173 views

Maximizing a quadratic form involving a trace-bounded positive definite matrix?

$\newcommand{\tr}{\mathrm{tr}}$Suppose $P, Q$ are two real, symmetric positive definite matrices and $v$ a nonzero unit vector. Consider $$ f(X) = v^T(P + X^{-1})^{-1} v + v^T(Q + X^{-1})^{-1} v. $$ ...
Drew Brady's user avatar
2 votes
1 answer
326 views

Full rank of Hadamard product matrix

Let $\circ$ be the Hadamard product and consider two matrices $C \in\{0,1\}^{N \times n}$ and $W\in \mathbb{R}^{N\times n}$: $$ C:=\left[\begin{array}{cccc} c_1^1 & c_2^1 & \cdots & c_n^1 \...
mathbb's user avatar
  • 43
4 votes
1 answer
184 views

Is there a nice basis for a pair of linear maps?

By using splitting fields I know you can put a (single) matrix in upper triangular form. This gives in my opinion the cleanest proof of the Cayley-Hamilton theorem. consider the following... WRONG ...
Miguel Andrade's user avatar
0 votes
0 answers
52 views

References on a variant of Geometric Calculus

Geometric algebra and (standard) calculus, when synthesized, give rise to geometric calculus, a very powerful formalism. I have read a bit about fractional calculus and time-scale calculus, both very ...
user avatar
2 votes
0 answers
108 views

Largest prime determinant of a binary matrix

Given an integer $n$, I want to prove the existence of an $n\times n$ binary matrix (with 0,1 entries), whose determinant is a prime number. What is a lower bound on the largest determinant that I ...
Erel Segal-Halevi's user avatar
1 vote
1 answer
132 views

Can I find $n$ points on the boundary of an $n$-dimensional ball with certain properties?

My problem is the following: I want to construct $n$ rays all starting at a point $v$ that is not in the $n$-dimensional ball around $0$ such that the following is true: The $n$-dimensional ball is a ...
limes_inferior's user avatar
1 vote
0 answers
47 views

Regression models as local sections of a chain complex

Let's say we find some regression equation $\ell$ (best fit / linear / whatever words you need to put here) for a sample $D$, subset of population $P$. This equation/model can be thought of as a ...
cheyne's user avatar
  • 1,611
5 votes
1 answer
429 views

Lower bound for the rank of the sum of $n$ matrices

I found a mathematical note by George Marsaglia entitiled "Bounds for the rank of the sum of two matrices", where he proves the following result. Let $A_1$ and $A_2$ be two complex matrices ...
Malkoun's user avatar
  • 5,215
14 votes
0 answers
602 views

Is the Zariski density proof of Cayley-Hamilton circular?

This old MO thread and its comments contains a discussion of the Zariski density proof of Cayley-Hamilton (I have also asked a separate question about the proof Victor gives in the comments here). ...
Qiaochu Yuan's user avatar
0 votes
1 answer
158 views

Techniques for bounding the operator norm of the expectation of random matrix?

Let $\mu$ be a distribution on the unit sphere in $\mathbb{R}^n$. Let $u \sim \mu$ and consider the random matrix $$ A = I_n - uu^T. $$ Question: What techniques are available to provide (reasonably ...
Drew Brady's user avatar
4 votes
1 answer
686 views

Who and when proved Artin's Theorem on alternative rings?

I am interested in the history of the proof of Artin's Theorem (on the diassociativity of alternative rings). Question. When has Artin proved this theorem and where was it published for the first ...
Taras Banakh's user avatar
  • 41.8k
36 votes
4 answers
2k views

Determinant of the random matrix $X^2+Y^2$

$\DeclareMathOperator\Prob{Prob}$Let $X,Y\in M_n(\mathbb{R})$ be $2$ random matrices. The entries of $X,Y$ are i.i.d. variables. They follow the standard normal law $N(0,1)$. i) When $n=2,3,4$, one ...
loup blanc's user avatar
  • 3,741
0 votes
0 answers
52 views

What are the injective embeddings of R^d into the cone of (semi-) positive definite matrices of dimension d?

How can we characterize the set of all injective functions from $\mathbb{R}^d$ to the set of all symmetric positive definite matrices of dimension d?
Drmanifold's user avatar
3 votes
4 answers
551 views

How big a class of lines can a non-linear transformation map to itself?

Edit: In the original version of this question, I wrote "lines through the origin" instead of "lines"; as Alexandre Eremenko points out in his answer, this makes the question too ...
Steven Landsburg's user avatar
0 votes
0 answers
70 views

Cyclotomic eigenvalue question for Distance-regular graph

I have read this paper. So, I am just thinking about if the following guess is true: GUESS: Any Distance-regular graph (DRG) has cyclotomic character value property (which means the eigenvalues of a ...
user1992's user avatar
  • 109
9 votes
1 answer
563 views

Peter–Weyl decomposition of a group representation rather than group algebra

Consider a finite or compact group $G$. The Peter–Weyl decomposition is usually formulated for the group algebra $\mathbb{C}[G]\simeq\bigoplus_i \operatorname{End}(V_i)$, where $V_i$ are the spaces of ...
Conifold's user avatar
  • 1,731
3 votes
1 answer
252 views

Two isotropic subspaces in a symplectic vector space

Let $k$ be a field of characteristic $0$, let $V$ be a finite-dimensional vector space over $V$, and let $\omega(-,-)$ be a symplectic bilinear form on $V$. In other words, $\omega(-,-)$ is an ...
Linda's user avatar
  • 33
9 votes
2 answers
245 views

Matrix invariants for simultaneous conjugation by a finite subgroup of $\textrm{GL}_n$

Let $K$ be a field of characteristic 0, and consider $d$ generic $n\times n$ matrices $X_1,\ldots,X_d$ where $X_k = (x_{ijk})_{ij}$ and $ K[x_{ijk}]$ is the polynomial algebra in $n^2 \cdot d$ ...
Greg Zitelli's user avatar
  • 1,104
4 votes
0 answers
284 views

Institutional approach to linear algebra

In Diaconescu's book Institution Independent Model Theory, it is mentioned on p. 37 that linear algebra can be viewed as an institution. Specifically, we have the following Definition. An institution ...
Alec Rhea's user avatar
  • 10.1k
3 votes
1 answer
189 views

Rank properties of matrix valued in linear forms

Let $R(X,Y) \in \text{Mat}_{d,d+1}(\mathbb{C}[X,Y]_{(1)})$ be a $d \times (d+1)$-matrix valued in linear forms $\mathbb{C}[X,Y]_{(1)}:= \{aX+bY \ \vert \ a,b \in \Bbb C \}$. Let denote $v_j(X,Y)$ its $...
user267839's user avatar
  • 6,028
3 votes
0 answers
118 views

A matrix-valued analogue of a classical inequality

Let $p \geq 4$ be an even integer. In the study of variational problems in $W^{1, p}$, it is handy to know that for $a, b \in \mathbb R^d$, $$|a - b|^p \leq 2^{p - 1} (|a|^{p - 2} + |b|^{p - 2}) |a - ...
Aidan Backus's user avatar
7 votes
1 answer
390 views

Questions on symmetric Hadamard matrices

Definitions: An $n\times n$ Hadamard matrix (HM for short) is a matrix whose entries are either $1$ or $−1$ and whose rows are mutually orthogonal. If $A$ is a symmetric matrix, then $A = A^T$ and if $...
user369335's user avatar
0 votes
1 answer
66 views

Correct conditions for the image of a matrix to intersect a cone?

Given an $m \times n$ real (or rational) matrix $A = (a_{ij})$, what are necessary and sufficient conditions for the image of this matrix to intersect a cone? I am specifically interested in the cone $...
LGe's user avatar
  • 11
20 votes
7 answers
5k views

Why do infinite-dimensional vector spaces usually have additional structure?

On Mathematics Stack Exchange, I asked the following question: Why are infinite-dimensional vector spaces usually equipped with additional structure? Although it received one good answer, I feel that ...
Joe Lamond's user avatar
3 votes
1 answer
196 views

Deriving the "Explicit" formula for inverse of Hilbert/Cauchy matrices

My exact question is, how to derive the formula for $H^{-1}$, in which $H_{ij}=\frac{1}{i+j-1}$. I am currently working my way through Hoffman&Kunze Linear Algebra. I noticed that a question on ...
Yinuo An's user avatar
  • 183
43 votes
18 answers
5k views

Results in linear algebra that depend on the choice of field

Linear algebra as we learn it as undergraduates usually holds for any field (even though we usually learn it for the complex, or real, numbers). I am looking for a list of concepts, and results, in ...
0 votes
2 answers
397 views

How to show the following matrix has eigenvalues $-d,-d+1,...,d$?

Consider the following $(2d+1)\times (2d+1)$ matrix: $$ A = \begin{pmatrix} 0 &\frac{2d}{2} & 0 &0 & \cdots &0 & 0 \\ \frac{1}{2} & 0 & \frac{2d-1}{2} &0& \...
Quokka's user avatar
  • 25