Stable Border Bases for Ideals of Numerical Cartesian Sets

In this paper, we discuss a special class of sets of bivariate empirical points, namely, numerical cartesian sets. We find that the stable quotient bases for numerical cartesian sets are unique if they exist. Furthermore, the corresponding border bases are the unique stable border bases for the vanishing ideals of numerical cartesian sets.     

A bivariate preprocessing paradigm for the Buchberger-Möller algorithm

For the last almost three decades, since the famous Buchberger-Möller (BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of bivariate polynomial interpolation on cartesian point sets that gives us a related degree reducing interpolation monomial and Newton bases directly. Since the bases are involved in the computation process as well as contained in the final output of the BM algorithm, our paradigm obviously simplifies the computation and accelerates the BM process. The experiments show that the paradigm is best suited for the computation over finite prime fields that have many applications.     

Splitting and conjoining objects in monotopological categories

Power-sets are defined for any concrete category (over Set) with finite concrete products, and their structure described for monotopological categories. These sets are used to define the notions of splitting object and of conjoining object. Characterizations of the existence of these objects in monotopological categories are given. It is proved that no proper monotopological category can be concretely cartesian closed. Most well-known monotopological categories with splitting objects are topological or are c-categories, but it is shown that there are many proper monotopological categories which are not c-categories, and yet have splitting objects, and may even be cartesian closed. One of the characterizations of the existence of splitting objects is used to prove that a monotopological category with splitting objects is cartesian closed iff the largest initial completion in which it is epireflective is cartesian closed iff its MacNeille completion is cartesian closed.     

Strict refinement for graphs and digraphs

We show that any two cartesian factorizations of a connected graph have a strict common refinement, improving on the unique factorization theorem of G. Sabidussi. (The cartesian product is the product wherein two vertices are adjacent when they are adjacent in one coordinate and equal in all other coordinates.) Among the applications, we can deduce the strict refinement theorem for chain-finite posets, and (using a cartesian factorization algorithm of P. Winkler) we give a polynomial-time algorithm for cardinal factorization of connected finite posets.     

Orthonormalbasen in der nichtarchimedischen Funktionentheorie

In this paper one finds a new method to calculate problems concerning affinoid algebras. The method which uses orthonormal bases in normed vector spaces is developed in the first two paragraphs and is applied to affinoid algebras later on. In a simple way there are obtained nearly all results about affinoid algebras which are already known. Further this method gives new information about the functor F which associates to each affinoid space X an affine algebraic variety . In detail: F is compatible with extensions of the field k (if affinoid spaces are considered, k algebraically closed, n arbitrary) and F is compatible with the cartesian product. These problems are treated in the language of affinoid algebras.     

带有热传导的波动方程组的无条件稳定二阶收敛的差分格式

带有热传导的波动方程组的无条件稳定二阶收敛的差分格式孙志忠（东南大学数学力学系）ＡＮＵＮＣＯＮＤＩＴＩＯＮＡＬＬＹＳＴＡＢＬＥＡＮＤＳＥＣＯＮＤ－ＯＲＤＥＲＣＯＮＶＥＲＧＥＮＴＤＩＦＦＥＲＥＮＣＥＳＣＨＥＭＥＦＯＲＴＨＥＳＹＳＴＥＭＯＦＷＡＶＥＥＱＵ...     

Efficient modelling of rotating disks and cylinders using a cartesian grid

Calculations are presented of flow characteristics in the vicinity of disks and cylinders rotating at speeds typical of those found in modern mechatronics machinery. The rotational speeds are slow or intermittent, and the generated boundary layers are laminar and transitional. Comparison is made with existing experimental data and exact, though idealised, analytical solutions. A three-dimensional finite volume procedure with time dependence was employed as the solution method, and two grid geometries were used, namely, axisymmetric and cartesian. Use of a cartesian grid is very important, as it is compatible with the design of the interiors of mechatronics machinery, and present practice is to model these interiors with computationally economical cartesian grids. Expanding grids were generated normal to surfaces for each of the grid geometries so as to capture the thin boundary layers. To alleviate numerical difficulties, when using the cartesian geometry, an expanding and contracting grid was generated normal to the axis of the disks and cylinders with the grid spacing based on a shifted Chebyshev polynomial.     

IIM-based ADI finite difference scheme for nonlinear convection–diffusion equations with interfaces

Based on Li’s immersed interface method (IIM), an ADI-type finite difference scheme is proposed for solving two-dimensional nonlinear convection–diffusion interface problems on a fixed cartesian grid, which is unconditionally stable and converges with two-order accuracy in both time and space in maximum norm. Correction terms are added to the right-hand side of standard ADI scheme at irregular points. The nonlinear convection terms are treated by Adams–Bashforth method, without affecting the stability of difference schemes. A new method for computing the correction terms is developed, in which the Adams–Bashforth method is employed. Thus we can get an explicit approximation for the computation of corrections, when the jump condition is solution-dependent. Three numerical experiments are displayed and analyzed. The numerical results show good agreement with the exact solutions and confirm the convergence order.     

Regularity of the category of Kelley spaces

We show that the cartesian closed category of compactly generated Hausdorff spaces is regular, but is neither exact, nor locally cartesian closed. In fact we find a coequalizer of an equivalence relation which is not stable under pullback.     

The class of co-Namioka compact spaces is stable under product

In an earlier paper we have established that the cartesian product of a family of co-Namioka compact spaces is co-Namioka if and only if all finite cartesian products of this family are co-Namioka. The purpose of this note is to show that the product of two co-Namioka compact spaces is always co-Namioka. The class of co-Namioka compact spaces is consequently stable under arbitrary products.

     

A note on temporal games

Summary We investigate strategic situations where the zero-sum two-person game in normal form is composed of a sequence of choices where the players are informed about the past and its relations between the orders of realizing them. The minimax theorem is improved for games having cartesian products as strategy sets.     

Fall colouring of bipartite graphs and cartesian products of graphs

The question of whether a graph can be partitioned into k independent dominating sets, which is the same as having a fallk-colouring, is considered. For k=3, it is shown that a graph G can be partitioned into three independent dominating sets if and only if the cartesian product G□K₂ can be partitioned into three independent dominating sets. The graph K₂ can be replaced by any graph H such that there is a mapping f:Q_n→H, where f is a type-II graph homomorphism.The cartesian product of two trees is considered, as well as the complexity of partitioning a bipartite graph into three independent dominating sets, which is shown to be NP-complete. For other values of k, iterated cartesian products are considered, leading to a result that shows for what values of k the hypercubes can be partitioned into k independent dominating sets.     

Stability analysis of the cell centered finite-volume M<Emphasis Type="SmallCaps">uscl</Emphasis> method on unstructured grids

The goal of this study is to apply the Muscl scheme to the linear advection equation on general unstructured grids and to examine the eigenvalue stability of the resulting linear semi-discrete equation. Although this semi-discrete scheme is in general stable on cartesian grids, numerical calculations of spectra show that this can sometimes fail for generalizations of the Muscl method to unstructured three-dimensional grids. This motivates our investigation of the influence of the slope reconstruction method and stencil on the eigenvalue stability of the Muscl scheme. A theoretical stability analysis of the first order upwind scheme proves that this method is stable on arbitrary grids. In contrast, a general theoretical result is very difficult to obtain for the Muscl scheme. We are able to identify a local property of the slope reconstruction that is strongly related to the appearance of unstable eigenmodes. This property allows to identify the reconstruction methods that are best suited for stable discretizations. The explicit numerical computation of spectra for a large number of two- and three-dimensional test cases confirms and completes the theoretical results.     

Excess in critical graphs

In this paper we prove that the cartesian product of two trees is a semistable graph and we exhibit several vertices of semistability. We show that in most cases the cartesian product of two paths is completely semistable and we list the exceptions. Finally, we characterize stable composite graphs.     

Simploidals sets: Definitions, operations and comparison with simplicial sets

The combinatorial structure of simploidal sets generalizes both simplicial complexes and cubical complexes. More precisely, cells of simploidal sets are cartesian product of simplices. This structure can be useful for geometric modeling (e.g. for handling hybrid meshes) or image analysis (e.g. for computing topological properties of parts of n-dimensional images). In this paper, definitions and basic constructions are detailed. The homology of simploidal sets is defined and it is shown to be equivalent to the classical homology. It is also shown that products of Bézier simplicial patches are well suited for the embedding of simploidal sets.     

Dimension and local structures of attracting manifolds of smooth dynamical systems

We give a numerical algorithm to compute the dimension and local structures of attracting sets or invariant manifolds of smooth dynamical systems. This algorithm is based on local adaptive Galerkin bases and is tested for several examples. The important degrees of freedom that are preferentially selected, from the geometrical point of view, are found.     

Kernel B-splines on general lattices

The aim of the paper is to provide a computationally effective way to construct stable bases on general non-degenerate lattices. In particular, we define new stable bases on hexagonal lattices and we give some numerical examples which show their usefulness in applications.     

A polynomial time algorithm for finding the prime factors of cartesian-product graphs

We consider the computational complexity of recognizinf concerned cartesian product graphs. Sabidussi gives a non-algorithmic proof that the cartesian factorization is unique. He uses a tower of successively coarser equivalence relations on the edge set in which each prime factor of the graph is identified with an equivalence class in the coarsest of the relations. We first explore the structure and size of the relation at the base of the tower. Then we give a polynomial-time algorithm to compute the relations and to construct the prime factors of any connected graph. The bounds on the size of the relations are crucial to the runtime analysis of our algorithm.     

Unique infinite expansions in noninteger bases

Contrary to the classical situation, in noninteger bases almost all numbers have a continuum of distinct expansions. However, the set of numbers having a unique expansions also has a rich topological and combinatorial structure. We clarify the connection of this set with the sets of numbers having a unique infinite or doubly infinite expansion.