Twisted factorization of a banded matrix

The twisted factorization of a tridiagonal matrix T plays an important role in inverse iteration as featured in the MRRR algorithm. The twisted structure simplifies the computation of the eigenvector approximation and can also improve the accuracy. A tridiagonal twisted factorization is given by T=M _k Δ _k N _k where Δ _k is diagonal, M _k ,N _k have unit diagonals, and the k-th column of M _k and the k-th row of N _k correspond to the k-th column and row of the identity, that is . This paper gives a constructive proof for the existence of the twisted factorizations of a general banded matrix A. We show that for a given twist index k, there actually are two such factorizations. We also investigate the implications on inverse iteration and discuss the role of pivoting.      

Star factorizations of graph products

A k‐star is the graph K_1,k. We prove a general theorem about k‐star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k‐star factorizations of any power (K_q)^s of a complete graph with prime power order q, products C × C ×··· × C of k cycles of arbitrary lengths, and any power (C_r)^s of a cycle of arbitrary length. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 59–66, 2001     

Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K_n, is a 3‐factorization of K_n in which the components of each factor are cubes. We show that there exists a cube factorization of K_n if and only if n ≡ 16 (mod 24), thus providing a new family of uniform 3‐factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. © 2004 Wiley Periodicals, Inc.     

The spectrum of path factorization of bipartite multigraphs

LetλK_(m,n)be a bipartite multigraph with two partite sets having m and n vertices, respectively.A P_v-factorization ofλK_(m,n)is a set of edge-disjoint P_v-factors ofλK_(m,n)which partition the set of edges ofλK_(m,n).When v is an even number,Ushio,Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P_v-factorization ofλK_(m,n).When v is an odd number,we have proposed a conjecture.Very recently,we have proved that the conjecture is true when v=4k-1.In this paper we shall show that the conjecture is true when v = 4k 1,and then the conjecture is true.That is,we will prove that the necessary and sufficient conditions for the existence of a P_(4k 1)-factorization ofλK_(m,n)are(1)2km≤(2k 1)n,(2)2kn≤(2k 1)m,(3)m n≡0(mod 4k 1),(4)λ(4k 1)mn/[4k(m n)]is an integer.     

Numerical Semigroups on Compound Sequences

We generalize the geometric sequence {a^p, a^p?1b, a^p?2b²,…, b^p} to allow the p copies of a (resp. b) to all be different. We call the sequence {a₁a₂a₃… a_p, b₁a₂a₃…a_p, b₁b₂a₃…a_p,…, b₁b₂b₃…b_p} a compound sequence. We consider numerical semigroups whose minimal set of generators form a compound sequence, and compute various semigroup and arithmetical invariants, including the Frobenius number, Apéry sets, Betti elements, and catenary degree. We compute bounds on the delta set and the tame degree.     

Elasticity in certain block monoids via the Euclidean table

This paper continues the study begun in [GEROLDINGER, A.: On non-unique factorizations into irreducible elements II, Colloq. Math. Soc. János Bolyai 51 (1987), 723–757] concerning factorization properties of block monoids of the form ℬ(ℤ _n , S) where S = (hereafter denoted ℬ _a (n)). We introduce in Section 2 the notion of a Euclidean table and show in Theorem 2.8 how it can be used to identify the irreducible elements of ℬ _a (n). In Section 3 we use the Euclidean table to compute the elasticity of ℬ _a (n) (Theorem 3.4). Section 4 considers the problem, for a fixed value of n, of computing the complete set of elasticities of the ℬ _a (n) monoids. When n = p is a prime integer, Proposition 4.12 computes the three smallest possible elasticities of the ℬ _a (p). Part of this work was completed while the second author was on an Academic Leave granted by the Trinity University Faculty Development Committee.     

On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors

Given two 2‐regular graphs F₁ and F₂, both of order n, the Hamilton‐Waterloo Problem for F₁ and F₂ asks for a factorization of the complete graph into α₁ copies of F₁, α₂ copies of F₂, and a 1‐factor if n is even, for all nonnegative integers α₁ and α₂ satisfying . We settle the Hamilton‐Waterloo Problem for all bipartite 2‐regular graphs F₁ and F₂ where F₁ can be obtained from F₂ by replacing each cycle with a bipartite 2‐regular graph of the same order.     

Orthogonal factorizations of graphs

Let G be a graph with vertex set V(G) and edge set E(G). Let k₁, k₂,…,k_m be positive integers. It is proved in this study that every [0,k₁+…+k_m?m+1]‐graph G has a [0, k_i]₁^m‐factorization orthogonal to any given subgraph H with m edges. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 267–276, 2002     

Hamilton cycle rich two‐factorizations of complete graphs

For all integers n ≥ 5, it is shown that the graph obtained from the n‐cycle by joining vertices at distance 2 has a 2‐factorization is which one 2‐factor is a Hamilton cycle, and the other is isomorphic to any given 2‐regular graph of order n. This result is used to prove several results on 2‐factorizations of the complete graph K_n of order n. For example, it is shown that for all odd n ≥ 11, K_n has a 2‐factorization in which three of the 2‐factors are isomorphic to any three given 2‐regular graphs of order n, and the remaining 2‐factors are Hamilton cycles. For any two given 2‐regular graphs of even order n, the corresponding result is proved for the graph K_n ‐ I obtained from the complete graph by removing the edges of a 1‐factor. © 2004 Wiley Periodicals, Inc.     

P4k?1-factorization of bipartite multigraphs

Let λK _m,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A P _v-factorization of λK _m,n is a set of edge-disjoint P _v -factors of λK _m,n which partition the set of edges of λK _m,n. When v is an even number, Ushio, Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P _v -factorization of λK _m,n. When v is an odd number, we proposed a conjecture. However, up to now we only know that the conjecture is true for v = 3. In this paper we will show that the conjecture is true when v = 4k − 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P _4k−1-factorization of λK _m,n is (1) (2k − 1)m ⩽ 2kn, (2) (2k − 1)n ⩽ 2km, (3) m + n ≡ 0 (mod 4k − 1), (4) λ(4k − 1)mn/[2(2k − 1)(m + n)] is an integer.     

On K 1,k -factorization of bipartite multigraphs

A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n, which partition the set of edges of λKm,n. In this paper, it is proved that a sufficient condition for the existence of K1,k-factorization of λKm,n, whenever k is any positive integer, is that （1） m ≤ kn, （2） n ≤ km, （3） km-n = kn-m ≡ 0 （mod （k^2- 1）） and （4） λ（km-n）（kn-m） ≡ 0 （mod k（k- 1）（k^2 - 1）（m ＋ n））.     

Factorizations of complete multipartite graphs into generalized cubes

For a positive integer d, the usual d‐dimensional cube Q_d is defined to be the graph (K₂)^d, the Cartesian product of d copies of K₂. We define the generalized cube Q(K_k, d) to be the graph (K_k)^d for positive integers d and k. We investigate the decomposition of the complete multipartite graph K into factors that are vertex‐disjoint unions of generalized cubes Q(K_k, d_i), where k is a power of a prime, n and j are positive integers with j ≤ n, and the d_i may be different in different factors. We also use these results to partially settle a problem of Kotzig on Q_d‐factorizations of K_n. © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 144–150, 2000     

Balanced bipartite graphs may be completely star-factored

We conclude the study of complete K_1,q-factorizations of complete bipartite graphs of the form K_n,n and show that, so long as the obvious Basic Arithmetic Conditions are satisfied, such complete factorizations must exist. © 1997 John Wiley & Sons, Inc. J Combin Designs 5: 407–415, 1997     

Existence of subgraph with orthogonal (g,f)-factorization

Simple graphs are considered. Let G be a graph andg(x) andf(x) integer-valued functions defined on V(G) withg(x)⩽f(x) for everyxɛV(G). For a subgraphH ofG and a factorizationF=|F ₁,F ₂,⃛,F ₁| ofG, if |E(H)∩E(F ₁)|=1,1⩽i⩽j, then we say thatF orthogonal toH. It is proved that for an (mg(x)+k,mf(x) -k)-graphG, there exists a subgraphR ofG such that for any subgraphH ofG with |E(H)|=k,R has a (g,f)-factorization orthogonal toH, where 1⩽k<m andg(x)⩾1 orf(x)⩾5 for everyxɛV(G). Project supported by the Chitia Postdoctoral Science Foundation and Chuang Xin Foundation of the Chinese Academy of Sciences.     

Isomorphic factorization of the complete graph into Cayley digraphs

Let Z_p denote the cyclic group of order p where p is a prime number. Let X = X(Z_p, H) denote the Cayley digraph of Z_p with respect to the symbol H. We obtain a necessary and sufficient condition on H so that the complete graph on p vertices can be edge‐partitioned into three copies of Cayley digraphs of the same group Z_p each isomorphic to X. Based on this condition on H, we then enumerate all such Cayley graphs and digraphs. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 243–256, 2006     

The proof of Ushio’s conjecture concerning path factorization of complete bipartite graphs

Let K _m,n be a complete bipartite graph with two partite sets having m and n vertices, respectively. A P _v -factorization of K _m,n is a set of edge-disjoint P _v -factors of K _m,n which partition the set of edges of K _m,n . When v is an even number, Wang and Ushio gave a necessary and sufficient condition for existence of P _v -factorization of K _m,n . When k is an odd number, Ushio in 1993 proposed a conjecture. Very recently, we have proved that Ushio’s conjecture is true when v = 4k − 1. In this paper we shall show that Ushio Conjecture is true when v = 4k − 1, and then Ushio’s conjecture is true. That is, we will prove that a necessary and sufficient condition for the existence of a P _4k+1-factorization of K _m,n is (i) 2km≤(2k+1)n, (ii) 2kn≤(2k+1)m, (iii) m+n≡0 (mod 4k+1), (iv) (4k+1)mn/[4k(m+n)] is an integer.     

On Local Invertible Operators in L2 (ℝ1, H)

We study operators of the form Lu = — G(t) u(t) in L²([t₀ — δ, t₀ + δ], H) with = L² ([t₀— δ, t₀ + δ], H ) in the neighbourhood [t₀— δ, t₀ + δ] of a point t₀ ∈ ℝ¹. Such problems arise in questions on local solvability of partial differential equations (see [6] and [7]). For these operators,one of the major questions is if they are invertible in a neighbourhood of a point t ∈ ℝ¹. To solve this problem we establish needed commutator estimates. Using the commutator estimates and factorization theorems for nonanalytic operator-functions we give additional conditions for the nonanalytic operator -function G(t) and show that the operator L (or ) with some boundary conditions is local invertible.     

Finite free resolutions of length two and koszul generalized complex

Abstract

In 1956, Ehrenfeucht proved that a polynomial f ₁(x ₁) + · + f _n (x _n ) with complex coefficients in the variables x ₁, …, x _n is irreducible over the field of complex numbers provided the degrees of the polynomials f ₁(x ₁), …, f _n (x _n ) have greatest common divisor one. In 1964, Tverberg extended this result by showing that when n ≥ 3, then f ₁(x ₁) + · + f _n (x _n ) belonging to K[x ₁, …, x _n ] is irreducible over any field K of characteristic zero provided the degree of each f _i is positive. Clearly a polynomial F = f ₁(x ₁) + · + f _n (x _n ) is reducible over a field K of characteristic p ≠ 0 if F can be written as F = (g ₁(x ₁)) ^p  + (g ₂(x ₂)) ^p  + · + (g _n (x _n )) ^p  + c[g ₁(x ₁) + g ₂(x ₂) + · + g _n (x _n )] where c is in K and each g _i (x _i ) is in K[x _i ]. In 1966, Tverberg proved that the converse of the above simple fact holds in the particular case when n = 3 and K is an algebraically closed field of characteristic p > 0. In this article, we prove an extension of Tverberg's result by showing that this converse holds for any n ≥ 3.     

A Generalization of Orthogonal Factorizations in Graphs

Let G be a graph with vertex set V(G) and edge set E(G) and let g and f be two integer-valuated functions defined on V(G) such that g(x) ≤f(x) for all x∈V(G). Then a (g, f)-factor of G is a spanning subgraph H of G such that g(x) ≤d _H (x) ≤f(x) for all x∈V(G). A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let = {F ₁, F ₂, ..., F _m } be a factorization of G and H be a subgraph of G with mr edges. If F _i , 1 ≤i≤m, has exactly r edges in common with H, then is said to be r-orthogonal to H. In this paper it is proved that every (mg + kr, mf−kr)-graph, where m, k and r are positive integers with k < m and g≥r, contains a subgraph R such that R has a (g, f)-factorization which is r-orthogonal to a given subgraph H with kr edges. This research is supported by the National Natural Science Foundation of China (19831080) and RSDP of China