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.     

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 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.     

Codimension-one minimal projections onto Haar subspaces

Let H_n be an n-dimensional Haar subspace of and let H_n−1 be a Haar subspace of H_n of dimension n−1. In this note we show (Theorem 6) that if the norm of a minimal projection from H_n onto H_n−1 is greater than 1, then this projection is an interpolating projection. This is a surprising result in comparison with Cheney and Morris (J. Reine Angew. Math. 270 (1974) 61 (see also (Lecture Notes in Mathematics, Vol. 1449, Springer, Berlin, Heilderberg, New York, 1990, Corollary III.2.12, p. 104) which shows that there is no interpolating minimal projection from C[a,b] onto the space of polynomials of degree n, (n2). Moreover, this minimal projection is unique (Theorem 9). In particular, Theorem 6 holds for polynomial spaces, generalizing a result of Prophet [(J. Approx. Theory 85 (1996) 27), Theorem 2.1].     

The existence of minimal large positive solutions for a class of nonlinear cooperative systems

In this paper we establish the existence of the minimal large positive solution for a general class of nonlinear cooperative systems including the simplest prototype of García-Melián et al. (2016). Precisely, based on the existence of a large positive supersolution, we can infer the existence of the minimal large positive solution. Moreover, we also give some sufficient easily computable conditions for the existence of a large positive supersolution. Our results generalize, very substantially, some of the findings of García-Melián et al. (2016) adopting a rather novel methodology.     

Maximum principle at infinity for complete minimal surfaces in flat 3-manifolds

The main result of this paper is the following maximum principle at infinity:Theorem.Let M ₁ and M ₂ be two disjoint properly embedded complete minimal surfaces with nonempty boundaries, that are stable in a complete flat 3-manifold. Then dist(M ₁,M ₂)=min(dist(M ₁,M ₂), dist(M ₂,M ₁)).In case one boundary is empty, e.g. M ₁,then dist(M ₁,M ₂)=dist(M ₂,M ₁).If both boundaries are empty, then M ₁ and M ₂ are flat.     

Sur les metriques admettant les plans comme surfaces minimales

We establish the system of partial differential equations satisfied by the riemannian metrics on open subsets of which admit planes as minimal surfaces. This is a nonlinear system of 10 partial differential equations, with the euclidian metric as a particular solution. In a previous work, we solved this system for axially symmetrical metrics. In this paper we linearize the system at the euclidian metric and solve the linear system. We obtain a 20-dimensional space of solutions.

     

All-glass open-split interface for capillary GC/MS

This paper describes a design for an all-glass GC/MS interface. The design has advantages due to low dead volume, lack of column effluent adsorption and degradation, simple interface production and installation, and ease of column mounting/dismounting.