Separation in topological algebras

One of the basic results from the theory of topological groups is that aT ₀ topological group is already completely regular. It is also known [1] thatT ₀ quasigroups are regular. Taylor [8] showed that a fragment of these results holds in any congruence permutable variety, namely that in such a variety aT ₀ topological algebra is already Hausdorff. Gumm [2] extended this result to 3-permutable varieties and showed that, more generally,T ₀ topological algebras in congruencen-permutable varieties areT ₁. In this paper we show thatT ₀ topological algebras inn-permutable varieties satisfy a separation condition strictly stronger thanT ₁. We also give some counterexamples that show that some of these separation results are the best possible.Presented by S. Burris.This research was part of the author's thesis at The University of Colorado, directed by Walter Taylor. The author wishes to thank professor Taylor for his many contributions.     

Hausdorff properties of topological algebras

Let P be a property of topological spaces. Let [P] be the class of all varieties having the property that any topological algebra in has underlying space satisfying property P. We show that if P is preserved by finite products, and if is preserved by ultraproducts, then [P] is a class of varieties that is definable by a Maltsev condition.?The property that all T ₀ topological algebras in are j-step Hausdor. (Hj) is preserved by finite products, and its negation is preserved by ultraproducts. We partially characterize the Maltsev condition associated to by showing that this topological implication holds in every (2j + 1)-permutable variety, but not in every (2j + 2)-permutable variety.?Finally, we show that the topological implication holds in every k-permutable, congruence modular variety. Received March 1, 2000; accepted in final form October 18, 2001.     

IDEAL DETERMINED VARIETIES HAVE UNBOUNDED DEGREES OF PERMUTABILITY

Abstract

It is proved that for every integer n ≥ 2, there is a (finitely generated congruence distributive) ideal determined variety that is congruence (n + 1)-permutable but not congruence n-permutable. This answers a question of Gumm and Ursini.     

Induced operators on symmetry classes of tensors

LetV be ann-dimensional inner product space,T _i ,i=1,...,k, k linear operators onV, H a subgroup ofS _m (the symmetric group of degreem), a character of degree 1 andT a linear operator onV. Denote byK(T) the induced operator ofT onV (H), the symmetry class of tensors associated withH and . This note is concerned with the structure of the setK _{, m} ^H (T₁,...,T_k) consisting of all numbers of the form traceK(T ₁ U ₁...T _k U _k ) whereU _i ,i=1,...k vary over the group of all unitary operators onV. For V=ⁿ or ⁿ, it turns out thatK _{, m} ^H (T₁,...,T_k) is convex whenm is not a multiple ofn. Form=n, there are examples which show that the convexity of _{, m} ^H (T₁,...,T_k) depends onH and .The author wishes to express his thanks to Dr. Yik-Hoi Au-Yeung for his valuable advice and encouragement.     

Monotone clones and congruence modularity

We investigate the relationship between the local shape of an ordered set P=(P; ) and the congruence-modularity of the variety V generated by an algebra A=(P; F) each of whose operations is order-preserving with respect to P. For example, if V is k-permutable (k2) then P is an antichain; if P is both up and down directed and V is congruence-modular, then V is congruence-distributive; if A is a dual discriminator algebra, then either P is an antichain or a two-element chain. We also give a useful necessary condition on P for V to be congruence-modular. Finally a class of ordered sets called braids is introduced and it is shown that if P is a braid of length 1, in particular if P is a crown, then the variety V is not congruence-modular.     

Covering times of random walks on bounded degree trees and other graphs

The motivating problem for this paper is to find the expected covering time of a random walk on a balanced binary tree withn vertices. Previous upper bounds for general graphs ofO(|V| |E|)⁽¹⁾ andO(|V| |E|/d _min)⁽²⁾ imply an upper bound ofO(n ²). We show an upper bound on general graphs ofO( |E| log |V|), which implies an upper bound ofO(n log² n). The previous lower bound was (|V| log |V|) for trees.⁽²⁾ In our main result, we show a lower bound of (|V| (log _{d max} |V|)²) for trees, which yields a lower bound of (n log² n). We also extend our techniques to show an upper bound for general graphs ofO(max{E T_i} log |V|).     

Lower bounds for the condition number of Vandermonde matrices

Summary We derive lower bounds for the -condition number of then×n-Vandermonde matrixV _n(x) in the cases where the node vectorx _T=[x₁, x₂,...,x_n] has positive elements or real elements located symmetrically with respect to the origin. The bounds obtained grow exponentially inn. withO(2ⁿ) andO(2^n/2), respectively. We also compute the optimal spectral condition numbers ofV _n(x) for the two node configurations (including the optimal nodes) and compare them with the bounds obtained.Dedicated to the memory of James H. WilkinsonSupported, in part, by the National Science Foundation under grant CCR-8704404     

Trees with Equal Domination and Restrained Domination Numbers

Let G = (V,E) be a graph and let S V. The set S is a packing in G if the vertices of S are pairwise at distance at least three apart in G. The set S is a dominating set (DS) if every vertex in V − S is adjacent to a vertex in S. Further, if every vertex in V − S is also adjacent to a vertex in V − S, then S is a restrained dominating set (RDS). The domination number of G, denoted by γ(G), is the minimum cardinality of a DS of G, while the restrained domination number of G, denoted by γ_r(G), is the minimum cardinality of a RDS of G. The graph G is γ-excellent if every vertex of G belongs to some minimum DS of G. A constructive characterization of trees with equal domination and restrained domination numbers is presented. As a consequence of this characterization we show that the following statements are equivalent: (i) T is a tree with γ(T)=γ_r(T); (ii) T is a γ-excellent tree and T ≠ K₂; and (iii) T is a tree that has a unique maximum packing and this set is a dominating set of T. We show that if T is a tree of order n with ℓ leaves, then γ_r(T) ≤ (n + ℓ + 1)/2, and we characterize those trees achieving equality.     

One‐Dimensional Birth‐Death Process and Delbrück‐Gillespie Theory of Mesoscopic Nonlinear Chemical Reactions

As a mathematical theory for the stochastic, nonlinear dynamics of individuals within a population, Delbrück‐Gillespie process (DGP) is a birth–death system with state‐dependent rates which contain the system size V as a natural parameter. For large V , it is intimately related to an autonomous, nonlinear ODE as well as a diffusion process. For nonlinear dynamical systems with multiple attractors, the quasi‐stationary and stationary behavior of such a birth–death process can be understood in terms of a separation of time scales by a T*～e^αV (α > 0) : a relatively fast, intra‐basin diffusion for t?T* and a much slower inter‐basin Markov jump process for t?T* . In this paper for one‐dimensional systems, we study both stationary behavior (t=∞ ) in terms of invariant distribution , and finite time dynamics in terms of the mean first passsage time (MFPT) . We obtain an asymptotic expression of MFPT in terms of the “stochastic potential”. We show in general no continuous diffusion process can provide asymptotically accurate representations for both the MFPT and the for a DGP. When n₁ and n₂ belong to two different basins of attraction, the MFPT yields the T*(V) in terms of Φ (x, V) ≈φ₀(x) + (1/V)φ₁(x) . For systems with saddle‐node bifurcations and catastrophe, discontinuous “phase transition” emerges, which can be characterized by Φ (x, V) in the limit of . In terms of timescale separation, the relation between deterministic local nonlinear bifurcations, and stochastic global phase transition is discussed. The one‐dimensional theory is a pedagogic first step toward a general theory of DGP.     

Applications of matroid partition to tree decomposition

1.IntroductionWeshallassumefamiliaritywithmatroidtheory--foranintroduction,andforthedefinitionoftermsnotdefinedinthispaper,see[31.Edmonds'matroidpartitiontheoremisaveryimportanttheorem,whichhasmanyapplications.Twoclassicresultsof[4,5],whichconcernwithpackingandcoveringoftheedgesetofagraphwithkedge--disjointspanningtrees,canbeeasilydeducedfromit(see[3],PP.125--127).Inthepresentpaperwewillpresentamatroidapproachtotheproblemoftreedecompositionraisedrecently(see[6,7]).Ourmainaimistogivealternati…     

Finite Groups with S-permutable n-maximal Subgroups

Let G be a finite group and M _n (G) be the set of n-maximal subgroups of G, where n is an arbitrary given positive integer. Suppose that M _n (G) contains a nonidentity member and all members in M _n (G) are S-permutable in G. Then any of of the following conditions guarantees the supersolvability of G: (1) M _n (G) contains a nonidentity member whose order is not a prime; (2) all nonidentity members in M _n (G) are of prime order, and all cyclic members in M _n?1(G) of order 4 are S-permutable in G.     

Classes de Chern Des Ensembles Analytiques

Let V be a compact complex analytic subset of a non-singular holomorphic manifold M. Assume that V has pure complex dimension n. Denote by V₀ its regular part, and by [V] its fundamental class in H_2n(V; ). If V is a locally complete intersection (LCI), it is known that the normal bundle N_{V_0} in M to V₀ in M has a natural extension N_V to all of V, so that we can define its Chern classes c^(*)(N_V) in cohomology, as well as the Chern classes c_vir^(*). If V is a locally complete intersection (LCI), it is known that the normal bundle N_{V_0} in M to V₀ in M has a natural extension N_V to all of V, so that we can define its Chern classes c^(*)(N_V) in cohomology, as well as the Chern classes c_vir^(*) (V) of the virtual tangent bundle T_vir(V):=[TM|_V - N_V] in the K-theory K⁰(V). This has applications

On solubility and supersolubility of some classes of finite groups

Let G be a finite group and H a subgroup of G. Then H is said to be S-permutable in G if HP = PH for all Sylow subgroups P of G. Let HsG be the subgroup of H generated by all those subgroups of H which are S-permutable in G. Then we say that H is S-embedded in G if G has a normal subgroup T and an S-permutable subgroup C such that T ∩ H HsG and HT = C. Our main result is the following Theorem A. A group G is supersoluble if and only if for every non-cyclic Sylow subgroup P of the generalized Fitting subgrou...     

Simple <Emphasis Type="Italic">SL</Emphasis>(<Emphasis Type="Italic">n</Emphasis>)-modules with normal closures of maximal torus orbits

Let T be the subgroup of diagonal matrices in the group SL(n). The aim of this paper is to find all finite-dimensional simple rational SL(n)-modules V with the following property: for each point v∈V the closure [`(Tv)]\overline{Tv} of its T-orbit is a normal affine variety. Moreover, for any SL(n)-module without this property a T-orbit with non-normal closure is constructed. The proof is purely combinatorial: it deals with the set of weights of simple SL(n)-modules. The saturation property is checked for each subset in the set of weights.     

Projective normality of G.I.T. quotient varieties modulo finite groups

We prove that for any finite dimensional representation V of a finite group G of order n the quotient variety G??(V) is projectively normal with respect to descent of 𝒪(1)^?l where l = lcm{1,2,3,4,…,n}. We also prove that for the tautological representation V of the alternating group A_n the projective variety A_n??(V) is projectively normal with respect to the descent of the above line bundle.     

Partitions of finite vector spaces into subspaces

Let V_n(q) denote a vector space of dimension n over the field with q elements. A set of subspaces of V_n(q) is a partition of V_n(q) if every nonzero element of V_n(q) is contained in exactly one element of . Suppose there exists a partition of V_n(q) into x_i subspaces of dimension n_i, 1 ≤ i ≤ k. Then x₁, …, x_k satisfy the Diophantine equation . However, not every solution of the Diophantine equation corresponds to a partition of V_n(q). In this article, we show that there exists a partition of V_n(2) into x subspaces of dimension 3 and y subspaces of dimension 2 if and only if 7x + 3y = 2ⁿ ? 1 and y ≠ 1. In doing so, we introduce techniques useful in constructing further partitions. We also show that partitions of V_n(q) induce uniformly resolvable designs on qⁿ points. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 329–341, 2008     

The average Steiner distance of a graph

The average distance μ(G) of a graph G is the average among the distances between all pairs of vertices in G. For n ≥ 2, the average Steiner n-distance μ_n(G) of a connected graph G is the average Steiner distance over all sets of n vertices in G. It is shown that for a connected weighted graph G, μ_n(G) ≤ μ_k(G) + μ_n+1−k(G) where 2 ≤ k ≤ n − 1. The range for the average Steiner n-distance of a connected graph G in terms of n and |V(G)| is established. Moreover, for a tree T and integer k, 2 ≤ k ≤ n − 1, it is shown that μ_n(T) ≤ (n/k)μ_k(T) and the range for μ_n(T) in terms of n and |V(T)| is established. Two efficient algorithms for finding the average Steiner n-distance of a tree are outlined. © 1996 John Wiley & Sons, Inc.     

Varieties with at most quadratic growth

Let V be a variety of non-necessarily associative algebras over a field of characteristic zero. The growth of V is determined by the asymptotic behavior of the sequence of codimensions c _n (V), n = 1, 2, …, and here we study varieties of polynomial growth. Recently in [16], for any real number α, 3 < α < 4, a variety V was constructed satisfying C ₁ n ^α < c _n (V) < C ₂ n ^α , for some constants C ₁, C ₂. Motivated by this result here we try to classify all possible growth of varieties V such that c _n (V) < C _n ^α , with 0 < α < 2, for some constant C. We prove that if 0 < α < 1 then, for n large, c _n (V) ≤ 1, whereas if V is a commutative variety and 1 < α < 2, then lim _n→∞ log _n c _n (V) = 1 or c _n (V) ≤ 1 for n large enough.     

Toppling kings in multipartite tournaments by introducing new kings

Let and be two n-tuples of nonnegative integers. An all-4-kings n-partite tournament T(V₁,V₂,…V_n) is said to have a -property if there exists an n-partite tournament T₁(W₁,W₂,…,W_n) such that for each i∈{1,…,n}:

(1)

V_i⊆W_i;

(2)

exactly t_i 4-kings of V_i are not 4-kings in T₁;

(3)

exactly c_i 4-kings of W_i are not vertices of V_i.

We describe all pairs such that there exists an n-partite tournament having -property.