Polyhedral combinatorics of UPGMA cones

Distance-based methods such as UPGMA (Unweighted Pair Group Method with Arithmetic Mean) continue to play a significant role in phylogenetic research. We use polyhedral combinatorics to analyze the natural subdivision of the positive orthant induced by classifying the input vectors according to tree topologies returned by the algorithm. The partition lattice informs the study of UPGMA trees. We give a closed form for the extreme rays of UPGMA cones on n taxa, and compute the spherical volumes of the UPGMA cones for small n.     

Incidence combinatorics of resolutions

We introduce notions of combinatorial blowups, building sets, and nested sets for arbitrary meet-semilattices. This gives a~common abstract framework for the incidence combinatorics occurring in the context of De Concini-Procesi models of subspace arrangements and resolutions of singularities in toric varieties. Our main theorem states that a sequence of combinatorial blowups, prescribed by a building set in linear extension compatible order, gives the face poset of the corresponding simplicial complex of nested sets. As applications we trace the incidence combinatorics through every step of the De Concini-Procesi model construction, and we introduce the notions of building sets and nested sets to the context of toric varieties. There are several other instances, such as models of stratified manifolds and certain graded algebras associated with finite lattices, where our combinatorial framework has been put to work; we present an outline at the end of this paper.     

Semilattice modes I: the associated semiring

We examine idempotent, entropic algebras (modes) which have a semilattice term. We are able to show that any variety of semilattice modes has the congruence extension property and is residually small. We refine the proof of residual smallness by showing that any variety of semilattice modes of finite type is residually countable. To each variety of semilattice modes we associate a commutative semiring satisfying 1 +r=1 whose structure determines many of the properties of the variety. This semiring is used to describe subdirectly irreducible members, clones, subvariety lattices, and free spectra of varieties of semilattice modes.Presented by J. Berman.Part of this paper was written while the author was supported by a fellowship from the Alexander von Humboldt Stiftung.     

On limit theorem for the eigenvalues of product of two random matrices

The existence of limiting spectral distribution (LSD) of the product of two random matrices is proved. One of the random matrices is a sample covariance matrix and the other is an arbitrary Hermitian matrix. Specially, the density function of LSD of S_nW_n is established, where S_n is a sample covariance matrix and W_n is Wigner matrix.     

Completely positive mappings and mean matrices

Some functions f:R⁺→R⁺ induce mean of positive numbers and the matrix monotonicity gives a possibility for means of positive definite matrices. Moreover, such a function f can define a linear mapping on matrices (which is basic in the constructions of monotone metrics). The present subject is to check the complete positivity of in the case of a few concrete functions f. This problem has been motivated by applications in quantum information.     

Integral bilinear forms, Coxeter transformations and Coxeter polynomials of finite posets

Linear algebra technique in the study of linear representations of finite posets is developed in the paper. A concept of a quadratic wandering on a class of posets I is introduced and finite posets I are studied by means of the four integral bilinear forms (1.1), the associated Coxeter transformations, and the Coxeter polynomials (in connection with bilinear forms of Dynkin diagrams, extended Dynkin diagrams and irreducible root systems are also studied). Bilinear equivalences between some of the forms are established and equivalences with the bilinear forms of Dynkin diagrams and extended Dynkin diagrams are discussed. A homological interpretation of the bilinear forms (1.1) is given and Z-bilinear equivalences between them are discussed. By applying well-known results of Bongartz, Loupias, and Zavadskij-Shkabara, we give several characterisations of posets I, with the Euler form weakly positive (resp. with the reduced Euler form weakly positive), and posets I, with the Tits form weakly positive.     

Cancellation and absorption of lexicographic powers of totally ordered Abelian groups

Let G and H be totally ordered Abelian groups such that, for some integer k, the lexicographic powers G ^k and H ^k are isomorphic (as ordered groups). It was proved by F. Oger that G and H need not be isomorphic. We show here that they are whenever G is either divisible or ₁ -saturated (and in a few more cases). Our proof relies on a general technique which we also use to prove that G and H must be elementary equivalent as ordered groups (a fact also proved by F. Delon and F. Lucas) and isomorphic as chains. The same technique applies to the question of whether G and H should be isomorphic as groups, but, in this last case, no hint about a possible negative answer seems available.     

Semigroup of matrices acting on the max-plus projective space

We investigate the action of semigroups of d×d matrices with entries in the max-plus semifield on the max-plus projective space. Recall that semigroups generated by one element with projectively bounded image are projectively finite and thus contain idempotent elements.In terms of orbits, our main result states that the image of a minimal orbit by an idempotent element of the semigroup with minimal rank has at most d! elements. Moreover, each idempotent element with minimal rank maps at least one orbit onto a singleton.This allows us to deduce the central limit theorem for stochastic recurrent sequences driven by independent random matrices that take countably many values, as soon as the semigroup generated by the values contains an element with projectively bounded image.     

An interval version of separation by semispaces in max-min convexity

In this paper, we study separation of a closed box from a max-min convex set by max-min semispaces. This can be regarded as an interval extension of the known separation results. We give a constructive proof of the separation in the case when the box satisfies a certain condition, and we show that the separation is never possible when the condition is not satisfied. We also study the separation of two max-min convex sets by a box and by a box and a semispace.     

ASSOCIATIONS AND VALUATIONS

Abstract

Right cones are semigroups for which the lattice of right ideals is a chain and a left cancellation law holds; valuation rings, the cones of ordered groups, and initial segments of ordinal numbers are examples. Two such cones are associated if they have isoniorphic lattices of right ideals so that ideals, prime ideals, and completely prime ideals correspond to each other. A list of problems is discussed. In Proposition 3.11 it is proved that the canonical mapping from a right invariant right chain domain R onto the associated right holoid can be extended to a valuation from the skew field Q(R) of quotients of R onto an ordered group if and only if Ja ? aJ for all a ∈ R and J = J(R), the Jacobson radical of R.     

Random graph orders

Let P _n be the order determined by taking a random graph G on {1, 2,..., n}, directing the edges from the lesser vertex to the greater (as integers), and then taking the transitive closure of this relation. We call such and ordered set a random graph order. We show that there exist constants c, and °, such that the expected height and set up number of P _n are sharply concentrated around cn and °n respectively. We obtain the estimates: .565<c<.610, and .034<°<.289. We also discuss the width, dimension, and first-order properties of P _n.     

Hypothesis testing for the common mean of two normal distributions in the presence of an indifference zone

Summary LetX ₁,...,X _m andY _t,...,Y be independent, random samples from populations which are N(θ,σ _x ² ) and N(θ,σ _y ² ), respectively, with all parameters unknown. In testingH ₀:θ=0 againstH ₁:θ≠0, thet-test based upon either sample is known to be admissible in the two-sample setting. If, however, one testsH ₀ againstH ₁:|θ|≧ε>0, with ε arbitrary, our main results show: (i) the construction of a test which is better than the particulart-test chosen, (ii) eacht-test is admissible under the invariance principle with respect to the group of scale changes, and (iii) there does not exist a test which simultaneously is better than botht-tests.     

Normal limit theorems for symmetric random matrices

Using the machinery of zonal polynomials, we examine the limiting behavior of random symmetric matrices invariant under conjugation by orthogonal matrices as the dimension tends to infinity. In particular, we give sufficient conditions for the distribution of a fixed submatrix to tend to a normal distribution. We also consider the problem of when the sequence of partial sums of the diagonal elements tends to a Brownian motion. Using these results, we show that if O _n is a uniform random n×n orthogonal matrix, then for any fixed k>0, the sequence of partial sums of the diagonal of O ^k _n tends to a Brownian motion as n→∞. Received: 3 February 1998 / Revised version: 11 June 1998     

A process of runs and its convergence to the brownian motion

Let X₁,X₂,… be i.i.d. random variables with a continuous distribution function. Let R₀=0, R_k=min{j>R_k?1, such that X_j>X_j+1}, k?1. We prove that all finite-dimensional distributions of a process $\text{W}{}^{\mathrm{(n)}}\text{(t)=}\text{(R}{}_{\mathrm{[nt]}}\text{?2[nt])}\text{2}\text{3}\text{n}\text{, t ? [0,1]}$, converge to those of the standard Brownian motion.     

Minimal zonotopes containing the crosspolytope

Motivated by the problem to improve Minkowski’s lower bound on the successive minima for the class of zonotopes we determine the minimal volume of a zonotope containing the standard crosspolytope. It turns out that this volume can be expressed via the maximal determinant of a ±1-matrix, and that in each dimension the set of minimal zonotopes contains a parallelepiped. Based on that link to ±1- matrices, we characterize all zonotopes attaining the minimal volume in dimension 3 and present related results in higher dimensions.     

Orthomodular lattices in ordered vector spaces

In a partly ordered space the orthogonality relation is defined by incomparability. We define integrally open and integrally semi-open ordered real vector spaces. We prove: if an ordered real vector space is integrally semi-open, then a complete lattice of double orthoclosed sets is orthomodular. An integrally open concept is closely related to an open set in the Euclidean topology in a finite dimensional ordered vector space. We prove: if V is an ordered Euclidean space, then V is integrally open and directed (and is also Archimedean) if and only if its positive cone, without vertex 0, is an open set in the Euclidean topology (and also the family of all order segments , a < b, is a base for the Euclidean topology). Received January 7, 2005; accepted in final form November 26, 2005.     

The number of order-preserving maps of fences and crowns

We perform an exact enumeration of the order-preserving maps of fences (zig-zags) and crowns (cycles). From this we derive asymptotic results.