2 citations · 3 across the 7 of their papers we have counts for
12 papers
Essential algebra of the shifted Burnside biset functor with abelian shift
Olcay Coşkun, Ruslan Muslumov
Let be a finite group and let denote the shifted Burnside biset functor over a commutative ring . We study the essential algebra of at an a…
The functor of complex characters of finite groups
Mehmet Arslan, Olcay Coşkun
We determine the structure of the fibered biset functor sending a finite group to the complex vector space of complex valued class functions of . Previously, it is studied a…
Tower Diagrams and Pieri's Rule
Olcay Coşkun, Müge Taşkın
We introduce an algorithm to describe Pieri's Rule for multiplication of Schubert polynomials. The algorithm uses tower diagrams introduced by the authors and another new algorithm…
Obstructions for gluing biset functors
Olcay Coskun, Ergun Yalcin
We develop an obstruction theory for the existence and uniqueness of a solution to the gluing problem for a destriction functor and apply it to some well-known biset functors. The…
Fibered -biset functor structure of the fibered Burnside rings
Olcay Coşkun, Deniz Yılmaz
We determine the composition factors of the -fibered Burnside functor for -groups over a field of characteristic with and cyclic fiber group . We…
Fibered Biset Functors
Robert Boltje, Olcay Coşkun
The theory of biset functors, introduced by Serge Bouc, gives a unified treatment of operations in representation theory that are induced by permutation bimodules. In this paper, b…
The Dade group of Mackey functors for p-groups
Olcay Coşkun
We introduce endo-permutation Mackey functors and the Mackey-Dade group of a -group and study their basic properties. We exhibit relations between the Mackey-Dade group of a fin…
Inducing native Mackey functors to biset functors
Olcay Coşkun
In this paper, we describe the induction functor from the category of native Mackey functors to the category of biset functors for a finite group over an algebraically closed f…
Tower tableaux and Schubert polynomials
Olcay Coşkun, Müge Taşkın
We prove that the well-known condition of being a balanced labeling can be characterized in terms of the sliding algorithm on tower diagrams. The characterization involves a genera…
Sorting and generating reduced words
Olcay Coşkun, Müge Taşkın
We introduce a partial order on the set of all reduced words of a given permutation , called \emph{directed-braid poset} of . This poset enables us to produce two algorithms:…
Tower Tableaux
Olcay Coşkun, Müge Taşkın
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tow…
Gluing Borel-Smith functions and the group of endo-trivial modules
Olcay Coskun
The aim of this paper is to describe the group of endo-trivial modules for a -group , in terms of the obstruction group for the gluing problem of Borel-Smith functions.