低复杂度序列的维数

本文研究符号空间中由零拓扑熵序列组成的集合.通过构造适当的自相似集,证明了该集合的盒维数为1,而Hausdorff维数为0.     

球面稳定同伦群中的一个新元素族$b_1g_0\tilde{\gamma}_s$

设$p\geq 7$素数,$A$为模$p$的Steenrod代数. 我们利用Adams谱序列证明了球面稳定同伦群$\pi_{\ast}S$中,存在由$b_1g_0\tilde{\gamma}_{s}\in Ext_A^{s+4,(s+1)p^2q+spq+sq+s-3}(Z_p,Z_p)$所表示的新的非平凡元素族,其中$q=2(p-1)$, $3\leq s相似文献   

Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments

The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented.     

Measurements of edge-uncolorability

Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let c_k be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r₃=|E|−c₃ and . We show that on one side r₃ and r₂ bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r₃ and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr₃. For k=2,3, let ζ_k denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other.     

纵横扩张的优化

得到了最小折数纵横扩张的判别准则．针对4-正则图的平面嵌入的纵横扩张的特殊性，给出了它的最小折数纵横扩张判别准则．     

On the spectral sequence constructors of Guichardet and Stefan

The concept of a spectral sequence constructor is generalised to Hopf Galois extensions. The spectral sequence constructions that are given by Guichardet for crossed product algebras are also generalised and shown to provide examples. It is shown that all spectral sequence constructors for Hopf Galois extensions construct the same spectral sequence.     

Sagnac Effect of Gödel's Universe

We present exact expressions for the Sagnac effect of Gödel's Universe. For this purpose we first derive a formula for the Sagnac time delay along a circular path in the presence of an arbitrary stationary metric in cylindrical coordinates. We then apply this result to Gödel's metric for two different experimental situations: First, the light source and the detector are at rest relative to the matter generating the gravitational field. In this case we find an expression that is formally equivalent to the familiar nonrelativistic Sagnac time delay. Second, the light source and the detector are rotating relative to the matter. Here we show that for a special rotation rate of the detector the Sagnac time delay vanishes. Finally we propose a formulation of the Sagnac time delay in terms of invariant physical quantities. We show that this result is very close to the analogous formula of the Sagnac time delay of a rotating coordinate system in Minkowski spacetime.     

从一道运动学题目的求解谈坐标系选取的重要性

通过比较一道典型运动学题目的近似求解方法与精确求解方法，探讨坐标系选取对研究曲线运动的重要性．     

Slutsky定理在样本分位数的极限分布证明上的应用

为了更好地理解和应用样本分位数的极限分布,利用Slutsky定理,推导了样本分位数的极限分布.     

UPML formulation for truncating conductive media in curvilinear coordinates

This work presents a formulation based on UPML for truncating conductive media by using a local and non-orthogonal coordinate system to solve Maxwell’s equations by the FDTD method. The detailed procedure for obtaining the UPML equations for this case is shown and the complete equation set is provided.