关于绝对半素环和绝对半素根

本文了绝对半素环的概念，研究了绝对半素与与半素环及素环之间的关系，讨论了由全体绝对半素环类决定的上根－－绝对半半素根及其性质。     

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.     

Banach空间中优化问题的最优性条件

首先在Contingent切锥意义下界定了Banach空间中非空集合的伪切锥和伪凸性的概念，并讨论了相应的性质，然后针对可微优化问题，在广义凸性假设下，建立了最优性条件。     

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 EXISTENCE THEOREM OF THE CONE-WEAK SUBDIFFERENTIAL OF SET-VALUED MAPPING

In this paper, the existence theorem of the cone-weak subdiflerential of set-valued mapping in locally convex topological vector space is proved.     

关于多正解问题的某些研究

本文以ｆｐ 同伦方法为工具，借助于一些适当的变换，研究有序的（Ｂ）空间中的集值映象方程的多正解问题；在文中的有关工作中，还使用了集值映象的拟导数的某些性质．     

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.     

Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.     

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.