scholarly journals Chern number formula for ramified coverings

2000 ◽  
Vol 52 (1) ◽  
pp. 1-15 ◽  
Author(s):  
Takeshi IZAWA
Author(s):  
Yunhyung Cho ◽  
Yoosik Kim

Abstract In this paper, we give a formula for the Maslov index of a gradient holomorphic disk, which is a relative version of the Chern number formula of a gradient holomorphic sphere for a Hamiltonian $S^1$-action. Using the formula, we classify all monotone Lagrangian fibers of Gelfand–Cetlin systems on partial flag manifolds.


2021 ◽  
Vol 103 (23) ◽  
Author(s):  
Shuwen Sun ◽  
Wei Qin ◽  
Leiqiang Li ◽  
Zhenyu Zhang

2021 ◽  
Vol 126 (5) ◽  
Author(s):  
Ze-Pei Cian ◽  
Hossein Dehghani ◽  
Andreas Elben ◽  
Benoît Vermersch ◽  
Guanyu Zhu ◽  
...  

2021 ◽  
Vol 24 (3) ◽  
Author(s):  
Alexander I. Bobenko ◽  
Ulrike Bücking

AbstractWe consider the class of compact Riemann surfaces which are ramified coverings of the Riemann sphere $\hat {\mathbb {C}}$ ℂ ̂ . Based on a triangulation of this covering we define discrete (multivalued) harmonic and holomorphic functions. We prove that the corresponding discrete period matrices converge to their continuous counterparts. In order to achieve an error estimate, which is linear in the maximal edge length of the triangles, we suitably adapt the triangulations in a neighborhood of every branch point. Finally, we also prove a convergence result for discrete holomorphic integrals for our adapted triangulations of the ramified covering.


2017 ◽  
Vol 10 (03) ◽  
pp. 1750057
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Sadegh Rahimi

The Wiener number [Formula: see text] of a graph [Formula: see text] was introduced by Harold Wiener in connection with the modeling of various physic-chemical, biological and pharmacological properties of organic molecules in chemistry. Milan Randić introduced a modification of the Wiener index for trees (acyclic graphs), and it is known as the hyper-Wiener index. Then Klein et al. generalized Randić’s definition for all connected (cyclic) graphs, as a generalization of the Wiener index, denoted by [Formula: see text] and defined as [Formula: see text]. In this paper, we establish some upper and lower bounds for [Formula: see text], in terms of other graph-theoretic parameters. Moreover, we compute hyper-Wiener number of some classes of graphs.


1991 ◽  
Vol 124 ◽  
pp. 133-144 ◽  
Author(s):  
Masanori Morishita

As an interpretation and a generalization of Gauss’ genus theory on binary quadratic forms in the language of arithmetic of algebraic tori, Ono [02] established an equality between a kind of “Euler number E(K/k)” for a finite Galois extension K/k of algebraic number fields and other arithmetical invariants associated to K/k. His proof depended on his Tamagawa number formula [01] and Shyr’s formula [Sh] which follows from the analytic class number formula of a torus. Later, two direct proofs were given by Katayama [K] and Sasaki [Sa].


2017 ◽  
Vol 09 (02) ◽  
pp. 1750023 ◽  
Author(s):  
Nacéra Meddah ◽  
Mustapha Chellali

A Roman dominating function (RDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the condition that every vertex [Formula: see text] with [Formula: see text] is adjacent to at least one vertex [Formula: see text] of [Formula: see text] for which [Formula: see text]. The weight of a RDF is the sum [Formula: see text], and the minimum weight of a RDF [Formula: see text] is the Roman domination number [Formula: see text]. A subset [Formula: see text] of [Formula: see text] is a [Formula: see text]-independent set of [Formula: see text] if every vertex of [Formula: see text] has at most one neighbor in [Formula: see text] The maximum cardinality of a [Formula: see text]-independent set of [Formula: see text] is the [Formula: see text]-independence number [Formula: see text] Both parameters are incomparable in general, however, we show that if [Formula: see text] is a tree, then [Formula: see text]. Moreover, all extremal trees attaining equality are characterized.


2015 ◽  
Vol 07 (04) ◽  
pp. 1550050
Author(s):  
Carlos J. Luz

For any graph [Formula: see text] Luz and Schrijver [A convex quadratic characterization of the Lovász theta number, SIAM J. Discrete Math. 19(2) (2005) 382–387] introduced a characterization of the Lovász number [Formula: see text] based on convex quadratic programming. A similar characterization is now established for the weighted version of the number [Formula: see text] independently introduced by McEliece, Rodemich, and Rumsey [The Lovász bound and some generalizations, J. Combin. Inform. Syst. Sci. 3 (1978) 134–152] and Schrijver [A Comparison of the Delsarte and Lovász bounds, IEEE Trans. Inform. Theory 25(4) (1979) 425–429]. Also, a class of graphs for which the weighted version of [Formula: see text] coincides with the weighted stability number is characterized.


2008 ◽  
Vol 17 (10) ◽  
pp. 1199-1221 ◽  
Author(s):  
TERUHISA KADOKAMI ◽  
YASUSHI MIZUSAWA

Based on the analogy between links and primes, we present an analogue of the Iwasawa's class number formula in a Zp-extension for the p-homology groups of pn-fold cyclic covers of a link in a rational homology 3-sphere. We also describe the associated Iwasawa invariants precisely for some examples and discuss analogies with the number field case.


Sign in / Sign up

Export Citation Format

Share Document