English
Related papers

Related papers: Simultaneous similarity and triangularization of s…

200 papers

Canonical matrices are given for (a) bilinear forms over an algebraically closed or real closed field; (b) sesquilinear forms over an algebraically closed field and over real quaternions with any nonidentity involution; and (c) sesquilinear…

Representation Theory · Mathematics 2007-12-17 Roger A. Horn , Vladimir V. Sergeichuk

Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…

Computational Complexity · Computer Science 2008-05-19 Jarek Duda

Two (real or complex) $m\times n$ matrices $A$ and $B$ are said to be parallel (resp. triangle equality attaining, or TEA in short) with respect to the spectral norm $\|\cdot\|$ if $\|A+ \mu B\| = \|A\| + \|B\|$ for some scalar $\mu$ with…

Rings and Algebras · Mathematics 2024-08-14 Chi-Kwong Li , Ming-Cheng Tsai , Ya-Shu Wang , Ngai-Ching Wong

We consider several ways of decomposing models into parts of bounded size forming a congruence over a base, and show that admitting any such decomposition is equivalent to mutual algebraicity at the level of theories. We also show that a…

Logic · Mathematics 2022-08-11 Samuel Braunfeld , Michael C Laskowski

A (positive definite integral) quadratic form is called almost 2-universal if it represents all (positive definite integral) binary quadratic forms except those in only finitely many equivalence classes. Oh [7] determined all almost…

Number Theory · Mathematics 2019-01-25 Myeong Jae Kim

For given k distinct complex conjugate pairs, l distinct real numbers, and a given graph G on 2k+l vertices with a matching of size at least k, we will show that there is a real matrix whose eigenvalues are the given numbers and its graph…

Spectral Theory · Mathematics 2018-03-16 Keivan Hassani Monfared

We present a necessary and sufficient condition for a 3 by 3 matrix to be unitarily equivalent to a symmetric matrix with complex entries, and an algorithm whereby an arbitrary 3 by 3 matrix can be tested. This test generalizes to a…

Functional Analysis · Mathematics 2009-08-18 James E. Tener

We prove that two general ternary forms are simultaneously identifiable only in the classical cases of two quadratic and a cubic and a quadratic form. We translate the problem into the study of a certain linear system on a projective bundle…

Algebraic Geometry · Mathematics 2022-06-08 Valentina Beorchia , Francesco Galuppi

In the first part of this paper we give an elementary proof of the fact that if an infinite matrix $A$, which is invertible as a bounded operator on $\ell^2$, can be uniformly approximated by banded matrices then so can the inverse of $A$.…

Statistics Theory · Mathematics 2010-02-25 Peter J. Bickel , Marko Lindner

If a tuple of matrices has a common invariant subspace, its projective joint spectrum has an algebraic component. In general, the converse is not true, and there might be algebraic components in the projective joint spectrum without…

Functional Analysis · Mathematics 2025-09-09 Michael Stessin , Rongwei Yang

Consider the special linear group of degree $2$ over an arbitrary finite field, acting on the full space of $2 \times 2$-matrices by transpose. We explicitly construct a generating set for the corresponding modular matrix invariant ring,…

Commutative Algebra · Mathematics 2026-03-20 Yin Chen , Shan Ren

We describe a class of matrices whose determinants are trivial to compute. A nice example of such a matrix is given by considering the symmetric matrix with entries {i+j choose i} (mod 2) in {0,1}, 0 <= i,j < n the binomial coefficients…

Rings and Algebras · Mathematics 2007-05-23 Roland Bacher

An infinite real sequence $\{a_n\}$ is called an invariant sequence of the first (resp., second) kind if $a_n=\sum_{k=0}^n {n \choose k} (-1)^k a_k$ (resp., $a_n=\sum_{k=n}^{\infty} {k \choose n} (-1)^k a_k$). We review and investigate…

Combinatorics · Mathematics 2017-06-07 Ik-Pyo Kim , Michael J. Tsatsomeros

We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…

Computational Complexity · Computer Science 2024-01-22 Anuj Dawar , Gregory Wilsenach

Invariants allow to classify images up to the action of a group of transformations. In this paper we introduce notions of the algebras of simultaneous polynomial and rational 2D moment invariants and prove that they are isomorphic to the…

Computer Vision and Pattern Recognition · Computer Science 2019-09-04 Leonid Bedratyuk

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation E x' + A x = 0. Such an equation is invariant by changes of variables,…

Numerical Analysis · Mathematics 2012-05-08 Olivier Verdier

Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…

Rings and Algebras · Mathematics 2007-05-23 Vijay Kodiyalam , K. N. Raghavan

We tackle the problem of attributed graph transformations and propose a new algorithmic approach for defining parallel graph transformations allowing overlaps. We start by introducing some abstract operations over graph structures. Then, we…

Logic in Computer Science · Computer Science 2018-08-10 Thierry Boy de la Tour , Rachid Echahed

We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity and linear minors of a matrix, which consists of…

Data Structures and Algorithms · Computer Science 2022-09-27 Édouard Bonnet , Ugo Giocanti , Patrice Ossona de Mendez , Stéphan Thomassé