English
Related papers

Related papers: Closure of Certain Matrix Varieties and Applicatio…

200 papers

It is known that that the centralizer of a matrix over a finite field depends, up to conjugacy, only on the type of the matrix, in the sense defined by J. A. Green. In this paper an analogue of the type invariant is defined that in general…

Group Theory · Mathematics 2013-10-22 John R. Britnell , Mark Wildon

This paper is concerned with the completion of the proof of the Bergman centralizer theorem by using generic matrices based on our previous quantization proof \cite{KBRZh}. Additionally, we establish that the algebra of generic matrices…

Rings and Algebras · Mathematics 2025-03-28 Alexei Belov-Kanel , Farrokh Razavinia , Wenchao Zhang

Based on the fact that every finite-dimensional algebra over a field is isomorphic to the centralizer of \textbf{two} matrices, we approach the representation theory of finite-dimensional algebras over fields by centralizers of matrices.…

Representation Theory · Mathematics 2025-11-13 Xiaogang Li , Changchang Xi

The centralizer algebra of a matrix consists of those matrices that commute with it. We investigate the basic representation-theoretic invariants of centralizer algebras, namely their radicals, projective indecomposable modules, injective…

Rings and Algebras · Mathematics 2010-12-22 Umesh V. Dubey , Amritanshu Prasad , Pooja Singla

The fact that each finite-dimensional algebra over a field is isomorphic to the centralizer of two matrices, has suggested to investigate representation theoretical problems of finite-dimensional algebras through centralizer algebras of…

Representation Theory · Mathematics 2026-03-24 Zhenxian Chen , Changchang Xi

In this paper we consider centralizers of single elements in Ore extensions of the ring of polynomials in one variable over a field. We show that they are commutative and finitely generated as an algebra. We also show that for certain…

Rings and Algebras · Mathematics 2019-07-24 Johan Richter , Sergei Silvestrov

We look at the centralizer in a semisimple algebraic group $G$ of a regular nilpotent element, and show that its closure in the wonderful compactification is isomorphic to the Peterson variety. It follows that the closure in the wonderful…

Representation Theory · Mathematics 2017-08-17 Ana Balibanu

Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit…

Combinatorics · Mathematics 2025-04-17 Santiago Barrera Acevedo , Padraig Ó Catháin , Heiko Dietrich , Ronan Egan

We give criteria for finite dimensionality or infinite dimensionality of the polynomial centralizer of the Lie algebra of a linear Lie group, in terms of invariants and relative invariants of the group. In the finite dimensional scenario…

Mathematical Physics · Physics 2007-05-23 G. Gaeta , S. Walcher

This paper is the second in a series investigating cartesian closed varieties. In first of these, we showed that every non-degenerate finitary cartesian variety is a variety of sets equipped with an action by a Boolean algebra B and a…

Operator Algebras · Mathematics 2024-08-06 Richard Garner

The closure of a Diximier sheet is the image of a generalized Grothendieck's simultaneous resolution. We show that the associated variety of simple affine vertex algebras is contained in the closure of the Diximier sheet when a…

Representation Theory · Mathematics 2024-12-23 Tomoyuki Arakawa , Vyacheslav Futorny , Libor Krizka

Let A be a finitely generated associative algebra over an algebraically closed field. We characterize the finite dimensional modules over A whose orbit closures are regular varieties.

Algebraic Geometry · Mathematics 2007-05-23 Nguyen Quang Loc , Grzegorz Zwara

We consider a generalization of low-rank matrix completion to the case where the data belongs to an algebraic variety, i.e. each data point is a solution to a system of polynomial equations. In this case the original matrix is possibly…

Machine Learning · Statistics 2017-03-29 Greg Ongie , Rebecca Willett , Robert D. Nowak , Laura Balzano

This paper addresses various questions about pairs of similarity classes of matrices which contain commuting elements. In the case of matrices over finite fields, we show that the problem of determining such pairs reduces to a question…

Group Theory · Mathematics 2014-02-26 John R. Britnell , Mark Wildon

Computational problems concerning the orbit of a point under the action of a matrix group occur throughout computer science, including in program analysis, complexity theory, quantum computation, and automata theory. In many cases the focus…

Computational Complexity · Computer Science 2025-11-18 Rida Ait El Manssour , George Kenison , Mahsa Shirmohammadi , Anton Varonka , James Worrell

A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.

Exactly Solvable and Integrable Systems · Physics 2009-11-11 F. Musso , A. Shabat

We present and expand some existing results on the Zariski closure of cyclic groups and semigroups of matrices. We show that, with the exclusion of isolated points, their irreducible components are toric varieties. Additionally, we…

Algebraic Geometry · Mathematics 2023-11-21 Francesco Galuppi , Mima Stanojkovski

This paper examines the properties of real symmetric square matrices with a constant value for the main diagonal elements and another constant value for all off-diagonal elements. This matrix form is a simple subclass of circulant matrices,…

Statistics Theory · Mathematics 2021-09-14 Ben O'Neill

A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.

Combinatorics · Mathematics 2019-10-31 Augusto Ferrante , Fabrizio Padula , Lorenzo Ntogramatzidis

We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…

Group Theory · Mathematics 2026-01-12 Willem A. de Graaf
‹ Prev 1 2 3 10 Next ›