On computing minimal realizable spectral radii of non‐negative matrices

For decades considerable efforts have been exerted to resolve the inverse eigenvalue problem for non‐negative matrices. Yet fundamental issues such as the theory of existence and the practice of computation remain open. Recently, it has been proved that, given an arbitrary (n–1)‐tuple ?? = (λ₂,…,λ_n) ∈ ?^n–1 whose components are closed under complex conjugation, there exists a unique positive real number ?(??), called the minimal realizable spectral radius of ??, such that the set {λ₁,…,λ_n} is precisely the spectrum of a certain n × n non‐negative matrix with λ₁ as its spectral radius if and only if λ₁ ? ?(??). Employing any existing necessary conditions as a mode of checking criteria, this paper proposes a simple bisection procedure to approximate the location of ?(??). As an immediate application, it offers a quick numerical way to check whether a given n‐tuple could be the spectrum of a certain non‐negative matrix. Copyright © 2004 John Wiley & Sons, Ltd.     

Soluble minimal non-(finite-by-Baer)-groups

Let \mathfrakX{\mathfrak{X}} be a class of groups. A group G is called a minimal non- \mathfrakX{\mathfrak{X}}-group if it is not an \mathfrakX{\mathfrak{X}}-group but all of whose proper subgroups are \mathfrakX{\mathfrak{X}}-groups. In [16], Xu proved that if G is a soluble minimal non-Baer-group, then G/G ^′′ is a minimal non-nilpotent-group which possesses a maximal subgroup. In the present note, we prove that if G is a soluble minimal non-(finite-by-Baer)-group, then for all integer n ≥ 2, G/γ _n (G′) is a minimal non-(finite-by-abelian)-group.     

Q5‐factorization of λKn

Q_k is the simple graph whose vertices are the k‐tuples with entries in {0, 1} and edges are the pairs of k‐tuples that differ in exactly one position. In this paper, we proved that there exists a Q₅‐factorization of λK_n if and only if (a) n ≡ 0(mod 32) if λ ≡ 0(mod 5) and (b) n ≡ 96(mod 160) if λ ? 0(mod 5).     

A local structure theorem on 5‐connected graphs

An edge of a 5‐connected graph is said to be contractible if the contraction of the edge results in a 5‐connected graph. Let x be a vertex of a 5‐connected graph. We prove that if there are no contractible edges whose distance from x is two or less, then either there are two triangles with x in common each of which has a distinct degree five vertex other than x, or there is a specified structure called a K₄^?‐configuration with center x. As a corollary, we show that if a 5‐connected graph on n vertices has no contractible edges, then it has 2n/5 vertices of degree 5. © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 99–129, 2009     

Surface embeddings of Steiner triple systems

A Steiner triple system of order n (STS(n)) is said to be embeddable in an orientable surface if there is an orientable embedding of the complete graph K_n whose faces can be properly 2-colored (say, black and white) in such a way that all black faces are triangles and these are precisely the blocks of the STS(n). If, in addition, all white faces are triangular, then the collection of all white triangles forms another STS(n); the pair of such STS(n)s is then said to have an (orientable) bi-embedding. We study several questions related to embeddings and bi-embeddings of STSs. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 325–336, 1998     

Total Scalar Curvature and L 2 Harmonic 1-Forms on a Minimal Hypersurface in Euclidean Space

Let M ⁿ , n 3, be a complete oriented immersed minimal hypersurface in Euclidean space R ⁿ⁺¹. We show that if the total scalar curvature on M is less than the n/2 power of 1/C _s , where C _s is the Sobolev constant for M, then there are no L ² harmonic 1-forms on M. As corollaries, such a minimal hypersurface contains no nontrivial harmonic functions with finite Dirichlet integral and so it has only one end. This implies finally that M is a hyperplane.     

Finite subgraphs of uncountably chromatic graphs

It is consistent that for every function f:ω → ω there is a graph with size and chromatic number ?₁ in which every n‐chromatic subgraph contains at least f(n) vertices (n ≥ 3). This solves a $ 250 problem of Erd?s. It is consistent that there is a graph X with Chr(X)=|X|=?₁ such that if Y is a graph all whose finite subgraphs occur in X then Chr(Y)≤?₂ (so the Taylor conjecture may fail). It is also consistent that if X is a graph with chromatic number at least ?₂ then for every cardinal λ there exists a graph Y with Chr(Y)≥λ all whose finite subgraphs are induced subgraphs of X. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 28–38, 2005     

Representation of the space spanned by a sequence in a Banach space

Summary Let (x _n ) be a general sequence of a Banach space, there is given a particular representation of the elements of the space spanned by (x _n ), by means of the elements of (x _n ). Some properties of this representation are shown, also if (x _n is minimal or normingM-basis. Moreover some open questions are solved.     

Topological realizations of families of ergodic automorphisms, multitowers and orbit equivalence

We study minimal topological realizations of families of ergodic measure preserving automorphisms (e.m.p.a.'s). Our main result is the following theorem. Theorem: Let {T_p:p∈I} be an arbitrary finite or countable collection of e.m.p.a.'s on nonatomic Lebesgue probability spaces (Y _p v _p ). Let S be a Cantor minimal system such that the cardinality of the set ε _S of all ergodic S-invariant Borel probability measures is at least the cardinality of I. Then for any collection {μ _p :pεI} of distinct measures from ε _S there is a Cantor minimal system S′ in the topological orbit equivalence class of S such that, as a measure preserving system, (S ¹,μ _p ) is isomorphic to T_p for every p∈I. Moreover, S′ can be chosen strongly orbit equivalent to S if and only if all finite topological factors of S are measure-theoretic factors of T_p for all p∈I. This result shows, in particular, that there are no restrictions at all for the topological realizations of countable families of e.m.p.a.'s in Cantor minimal systems. Namely, for any finite or countable collection {T ₁,T₂,…} of e.m.p.a.'s of nonatomic Lebesgue probability spaces, there is a Cantor minimal systemS, whose collection {μ1,μ2…} of ergodic Borel probability measures is in one-to-one correspondence with {T ₁,T₂,…}, and such that (S,μ _i ) is isomorphic toT _i for alli. Furthermore, since realizations are taking place within orbit equivalence classes of a given Cantor minimal system, our results generalize the strong orbit realization theorem and the orbit realization theorem of [18]. Those theorems are now special cases of our result where the collections {T _p}, {T _p }{μ _p } consist of just one element each. Research of I.K. was supported by NSF grant DMS 0140068.     

Codimension-one minimal projections onto Haar subspaces

Let H_n be an n-dimensional Haar subspace of and let H_n−1 be a Haar subspace of H_n of dimension n−1. In this note we show (Theorem 6) that if the norm of a minimal projection from H_n onto H_n−1 is greater than 1, then this projection is an interpolating projection. This is a surprising result in comparison with Cheney and Morris (J. Reine Angew. Math. 270 (1974) 61 (see also (Lecture Notes in Mathematics, Vol. 1449, Springer, Berlin, Heilderberg, New York, 1990, Corollary III.2.12, p. 104) which shows that there is no interpolating minimal projection from C[a,b] onto the space of polynomials of degree n, (n2). Moreover, this minimal projection is unique (Theorem 9). In particular, Theorem 6 holds for polynomial spaces, generalizing a result of Prophet [(J. Approx. Theory 85 (1996) 27), Theorem 2.1].     

Construction of systems of differential equations of Okubo normal form with rigid monodromy

For systems of differential equations of the form (xI _n – T )dy /dx = Ay (systems of Okubo normal form), where A is an n × n constant matrix and T is an n × n constant diagonal matrix, two kinds of operations (extension and restriction) are defined. It is shown that every irreducible system of Okubo normal form of semi‐simple type whose monodromy representation is rigid is obtained from a rank 1 system of Okubo normal form by a finite iteration of the operations. Moreover, an algorithm to calculate the generators of monodromy groups for rigid systems of Okubo normal form is given. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Amenability constants for semilattice algebras

For any finite commutative idempotent semigroup S, a semilattice, we show how to compute the amenability constant of its semigroup algebra ℓ ¹(S). This amenability constant is always of the form 4n+1. We then show that these give lower bounds to amenability constants of certain Banach algebras graded over semilattices. We also give example of a commutative Clifford semigroups G _n whose semigroup algebras ℓ ¹(G _n ) admit amenability constants of the form 41+4(n−1)/n. We also show there is no commutative semigroup whose semigroup algebra has an amenability constant between 5 and 9. N. Spronk’s research was supported by NSERC Grant 312515-05.     

On the number of generators needed for free profinite products of finite groups

We provide lower estimates on the minimal number of generators of the profinite completion of free products of finite groups. In particular, we show that if C ₁, ..., C _n are finite cyclic groups then there exists a finite group G which is generated by isomorphic copies of C ₁, ..., C _n and the minimal number of generators of G is n. The first author’s research is partially supported by NSF grant DMS-0701105. The second author’s research is partially supported by OTKA grant T38059 and the Magyary Zoltán Postdoctoral Fellowship.     

Product recurrent properties, disjointness and weak disjointness

Let F be a collection of subsets of ℝ₊ and (X, T) be a dynamical system; x ∈ X is F-recurrent if for each neighborhood U of x, {n ∈ ℝ₊: T ⁿ x ∈ U} ∈ F; x is F-product recurrent if (x, y) is recurrent for any F-recurrent point y in any dynamical system (Y, S). It is well known that x is {infinite}-product recurrent if and only if it is minimal and distal. In this paper it is proved that the closure of a {syndetic}-product recurrent point (i.e., weakly product recurrent point) has a dense minimal points; and a {piecewise syndetic}-product recurrent point is minimal. Results on product recurrence when the closure of an F-recurrent point has zero entropy are obtained.     

On Commuting Graphs of Finite Matrix Rings

The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all noncentral elements of R and two distinct vertices are joint by an edge whenever they commute. It is conjectured that if R is a ring with identity such that Γ(R) ≈ Γ(M _n (F)), for a finite field F and n ≥ 2, then R ≈ M _n (F). Here we prove this conjecture when n = 2.     

On graphs whose Laplacian matrices have distinct integer eigenvalues

In this paper, we investigate graphs for which the corresponding Laplacian matrix has distinct integer eigenvalues. We define the set S_i,n to be the set of all integers from 0 to n, excluding i. If there exists a graph whose Laplacian matrix has this set as its eigenvalues, we say that this set is Laplacian realizable. We investigate the sets S_i,n that are Laplacian realizable, and the structures of the graphs whose Laplacian matrix has such a set as its eigenvalues. We characterize those i < n such that S_i,n is Laplacian realizable, and show that for certain values of i, the set S_i,n is realized by a unique graph. Finally, we conjecture that S_n,n is not Laplacian realizable for n ≥ 2 and show that the conjecture holds for certain values of n. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Finite groups in which permutability is a transitive relation on their frattini factor groups

Let G be a finite group. A PT-group is a group G whose subnormal subgroups are all permutable in G. A PST-group is a group G whose subnormal subgroups are all S-permutable in G. We say that G is a PT_o-group (respectively, a PST_o-group) if its Frattini quotient group G/Φ(G) is a PT-group (respectively, a PST-group). In this paper, we determine the structure of minimal non-PT_o-groups and minimal non-PST_o-groups.      

On Minimal Entropy and Stability

We study n-manifolds Y whose fundamental groups are subexponential extensions of the fundamental group of some closed locally symmetric manifold X of negative curvature. We show that, in this case, MinEnt(Y)ⁿ is an integral multiple of MinEnt(X)ⁿ, and the value MinEnt(Y) is generally not attained (unless if Y is diffeomorphic to X). This gives a new class of manifolds for which the minimal entropy problem is completely solved. Several examples (even complex projective), obtained by gluings and by taking plane intersections in complex projective space, are described. Some problems about topological stability, related to the minimal entropy problem, are also discussed.     

Fixed Points of Automorphisms of Graphs with 1 – Factorizations

We consider sets of fixed points of finite simple undirected connected graphs with 1 – factorizations. The maximum number of fixed points of complete graphs K_2n (n > 2) is n if n ≡ 0 mod 4, n — 1 if n ≡ 3 mod 4 or n ≡ 5 mod 12, n — 2 if n ≡ 2 mod 4, n — 3 if n ≡ 1 mod 4 and n ≢ 5 (mod 12). The maximum number of fixed points of 1 – factorizations of (non – complete) graphs with 2n vertices is less than or equal to n. If n is a prime number, then there are graphs with 2n vertices whose 1 – factorizations have automorphisms with n fixed points. Moreover, a result on the structure of a group of fixed – point – free automorphisms is presented.     

Multicolored trees in complete graphs

A multicolored tree is a tree whose edges have different colors. Brualdi and Hollingsworth 5 proved in any proper edge coloring of the complete graph K_2n(n > 2) with 2n ? 1 colors, there are two edge‐disjoint multicolored spanning trees. In this paper we generalize this result showing that if (a₁,…, a_k) is a color distribution for the complete graph K_n, n ≥ 5, such that , then there exist two edge‐disjoint multicolored spanning trees. Moreover, we prove that for any edge coloring of the complete graph K_n with the above distribution if T is a non‐star multicolored spanning tree of K_n, then there exists a multicolored spanning tree T' of K_n such that T and T' are edge‐disjoint. Also it is shown that if K_n, n ≥ 6, is edge colored with k colors and , then there exist two edge‐disjoint multicolored spanning trees. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 221–232, 2007