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
On the support genus of a contact structure
Date
2007-01-01
Author
Arıkan, Mehmet Fırat
Metadata
Show full item record
Item Usage Stats
331
views
0
downloads
Cite This
The algorithm given by Akbulut and Ozbagci constructs an explicit open book decomposition on a contact three-manifold described by a contact surgery on a link in the three-sphere. In this article, we will improve this algorithm by using Giroux’s contact cell decomposition process. In particular, our algorithm gives a better upper bound for the recently defined “minimal supporting genus invariant” of contact structures.
URI
https://hdl.handle.net/11511/77835
http://gokovagt.org/journal/2007/jggt07-arikan.pdf
Journal
Journal Gökova Geometry Topology
Collections
Department of Mathematics, Article
Suggestions
OpenMETU
Core
ON AN ADJACENCY CLUSTER MERIT
Volkovich, Zeev (Vladimir); Weber, Gerhard Wilhelm; Avros, Renata (2010-02-04)
This work is addressed to the problem of cluster validation to determine the right number of clusters. We consider a cluster stability property based on the k nearest neighbor type coincidences model. Cluster quality is measured by the deviations from this model such that good constructed clusters are typified by small departures values. The true number of clusters corresponds to the empirical deviation distribution having shortest right tail. The experiments carried out on synthetic and real databases demo...
Invariants of Legendrian Knots from Open Book Decompositions
Onaran, Sinem Celik (Oxford University Press (OUP), 2010-01-01)
In this note, we define a new invariant of a Legendrian knot in a contact 3-manifold using an open book decomposition supporting the contact structure. We define the support genus sg(L) of a Legendrian knot L in a contact 3-manifold (M, xi) as the minimal genus of a page of an open book of M supporting the contact structure xi such that L sits on a page and the framings given by the contact structure and the page agree. We show that any null-homologous loose knot in an overtwisted contact structure has supp...
On quasi-compactness of operator nets on Banach spaces
Emelyanov, Eduard (Institute of Mathematics, Polish Academy of Sciences, 2011-01-01)
The paper introduces a notion of quasi-compact operator net on a Banach space. It is proved that quasi-compactness of a uniform Lotz-Rabiger net (T(lambda))(lambda) is equivalent to quasi-compactness of some operator T(lambda). We prove that strong convergence of a quasi-compact uniform Lotz-Rabiger net implies uniform convergence to a finite-rank projection. Precompactness of operator nets is also investigated.
ON THE LATTICE STRUCTURE OF A NONLINEAR GENERATOR WITH MODULUS 2-ALPHA
EICHENAUERHERRMANN, J; GROTHE, H; NIEDERREITER, H; TOPUZOGLU, A (1990-07-24)
Nonlinear congruential pseudorandom number generators based on inversions have been introduced and analysed recently. These generators do not show the simple lattice structure of the widely used linear congruential generators which are too regular for certain simulation purposes. In the present paper a nonlinear congruential generator based on inversions with respect to a power of two modulus is considered. It is shown that the set of points formed by consecutive pseudorandom numbers has a more complicated ...
New Efficient Algorithms for Multiplication Over Fields of Characteristic Three
Cenk, Murat; Hasan, M. Anwar (2018-03-01)
In this paper, we first present an enhancement of the well-known Karatsuba 2-way and 3-way algorithms for characteristic three fields, denoted by where nae1. We then derive a 3-way polynomial multiplication algorithm with five 1/3 sized multiplications that use interpolation in . Following the computation of the arithmetic and delay complexity of the proposed algorithm, we provide the results of our hardware implementation of polynomial multiplications over and . The final proposal is a new 3-way polynomial...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. F. Arıkan, “On the support genus of a contact structure,”
Journal Gökova Geometry Topology
, pp. 92–115, 2007, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/77835.