Varieties of quasigroups arising from 2-perfect m-cycle systems

For m = 6 and for all odd composite integers m, as well as for all even integers m 10 that satisfy certain conditions, 2-perfect m-cycle systems are constructed whose quasigroups have a homomorphism onto quasigroups which do not correspond to a 2-perfect m-cycle systems. Thus it is shown that for these values of m the class of quasigroups arising from all 2-perfect m-cycle systems does not form a variety.     

On Integrable roots in split Lie triple systems

We focus on the notion of an integrable root in the framework of split Lie triple systems T with a coherent 0-root space. As a main result, it is shown that if T has all its nonzero roots integrable, then its standard embedding is a split Lie algebra having all its nonzero roots integrable. As a consequence, a local finiteness theorem for split Lie triple systems, saying that whenever all nonzero roots of T are integrable then T is locally finite, is stated. Finally, a classification theorem for split simple Lie triple systems having all its nonzero roots integrable is given.     

Classification of Integrable Divergent N-Component Evolution Systems

We use a symmetry approach to solve the classification problem for integrable N-component evolution systems having the form of conservation laws. We obtain complete lists of both isotropic and anisotropic systems of this type and find auto-Bäcklund transformations with a spectral parameter for all systems.     

Further 6-sparse Steiner Triple Systems

We give a construction that produces 6-sparse Steiner triple systems of order v for all sufficiently large v of the form 3p, p prime and p ≡ 3 (mod 4). We also give a complete list of all 429 6-sparse systems with v < 10000 produced by this construction.     

A hierarchy of axiom systemZF

In this paper we develop a sequenceZ ₀, ...,Z _α,... of axiom systems for set theory, such that (1) the consistency of any system within the sequence is provable in its succeeding systems, (2) the first system in the sequence is Zermelo's system Z and the union of all systems in the sequence is justZF. And we prove that for ordinal number α>1, there exists a sequence of ℵ_a+1 axiom systems between systemsZ _α andZ _α+1 such that these systems satisfy the above condition (1).     

On Approximate ℓ 1 Systems in Banach Spaces

Let X be a real Banach space and let (f(n)) be a positive nondecreasing sequence. We consider systems of unit vectors (x_i)^∞_i=1 in X which satisfy ∑_iA±x_i|A|−f(|A|), for all finite A and for all choices of signs. We identify the spaces which contain such systems for bounded (f(n)) and for all unbounded (f(n)). For arbitrary unbounded (f(n)), we give examples of systems for which [x_i] is H.I., and we exhibit systems in all isomorphs of ℓ₁ which are not equivalent to the unit vector basis of ℓ₁. We also prove that certain lacunary Haar systems in L₁ are quasi-greedy basic sequences.     

Pseudozero Set of Real Multivariate Polynomials

The pseudozero set of a system P of polynomials in n variables is the subset of C ⁿ consisting of the union of the zeros of all polynomial systems Q that are near to P in a suitable sense. This concept arises naturally in Scientific Computing where data often have a limited accuracy. When the polynomials of the system are polynomials with complex coefficients, the pseudozero set has already been studied. In this paper, we focus on the case where the polynomials of the system have real coefficients and such that all the polynomials in all the perturbed polynomial systems have real coefficients as well. We provide an explicit definition to compute this pseudozero set. At last, we analyze different methods to visualize this set.      

The random product homotopy and deficient polynomial systems

Summary Most systems ofn polynomial equations inn unknowns arising in applications aredeficient, in the sense that they have fewer solutions than that predicted by the total degree of the system. We introduce the random product homotopy, an efficient homotopy continuation method for numerically determining all isolated solutions of deficient systems. In many cases, the amount of computation required to find all solutions can be made roughly proportional to the number of solutions.     

The entropies of renewal systems

Renewal systems are symbolic dynamical systems originally introduced by Adler. IfW is a finite set of words over a finite alphabetA, then the renewal system generated byW is the subshiftX _W ⊂A ^Z formed by bi-infinite concatenations of words fromW. Motivated by Adler’s question of whether every irreducible shift of finite type is conjugate to a renewal system, we prove that for every shift of finite type there is a renewal system having the same entropy. We also show that every shift of finite type can be approximated from above by renewal systems, and that by placing finite-type constraints on possible concatenations, we obtain all sofic systems. The authors were supported in part by NFS grants DMS-8706284, DMS-8814159 and DMS-8820716.