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
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
On the Maximal Matching Polytope
Date
2016-05-21
Author
Tural, Mustafa Kemal
Metadata
Show full item record
Item Usage Stats
54
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/80388
Collections
Unverified, Conference / Seminar
Suggestions
OpenMETU
Core
On the finite perimeter sets of sub-Lorentzian metric spaces
Çetin, Günseli; Sarıoğlu, Bahtiyar Özgür; Department of Physics (2022-8-25)
In this thesis, inspired by the recent progress on sub-Riemannian geometry, a method of determining the finite perimeter sets of sub-Lorentzian manifolds independent of the original metric structure is suggested and a possible version of Riesz Representation theorem is discussed.
On the non-linear congruential pseudorandom number generators.
Demirel, Funda; Department of Mathematics (1992)
On the modular curve X(6) and surfaces admitting genus 2 fibrations
Karadoğan, Gülay; Önsiper, Hurşit; Department of Mathematics (2001)
On the generating graphs of the symmetric and alternating groups
Erdem, Fuat; Ercan, Gülin; Maróti, Attila; Department of Mathematics (2018)
Dixon showed that the probability that a random pair of elements in the symmetric group $S_n$ generates $S_n$ or the alternating group $A_n$ tends to $1$ as $n to infty$. (A generalization of this result was given by Babai and Hayes.) The generating graph $Gamma(G)$ of a finite group $G$ is defined to be the simple graph on the set of non-identity elements of $G$ with the property that two elements are connected by and edge if and only if they generate $G$. The purpose of this thesis is to study the graphs ...
On a class of repeated root monomial like abelian codes
Martinez Moro, Edgar; Özadam, Hakan; Özbudak, Ferruh; szabo, steve (2015-04-01)
In this paper we study polycyclic codes of length p s 1 × ⋯ × p s n p s 1 ×⋯×p s n \ over $\F_{p^a}$\ generated by a single monomial. These codes form a special class of abelian codes. We show that these codes arise from the product of certain single variable codes and we determine their minimum Hamming distance. Finally we extend the results of Massey et. al. in \cite{MASSEY_1973} on the weight retaining property of monomials in one variable to the weight retaining property of monomials ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. K. Tural, “On the Maximal Matching Polytope,” 2016, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/80388.