نتایج جستجو برای: group determinant

تعداد نتایج: 1022156  

Journal: :international journal of group theory 0
naoya yamaguchi kyushu university

for any given finite abelian group‎, ‎we give factorizations of the group determinant in the group algebra of any subgroups‎. ‎the factorizations is an extension of dedekind's theorem‎. ‎the extension leads to a generalization of dedekind's theorem‎.

Journal: :Proceedings of the American Mathematical Society 1991

Journal: :Proceedings of the American Mathematical Society 1992

Journal: :Rocky Mountain Journal of Mathematics 2021

Frobenius is generally considered the creator of character theory finite groups. This achievement came from study group determinant, which determinant a matrix coming regular representation. We generalize several Frobenius’ results about and use them to find new formulation supercharacter in terms factorizations determinant.

2017
Ravindra B. Bapat Murali K. Srinivasan Ashish Mishra ASHISH MISHRA MURALI K. SRINIVASAN

We define the commuting algebra determinant of a finite group action on a finite set, a notion dual to the group determinant of Dedekind. We show that the following combinatorial example is a commuting algebra determinant. Let Bq(n) denote the set of all subspaces of an n-dimensional vector space over Fq. The type of an ordered pair (U, V ) of subspaces, where U, V ∈ Bq(n), is the ordered tripl...

Journal: :European Journal of Combinatorics 1995

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه اراک - دانشکده علوم پایه 1389

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

Journal: :transactions on combinatorics 2012
alireza abdollahi

we study the set of all determinants of adjacency matrices of graphs with a given number of vertices. using brendan mckay's data base of small graphs, determinants of graphs with at most $9$ vertices are computed so that the number of non-isomorphic graphs with given vertices whose determinants are all equal to a number is exhibited in a table. using an idea of m. newman, it is proved that if $...

Journal: :Journal of the Korean Mathematical Society 2007

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید