Boundary Harnack Principle and Martin Boundary at Infinity for Subordinate Brownian Motions

In this paper we study the Martin boundary of unbounded open sets at infinity for a large class of subordinate Brownian motions. We first prove that, for such subordinate Brownian motions, the uniform boundary Harnack principle at infinity holds for arbitrary unbounded open sets. Then we introduce the notion of κ-fatness at infinity for open sets and show that the Martin boundary at infinity of any such open set consists of exactly one point and that point is a minimal Martin boundary point.     

Regularity Conditions for Einstein’s Equations at Spatial Infinity

The regular finite initial value problem at spatial infinity is used to obtain regularity conditions on the freely specifiable parts of initial data sets for the vacuum Einstein equations with non-vanishing second fundamental forms. These conditions ensure that the solutions of the conformal Einstein equations extend smoothly through the sets where spatial infinity touches null infinity. For simplicity, the conformal metric of the initial data set is assumed to be analytic, although the results presented here could be extended to a setting where the conformal metric is only smooth. The analysis given here is a generalisation of the analysis of the regular finite initial value problem first carried out by Friedrich, in the case of time symmetric initial data sets. Submitted: May 12, 2009. Accepted: May 13, 2009.     

Progressive Decoupling of Linkages in Optimization and Variational Inequalities with Elicitable Convexity or Monotonicity

Algorithms for problem decomposition and splitting in optimization and the solving of variational inequalities have largely depended on assumptions of convexity or monotonicity. Here, a way of “eliciting” convexity or monotonicity is developed which can get around that limitation. It supports a procedure called the progressive decoupling algorithm, which is derived from the proximal point algorithm through passing to a partial inverse, localizing and rescaling. In the optimization setting, elicitability of convexity corresponds to a new and very general kind of second-order sufficient condition for a local minimum. Applications are thereby opened up to problem decomposition and splitting even in nonconvex optimization, moreover with augmented Lagrangians for subproblems assisting in the implementation.

     

Generalized Trajectory Methods for Finding Multiple Extrema and Roots of Functions

Two generalized trajectory methods are combined to provide a novel and powerful numerical procedure for systematically finding multiple local extrema of a multivariable objective function. This procedure can form part of a strategy for global optimization in which the greatest local maximum and least local minimum in the interior of a specified region are compared to the largest and smallest values of the objective function on the boundary of the region. The first trajectory method, a homotopy scheme, provides a globally convergent algorithm to find a stationary point of the objective function. The second trajectory method, a relaxation scheme, starts at one stationary point and systematically connects other stationary points in the specified region by a network of trjectories. It is noted that both generalized trajectory methods actually solve the stationarity conditions, and so they can also be used to find multiple roots of a set of nonlinear equations.     

The limit set of trajectory in quasi-homogeneous system in ℝ3

In this article, we study the limit set of trajectory in three-dimensional quasi-homogeneous system. For the trajectory which is close to a singular curve, we show that either it approaches a fixed point or infinity, or it oscillates. Moreover, an oscillating example is given. The behaviour of trajectory which is near a closed orbit is also studied. At the end, we classify the integral manifolds of the system with isolated singularities.     

Scale-Distortion Inequalities for Mantissas of Finite Data Sets

In scientific computations using floating point arithmetic, rescaling a data set multiplicatively (e.g., corresponding to a conversion from dollars to euros) changes the distribution of the mantissas, or fraction parts, of the data. A scale-distortion factor for probability distributions is defined, based on the Kantorovich distance between distributions. Sharp lower bounds are found for the scale-distortion of n-point data sets, and the unique data set of size n with the least scale-distortion is identified for each positive integer n. A sequence of real numbers is shown to follow Benford’s Law (base b) if and only if the scale-distortion (base b) of the first n data points tends zero as n goes to infinity. These results complement the known fact that Benford’s Law is the unique scale-invariant probability distribution on mantissas. The first author was partly supported by a Humboldt research fellowship. The second author was supported in part by the National Security Agency and as a Research Scholar in Residence at California Polytechnic State University.     

Partition Lattice q-Analogs Related to q-Stirling Numbers

We construct a family of partially ordered sets (posets) that are q-analogs of the set partition lattice. They are different from the q-analogs proposed by Dowling [5]. One of the important features of these posets is that their Whitney numbers of the first and second kind are just the q-Stirling numbers of the first and second kind, respectively. One member of this family [4] can be constructed using an interpretation of Milne [9] for S[n, k] as sequences of lines in a vector space over the Galois field F _q. Another member is constructed so as to mirror the partial order in the subspace lattice.     

CENTER CONDITIONS AND BIFURCATION OF LIMIT CYCLES FOR A CLASS OF FIFTH DEGREE SYSTEMS

The center conditions and bifurcation of limit cycles for a class of fifth degree systems are investigated. Two recursive formulas to compute singular quantities at infinity and at the origin are given. The first nine singular point quantities at infinity and first seven singular point quantities at the origin for the system are given in order to get center conditions and study bifurcation of limit cycles. Two fifth degree systems are constructed. One allows the appearance of eight limit cycles in the neighborhood of infinity,which is the first example that a polynomial differential system bifurcates eight limit cycles at infinity. The other perturbs six limit cycles at the origin.     

关于平面点集三角剖分的两类子集

给定欧氏平面上的一个点集合Ｓ，我们给出两类端点在Ｓ中的线段集合，第一类线段集合是Ｓ的任一三角剖分的子集，第二类线段集合是Ｓ的任一最小权三解剖分的子集，这两类子集是不相交的，这两类子集合的计算要用Ｏ(n³)时间和Ｏ（ｎ）空间．     

多方参与且评价指标集有差异的方案筛选方法

针对多方给出评价指标集存在差异情形的方案筛选问题,提出了一种基于软集理论的方案筛选方法。在该方法中,首先依据各方给出关于备选方案符合评价指标要求的可接受水平,构建各方相应的评价指标子集,进而针对各备选方案符合评价指标要求的结果构建针对各方评价指标子集的软集;然后构建所有方案均符合全部指标要求的软集,进而通过各评价指标子集的软集与所有方案均符合全部指标要求的软集的积运算和算子运算,得到对应评价指标子集的每方可接受的备选方案集;进一步地,通过各方可接受的备选方案集间的并集运算及交集运算,可得到最终的方案筛选结果。最后,通过一个算例说明了本文给出方法的可行性和有效性。     

Bifurcation of limit cycles at the equator for a class of polynomial differential system

In this paper, center conditions and bifurcation of limit cycles from the equator for a class of polynomial system of degree seven are studied. The method is based on converting a real system into a complex system. The recursion formula for the computation of singular point quantities of complex system at the infinity, and the relation of singular point quantities of complex system at the infinity with the focal values of its concomitant system at the infinity are given. Using the computer algebra system Mathematica, the first 14 singular point quantities of complex system at the infinity are deduced. At the same time, the conditions for the infinity of a real system to be a center and 14 order fine focus are derived respectively. A system of degree seven that bifurcates 13 limit cycles from the infinity is constructed for the first time.     

Distributionally scrambled set and minimal set

We investigate the relation between distributional chaos and minimal sets, and discuss how to obtain various distributionally scrambled sets by using least and simplest minimal sets. We show: i) an uncountable extremal distributionally scrambled set can appear in a system with just one simple minimal set: a periodic orbit with period 2; ii) an uncountable dense invariant distributionally scrambled set can occur in a system with just two minimal sets: a fixed point and an infinite minimal set; iii) infinitely many minimal sets are necessary to generate a uniform invariant distributionally scrambled set, and an uncountable dense extremal invariant distributionally scrambled set can be constructed by using just countably infinitely many periodic orbits.     

Bifurcation of limit cycles at the equator

This paper studies center conditions and bifurcation of limit cycles from the equator for a class of polynomial differential system of order seven. By converting real planar system into complex system, we established the relation of focal values of a real system with singular point quantities of its concomitant system, and the recursion formula for the computation of singular point quantities of a complex system at the infinity. Therefore, the first 14 singular point quantities of a complex system at the infinity are deduced by using computer algebra system Mathematica. What’s more, the conditions for the infinity of the real system to be a center or 14 degree fine focus are derived, respectively. A system of order seven that bifurcates 12 limit cycles from the infinity is constructed for the first time.     

一类七次多项式微分系统的中心条件与赤道极限环分支

研究了一类七次系统无穷远点的中心条件与赤道极限环分支问题.通过将实系统转化为复系统研究,给出了计算无穷远点奇点量的递推公式,并在计算机上用Mathematica推导出该系统无穷远点前14个奇点量,进一步导出了无穷远点成为中心的条件和14阶细焦点的条件,在此基础上得到了七次系统无穷远点分支出12个极限环的一个实例.     

Determining knots by optimizing the bending and stretching energies

For a given set of data points in the plane, a new method is presented for computing a parameter value (knot) for each data point. Associated with each data point, a quadratic polynomial curve passing through three adjacent consecutive data points is constructed. The curve has one degree of freedom which can be used to optimize the shape of the curve. To obtain a better shape of the curve, the degree of freedom is determined by optimizing the bending and stretching energies of the curve so that variation of the curve is as small as possible. Between each pair of adjacent data points, two local knot intervals are constructed, and the final knot interval corresponding to these two points is determined by a combination of the two local knot intervals. Experiments show that the curves constructed using the knots by the new method generally have better interpolation precision than the ones constructed using the knots by the existing local methods.     

First Observations on Prefab Posets’ Whitney Numbers

We introduce a natural partial order ≤ in structurally natural finite subsets of the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling-like numbers’ triangular array — are then calculated and the explicit formula for them is provided. Next — in the second construction — we endow the set sums of prefabiants with such an another partial order that their Bell-like numbers include Fibonacci triad sequences introduced recently by the present author in order to extend famous relation between binomial Newton coefficients and Fibonacci numbers onto the infinity of their relatives among whom there are also the Fibonacci triad sequences and binomial-like coefficients (incidence coefficients included). The first partial order is F-sequence independent while the second partial order is F-sequence dependent where F is the so-called admissible sequence determining cobweb poset by construction. An F-determined cobweb poset’s Hasse diagram becomes Fibonacci tree sheathed with specific cobweb if the sequence F is chosen to be just the Fibonacci sequence. From the stand-point of linear algebra of formal series these are generating functions which stay for the so-called extended coherent states of quantum physics. This information is delivered in the last section. Presentation (November 2006) at the Gian-Carlo Rota Polish Seminar .     

The Kakeya problem: a gap in the spectrum and classification of the smallest examples

Kakeya sets in the affine plane $\mathrm AG (2,q)$ are point sets that are the union of lines, one through every point on the line at infinity. The finite field Kakeya problem asks for the size of the smallest Kakeya sets and the classification of these Kakeya sets. In this article we present a new example of a small Kakeya set and we give the classification of the smallest Kakeya sets up to weight $\frac{q(q+2)}{2}+\frac{q}{4}$ , both in case $q$ even.