Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.     

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast.     

仓库容量有限条件下的随机存贮管理问题的评注

给出2005年全国部分高校研究生数学建模竞赛D题的研究背景,对参赛论文作了简要评注,并提供了一种参考解答.     

多结超导环在外磁场中的行为

分析和计算了双结超导环在无偏置电流时的磁通、环流、自由能与外磁场的关系.发现双结环与单结环在磁场中的行为有所不同.当两个结的Ic相等时，双结环在1＜β=2πLIcΦ0＜2时，若无偏置电流，总磁通Φ、环流I与外磁通Φe的关系仍然是非回滞的曲线.仅当β≥2时，曲线才出现回滞.另外双结环有两支解，并且每支解的周期为2Φ0. 关键词： 双结环 双支解 2Φ0周期 回滞     

A characterization of adding machine maps

Let f :X→X be a continuous map of a compact metric space to itself. We prove that f is topologically conjugate to an adding machine map if and only if X is an infinite minimal set for f and each point of X is regularly recurrent. Moreover, if X is an infinite minimal set for f and one point of X is regularly recurrent, then f is semiconjugate to an adding machine map.     

THE CLASSIFICATION AND PERIOD OF STATES FOR MARKOV CHAIN IN RANDOM ENVIRONMENT

This paper is a continuation of [8]. In Section 1, three kinds of communication are introdnced for two states and the relations among them are investigated. In Section 2, two kinds of period of a state are introdnced and it is obtained that the period is a “class property” ,i.e. two states x and y belong to same class implies the period of x is equal to the period of y.     

非线性控制系统的最小实现

对于那些由代数微分方程描述的具有输入输出关系的非线性控制系统，本文采用两种方法讨论了其最小实现问题：一种方法是直接计算系统的特征列；另一种方法则采用了本原元定理．两种方法给出的最小实现所需的状态变量最小数目是相等的．文中的大量代数与微分运算则可利用数学机械化来完成     

The set of toric minimal log discrepancies

We describe the set of minimal log discrepancies of toric log varieties, and study its accumulation points. This work is supported by a 21st Century COE Kyoto Mathematics Fellowship, and a JSPS Grant-in-Aid No 17740011.     

Achievable sets, brambles, and sparse treewidth obstructions

One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors.     

Chaotic-to-ordered state transition of cathode-sheath instabilities in DC glow discharge plasmas

Transition from chaotic to ordered state has been observed during the initial stage of a discharge in a cylindrical DC glow discharge plasma. Initially it shows a chaotic behavior but increasing the discharge voltage changes the characteristics of the discharge glow and shows a period subtraction of order 7 period → 5 period → 3 period → 1 period, i.e. the system goes to single mode through odd cycle subtraction. On further increasing the discharge voltage, the system goes through period doubling, like 1 period → 2 period → 4 period. On further increasing the voltage, the system goes to stable state through two period subtraction, like 4 period → 2 period → stable.