Valuations and closure operators on finite lattices

Let L be a lattice. A function f:L→R (usually called evaluation) is submodular if f(x∧y)+f(x∨y)≤f(x)+f(y), supermodular if f(x∧y)+f(x∨y)≥f(x)+f(y), and modular if it is both submodular and supermodular. Modular functions on a finite lattice form a finite dimensional vector space. For finite distributive lattices, we compute this (modular) dimension. This turns out to be another characterization of distributivity (Theorem 3.9). We also present a correspondence between isotone submodular evaluations and closure operators on finite lattices (Theorem 5.5). This interplay between closure operators and evaluations should be understood as building a bridge between qualitative and quantitative data analysis.     

New Brownian bridge construction in quasi-Monte Carlo methods for computational finance

Quasi-Monte Carlo (QMC) methods have been playing an important role for high-dimensional problems in computational finance. Several techniques, such as the Brownian bridge (BB) and the principal component analysis, are often used in QMC as possible ways to improve the performance of QMC. This paper proposes a new BB construction, which enjoys some interesting properties that appear useful in QMC methods. The basic idea is to choose the new step of a Brownian path in a certain criterion such that it maximizes the variance explained by the new variable while holding all previously chosen steps fixed. It turns out that using this new construction, the first few variables are more “important” (in the sense of explained variance) than those in the ordinary BB construction, while the cost of the generation is still linear in dimension. We present empirical studies of the proposed algorithm for pricing high-dimensional Asian options and American options, and demonstrate the usefulness of the new BB.     

A class of Sierpinski carpets with overlaps

Based on a scheme by Lau and Ngai, a sufficient and necessary condition for an IFS of contractive similitudes to satisfy the open set condition is given. A class of Sierpinski carpets with parameters (λ₁,λ₂) is then investigated.     

Flow dimension and capacity for structuring urban street networks

This paper aims to measure the efficiency of urban street networks (a kind of complex networks) from the perspective of the multidimensional chain of connectivity (or flow). More specifically, we define two quantities: flow dimension and flow capacity, to characterize structures of urban street networks. To our surprise, for the topologies of urban street networks, previously confirmed as a form of small world and scale-free networks, we find that (1) the range of their flow dimensions is rather wider than their random and regular counterparts, (2) their flow dimension shows a power-law distribution, and (3) they have a higher flow capacity than their random and regular counterparts. The findings confirm that (1) both the wider range of flow dimensions and the higher flow capacity can be a signature of small world networks, and (2) the flow capacity can be an alternative quantity for measuring the efficiency of networks or that of the individual nodes. The findings are illustrated using three urban street networks (two in Europe and one in the USA).     

Distributional dimension of fractal sets in local fields

The distributional dimension of fractal sets in R^n has been systematically studied by Triebel by virtue of the theory of function spaces. In this paper, we first discuss some important properties about the B-type spaces and the F-type spaces on local fields, then we give the definition of the distributional dimension dimD in local fields and study the relations between distributional dimension and Hausdorff dimension. Moreover, the analysis expression of the Hausdorff dimension is given. Lastly, we define the Fourier dimension in local fields, and obtain the relations among all the three dimensions. Keywords local field, B-type space, F-type space, distributional dimension, Hausdorff dimension Fourier dimension     

On the Hausdorff Dimension of Regular Points of Inviscid Burgers Equation with Stable Initial Data

Consider an inviscid Burgers equation whose initial data is a Lévy α-stable process Z with α>1. We show that when Z has positive jumps, the Hausdorff dimension of the set of Lagrangian regular points associated with the equation is strictly smaller than 1/α, as soon as α is close to 1. This gives a partially negative answer to a Conjecture of Janicki and Woyczynski (J. Stat. Phys. 86(1–2):277–299, 1997). Along the way, we contradict a recent Conjecture of Z. Shi () about the lower tails of integrated stable processes.     

Ginzburg－Landau－Newell模型的动力学行为

木文对Ｇｉｎｚｂｕｒｇ－Ｌａｎｄａｕ－Ｎｅｗｅｄ模型的动力学行为进行了讨论，得到了该模型的整体吸引子的存在性，同时得到了此吸引子维数的下界估计和该吸引子的Ｈａｕｓｄｏｒｆｆ维数和Ｗａｃｔａｌ（分形）维数的上界估计．     

Infinite-dimensional linear groups with restrictions on subgroups that are not soluble <Emphasis Type="Italic">A</Emphasis><Subscript>3</Subscript>-groups

We are concerned with infinite-dimensional locally soluble linear groups of infinite central dimension that are not soluble A₃-groups and all of whose proper subgroups, which are not soluble A₃-groups, have finite central dimension. The structure of groups in this class is described. The case of infinite-dimensional locally nilpotent linear groups satisfying the specified conditions is treated separately. A similar problem is solved for infinite-dimensional locally soluble linear groups of infinite fundamental dimension that are not soluble A₃-groups and all of whose proper subgroups, which are not soluble A₃-groups, have finite fundamental dimension. __________ Translated from Algebra i Logika, Vol. 46, No. 5, pp. 548–559, September–October, 2007.     

Resolvability in circulant graphs

A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, v ∈ V (G) there is a vertex w ∈ W such that d(u, w) ≠ d(v, w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number min s∈S d(u, s). A k-partition Π = {S 1 , S 2 , . . . , S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, Si )≠ d(v, Si ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set Zn , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i-j (mod n) ∈ C , where CZn has the property that C =-C and 0 ■ C. The circulant graph is denoted by Xn, Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs Xn, 3 with connection set C = {1, n/2 , n-1} and prove that dim(Xn, 3 ) is independent of choice of n by showing that dim(Xn, 3 ) ={3 for all n ≡ 0 (mod 4), 4 for all n ≡ 2 (mod 4). We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C = {±1, ±2} and prove that pd(Xn, 4 ) is independent of choice of n and show that pd(X5,4 ) = 5 and pd(Xn,4 ) ={3 for all odd n ≥ 9, 4 for all even n ≥ 6 and n = 7.     

相对n-FP-内射模

给出了n-FP-内射模的定义,M为左R-模,如果对任意的左R-模N有Ext1(N,M)=0,则称M为n-FP-内射模,作为应用,给出了n-FP-内射模的一些等价条件.