English
Related papers

Related papers: Gram mates, sign changes in singular values, and i…

200 papers

Let $\mathbb F$ be an algebraically closed field, $G$ be an abelian group, and let $A$ and $B$ be arbitrary finite-dimensional $G$-graded simple algebras over $\mathbb F$. We prove that $A$ and $B$ are isomorphic if, and only if, they…

Rings and Algebras · Mathematics 2019-05-14 Angelo Bianchi , Diogo Diniz

A rank $n$ generalized Baumslag-Solitar group is a group that splits as a finite graph of groups such that all vertex and edge groups are isomorphic to $\mathbb{Z}^n$. In this paper we classify these groups in terms of their separability…

Group Theory · Mathematics 2025-01-31 Jone Lopez de Gamiz Zearra , Sam Shepherd

A linear isometry $R$ of $\mathbb{R}^d$ is called a similarity isometry of a lattice $\Gamma \subseteq \mathbb{R}^d$ if there exists a positive real number $\beta$ such that $\beta R\Gamma$ is a sublattice of (finite index in) $\Gamma$. The…

Metric Geometry · Mathematics 2020-11-03 Jeanine Concepcion H. Arias , Manuel Joseph C. Loquias

In this paper we describe graded automorphisms and antiautomorphisms of finite order on matrix algebras endowed with a group gradings by a finite abelian group over an arbitrary algebraically closed field of charcteristic different from 2.

Rings and Algebras · Mathematics 2007-05-23 Yuri Bahturin , Mikhail Zaicev

We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in $\Sigma_2^p$. In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is…

Computational Complexity · Computer Science 2008-11-25 Raghavendra Rao B. V. , Jayalal M. N. Sarma

Given two tuples of subspaces, can you tell whether the tuples are isomorphic? We develop theory and algorithms to address this fundamental question. We focus on isomorphisms in which the ambient vector space is acted on by either a unitary…

Metric Geometry · Mathematics 2025-12-25 Emily J. King , Dustin G. Mixon , Shayne Waldron

For each natural number $n$, we define a category whose objects are discriminant algebras in rank $n$, i.e. functorial means of attaching to each rank-$n$ algebra a quadratic algebra with the same discriminant. We show that the discriminant…

Commutative Algebra · Mathematics 2016-12-07 Owen Biesel , Alberto Gioia

We define an equivalence relation called A-isotopy between finitely determined map-germs, which is a strengthened version of A-equivalence. We consider the number of A-isotopy classes of equidimensional Morin singularities, and some other…

Geometric Topology · Mathematics 2015-10-14 Kentaro Saji

In this paper we parameterize non-negative matrices of sum one and rank at most two. More precisely, we give a family of parameterizations using the least possible number of parameters. We also show how these parameterizations relate to a…

Computation · Statistics 2009-11-10 Enrico Carlini , Fabio Rapallo

Checkered patterns are characterized by their square structure and the use of only two distinct colors. These colors are typically represented by two types of numerical sets: {1,0} and {1,-1}. Matrices based on {1,0} may seem identical to…

History and Overview · Mathematics 2025-09-22 Hideo Hirose

Bell and Zhang have shown that if $A$ and $B$ are two connected graded algebras finitely generated in degree one that are isomorphic as ungraded algebras, then they are isomorphic as graded algebras. We exploit this result to solve the…

Quantum Algebra · Mathematics 2018-05-16 Jason Gaddis

Let $A$ and $B$ be finite-dimensional simple algebras with arbitrary signature over an algebraically closed field. Suppose $A$ and $B$ are graded by a semigroup $S$ so that the graded identitical relations of $A$ are the same as those of…

Rings and Algebras · Mathematics 2019-10-07 Yuri Bahturin , Felipe Yasumura

Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…

Computational Complexity · Computer Science 2024-10-04 Abhranil Chatterjee , Sumanta Ghosh , Rohit Gurjar , Roshan Raj

Two matrices $A$ and $B$ are called unitary (resp. orthogonal) equivalent if $AU=VB$ for two unitary (resp. orthogonal) matrices $U$ and $V$. Using trace identities, criteria are given for simultaneous unitary, orthogonal or complex…

Rings and Algebras · Mathematics 2020-08-05 Naihuan Jing

We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…

Rings and Algebras · Mathematics 2019-05-06 Peter A. Brooksbank , E. A. O'Brien , James B. Wilson

For a given abelian group G, we classify the isomorphism classes of G-gradings on the simple Lie algebras of types A_n (n >= 1), B_n (n >= 2), C_n (n >= 3) and D_n (n > 4), in terms of numerical and group-theoretical invariants. The ground…

Rings and Algebras · Mathematics 2012-12-04 Yuri Bahturin , Mikhail Kotchetov

We investigate self-adjoint matrices $A\in\mathbb{R}^{n,n}$ with respect to their equivariance properties. We show in particular that a matrix is self-adjoint if and only if it is equivariant with respect to the action of a group…

Dynamical Systems · Mathematics 2019-09-24 Michael Dellnitz , Bennet Gebken , Raphael Gerlach , Stefan Klus

Let $\Gamma^{(x_0)}$ be a finite rooted tree, for which $\Gamma$ is the underlying tree and $x_0$ the root. Let $T$ be the Terwilliger algebra of $\Gamma$ with respect to $x_0$. We study the structure of the principal $T$-module. As a…

Combinatorics · Mathematics 2019-10-23 Shuang-Dong Li , Yi-Zheng Fan , Tatsuro Ito , Masoud Karimi , Jing Xu

In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…

Discrete Mathematics · Computer Science 2019-08-14 Stefan Klus , Tuhin Sahai

Let $\mathbb{D}$ be a division ring, and let ${\mathbb{D}}^{m\times n}$ be the set of $m\times n$ matrices over $\mathbb{D}$. Two matrices $A,B\in {\mathbb{D}}^{m\times n}$ are adjacent if ${\rm rank}(A-B)=1$. By the adjacency,…

Combinatorics · Mathematics 2017-05-22 Li-Ping Huang , Kang Zhao