带有给定凸切线多边形的保形五次样条逼近

本讨论带有给定切线多边形的保形逼近问题．给出了一条与给定切线多边形相切的保形五次参数祥条曲线。     

The completion of the classification of the regular near octagons with thick quads

Brouwer and Wilbrink [3] showed the nonexistence of regular near octagons whose parameters s, t₂, t₃ and t satisfy s ≥ 2, t₂ ≥ 2 and t₃ ≠ t₂(t₂+1). Later an arithmetical error was discovered in the proof. Because of this error, the existence problem was still open for the near octagons corresponding with certain values of s, t₂ and t₃. In the present paper, we will also show the nonexistence of these remaining regular near octagons. MSC2000 05B25, 05E30, 51E12 Postdoctoral Fellow of the Research Foundation - Flanders     

The valuations of the near hexagons related to the Witt designs S(5,6,12) and S(5,8,24)

Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??₁ and ??₂, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??₁ or ??₂, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??₁ or ??₂. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, t_i (0 ≤ i ≤ d) satisfy (s, t₂, t₃) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006     

Minkowski-type and Alexandrov-Type Theorems for Polyhedral Herissons

Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image.     

Fractional Power Series and Pairings on Drinfeld Modules

Let be an algebraically closed field containing which is complete with respect to an absolute value . We prove that under suitable constraints on the coefficients, the series converges to a surjective, open, continuous -linear homomorphism whose kernel is locally compact. We characterize the locally compact sub--vector spaces of which occur as kernels of such series, and describe the extent to which determines the series. We develop a theory of Newton polygons for these series which lets us compute the Haar measure of the set of zeros of of a given valuation, given the valuations of the coefficients. The ``adjoint' series converges everywhere if and only if does, and in this case there is a natural bilinear pairing

which exhibits as the Pontryagin dual of . Many of these results extend to non-linear fractional power series. We apply these results to construct a Drinfeld module analogue of the Weil pairing, and to describe the topological module structure of the kernel of the adjoint exponential of a Drinfeld module.

     

The Spin-Coating Process: Analysis of the Free Boundary Value Problem

In this paper, an accurate model of the spin-coating process is presented and investigated from the analytical point of view. More precisely, the spin-coating process is being described as a one-phase free boundary value problem for Newtonian fluids subject to surface tension and rotational effects. It is proved that for T > 0 there exists a unique, strong solution to this problem in (0, T) belonging to a certain regularity class provided the data and the speed of rotation are small enough in suitable norms. The strategy of the proof is based on a transformation of the free boundary value problem to a quasilinear evolution equation on a fixed domain. The keypoint for solving the latter equation is the so-called maximal regularity approach. In order to pursue in this direction one needs to determine the precise regularity classes for the associated inhomogeneous linearized equations. This is being achieved by applying the Newton polygon method to the boundary symbol.     

An exact construction of digital convex polygons with minimal diameter

Given a natural number n, an exact formula is derived for the minimal possible size MD(n) of a square grid, in which a digital convex n-gon can be inscribed. An exact construction of a digital convex n-gon which can be inscribed into a square grid of size MD(n) is also given.     

A practical algorithm for decomposing polygonal domains into convex polygons by diagonals

We present algorithms for decomposing a polygon (with holes) into convex polygons by diagonals. The methods are computationally quick, and although the partitions that they produce may not have minimal cardinality they usually have a low number of convex pieces. Thus, the methods are suitable for being used when achieving a modest load on the CPU time is more important than finding optimal decompositions as, for instance, in location problems. Part of the results in this paper are from Fernández (1999), and were presented in Fernández et al. (1998). This work has been supported by the Ministry of Science and Technology of Spain under the research projects BEC2002-01026, SEJ2005-06273/ECON (J. Fernández, B. Tóth and B. Pelegrín) and TIC2003-05982-C05-03 (L. Cánovas), in part financed by the European Regional Development Fund (ERDF).     

正多边形的最优分割问题

记平面边长为1的正m边形为S_m,将S_m剖分成n块:S_(m1),S_(m2),…,S_(mn),这样的剖分称S_m的n剖分,并以T(m,n)表示.以d_(mi)表示区域S_(mi)(i=1,2,…,n)的直径(即区域S_(mi)任意两点之间距离的最大者).记D(m,n)=max{d_(m1),d_(m2),…,d_(mn)}及Ψ(m,n)=■{D(m,n)}.本文将估计Ψ(m,n)的上下界.证明Ψ(6,3)=3/2,Ψ(6,4)=3-3~(1/2),Ψ(6.6)=1,Ψ(6,7)=3/2,估计Ψ(6,n)的渐进性.提出几个猜想.     

第一类弱奇异核Fredholm积分方程的数值求解

第一类弱奇异核Fredholm积分方程由于奇异及本质的不适定性,给求解带来很大难度．本文首先利用克雷斯变换将方程转化,并对转化后的方程进行高斯一勒让德离散,得到一离散不适定的线性方程组,结合正则化方法对该类问题进行数值求解．最后给出了数值模拟,验证了本文方法的可行性及有效性．