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
SYMPLECTIC GEOGRAPHY PROBLEM IN DIMENSION SIX
Date
2012-10-01
Author
Beyaz, Ahmet
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
202
views
0
downloads
Cite This
In this note, the geography problem in dimension four is reviewed and then its extension to dimension six for the symplectic case is explained. Finally some examples in dimension six are provided.
Subject Keywords
Symplectic
,
6-manifold
,
4-manifold
,
Geography
URI
https://hdl.handle.net/11511/53611
Journal
HACETTEPE JOURNAL OF MATHEMATICS AND STATISTICS
Collections
Department of Mathematics, Article
Suggestions
OpenMETU
Core
Distance-based discretization of parametric signal manifolds
Vural, Elif (2010-06-28)
The characterization of signals and images in manifolds often lead to efficient dimensionality reduction algorithms based on manifold distance computation for analysis or classification tasks. We propose in this paper a method for the discretization of signal manifolds given in a parametric form. We present an iterative algorithm for the selection of samples on the manifold that permits to minimize the average error in the manifold distance computation. Experimental results with image appearance manifolds d...
Complex and symplectic structures on panelled web 4-manifolds
Kalafat, Mustafa; Arguez, Huelya (2012-05-15)
We analyze the symplectic and complex structures on the panelled web 4-manifolds of S. Akbulut and M. Kalafat [1]. In particular, we give infinite families of examples of almost complex but not symplectic and not complex 4-manifolds in the non-simply connected case.
AN UPPER BOUND FOR THE LARGEST EIGENVALUE OF A GRAPH - EFFECT OF TYPES OF VERTICES
Türker, Burhan Lemi (Springer Science and Business Media LLC, 1992-01-01)
A novel method, based on the topology of the cardinal vertex, is described to find an upper bound for the largest eigenvalue of a graph.
A Numerical Investigationof VMS-POD Model for Darcy-Brinkman Equations
Güler Eroğlu, Fatma; Kaya Merdan, Songül; Rebholz, Leo (2018-07-06)
We extend the variational multiscale proper orthogonal decomposition reduced order modeling (VMSPOD) to flows governed by double diffusive convection. We present stability and convergence analyses for it, and give results for numerical tests on a benchmark problem which show it is an effective approach.
A local discontinuous Galerkin method for Dirichlet boundary control problems
Yücel, Hamdullah (null; 2018-10-20)
In this paper, we consider Dirichlet boundary control of a convection-diffusion equation with L 2 4 – 5 boundary controls subject to pointwise bounds on the control posed on a two dimensional convex polygonal domain. 6 We use the local discontinuous Galerkin method as a discretization method. We derive a priori error estimates for 7 the approximation of the Dirichlet boundary control problem on a polygonal domain. Several numerical results are 8 provided to illustrate the theoretical results.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Beyaz, “SYMPLECTIC GEOGRAPHY PROBLEM IN DIMENSION SIX,”
HACETTEPE JOURNAL OF MATHEMATICS AND STATISTICS
, pp. 709–713, 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53611.