Hermite and Smith normal form algorithms over Dedekind domains

We show how the usual algorithms valid over Euclidean domains, such as the Hermite Normal Form, the modular Hermite Normal Form and the Smith Normal Form can be extended to Dedekind rings. In a sequel to this paper, we will explain the use of these algorithms for computing in relative extensions of number fields.

     

4G手机无线接入系统设计及实现

用射频微波电路集成技术设计第4代(4G)手机无线接入系统．从分布参数概念出发，主要在smith圆图上进行电路设计．由微带线进行电路的实现，电路将各功能单元集成在微带基板上，具有体积小、重量轻、可靠性高、与手机其他电路易于共形等特点．运用网络转移参量矩阵理论进行了系统响应预估，结果表明所设计的无线接入系统满足4G移动终端的性能要求．     

六元gcd封闭集上Smith矩阵的整除性

我们给出了关于六元gcd封闭集S的充分必要条件,使得在整数矩阵环M_6(Z)中,定义在S上的e次幂GCD矩阵(S~e)整除e次幂LCM矩阵[S~e].这部分解决了Hong在2002年提出的一个公开问题.     

The critical group of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> × <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

In this paper, the structure of the critical group of the graph K _m × C _n is determined, where m, n ≥ 3.     

Graphs whose critical groups have larger rank

The critical group C(G) of a graph G is a refinement of the number of spanning trees of the graph and is closely connected with the Laplacian matrix. Let r(G) be the minimum number of generators (i.e., the rank) of the group C(G) and β(G) be the number of independent cycles of G. In this paper, some forbidden induced subgraphs are given for r(G) = n − 3 and all graphs with r(G) = β(G) = n − 3 are characterized.     

On the computation of the Smith normal form of compound matrices

Compound matrices are encountered in many fields such as Matrix Theory, Systems Theory, Control Theory, etc. In the present paper we develop an efficient algorithm computing the Smith normal form of compound matrices. This algorithm is based on a new theorem establishing an equivalence relation between the Smith normal form of the compounds of a given matrix and the compounds of the Smith normal form of the given matrix. This revised version was published online in June 2006 with corrections to the Cover Date.     

Properties of Some Character Tables Related to the Symmetric Groups

We determine invariants like the Smith normal form and the determinant for certain integral matrices which arise from the character tables of the symmetric groups S_n and their double covers. In particular, we give a simple computation, based on the theory of Hall-Littlewood symmetric functions, of the determinant of the regular character table _RC of S_n with respect to an integer r 2. This result had earlier been proved by Olsson in a longer and more indirect manner. As a consequence, we obtain a new proof of the Mathas Conjecture on the determinant of the Cartan matrix of the Iwahori-Hecke algebra. When r is prime we determine the Smith normal form of _RC. Taking r large yields the Smith normal form of the full character table of S_n. Analogous results are then given for spin characters.Partially supported by The Danish National Research Council.Partially supported by NSF grant #DMS-9988459.     

Distance unimodular equivalence of graphs

Let G be a connected graph and D(G) be its distance matrix. In this article, the Smith normal forms of the integer matrices D(G) are determined for trees, wheels, cycles, complements of cycles and are reduced for complete multipartite graphs.     

A note on unimodular congruence of the Laplacian matrix of a graph

Let G be a simple connected graph and L(G) be its Laplacian matrix. In this note, we prove that L(G) is congruent by a unimodular matrix to its Smith normal form if and only if G is a tree.     

A topological approach to divisibility of arithmetical functions and GCD matrices

Considering lower closed sets as closed sets on a preposet (P, ≤), we obtain an Alexandroff topology on P. Then order preserving functions are continuous functions. In this article we investigate order preserving properties (and thus continuity properties) of integer-valued arithmetical functions under the usual divisibility relation of integers and power GCD matrices under the divisibility relation of integer matrices.