Direct decompositions of torsion-free Abelian groups of finite rank

It is proved that ifr ₁ ,r ₂ , ...,r _s ;l ₁ ,l ₂ , ...,l _t are the ranks of the indecomposable summands of two direct decompositions of a torsion-free Abelian group of finite rank and if s₀ is the number of units among the numbers r_i, while t₀ is the number of units among the numbers l_j, thenr _i ⩽n - t ₀ ,l _j ⩽n−s ₀ for all i, j. Moreover, if for some i we have r_i=n−t₀, then among the l_j's only one term is different from 1 and it is equal to n−t₀; similarly if l_j=n−s₀ for some j. In addition, a construction is presented, allowing to form, from several indecomposable groups, a new group, called a flower group, and it is proved that a flower group is indecomposable under natural restrictions on its defining parameters. Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 160, pp. 272–285, 1987.     

Some recurrence relations in finite topologies

In a number of papers (see, e.g., RZhMat, 1977, 11B586) there is given for the number T_o(n) of labeled topologies on n points satisfying the T_o separation axiom the formula $$T_0 (n) = \sum {\frac{{n!}}{{p_1 ! \ldots p_k !}}V(p_1 , \ldots p_k ),} $$ where the summation extends over all ordered sets (p₁,...,P_k) of natural numbers such that p₁+...+P_k=n. In the present paper there is found a relation for calculating, whenn?2, the sum of all terms in this formula for which p₂=1 in terms of the values V(q₁,...,q_t) withq₁+...+q_t?n-2. This permits the determination (with the aid of a computer) of the new value T_o(12)=414 864 951 055 853 499     

Rings of quasi-endomorphisms of some direct sums of torsion-free Abelian groups

We consider a representation of quasi-endomorphisms of Abelian torsion-free groups of rank 4 bymatrices of order 4 over the field of rational numbers Q. We obtain a classification for quasi-endomorphism rings of Abelian torsion-free groups of rank 4 quasi-decomposable into a direct sum of groups A ₁, A ₂ of rank 1 and strongly indecomposable group B of rank 2 such that quasi-homomorphism groups Q ? Hom(A _i , B) and Q ? Hom(B, A _i ) for any i = 1, 2 have rank 1 or are zero. Moreover, for algebras from the classification we present necessary and sufficient conditions for their realization as quasi-endomorphism rings of these groups.     

The Green Ring of Drinfeld Double D(H 4)

In this paper, we study the Green ring (or the representation ring) of Drinfeld quantum double D(H ₄) of Sweedler’s four-dimensional Hopf algebra H ₄. We first give the decompositions of the tensor products of finite dimensional indecomposable modules into the direct sum of indecomposable modules over D(H ₄). Then we describe the structure of the Green ring r(D(H ₄)) of D(H ₄) and show that r(D(H ₄)) is generated, as a ring, by infinitely many elements subject to a family of relations.     

Products of EP matrices

Necessary and sufficient conditions are given for a matrix to be a product of an EP_r matrix by an EP_s matrix. It is shown that a given square matrix is a product of more than two EP matrices of specified ranks (and hence nullities) if and only if its rank is less than or equal to the minimum of the given ranks and its nullity is less than or equal to the sum of the given nullities. It is also shown that given two EP matrices, the rank of their product is independent of the order of the factors.     

Hamiltonian decompositions of complete regular s-partite graphs

In this paper we give a procedure by which Hamiltonian decompositions of the s-partite graph K_n,n,…,n, where (s − 1)n is even, can be constructed. For 2t⩽s, 1⩽a₁⩽…⩽a_t⩽n, we find conditions which are necessary and sufficient for a decomposition of the edge-set of K_a1a2…,a_t into (s − 1)n/2 classes, each class consisting of disjoint paths, to be extendible to a Hamiltonian decomposition of the complete s-partite graph K_rmn,n,…,n so that each of the classes forms part of a Hamiltonian cycle.     

Bounds for indecomposable torsion-free modules

Let M be a finitely generated torsion-free module over a one-dimensional reduced Noetherian ring R with finitely generated normalization. The rank of M is the tuple of vector-space dimensions of M_P over each field R_P (R localized at P), where P ranges over the minimal prime ideals of R. We assume that there exists a bound N_R on the ranks of all indecomposable finitely generated torsion-free R-modules. For such rings, what bounds and ranks occur? Partial answers to this question have been given by a plethora of authors over the past forty years. In this article we provide a final answer by giving a concise list of the ranks of indecomposable modules for R a local ring with no condition on the characteristic. We conclude that if the rank of an indecomposable module M is (r,r,…,r), then r∈{1,2,3,4,6}, even when R is not local.     

[r,s, t]-Colorings of Graph Products

Let G =  (V, E) be a graph with vertex set V and edge set E. Given non negative integers r, s and t, an [r, s, t]-coloring of a graph G is a proper total coloring where the neighboring elements of G (vertices and edges) receive colors with a certain difference r between colors of adjacent vertices, a difference s between colors of adjacent edges and a difference t between colors of a vertex and an incident edge. Thus [r, s, t]-colorings generalize the classical colorings of graphs and can have applications in different fields like scheduling, channel assignment problem, etc. The [r, s, t]-chromatic number χ _r,s,t (G) of G is the minimum k such that G admits an [r, s, t]-coloring. In our paper we propose several bounds for the [r, s, t]-chromatic number of the cartesian and direct products of some graphs.     

The Average Condition Number of Most Tensor Rank Decomposition Problems is Infinite

The tensor rank decomposition, or canonical polyadic decomposition, is the decomposition of a tensor into a sum of rank-1 tensors. The condition number of the tensor rank decomposition measures the sensitivity of the rank-1 summands with respect to structured perturbations. Those are perturbations preserving the rank of the tensor that is decomposed. On the other hand, the angular condition number measures the perturbations of the rank-1 summands up to scaling. We show for random rank-2 tensors that the expected value of the condition number is infinite for a wide range of choices of the density. Under a mild additional assumption, we show that the same is true for most higher ranks \(r\ge 3\) as well. In fact, as the dimensions of the tensor tend to infinity, asymptotically all ranks are covered by our analysis. On the contrary, we show that rank-2 tensors have finite expected angular condition number. Based on numerical experiments, we conjecture that this could also be true for higher ranks. Our results underline the high computational complexity of computing tensor rank decompositions. We discuss consequences of our results for algorithm design and for testing algorithms computing tensor rank decompositions.

     

On the value distribution theory of elliptic functions

The Nevanlinna characteristic of a nonconstant elliptic function φ (z) satisfiesT(r, φ)=Kr ² (1+o(1)) asr→∞ whereK is a nonzero constant. In this paper, we completely answer the following question: For which polynomialsQ(z, u ₀,...,u _n ) inu ₀,...,u _n , having coefficientsa(z) satisfyingT(r, a)=o(r ²) asr→∞, will the meromorphic functionh _Q (z)=Q(z, ?(z),...,?⁽ⁿ⁾(z)) either be identically zero or satisfyN(r, 1/h _Q )=o(r ²) asr→∞? In fact, we answer this question for rational functionsQ(z, u ₀,...,u _n ) inu ₀,...,u _n , and also obtain analogous results for the Weierstrass functions ζ(z) and σ(z).     

A linear-algebra problem from algebraic coding theory

Given an m×n matrix M over E=GF(q^t) and an ordered basis A={z₁,…,z_t} for field E over K=GF(q), expand each entry of M into a t×1 vector of coordinates of this entry relative to A to obtain an mt×n matrix M¹ with entries from the field K. Let r=rank(M) and r¹=rank(M¹). We show that r?r¹?min{rt,n}, and we determine the number b(m,n,r,r¹,q,t) of m×n matrices M of rank r over GF(q^t) with associated mt×n matrix M¹ of rank r¹ over GF (q).     

Relation between decomposition of comodules and coalgebras

LetM be aC-comodule. It is clear thatM andC can both be decomposed into a direct sum of the indecomposable subcoalgebras ofC and subcomodules ofM. The relation between the two decompositions is given.     

Multicommodity flows in graphs

Suppose that G is a graph, and (s_i,t_i) (1≤i≤k) are pairs of vertices; and that each edge has a integer-valued capacity (≥0), and that q_i≥0 (1≤i≤k) are integer-valued demands. When is there a flow for each i, between s_i and t_i and of value q_i, such that the total flow through each edge does not exceed its capacity? Ford and Fulkerson solved this when k=1, and Hu when k=2. We solve it for general values of k, when G is planar and can be drawn so that s₁,…, s_l, t₁, …, t_l,…,t_l are all on the boundary of a face and s_l+1, …,S_k, t_l+1,…,t_k are all on the boundary of the infinite face or when t₁=?=t_l and G is planar and can be drawn so that s_l+1,…,s_k, t₁,…,t_k are all on the boundary of the infinite face. This extends a theorem of Okamura and Seymour.     

A Class of Finite-Dimensional Representations of U_q（sl_2）

In order to study a class of finite-dimensional representations of Uq（sl2）, we deal with the quotient algebra Uq （m, n, b） of quantum group Uq（sl2） with relations Kr=1, Emr=b, Fnr=0 in this paper, where q is a root of unity. The algebra Uq（m, n, b） is decomposed into a direct sum of indecomposable （left） ideals. The structures of indecomposable projective representations and their blocks are determined.     

S-matrices

A new class of so called S-matrices is introduced which allows investigating links between various known classes of matrices such as Vandermonde matrices, Hankel matrices, companion matrices, etc. For complex S-matrices, the problem of decomposition into a quasidirect sum (a sum for which the sum of the ranks of the summands equals the rank of the given matrix) of indecomposable complex S-matrices is completely solved, and the uniqueness of such a decomposition is proved.     

Decomposing triples into cyclic designs

Motivated by constructing cyclic simple designs, we consider how to decomposing all the triples of Z_v into cyclic triple systems. Furthermore, we define a large set of cyclic triple systems to be a decomposition of triples of Z_v into indecomposable cyclic designs. Constructions of decompositions and large sets are given. Some infinite classes of decompositions and large sets are obtained. Large sets of small v with odd v<97 are also given. As an application, the results are used to construct cyclic simple triple systems.     

Low rank Tucker-type tensor approximation to classical potentials

This paper investigates best rank-(r ₁,..., r _d ) Tucker tensor approximation of higher-order tensors arising from the discretization of linear operators and functions in ℝ ^d . Super-convergence of the best rank-(r ₁,..., r _d ) Tucker-type decomposition with respect to the relative Frobenius norm is proven. Dimensionality reduction by the two-level Tucker-to-canonical approximation is discussed. Tensor-product representation of basic multi-linear algebra operations is considered, including inner, outer and Hadamard products. Furthermore, we focus on fast convolution of higher-order tensors represented by the Tucker/canonical models. Optimized versions of the orthogonal alternating least-squares (ALS) algorithm is presented taking into account the different formats of input data. We propose and test numerically the mixed CT-model, which is based on the additive splitting of a tensor as a sum of canonical and Tucker-type representations. It allows to stabilize the ALS iteration in the case of “ill-conditioned” tensors. The best rank-(r ₁,..., r _d ) Tucker decomposition is applied to 3D tensors generated by classical potentials, for example and with x, y ∈ ℝ ^d . Numerical results for tri-linear decompositions illustrate exponential convergence in the Tucker rank, and robustness of the orthogonal ALS iteration.      

On a class of sine-type functions

We study an infinite product F _Λ(z) with zeros λ _n = n + l(|n|), n ? ?, where l(t) is a concave function and l(t) = o(t). We obtain a test for F _Λ(z) to belong to the class of sine-type functions. For the particular case in which l(t) is a regularly varying function, we obtain sharp asymptotic estimates for F _Λ(z).     

Sets in Abelian groups with distinct sums of pairs

A subset S={s₁,…,sk} of an Abelian group G is called an St-set of size k if all sums of t different elements in S are distinct. Let s(G) denote the cardinality of the largest S₂-set in G. Let v(k) denote the order of the smallest Abelian group for which s(G)?k. In this article, bounds for s(G) are developed and v(k) is determined for k?15 by computing s(G) for Abelian groups of order up to 183 using exhaustive backtrack search with isomorph rejection.     

A nonlinear problem having a continuous locus of singular points and no multiple solutions

The boundary-value problem ?z″ = (z² ? t²)z′, ? > 0, z(? 1) = α, z(0) = β, t? [?1, 0], has been shown to have a solution, and moreover, depending on the choice of α and β, multiple solutions to it exist. We consider the more general equation f(z, t)z″ = (z^r ? t^s)z′ for a particular non-negative function f(z, t), and integrate the equation exactly. Depending on α and β, we find that either there are no solutions, or that only unique solutions exist. The conclusion is that the presence of a continuous locus of singular points, given by z^r = t^s, does not necessarily produce multiple solutions.