Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
255 views

Interpreting positive semidefinite matrix as a graph

Given any symmetric matrix $S \in \mathbb{R}^{n \times n}$, if $S \succeq 0$, is there a way to encode $S$ into a graph such that it takes into account the positive semidefinite constraint, and ...
patchouli's user avatar
  • 275
3 votes
1 answer
317 views

"Totally real" linear transformations

Identify $\mathbb{C}^n$ with $\mathbb{R}^{2n}$ via the equality $$(z_1, z_2, \ldots, z_n)=(x_1, \ldots, x_n, y_1, \ldots , y_n)$$ Where $z_j=x_j + iy_j$. We call a linear invertible map $A: \mathbb{R}^...
user avatar
1 vote
0 answers
72 views

A criterion for divisors of degree $n$ on the projective line to belong to a linear system of codimension 1

My question is essentially about linear dependence/independence of polynomials, but I will formulate it in the language of algebraic geometry, hoping someone may suggest a result in algebraic geometry ...
Malkoun's user avatar
  • 5,215
0 votes
0 answers
309 views

Simultaneous triangulation and Jordan normal form of commuting nilpotent matrices

Let $A_1,\ldots,A_r$ be $n\times n$ nilpotent matrices over $\mathbb C$, the field of complex numbers, satisfying $A_i\cdot A_j=A_j\cdot A_i$ for all $i,j$. As the matrices commute, they admit ...
sagnik chakraborty's user avatar
1 vote
1 answer
160 views

Differentiability of an integral of geodesic distance

Let $(M,g)$ be an $m$-dimensional Riemannian symmetric space and $d(\cdot,\cdot)$ be the geodesic distance function. Fix any $\alpha\in M$ and $v\in T_\alpha M$ with $\|v\|=1$. Q1: Define $$ g(t)=\...
Hengchao Chen's user avatar
3 votes
1 answer
132 views

Existence of a density

Let $W: \mathbb R^d \to \mathbb R^{d \times d}$ be a matrix-valued function with domain $\mathbb R^d$ and taking values in the set of $d \times d$ real matrices, such that $W(x)$ is positive-definite ...
Aurelien's user avatar
  • 301
2 votes
1 answer
213 views

Is matrix B obtained from matrix A?

Assuming a matrix $\mathbf{A} \in \mathbb{R}^{4096 \times 4096}$ sampled from a standard normal distribution $N(0, 1)$, and another matrix $\mathbf{B} \in \mathbb{R}^{4096 \times 4096}$ either sampled ...
eternity's user avatar
0 votes
0 answers
163 views

Generalization of polynomial coefficients

I'm dealing with a hard combinatorial problem where for every positive integer value of a variable $n$ I have to calculate a list of numbers, specifically $n^2$, that depend on $n$ and its list index ...
Cardstdani's user avatar
1 vote
0 answers
47 views

Characterization of Gaussian Gram matrices

From Euclidean geometry we know that a matrix $C$ is a matrix of squared Euclidean distances between some points if and only if $-\frac{1}{2} H D H \succeq 0$ (positive semi-definite) with $H = (I - \...
Titouan Vayer's user avatar
0 votes
1 answer
142 views

Matrix-order derivatives (differentiating a function a matrix number of times)

I have been exploring methods of generalizing the order of derivatives to a broader range of inputs (such as real numbers, complex, and now matrices). We are very well familiar with integer-order ...
charlesalexanderlee's user avatar
1 vote
0 answers
86 views

Functional inequality with complex variables

I am interested in considering a function $C(\tau)$ of the complex variable $\tau = t + i\eta$ such that $C(\tau)$ is analytic for $\Re(\tau)=t>t_0\ge0$ $\exists$ a constant $C_0$ and a function $...
knuth's user avatar
  • 33
0 votes
0 answers
88 views

Separating orthogonal vectors in $\mathbb{C}^2$

Is it possible to partition $\mathbb{C}^2$ into two sets $S$ and $S'$ such that, given any two nonzero orthogonal vectors $\mathbf{v}$ and $\mathbf{w}$ of $\mathbb{C}^2$, one of them lies in $S$ and ...
GaussJordan's user avatar
5 votes
1 answer
103 views

Interpolation between two matrices so that $L^p$ norm is controlled

Assume to have two square matrices $A$ and $B$ acting on $\mathbb{R}^n$ such that all their entries are in the interval $[0,1]$ and such that $||Ax||_1 = ||x||_1$ and $||Bx||_\infty \leq ||x||_\infty$....
tommy1996q's user avatar
0 votes
1 answer
525 views

What is the mathematician's definition of the determinant? [closed]

I am trying really hard to find a good definition of the determinant. I have looked virtually every single resource online and everybody gives a different answer: sum of cofactors or minors https://...
Olórin's user avatar
  • 179
4 votes
0 answers
97 views

The spectra of Hodge-Laplace operators

If we have a sequence of linear maps and finite dimensional inner product spaces $$X\xrightarrow{f} Y\xrightarrow{g}Z$$ such that $g\circ f=0$, then we can consider the Hodge-Laplace operator $$\Delta:...
Mariano Suárez-Álvarez's user avatar
0 votes
0 answers
19 views

Efficient Solution for tridiagonal solving with repeated coefficient lines

I working to speedup calls to LAPACK dgtsv for a specific case, where the the coefficients lines have 2 blocks of repeated coefficients and 3 distinct lines (first, "border" and last) First ...
Yair Lenga's user avatar
0 votes
0 answers
29 views

How to synthetize a controller $\dot{u} = F x + G u$ which stabilizes $\dot{x} = Ax + Bu$?

$\textbf{Introduction}$: I study linear control theory. Among strategies, we begin with vector field $Ax + Bu$, $A \in M_{n^2}(\mathbb{R})$, $B \in M_{n \times m}(\mathbb{R})$, and synthesize a ...
Usuário 6789's user avatar
1 vote
1 answer
71 views

Can non-periodic discrete auto-correlation be inversed?

I'm trying to understand whether discrete auto-correlation can be reversed. That is, we are given $t_0, \dots, t_n \in \mathbb C$ and a set of equations $$ t_{k} = \sum\limits_{i=0}^{n-k} b_i b_{i+k}, ...
Oleksandr  Kulkov's user avatar
7 votes
1 answer
307 views

Efficiently solve the Sylvester equation $AX+XA = C$ where $X$ is skew-symmetric

Is there a way (more efficient than the standard vectorization) to solve the following Sylvester equation in the skew-symmetric matrix $X$ $$AX+XA = C$$ where the matrix $A$ is symmetric positive ...
Gabi's user avatar
  • 173
4 votes
0 answers
1k views

Number of arrangements that contain at least 1 path from top to bottom of 2D matrix

I have a $n\times n$ matrix of objects. $n'$ objects are black, and the rest $n^2-n'$ are white. With that information, I can easily calculate the total number of black element arrangements that exist ...
Cardstdani's user avatar
4 votes
0 answers
262 views

Two questions about three circulant matrices

Consider the following matrix equation in $n \times n$ circulant $\pm 1$ matrices $A$, $B$, $C$ $$2AA^T+BB^T+CC^T=(4n+4)I-4J$$ where $I$ is the $n \times n$ identity matrix and $J$ is the $n×n$ matrix ...
user369335's user avatar
6 votes
2 answers
647 views

Is there a name for matrices of the form $a_{ij}=\frac{1}{a_{ji}}$?

I have a matrix that is “kind of symmetric.” Specifically, it is an $n \times n$ real matrix such that the entries $a_{ij}=1/a_{ji}$ whenever $j \ne i$. I want to investigate the properties of this ...
bryceadam1's user avatar
1 vote
0 answers
43 views

Intersection of unit-norm vectors with a large sum in high dimensions with a spherical cap

Let $d$ and $n$ be integers. For $i \in \lbrace 1,\dots,n \rbrace$ let $x_i \in \mathbb{R}^d$ be a vector such that $\lVert x \rVert=1 $. For a fixed $1/2 < \alpha \leq 1$, assume we have $\lVert \...
MMH's user avatar
  • 139
6 votes
0 answers
188 views

Expressing an invertible sparse matrix as a product of few elementary matrices

Let $M$ be an $n \times n$ matrix with integer entries. Suppose that $M$ is invertible (over the integers) and that $M$ has at most $An$ nonzero entries, each of which is less than $B$ in absolute ...
John Pardon's user avatar
  • 18.7k
7 votes
1 answer
894 views

Logical strength of a statement about vector spaces

[Apologies if this is a really trivial question, I know virtually nothing about set theory, and the following came up while preparing undergraduate linear algebra lectures.] I'm asking about the ...
David Loeffler's user avatar
3 votes
1 answer
68 views

What is the best known bound for the bilinear complexity of $4\times 4$ matrices product

Assume we work on the complex field $\mathbb{C}$. And we use $\langle p,q,r\rangle$ to denote the bilinear complexity of product of a $p\times q$ matrix and a $q\times r$. Recently I read a paper on ...
Nick Chen's user avatar
  • 151
0 votes
0 answers
36 views

Telling if matrix is contractive from the spectrum of its Choi-Jamiołkowski isomorphism?

Suppose $T$ is a ${d^2}\times {d^2}$ completely positive matrix, and $M$ is ${d^2}\times {d^2}$ matrix obtained by taking Choi-Jamiołkowski isomorphism of $T$. Is it possible to tell if $T$ is ...
Yaroslav Bulatov's user avatar
2 votes
0 answers
83 views

Closed form solutions to polynomial operator equations

To the best of my knowledge the problem at hand is a generalisation of monic matrix polynomials. Can a closed form solution to the following equation be found, $$u_3A_3X^3B_3 + u_2A_2X^2B_2 + ...
Septimus Boshoff's user avatar
1 vote
0 answers
152 views

Eigenvalues of an Infinite Matrix - No Diagonal Dominance

I was wondering if anyone could help me or point me to resources to find the eigenvalue of the following infinite matrix: $g_{ij}=\text{exp}\left(\frac{-i j}{2}\right)$. Most resources I have found ...
Ellio's user avatar
  • 11
5 votes
1 answer
186 views

What is expected (border) rank of the knonecker product of 3-tensors

Given two three order tensors $T$ and $S$ in $F^{m\times n\times p}$ and $F^{a\times b\times c}$. Clearly $\operatorname{rk}(T\otimes S)\le \operatorname{rk}(T)\operatorname{rk}(S)$. Does the equality ...
Nick Chen's user avatar
  • 151
0 votes
1 answer
104 views

How far is the slice rank of a tensor from its CP rank

Assume we work on any infinite field and 3-ordered tensor. Clearly for any tensor $T$, we have $\operatorname{srk}(T)\le \operatorname{rk}(T)$. Here, $\operatorname{srk}(T)$ (resp. $\operatorname{rk}(...
Nick Chen's user avatar
  • 151
2 votes
0 answers
119 views

Seeking insights on bounded set positive solutions for a set of linear systems in $\mathbb{R}^n$

Before delving into my query, I'd like to provide some context. Consider a continuous function $f:\mathbb{R}^{k}\rightarrow\mathbb{R}^{m}$ and a compact set $\mathcal{B}\subset \mathbb{R}^{k}$ (...
Diego Fonseca's user avatar
1 vote
2 answers
359 views

Recurrence relation with two variables

I am stuck on a recurrence relation with two variables. I'm familiar with techniques to solve recurrence relations with one variable and looked into ways to solve recurrence relations with multiple ...
user675763's user avatar
2 votes
0 answers
112 views

Invariant factors and commuting matrices over a discrete valuation ring

$\DeclareMathOperator\Im{Im}\DeclareMathOperator\Ker{Ker}$Let $A$ be a discrete valuation ring with uniformizer $p$. Let $X, Y\in M_n(A)$ be square matrices such that $XY=YX$, and let $X^T$, $Y^T$ be ...
Sylvain Brochard's user avatar
3 votes
0 answers
70 views

Admissibility of Ulm's invariants

Let $G$ be a reduced abelian $p$-group. We set $G_0=G$. Let $\alpha$ be an ordinal. Inductively, if $\alpha=\beta+1$ is a successor ordinal, we define $$G_{\alpha}=pG_{\beta}.$$ If $\alpha$ is a limit ...
Nini's user avatar
  • 31
3 votes
0 answers
239 views

Metrizing pointwise convergence of *sequences* of functionals in a dual space

This question was asked by myself on the math stackexchange a few days ago. I thought I'd repeat it here: Let $X$ be a normed, real vector space of uncountable dimension. Let $X^*$ denote the set of ...
Mustafa Motiwala's user avatar
3 votes
3 answers
421 views

Maximal set of $n$-bit strings that does not span $\mathbb{R}^n$

I am trying to find out the maximum-sized subset $S\subseteq \{0,1\}^n$ of $n$-bit strings that does not span $\mathbb{R}^n$. It is easy to show that $S$ has size at least $2^{n-1}$ when $S$ exactly ...
user43170's user avatar
2 votes
1 answer
423 views

Simple proof for convexity of a real valued matrix function

I am looking for a simple and short proof showing that $X \to \|X X^\top\|_F^2$ is a convex function where $\|\cdot\|_F$ is the Frobenius norm. I have one proof by showing that the derivative is ...
Titouan Vayer's user avatar
6 votes
1 answer
427 views

When are the chirp signals orthogonal?

Assume that we have two bounded-time chirp signals, \begin{align} x(t)&=\exp\Big(j\pi(\alpha t^2+\beta t+\gamma)\Big),\quad 0\leq t\leq T,\\ y(t)&=\exp\Big(j\pi(\alpha' t^2+\beta' t+\gamma')\...
Math_Y's user avatar
  • 287
2 votes
1 answer
264 views

Continuous path of unitary matrices with prescribed first column?

Consider a continuous curve $u \colon [0,1] \to \mathbb{C}^n$ where $u(t)$ is always a unit vector, $u(t)^* u(t) = 1$. Question 1: Does there exist a continuous curve $U \colon [0,1] \to \mathbb{C}^{n ...
ccriscitiello's user avatar
2 votes
0 answers
55 views

Quadratic surjective map between spheres

The quadratic function $f:\mathbb R^4\to\mathbb R^3$ $$f(a,b,c,d)=\begin{bmatrix} 2(ac + bd)&2(ad - bc)&a^2 + b^2 - c^2 - d^2\end{bmatrix}$$ surjectively maps the sphere $S^3$ to the sphere $S^...
rikhavshah's user avatar
7 votes
2 answers
347 views

Matrices over $\mathbb{F}_p$ that have nonzero determinant under any element permutation

$\DeclareMathOperator\GL{GL}$A few months ago, the following discussion took place on AoPS, concerning matrices that have nonzero determinant under any permutation of their entries: https://...
TheBestMagician's user avatar
5 votes
0 answers
169 views

Is there a sharper Golden–Thompson inequality?

For any two Hermitian matrices $A$ and $B$, the Golden–Thompson inequality $$\mathrm{Tr} (e^A e^B) \geq \mathrm{Tr} \, e^{A + B}$$ holds, and it is known to be a strict inequality whenever $[A, B] \...
Karen H.'s user avatar
1 vote
1 answer
184 views

Average distance between points of lower dimensional simplices in $\mathbb R^n$

Notation: By a simplex, we mean the convex hull of a finite set of distinct points in $\mathbb R^n$, which are called the vertices of the simplex. $\mathcal H^n$ will denote the $n$-dimensional ...
Nate River's user avatar
  • 6,155
3 votes
1 answer
332 views

Sparse representation for continuous function?

I recently came across the field of "Sparse representation". A talk is given here : https://www.youtube.com/watch?v=2bW4TkfTk-M. The goal of sparse representation is taking a signal and ...
user8469759's user avatar
3 votes
1 answer
155 views

Does this matrix equation always have a solution?

Let $\{A_i, i\ge 3\}$ be the matrices whose columns represent numbers from $0$ to $2^i-1$ in binary form. For example, $A_3 = \begin{bmatrix} 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 \...
Arnaud Casteigts's user avatar
1 vote
1 answer
142 views

Diagonalizability, orthogonal diagonalizability of higher order tensors and their being or not being dense in some suitable topology

For our discussion, we'll assume that we're working with $\mathbb{R}^m$ only, but much or all of the following discussion should be carried over immediately to any finite dimensional inner product ...
Learning math's user avatar
1 vote
0 answers
33 views

Eigendecomposition of hyper-complex multiplication

There is an isomorphism between quaternions and $4\times 4$ matrices: $$ \phi: a+bi+cj+dk \longmapsto \begin{pmatrix} a&b&c&d \\ -b&a&-d&c\\ -c&d&a&-b\\ -d&-c&...
Oleksandr  Kulkov's user avatar
3 votes
1 answer
233 views

On infinity-morphisms between algebras over algebraic operads

I posted this question in the "Mathematics" stack exchange, but it hasn't got much attention... I hope it will get more here. Let $P$ be a Koszul operad. In the book of Loday-Vallette "...
groupoid's user avatar
  • 215
2 votes
1 answer
129 views

Bounding the size of subspaces of $\mathbb{Z}^n$

For a subgroup $V$ of $\mathbb{Z}^n$, define $\Vert V \Vert$ to be the smallest $k$ such that $V$ is generated by its intersection with the closed $k$-ball around the origin in $\mathbb{R}^n$. Also, ...
Miranda's user avatar
  • 23

1
5 6
7
8 9
119