نتایج جستجو برای: frobenius representation theorem

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

Journal: :Mathematical Research Letters 2005

2008
J. VERCRUYSSE

We investigate functors between abelian categories having a left adjoint and a right adjoint that are similar (these functors are called quasi-Frobenius functors). We introduce the notion of a quasi-Frobenius bimodule and give a characterization of these bimodules in terms of quasi-Frobenius functors. Some applications to corings and graded rings are presented. In particular, the concept of qua...

2013
E. I. Khukhro

Suppose that a finite group G admits a Frobenius group of automorphisms FH of coprime order with cyclic kernel F and complement H such that the fixed point subgroup CG(H) of the complement is nilpotent of class c. It is proved that G has a nilpotent characteristic subgroup of index bounded in terms of c, |CG(F )|, and |F | whose nilpotency class is bounded in terms of c and |H| only. This gener...

2008
JEREMY LOVEJOY

We discuss conjugation and Dyson’s rank for overpartitions from the perspective of the Frobenius representation. More specifically, we translate the classical definition of Dyson’s rank to the Frobenius representation of an overpartition and define a new kind of conjugation in terms of this representation. We then use q-series identities to study overpartitions that are self-conjugate with resp...

2010
KEITH CONRAD

Representation theory was created by Frobenius about 100 years ago. We describe the background that led to the problem which motivated Frobenius to define characters of a finite group and show how representation theory solves the problem. The first results about representation theory in characteristic p are also discussed.

1999
JAY A. WOOD Edward F. Assmus

This paper sets a foundation for the study of linear codes over nite rings. The nite Frobenius rings are singled out as the most appropriate for coding theoretic purposes because two classical theorems of MacWilliams, the extension theorem and the MacWilliams identities, generalize from nite elds to nite Frobenius rings. It is over Frobenius rings that certain key identi cations can be made bet...

In this paper, a local approach to the concept of Hudetz $g$-entropy is presented. The introduced concept is stated in terms of Hudetz $g$-entropy. This representation is based on the concept of $g$-ergodic decomposition which is a result of the Choquet's representation Theorem for compact convex metrizable subsets of locally convex spaces.

Journal: :Electr. Notes Theor. Comput. Sci. 2015
Chris Heunen Martti Karvonen

We extend categorical semantics of monadic programming to reversible computing, by considering monoidal closed dagger categories: the dagger gives reversibility, whereas closure gives higher-order expressivity. We demonstrate that Frobenius monads model the appropriate notion of coherence between the dagger and closure by reinforcing Cayley’s theorem; by proving that effectful computations (Kle...

2004
Michael Larsen

This note is intended to provide the group-theoretic machinery for associating complex representations to certain modular forms. We recall [DS] that to a Hecke eigenform of weight 1 on GL2, we can associate a 2-dimensional compatible system of λ-adic representations. Rankin’s method shows that “on average” the eigenvalues of Frobenius are of O(1), and by a group-theoretic argument ([DS] §§7-8),...

2003
Geoffrey Mason Siu-Hung Ng

In this paper, we obtain a canonical central element νH for each semisimple quasiHopf algebraH over an algebraically closed field of char 0 and prove that νH is invariant under gauge transformations. Moreover, if H is a semisimple Hopf algebra or a twisted quantum double of a finite group, then χ(νH) is the Frobenius-Schur Indicator of the irreducible representation which affords the character ...

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

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