No abstract uploaded!

For a Landau–Ginzburg space ([Cn/G], W), we construct Witten’s top Chern class as an algebraic cycle using cosection localized virtual cycles in the case where all sectors are narrow, verify all axioms of this class, and derive an explicit formula for it in the free case. We prove that this construction is equivalent to the constructions of Polishchuk–Vaintrob, Chiodo, and Fan– Jarvis–Ruan.

Xingdu is an emerging mathematical game about searching for a corresponding polyline for a given polyline in a 2-dimensional or 3-dimensional mesh grid, meanwhile the searched polyline should have the same start and end points as those of the given polyline and the corresponding line segments on the searched and given polylines are perpendicular each other respectively. Studying from mathematical perspective the problem solving and designing of Xingdu is helpful of finding a general method for Xingdu problem solving, but still not attract much more attentions due to the relatively short history of Xingdu. Referring to the achievements in mathematical methods for Sudoku, we investigated preliminarily the possibility of using optimization theory to solve the problem of Xingdu. According to the definition of Xingdu, the points on the given polyline and the solution polyline have to be the grid nodes in the mesh grid so that their coordinates are integer. In addition, there should not be any points appearing repeatedly and any three sequential points on the solution polyline cannot be located on a same line. Due to these constraints, the optimization problem related to Xingdu belongs to integer programming with nonlinear constraints, which is very difficult and usually can only be solved by enumerating. For this reason, we solve the related problem first by neglecting the nonlinear constraints so that it can be converted as an integer programming with linear constraints only. Afterwards, we can check whether it fulfill the related nonlinear constraints if a feasible solution is obtained. Based on that, we proposed two integer programming models for Xingdu problem, which are the model using only line segments perpendicular property as constraints and the binary integer programming model using line segments perpendicular property together with no repeated points as constraints. The test results show that the proposed binary integer programming model has a very good performance in finding the solution of Xingdu problem. We also discussed the possibility of using the proposed binary integer programming model together with random simulation to design a Xingdu problem. Due to the challenge of discriminating the uniqueness of Xingdu solution, we finally presented an approach, inspired from the branch and bound method for integer programming, which solves and designs the Xingdu problem by constructing and pruning a search tree.

No abstract uploaded!

Loewner’s equation provides a way to encode a simply connected domain or equivalently its uniformizing conformal map via a real-valued driving function of its boundary. The first main result of the present paper is that the Dirichlet energy of this driving function (also known as the Loewner energy) is equal to the Dirichlet energy of the log-derivative of the (appropriately defined) uniformizing conformal map. This description of the Loewner energy then enables to tie direct links with regularized determinants and Teichmüller theory: We show that for smooth simple loops, the Loewner energy can be expressed in terms of the zeta-regularized determinants of a certain Neumann jump operator. We also show that the family of finite Loewner energy loops coincides with the Weil–Petersson class of quasicircles, and that the Loewner energy equals to a multiple of the universal Liouville action introduced by Takhtajan and Teo, which is a Kähler potential for the Weil–Petersson metric on the Weil–Petersson Teichmüller space.