Atalan, Ferihe
Loading...
Name Variants
Ozan, Ferihe Atalan
Ferihe Atalan
Atalan,F.
Atalan,Ferihe
Ferihe, Atalan
A., Ferihe
A.,Ferihe
Atalan, Ferihe
F.,Atalan
Atalan F.
F., Atalan
Ferihe Atalan
Atalan,F.
Atalan,Ferihe
Ferihe, Atalan
A., Ferihe
A.,Ferihe
Atalan, Ferihe
F.,Atalan
Atalan F.
F., Atalan
Job Title
Profesör Doktor
Email Address
ferihe.atalan@atilim.edu.tr
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Scholarly Output
17
Articles
14
Citation Count
27
Supervised Theses
3
17 results
Scholarly Output Search Results
Now showing 1 - 10 of 17
Article Citation Count: 0CONNECTEDNESS OF THE CUT SYSTEM COMPLEX ON NONORIENTABLE SURFACES(Univ Kragujevac, Fac Science, 2022) Ali, Fatema; Atalan, Ferihe; MathematicsLet N be a compact, connected, nonorientable surface of genus g with n boundary components. In this note, we show that the cut system complex of N is connected for g < 4 and disconnected for g >= 4. We then define a related complex and show that it is connected for g >= 4.Article Citation Count: 1On a Quadratic Eigenvalue Problem and its Applications(Springer Basel Ag, 2013) Atalan, Ferihe; Guseinov, Gusein Sh; MathematicsWe investigate the eigenvalues and eigenvectors of a special quadratic matrix polynomial and use the results obtained to solve the initial value problem for the corresponding linear system of differential equations.Article Citation Count: 1Number of pseudo–Anosov elements in the mapping class group of a four–holed sphere(2010) Ozan, Ferihe Atalan; Korkmaz, Mustafa; MathematicsWe compute the growth series and the growth functions of reducible and pseudo-Anosov elements of the pure mapping class group of the sphere with four holes with respect to a certain generating set. We prove that the ratio of the number of pseudo-Anosov elements to that of all elements in a ball with center at the identity tends to one as the radius of the ball tends to infinity.Article Citation Count: 5Number of pseudo-Anosov elements in the mapping class group of a four-holed sphere(Tubitak Scientific & Technological Research Council Turkey, 2010) Atalan, Ferihe; Korkmaz, Mustafa; MathematicsWe compute the growth series and the growth functions of reducible and pseudo-Anosov elements of the pure mapping class group of the sphere with four holes with respect to a certain generating set We prove that the ratio of the number of pseudo-Anosov elements to that of all elements in a ball with center at the identity tends to one as the radius of the ball tends to infinityArticle Citation Count: 0MOVES ON CURVES ON NONORIENTABLE SURFACES(Rocky Mountain Mathematics Consortium, 2022) Atalan,F.; Yurttaş,S.Ö.; MathematicsLet Ng,n denote a nonorientable surface of genus g with n punctures and one boundary component. We give an algorithm to calculate the geometric intersection number of an arbitrary multicurve L with so-called relaxed curves in Ng,n making use of measured π1-train tracks. The algorithm proceeds by the repeated application of three moves which take as input the measures of L and produces as output a multicurve L′ which is minimal with respect to each of the relaxed curves. The last step of the algorithm calculates the number of intersections between L′ and the relaxed curves. © Rocky Mountain Mathematics Consortium.Article Citation Count: 0Solving an initial boundary value problem on thesemiinfinite interval(2016) Atalan, Ferihe; Guseınov, Gusein Sh.; MathematicsWe explore the sign properties of eigenvalues and the basis properties of eigenvectors for a special quadratic matrix polynomial and use the results obtained to solve the corresponding linear system of differential equations on the half line subject to an initial condition at t = 0 and a condition at t = ∞.Article Citation Count: 1Solving an initial boundary value problem on the semiinfinite interval(Tubitak Scientific & Technological Research Council Turkey, 2016) Atalan, Ferihe; Guseinov, Gusein Sh.; MathematicsWe explore the sign properties of eigenvalues and the basis properties of eigenvectors for a special quadratic matrix polynomial and use the results obtained to solve the corresponding linear system of differential equations on the half line subject to an initial condition at t = 0 and a condition at t = infinity.Article Citation Count: 5Automorphisms of the mapping class group of a nonorientable surface(Springer, 2017) Atalan, Ferihe; Szepietowski, Blazej; MathematicsLet S be a nonorientable surface of genus g >= 5 with n >= 0 punctures, and Mod(S) its mapping class group. We define the complexity of S to be the maximum rank of a free abelian subgroup of Mod(S). Suppose that S-1 and S-2 are two such surfaces of the same complexity. We prove that every isomorphism Mod(S-1) -> Mod(S-2) is induced by a diffeomorphism S-1 -> S-2. This is an analogue of Ivanov's theorem on automorphisms of the mapping class groups of an orientable surface, and also an extension and improvement of the first author's previous result.Article Citation Count: 9Automorphisms of curve complexes on nonorientable surfaces(European Mathematical Soc, 2014) Atalan, Ferihe; Korkmaz, Mustafa; MathematicsFor a compact connected nonorientable surface N of genus g with n boundary components, we prove that the natural map from the mapping class group of N to the automorphism group of the curve complex of N is an isomorphism provided that g + n >= 5. We also prove that two curve complexes are isomorphic if and only if the underlying surfaces are diffeomorphic.Article Citation Count: 0MOVES ON CURVES ON NONORIENTABLE SURFACES(Rocky Mt Math Consortium, 2022) Atalan, Ferihe; Yurttas, S. Oyku; MathematicsLet Ng,n denote a nonorientable surface of genus g with n punctures and one boundary component. We give an algorithm to calculate the geometric intersection number of an arbitrary multicurve d. with so-called relaxed curves in Ng,n making use of measured n1-train tracks. The algorithm proceeds by the repeated application of three moves which take as input the measures of d. and produces as output a multicurve d.' which is minimal with respect to each of the relaxed curves. The last step of the algorithm calculates the number of intersections between d.' and the relaxed curves.
