English
Related papers

Related papers: Spaces of triangularizable matrices

200 papers

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

Discrete Mathematics · Computer Science 2017-01-18 Joël Ouaknine , Amaury Pouly , João Sousa-Pinto , James Worrell

Let $b$ be a non-degenerate symmetric (respectively, alternating) bilinear form on a finite-dimensional vector space $V$, over a field with characteristic different from $2$. In a previous work, we have determined the maximal possible…

Rings and Algebras · Mathematics 2018-07-02 Clément de Seguins Pazzis

We establish an explicit link between depth-3 formulas and one-sided approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n)…

Computational Complexity · Computer Science 2017-05-11 Shuichi Hirahara

Let $n \in \N$ and $M_n$ be the algebra of $n \times n$ matrices. We call a function $f$ matrix monotone of order $n$ or $n$-monotone in short whenever the inequality $f(a) \leq f(b)$ holds for every pair of selfadjoint matrices $a, b \in…

Operator Algebras · Mathematics 2008-05-15 Hiroyuki Osaka , Jun Tomiyama

We show that the algebraic dimension of a twistor space over n#CP^2 cannot be two if n>4 and the fundamental system (i.e. the linear system associated to the half-anti-canonical bundle, which is available on any twistor space) is a pencil.…

Differential Geometry · Mathematics 2017-06-14 Nobuhiro Honda , Bernd Kreussler

Every triangle-free planar graph on n vertices has an independent set of size at least (n+1)/3, and this lower bound is tight. We give an algorithm that, given a triangle-free planar graph G on n vertices and an integer k>=0, decides…

Discrete Mathematics · Computer Science 2014-09-23 Zdenek Dvorak , Matthias Mnich

Let $A$ be the polynomial algebra in $r$ variables with coefficients in an algebraically closed field $k$. When the characteristic of $k$ is $2$, Carlsson conjectured that any $\mathrm{dg}$-$A$-module that is free of rank $N$ as an…

Commutative Algebra · Mathematics 2025-12-16 Berrin Şentürk

Gerstenhaber's theorem states that the dimension of the unital algebra generated by two commuting $n\times n$ matrices is at most $n$. We study the analog of this question for positive matrices with a positive commutator. We show that the…

Rings and Algebras · Mathematics 2016-06-23 Marko Kandić , Klemen Šivic

Given $n+1$ unit vectors in $\mathbf{R}^n$ or $\mathbf{C}^n,$ consider the absolute values of the determinants of the vectors taken $n$ at a time. By taking a geometric perspective, we show that the minimum of these determinants is…

Metric Geometry · Mathematics 2016-08-23 Mark Fincher

Let $\mathbb{F}$ be an infinite field with characteristic different from two. For a graph $G=(V,E)$ with $V={1,...,n}$, let $S(G;\mathbb{F})$ be the set of all symmetric $n\times n$ matrices $A=[a_{i,j}]$ over $\mathbb{F}$ with…

Combinatorics · Mathematics 2012-10-29 Hein van der Holst

Let K be a field of characteristic different from 2 and let V be a vector space of dimension n over K. Let M be a non-zero subspace of symmetric bilinear forms defined on V x V and let r=rank(M) denote the set of different positive integers…

Rings and Algebras · Mathematics 2018-01-26 Rod Gow

Let $F_n$ be an $n$ by $n$ symmetric matrix whose entries are bounded by $n^{\gamma}$ for some $\gamma>0$. Consider a randomly perturbed matrix $M_n=F_n+X_n$, where $X_n$ is a random symmetric matrix whose upper diagonal entries $x_{ij}$…

Combinatorics · Mathematics 2011-03-18 Hoi H. Nguyen

Let $\mathbb{F}$ be a field of characteristic different from $2$ and $3$, and let $V$ be a vector space of dimension $2$ over $\mathbb{F}$. The generic classification of homogeneous quadratic maps $f\colon V\to V$ under the action of the…

Representation Theory · Mathematics 2022-09-27 R. Durán Díaz , L. Hernández Encinas , J. Muñoz Masqué

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_q$ and ${V\brack k}$ denote the family of all $k$-dimensional subspaces of $V$. A family $\mathcal{F}\subseteq {V\brack k}$ is called $k$-uniform $r$-wise…

Combinatorics · Mathematics 2025-03-11 Haixiang zhang , Mengyu Cao , Mei Lu , Jiaying Song

Let $T$ be a linear operator on an $\mathbb{F}_q$-vector space $V$ of dimension $n$. For any divisor $m$ of $n$, an $m$-dimensional subspace $W$ of $V$ is $T$-splitting if $$ V =W\oplus TW\oplus \cdots \oplus T^{d-1}W, $$ where $d=n/m$. Let…

Combinatorics · Mathematics 2021-06-01 Divya Aggarwal , Samrith Ram

We show that every self--adjoint matrix B of trace 0 can be realized as B=T+T^* for a nilpotent matrix T of norm no greater than K times the norm of B, for a constant K that is independent of matrix size. More particularly, if D is a…

Operator Algebras · Mathematics 2013-03-01 Ken Dykema , Junsheng Fang , Anna Skripka

In this paper we announce a conjecture concerning enumeration of n-times persymmetric matrices over F_2 by rank. To justify our statement we remark that the formulas obtained are valid for n equal to one, two and three.

Combinatorics · Mathematics 2009-09-23 Jorgen Cherly

Let $f(n)$ be the largest integer such that every poset on $n$ elements has a $2$-dimensional subposet on $f(n)$ elements. What is the asymptotics of $f(n)$? It is easy to see that $f(n)\geqslant n^{1/2}$. We improve the best known upper…

Combinatorics · Mathematics 2017-11-28 Grzegorz Guśpiel , Piotr Micek , Adam Polak

Let K be an infinite field such that its characteristic is not 2. We show that, for every $A\in\mathcal{M}_n(K)$ such that $\mathrm{rank}(A)\geq n/2$, there exists $B\in\mathcal{M}_n(K)$ such that $B$ is similar to $A$ and $A+B$ is…

Rings and Algebras · Mathematics 2012-10-03 Gerald Bourgeois

An arc is a set of vectors of the $k$-dimensional vector space over the finite field with $q$ elements ${\mathbb F}_q$, in which every subset of size $k$ is a basis of the space, i.e. every $k$-subset is a set of linearly independent…

Combinatorics · Mathematics 2016-05-27 Simeon Ball