On a 2-dimensional equipartition problem

The present paper deals with the following problem, which arises in a variety of applications: given a node-weighted rectangular grid graph, perform p horizontal full cuts and q vertical ones so as to make the weights of the resulting (p+1)(q+1) rectangular subgrids “as close as possible”. Computational complexity aspects are discussed. Several heuristic algorithms for obtaining partitions which minimize the maximum weight of a subgrid are developed, and computational results are reported. Theoretical bounds on the approximation error are also given.     

Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories

In this paper we study local induction w.r.t. Σ₁‐formulas over the weak arithmetic . The local induction scheme, which was introduced in 7 , says roughly this: for any virtual class that is progressive, i.e., is closed under zero and successor, and for any non‐empty virtual class that is definable by a Σ₁‐formula without parameters, the intersection of and is non‐empty. In other words, we have, for all Σ₁‐sentences S, that S implies , whenever is progressive. Since, in the weak context, we have (at least) two definitions of Σ₁, we obtain two minimal theories of local induction w.r.t. Σ₁‐formulas, which we call Peano Corto and Peano Basso. In the paper we give careful definitions of Peano Corto and Peano Basso. We establish their naturalness both by giving a model theoretic characterization and by providing an equivalent formulation in terms of a sentential reflection scheme. The theories Peano Corto and Peano Basso occupy a salient place among the sequential theories on the boundary between weak and strong theories. They bring together a powerful collection of principles that is locally interpretable in . Moreover, they have an important role as examples of various phenomena in the metamathematics of arithmetical (and, more generally, sequential) theories. We illustrate this by studying their behavior w.r.t. interpretability, model interpretability and local interpretability. In many ways the theories are more like Peano arithmetic or Zermelo Fraenkel set theory, than like finitely axiomatized theories as Elementary Arithmetic, and . On the one hand, Peano Corto and Peano Basso are very weak: they are locally cut‐interpretable in . On the other hand, they behave as if they were strong: they are not contained in any consistent finitely axiomatized arithmetical theory, however strong. Moreover, they extend , the theory of parameter‐free Π₁‐induction.     

On 2-dimensional Laguerre planes of shift type

We construct 2-dimensional Laguerre planes of shift type and determine the automorphism groups and isomorphism classes of these planes. Laguerre planes of shift type occur in the classification of 2-dimensional Laguerre planes with 4-dimensional automorphism groups that fix precisely one parallel class.     

从无穷维可积Hamilton系统到有限维可积Hamilton系统的一个一般途径

本文综述了作者关于将无穷维可积Ｈａｍｉｌｔｏｎ系统（ＩＤＩＨＳ）分解为两个可交换的有限维可积Ｈａｍｉｌｔｏｎ系统（ＦＤＩＨＳ）的一般途径方面能做的工作，该途径提出了联系势和特征函数的一般约束（包括高阶约束），提供了从ＩＤＩＨＳ到ＦＤＩＨＳ的一般方法；在零曲率表示理论框架内，统一处理了一族ＩＤＩＨＳ的分解；证明了在一般约束下，一族ＩＤＩＨＳ中的每一个都可以分解为两个可交换的ｘ－和ｔｎ－ＦＤＩＨＳ；建     

On some variational problems for 2-dimensional Hermitian metrics

Summary Let (M, J, g) be a compact complex 2-dimensional Hermitian manifold with the Kähler form , and the torsion 1-form defined by d = . In this note we obtain the Euler-Lagrange equations for the variational functionals defined by ² and d², whereg runs in the space of all the Hermitian metrics onM. In the first case, the extremals are precisely the Kähler metrics [Gd]. In the second case, we also write down a formula for the second variation.Communicated by J. Szenthe     

On 2-dimensional Simple Sets in n-dimensional Cubic Grids

Preserving topological properties of objects during reduction procedures is an important issue in the field of discrete image analysis. Such procedures are generally based on the notion of simple point, the exclusive use of which may result in the appearance of “topological artifacts.” This limitation leads to consider a more general category of objects, the simple sets, which also enable topology-preserving image reduction. A study of two-dimensional simple sets in two-dimensional spaces has been proposed recently. This article is devoted to the study of two-dimensional simple sets in spaces of higher dimension (i.e., n-dimensional spaces, n≥3). In particular, several properties of minimal simple sets (i.e., which do not strictly include any other simple sets) are proposed, leading to a characterisation theorem. It is also proved that the removal of a two-dimensional simple set from an object can be performed by only considering the minimal ones, thus authorising the development of efficient thinning algorithms.     

On a 2 + 1-dimensional Darboux system: Integrable and geometric connections

It is shown that a novel 2 + 1-dimensional system recently introduced by Konopelchenko and Rogers contains as a specialization the Zakharov-Manakov matrix triad system. The latter, in turn, in its scalar version yields a classical system investigated by Darboux in connection with conjugate coordinate systems. This Darboux system, in a 1 + 1-dimensional reduction, turns out to be connected to the self-induced transparency equations. Here, geometric aspects of the 2 + 1-dimensional Darboux systems are recorded.     

On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability

Reed-Solomon codes have gained a lot of interest due to its encoding simplicity, well structuredness and list-decoding capability [6] in the classical setting. This interest also translates to other metric setting, including the insertion and deletion (insdel for short) setting which is used to model synchronization errors caused by positional information loss in communication systems. Such interest is supported by the construction of a deletion correcting algorithm of insdel Reed-Solomon code in [22] which is based on the Guruswami-Sudan decoding algorithm [6]. Nevertheless, there have been few studies [3] on the insdel error-correcting capability of Reed-Solomon codes.In this paper, we discuss a criterion for a 2-dimensional insdel Reed-Solomon codes to have optimal asymptotic error-correcting capabilities, which are up to their respective lengths. Then we provide explicit constructions of 2-dimensional insdel Reed-Solomon codes that satisfy the established criteria. The family of such constructed codes can then be shown to extend the family of codes with asymptotic error-correcting capability reaching their respective lengths provided in [3, Theorem 2] which provide larger error-correcting capability compared to those defined in [25].     

(2+1)维破裂孤子方程及Kadomtsev-Petviashvili方程的Stable-range解法(英文)

By using Xu’s stable-range method,families of explicit exact solutions with multiple parameter functions for the(2+1)-dimensional breaking soliton and KadomtsevPetviashvili equations.These parameter functions make our solutions more applicable to related practical models and boundary value problems.     

A moving-mesh splitting scheme for 2-dimensional quenching problems

A novel moving-mesh adaptive finite difference method is proposed for solving 2-dimensional quenching differential equations of the form u_t = u_xx + u_yy + (κ – u)^–2. Splitting strategies equipped with proper arc-length adaptations are utilized to achieve the computational efficiency as well as accuracy of the numerical solution of the potentially singular problems. Important results including the monotonicity of the nonlinear finite difference scheme are given. Simulation validations are provided to further demonstrate our conclusions. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the structure of the automorphism group of 2-dimensional Laguerre planes

In this note we consider 2-dimensional Laguerre planes and prove structure theorems on their automorphism group . In particular, we look at connected locally simple Lie subgroups of and the factor group / of a connected closed subgroup of over the kernel of the action of on the set of parallel classes. The informations obtained will be useful in the later classification of 2-dimensional Laguerre planes having a 4-dimensional automorphism group.Dedicated to Professor H. Salzmann on the occasion of his 60th birthday     

On the local time of random walk on the 2-dimensional comb

We study the path behaviour of general random walks, and that of their local times, on the 2-dimensional comb lattice C² that is obtained from Z² by removing all horizontal edges off the x-axis. We prove strong approximation results for such random walks and also for their local times. Concentrating mainly on the latter, we establish strong and weak limit theorems, including Strassen-type laws of the iterated logarithm, Hirsch-type laws, and weak convergence results in terms of functional convergence in distribution.     

On the integrability of the (1+1)-dimensional and (2+1)-dimensional Ito equations

Under investigation in this paper are the (1+1)-dimensional and (2+1)-dimensional Ito equations. With the help of the Bell polynomials method, Hirota bilinear method and symbolic computation, the bilinear representations, N-soliton solutions, bilinear Bäcklund transformations and Lax pairs of these two equations are obtained, respectively. In particular, we obtain a new bilinear form and N-soliton solutions of the (2+1)-dimensional Ito equation. The bilinear Bäcklund transformation and Lax pair of the (2+1)-dimensional Ito equation are also obtained for the first time. Copyright © 2014 John Wiley & Sons, Ltd.