Analytic functions whose range is dense in a ball

Denote by Δ(resp. $\text{Δ}$) the open (resp. closed) unit disc in C. Let E be a closed subset of the unit circle T and let F be a relatively closed subset of T ? E of Lesbesgue measure zero. The following result is proved. Given a complex Banach space X and a bounded continuous function f:F → X, there exists an extension f? of f, bounded and continuous on $\text{}\text{?}\text{gD ? E}$, analytic on Δ and satisfying sup$\text{{6}\text{f}\text{?}\text{(z)6:zε}\text{δ}\text{?E}$. This is applied to show that for any separable complex Banach space X there exists an analytic function from Δ to X whose range is contained and dense in the unit ball of X.     

A theorem in combinatorial matrix theory

Let Z be a matrix of order n, and suppose that the elements of Z consist of only two elements x and y, which are elements of a field F. We call Z an (x,y)-matrix over F. In this paper we study the matrix equation ZEZ^T = D+λJ, where Z is a nonsingular (x,y)-matrix over F, Z^T is the transpose of Z, D and E are nonsingular diagonal matrices, J is the matrix of 1's and λ is an element of F. Our main theorem shows that the column sums of Z are severely restricted. This result generalizes a number of earlier investigations that deal with symmetric block designs and related configurations. The problems that emerge are of interest from both a combinatorial and a matrix theoretic point of view.     

A dimension series for multivariate splines

For a polyhedral subdivision Δ of a region in Euclideand-space, we consider the vector spaceC _k ^r (Δ) consisting of allC ^r piecewise polynomial functions over Δ of degree at mostk. We consider the formal power series ∑ _k≥0 dim_? C _k ^r (Δ)λ^k and show, under mild conditions on Δ, that this always has the formP(λ)/(1?λ) ^d+1, whereP(λ) is a polynomial in λ with integral coefficients which satisfiesP(0)=1,P(1)=f _d (Δ), andP′(1)=(r+1)f _d?1 ⁰ (Δ). We discuss how the polynomialP(λ) and bases for the spacesC _k ^r (Δ) can be effectively calculated by use of Gröbner basis techniques of computational commutative algebra. A further application is given to the theory of hyperplane arrangements.     

On the h-triangles of sequentially (S r ) simplicial complexes via algebraic shifting

Recently, Haghighi, Terai, Yassemi, and Zaare-Nahandi introduced the notion of a sequentially (S _r ) simplicial complex. This notion gives a generalization of two properties for simplicial complexes: being sequentially Cohen–Macaulay and satisfying Serre’s condition (S _r ). Let Δ be a (d?1)-dimensional simplicial complex with Γ(Δ) as its algebraic shifting. Also let (h _i,j (Δ))_{0≤j≤i≤d} be the h-triangle of Δ and (h _i,j (Γ(Δ)))_{0≤j≤i≤d} be the h-triangle of Γ(Δ). In this paper, it is shown that for a Δ being sequentially (S _r ) and for every i and j with 0≤j≤i≤r?1, the equality h _i,j (Δ)=h _i,j (Γ(Δ)) holds true.     

Writing representations over minimal fields

The chief aim of this paper is to describe a procedure which, given a d-dimensional absolutely irreducible matrix representation of a finite group over a finite field E, produces an equivalent representation such that all matrix entries lie in a subfield F of E which is as small as possible. The algorithm relies on a matrix version of Hilbert's Theorem 90, and is probabilistic with expected running time O(|E:F|d³) when |F| is bounded. Using similar methods we then describe an algorithm which takes as input a prime number and a power-conjugate presentation for a finite soluble group, and as output produces a full set of absolutely irreducible representations of the group over fields whose characteristic is the specified prime, each representation being written over its minimal field.     

Essentially doubly stochastic matrices II. Canonical forms for row equivalence,equivalence, and a special case of congruence

In this paper we obtain canonical forms for row equivalence, equivalence, and a special case of congruence in the algebra of essentially doubly stochastic (e.d.s.) matrices of order n over a field F, char(F) [nmid] n. These forms are analogues of familiar forms in ordinary matrix algebra. The canonical form for equivalence is used in showing, in a subsequent paper, that every e.d.s. matrix of rank r and order n over F, char(F) = 0 or char(F) > n, is a product of elementary e.d.s. matrices, n – r of which are singular.     

A common property of R(E, F) and B(ℝ n , ℝ m ) and a new method for seeking a path to connect two operators

Given two Banach spaces E, F, let B(E, F) be the set of all bounded linear operators from E into F, and R(E, F) the set of all operators in B(E, F) with finite rank. It is well-known that B(? ⁿ ) is a Banach space as well as an algebra, while B(? ⁿ , ? ^m ) for m ≠ n, is a Banach space but not an algebra; meanwhile, it is clear that R(E, F) is neither a Banach space nor an algebra. However, in this paper, it is proved that all of them have a common property in geometry and topology, i.e., they are all a union of mutual disjoint path-connected and smooth submanifolds (or hypersurfaces). Let Σ _r be the set of all operators of finite rank r in B(E, F) (or B(? ⁿ , ? ^m )). In fact, we have that 1) suppose Σ _r ∈ B(? ⁿ , ? ^m ), and then Σ _r is a smooth and path-connected submanifold of B(? ⁿ , ? ^m ) and dimΣ _r = (n + m)r ? r ², for each r ∈ [0, min{n,m}; if m ≠ n, the same conclusion for Σ _r and its dimension is valid for each r ∈ [0, min{n, m}]; 2) suppose Σ _r ∈ B(E, F), and dimF = ∞, and then Σ _r is a smooth and path-connected submanifold of B(E, F) with the tangent space T _A Σ _r = {B ∈ B(E, F): BN(A) ? R(A)} at each A ∈ Σ _r for 0 ? r ? ∞. The routine methods for seeking a path to connect two operators can hardly apply here. A new method and some fundamental theorems are introduced in this paper, which is development of elementary transformation of matrices in B(? ⁿ ), and more adapted and simple than the elementary transformation method. In addition to tensor analysis and application of Thom’s famous result for transversility, these will benefit the study of infinite geometry.     

The cores of random hypergraphs with a given degree sequence

We study random r‐uniform n vertex hypergraphs with fixed degree sequence d = (d₁…,d_n), maximum degree Δ = o(n^1/24) and total degree θn, where θ is bounded. We give the size, number of edges and degree sequence of the κ ≥ 2) up to a whp error of O(n^2/3 Δ^4/3 log n). In the case of graphs (r = 2) we give further structural details such as the number of tree components and, for the case of smooth degree sequences, the size of the mantle. We give various examples, such as the cores of r‐uniform hypergraphs with a near Poisson degree sequence, and an improved upper bound for the first linear dependence among the columns in the independent column model of random Boolean matrices. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 25, 2004     

The Relaxed Edge-Coloring Game and <Emphasis Type="Italic">k</Emphasis>-Degenerate Graphs

The (r, d)-relaxed edge-coloring game is a two-player game using r colors played on the edge set of a graph G. We consider this game on forests and more generally, on k-degenerate graphs. If F is a forest with Δ(F)=Δ, then the first player, Alice, has a winning strategy for this game with r=Δ?j and d≥2j+2 for 0≤j≤Δ?1. This both improves and generalizes the result for trees in Dunn, C. (Discret. Math. 307, 1767–1775, 2007). More broadly, we generalize the main result in Dunn, C. (Discret. Math. 307, 1767–1775, 2007) by showing that if G is k-degenerate with Δ(G)=Δ and j∈[Δ+k?1], then there exists a function h(k,j) such that Alice has a winning strategy for this game with r=Δ+k?j and d≥h(k,j).     

Reduced convex bodies in the plane

A convex bodyR of Euclideand-spaceE ^d is called reduced if there is no convex body properly contained inR of thickness equal to the thickness Δ(R) ofR. The paper presents basic properties of reduced bodies inE ². Particularly, it is shown that the diameter of a reduced bodyR?E ² is not greater than √2Δ(R), and that the perimeter is at most (2+½π)Δ(R). Both the estimates are the best possible.     

Geometric topological completions with universal final lifts

In this paper necessary and sufficient conditions are given on a concrete category over a category B so that it can be densely embedded (over B) into a geometric topological category E that admits certain universal final lifts. These conditions, as well as the class of universal final lifts, depend upon an a priori given full subcategory Δ of B. For example, E may have, depending upon Δ and B, universal coproducts or quotients or colimits. For appropriate Δ's, if B is cartesian closed then so is E.     

Existence of triple solutions of discrete (n,p) boundary value problems

We consider the following boundary value problem: −Δⁿy = F(k,y, Δy,…,Δⁿ⁻¹y), k ϵ Z[n − 1, N], Δⁱy(0) = 0, 0 ≤ i ≤ n − 2, Δ^py(N + n - p) = 0, where n ≥ 2 and p is a fixed integer satisfying 0 ≤ p ≤ n − 1. Using a fixed-point theorem for operators on a cone, we shall yield the existence of at least three positive solutions.     

The iterated Aluthge transforms of a matrix converge

Given an r×r complex matrix T, if T=U|T| is the polar decomposition of T, then, the Aluthge transform is defined byΔ(T)=|T|^1/2U|T|^1/2. Let Δn(T) denote the n-times iterated Aluthge transform of T, i.e., Δ⁰(T)=T and Δn(T)=Δ(Δn−1(T)), n∈N. We prove that the sequence {Δn(T)}_n∈N converges for every r×r matrix T. This result was conjectured by Jung, Ko and Pearcy in 2003. We also analyze the regularity of the limit function.     

Exponential sums and rectangular partitions

Let F denote a finite field with q=p^f elements, and let σ(A) equal the trace of the square matrix A. This paper evaluates exponential sums of the form S(E,X₁,…,X_n)e{?σ(CX₁?X_nE)}, where S(E,X₁,…,X_n) denotes a summation over all matrices E,X₁,…,X_n of appropriate sizes over F, and C is a fixed matrix. This evaluation is then applied to the problem of counting ranked solutions to matrix equations of the form U₁?U_αA+DV₁?V_β=B where A,B,D are fixed matrices over F.     

Space complexity of random formulae in resolution

We study the space complexity of refuting unsatisfiable random k-CNFs in the Resolution proof system. We prove that for Δ ≥ 1 and any ϵ > 0, with high probability a random k-CNF over n variables and Δn clauses requires resolution clause space of Ω(n/Δ^1+ϵ). For constant Δ, this gives us linear, optimal, lower bounds on the clause space. One consequence of this lower bound is the first lower bound for size of treelike resolution refutations of random 3-CNFs with clause density Δ ≫ n. This bound is nearly tight. Specifically, we show that with high probability, a random 3-CNF with Δn clauses requires treelike refutation size of exp(Ω(n/Δ^1+ϵ)), for any ϵ > 0. Our space lower bound is the consequence of three main contributions: (1) We introduce a 2-player Matching Game on bipartite graphs G to prove that there are no perfect matchings in G. (2) We reduce lower bounds for the clause space of a formula F in Resolution to lower bounds for the complexity of the game played on the bipartite graph G(F) associated with F. (3) We prove that the complexity of the game is large whenever G is an expander graph. Finally, a simple probabilistic analysis shows that for a random formula F, with high probability G(F) is an expander. We also extend our result to the case of G-PHP, a generalization of the Pigeonhole principle based on bipartite graphs G. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 23: 92–109, 2003     

Some comments concerning the Levine approach to slicing classical knots

This paper is concerned with the problem of when a Seifert surface for a slice knot can be 2-surgered to a disk in B⁴. Techniques of 3-dimensional topology are the principal tools employed. The main theorem asserts that such a Seifert surface, F, can be 2-surgered to a disk in B⁴ along a ribbon link if and only if there is a ribbon disk, Δ, spanning ∂F such that the singular set of Δ misses the interior of F.     

Limit of the spectra of the interior Neumann problems when a solid domain shrinks to a plane one

Let (Δ + λ) u = 0 in $\text{D}$c$\text{R}$^d, $\text{?u}\text{?N}\text{=0}$ on ?$\text{D}$. How do the eigenvalues λ_j behave when $\text{D}$ shrinks to a domain Δ ? R^{d ? 1} ? The answer depends not only on Δ but on the way $\text{D}$ shrinks to Δ. The limit of λ_j is found. Examples are given.     

Convexes divisibles III

Let Δ₀ be a group of finite type and FΔ₀⊂Hom(Δ₀,PGL(Rm)) be the subset of faithful representations for which there exists a properly convex Δ₀-invariant open subset Ω in P(Rm) such that the quotient Δ₀\Ω is compact. Koszul has proved in [J.L. Koszul, Déformation des connexions localement plates, Ann. Inst. Fourier 18 (1968) 103-114] that this subset FΔ₀ is open. We describe the closure of FΔ₀. As a consequence, we show that this subset FΔ₀ is closed if and only if the virtual center of Δ₀ is trivial. This condition is satisfied if and only if FΔ₀ contains a strongly¹ irreducible representation.     

Decomposition of bipartite graphs into special subgraphs

Let F and G be two graphs and let H be a subgraph of G. A decomposition of G into subgraphs F₁,F₂,…,F_m is called an F-factorization of G orthogonal to H if F_i≅F and |E(F_i∩H)|=1 for each i=1,2,…,m. Gyárfás and Schelp conjectured that the complete bipartite graph K_4k,4k has a C₄-factorization orthogonal to H provided that H is a k-factor of K_4k,4k. In this paper, we show that (1) the conjecture is true when H satisfies some structural conditions; (2) for any two positive integers r?k, K_kr²,kr² has a K_r,r-factorization orthogonal to H if H is a k-factor of K_kr²,kr²; (3) K_2d²,2d² has a C₄-factorization such that each edge of H belongs to a different C₄ if H is a subgraph of K_2d²,2d² with maximum degree Δ(H)?d.