Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Completion of Brauer's theorem on group characters.
Date
1975
Author
Önal, Hayri
Metadata
Show full item record
Item Usage Stats
55
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/3072
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Construction of self dual codes from graphs
Fellah, Nazahet; Guenda, Kenza; Özbudak, Ferruh; Seneviratne, Padmapani (2022-07-01)
In this work we define and study binary codes C-q,C-k and (C-q,C-k) over bar obtained from neighbor- hood designs of Paley-type bipartite graphs P(q, k) and their complements, respectively for q an odd prime. We prove that for some values of q and k the codes C-q,C-k are self-dual and the codes (C-q,C-k) over bar are self-orthogonal. Most of these codes tend to be with optimal or near optimal parameters. Next, we extend the codes C(q,k )to get doubly even self dual codes and find that most of these codes ar...
Characterization of quasidiagonal isomorphisms between some types of Köthe spaces
Sözen, Yaşar; Nurlu, Zafer; Department of Mathematics (1996)
Proof of the basic theorem on concept lattices in Isabelle/HOL
Sertkaya, Barış; Oğuztüzün, Mehmet Halit S.; Tiefenbach, Andreas; Department of Computer Engineering (2003)
Formel Concept Analysis is an emerging field of applied mathematics based on a lattice-theoretic formalization of the notions of concept and conceptual hierarchy. It thereby facilitates mathematical thinking for conceptual data analysis and knowledge processing. Isabelle, on the other hand, is a generic interactive theory development environment for implementing logical formalisms. It has been instantiated to support reasoning in several object-logics. Specialization of Isabelle for Higher Order Logic is ca...
Proof of the basic theorem on concept lattices in Isabelle/HOL
Sertkaya, B; Oğuztüzün, Mehmet Halit S. (2004-01-01)
This paper presents a machine-checked proof of the Basic Theorem on Concept Lattices, which appears in the book "Formal Concept Analysis" by Canter and Wille, in the Isabelle/HOL Proof Assistant. As a by-product, the underlying lattice theory by Kammueller has been extended.
Construction of surface bundles with nonzero signature.
Arıkan, Mehmet Fırat; Önder, Turgut; Department of Mathematics (2002)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. Önal, “Completion of Brauer’s theorem on group characters.,” Middle East Technical University, 1975.