Homology of Newtonian Coalgebras

Given a Newtonian coalgebra we associate to it a chain complex. The homology groups of this Newtonian chain complex are computed for two important Newtonian coalgebras arising in the study of flag vectors of polytopes:R a, b and Rc, d. The homology of Ra, b corresponds to the homology of the boundary of then -crosspolytope. In contrast, the homology of Rc, d depends on the characteristic of the underlying ring R. In the case the ring has characteristic 2, the homology is computed via cubical complexes arising from distributive lattices. This paper ends with a characterization of the integer homology ofZ c, d.     

Equivalence relation groupoids associated with certain linearly ordered dimension groups

We consider linearly ordered, Archimedean dimension groups (G,G⁺,u) for which the group G/u is torsion-free. It will be shown that if, in addition, G/u is generated by a single element (i.e., ), then (G,G⁺,u) is isomorphic to for some irrational number τ(0,1). This amounts to an extension of related results where dimension groups for which G/u is torsion were considered. We will prove, in the case of the Fibonacci dimension group, that these results can be used to directly construct an equivalence relation groupoid whose C^*-algebra is the Fibonacci C^*-algebra.     

Existence of HSOLSSOMs of type

In this paper we investigate the existence of holey self-orthogonal Latin squares with a symmetric orthogonal mate of type 2ⁿu¹ (HSOLSSOM(2ⁿu¹)). For u2, necessary conditions for existence of such an HSOLSSOM are that u must be even and n3u/2+1. Xu Yunqing and Hu Yuwang have shown that these HSOLSSOMs exist whenever either (1) n9 and n3u/2+1 or (2) n263 and n2(u-2). In this paper we show that in (1) the condition n9 can be extended to n30 and that in (2), the condition n263 can be improved to n4, except possibly for 19 pairs (n,u), the largest of which is (53,28).     

A vanishing theorem on Kaehler Finsler manifolds

Let M be a connected compact complex manifold endowed with a strongly pseudoconvex complex Finsler metric F. In this paper, we first define the complex horizontal Laplacian □_h and complex vertical Laplacian □_v on the holomorphic tangent bundle T^1,0M of M, and then we obtain a precise relationship among □_h,□_v and the Hodge–Laplace operator on (T^1,0M,,), where , is the induced Hermitian metric on T^1,0M by F. As an application, we prove a vanishing theorem of holomorphic p-forms on M under the condition that F is a Kaehler Finsler metric on M.     

Symplectic 2 × 2 matrices over free algebras

P.M. Cohn has proved the remarkable theorem, that every invertible n × n matrix over a free algebra is the product of elementary n × n matrices, see [C1], [C2]. In this note we prove the analogue for symplectic 2 × 2 matrices over free algebras relative to a homogeneous involution: every symplectic 2 × 2 matrix is the product of elementary symplectic 2 × 2 matrices.In Section 1 we define the group Sp₂(R) of symplectic 2 × 2 matrices over an involutive ring R. The group ESp₂(R) generated by elementary symplectic matrices is introduced in Section 3.In Section 2 we prove a reducibility criterion for homogeneous polynomials in a free algebra KX over a commutative field K. It leads to a special form in the factorization of symmetric homogeneous polynomials, see Corollary to Proposition 2.2.We prove in Section 4 that ESp₂(KX) = Sp₂(KX), if the involution on KX is homogeneous.In a subsequent article we will show that the main result is also true for 2g × 2g symplectic matrices over free algebras relative to homogeneous involutions, g ≥ 1. It seems that a proof of this result will be much more complicated than the case g = 1.     

Uniform Kazhdan constant for some families of linear groups

Let R be a ring generated by l elements with stable range r. Assume that the group EL_d(R) has Kazhdan constant ₀>0 for some dr+1. We prove that there exist (₀,l)>0 and , s.t. for every nd, EL_n(R) has a generating set of order k and a Kazhdan constant larger than . As a consequence, we obtain for where n3, a Kazhdan constant which is independent of n w.r.t. generating set of a fixed size.     

Algorithms for extracting motifs from biological weighted sequences

In this paper we present three algorithms for the Motif Identification Problem in Biological Weighted Sequences. The first algorithm extracts repeated motifs from a biological weighted sequence. The motifs correspond to repetitive words which are approximately equal, under a Hamming distance, with probability of occurrence 1/k, where k is a small constant. The second algorithm extracts common motifs from a set of N2 weighted sequences. In this case, the motifs consists of words that must occur with probability 1/k, in 1qN distinct sequences of the set. The third algorithm extracts maximal pairs from a biological weighted sequence. A pair in a sequence is the occurrence of the same word twice. In addition, the algorithms presented in this paper improve previous work on these problems.     

Multicriteria analysis in decision making under information uncertainty

This paper presents results of research related to multicriteria decision making under information uncertainty. The Bellman–Zadeh approach to decision making in a fuzzy environment is utilized for analyzing multicriteria optimization models (X,M models) under deterministic information. Its application conforms to the principle of guaranteed result and provides constructive lines in obtaining harmonious solutions on the basis of analyzing associated maxmin problems. This circumstance permits one to generalize the classic approach to considering the uncertainty of quantitative information (based on constructing and analyzing payoff matrices reflecting effects which can be obtained for different combinations of solution alternatives and the so-called states of nature) in monocriteria decision making to multicriteria problems. Considering that the uncertainty of information can produce considerable decision uncertainty regions, the resolving capacity of this generalization does not always permit one to obtain unique solutions. Taking this into account, a proposed general scheme of multicriteria decision making under information uncertainty also includes the construction and analysis of the so-called X,R models (which contain fuzzy preference relations as criteria of optimality) as a means for the subsequent contraction of the decision uncertainty regions. The paper results are of a universal character and are illustrated by a simple example.     

Sharp tridiagonal pairs

Let denote a field and let V denote a vector space over with finite positive dimension. We consider a pair of -linear transformations A:V→V and A^*:V→V that satisfies the following conditions: (i) each of A,A^* is diagonalizable; (ii) there exists an ordering of the eigenspaces of A such that A^*V_iV_i-1+V_i+V_i+1 for 0id, where V_-1=0 and V_d+1=0; (iii) there exists an ordering of the eigenspaces of A^* such that for 0iδ, where and ; (iv) there is no subspace W of V such that AWW, A^*WW, W≠0, W≠V. We call such a pair a tridiagonal pair on V. It is known that d=δ and for 0id the dimensions of coincide. We say the pair A,A^* is sharp whenever dimV₀=1. A conjecture of Tatsuro Ito and the second author states that if is algebraically closed then A,A^* is sharp. In order to better understand and eventually prove the conjecture, in this paper we begin a systematic study of the sharp tridiagonal pairs. Our results are summarized as follows. Assuming A,A^* is sharp and using the data we define a finite sequence of scalars called the parameter array. We display some equations that show the geometric significance of the parameter array. We show how the parameter array is affected if Φ is replaced by or or . We prove that if the isomorphism class of Φ is determined by the parameter array then there exists a nondegenerate symmetric bilinear form , on V such that Au,v=u,Av and A^*u,v=u,A^*v for all u,vV.     

Continued fractions with multiple limits

For integers m2, we study divergent continued fractions whose numerators and denominators in each of the m arithmetic progressions modulo m converge. Special cases give, among other things, an infinite sequence of divergence theorems, the first of which is the classical Stern–Stolz theorem.We give a theorem on a class of Poincaré-type recurrences which shows that they tend to limits when the limits are taken in residue classes and the roots of their characteristic polynomials are distinct roots of unity.We also generalize a curious q-continued fraction of Ramanujan's with three limits to a continued fraction with k distinct limit points, k2. The k limits are evaluated in terms of ratios of certain q-series.Finally, we show how to use Daniel Bernoulli's continued fraction in an elementary way to create analytic continued fractions with m limit points, for any positive integer m2.     

A Nonsymmetric Correlation Inequality for Gaussian Measure

Letμbe a Gaussian measure (say, onRⁿ) and letK,LRⁿbe such thatKis convex,Lis a “layer” (i.e.,L={x: ax, ub} for somea, bRanduRⁿ), and the centers of mass (with respect toμ) ofKandLcoincide. Thenμ(K∩L)μ(K)·μ(L). This is motivated by the well-known “positive correlation conjecture” for symmetric sets and a related inequality of Sidak concerning confidence regions for means of multivariate normal distributions. The proof uses the estimateΦ(x)> 1−((8/π)^1/2/(3x+(x²+8)^1/2))e^−x2/2,x>−1, for the (standard) Gaussian cumulative distribution function, which is sharper than the classical inequality of Komatsu.     

On triconnected and cubic plane graphs on given point sets

Let S be a set of n4 points in general position in the plane, and let h<n be the number of extreme points of S. We show how to construct a 3-connected plane graph with vertex set S, having max{3n/2,n+h−1} edges, and we prove that there is no 3-connected plane graph on top of S with a smaller number of edges. In particular, this implies that S admits a 3-connected cubic plane graph if and only if n4 is even and hn/2+1. The same bounds also hold when 3-edge-connectivity is considered. We also give a partial characterization of the point sets in the plane that can be the vertex set of a cubic plane graph.     

Eigenvalue estimates for non-normal matrices and the zeros of random orthogonal polynomials on the unit circle

We prove that for any n×n matrix, A, and z with |z|A, we have that . We apply this result to the study of random orthogonal polynomials on the unit circle.     

Global well-posedness and scattering for the defocusing -subcritical Hartree equation in

We prove the global well-posedness and scattering for the defocusing -subcritical (that is, 2<γ<3) Hartree equation with low regularity data in , d3. Precisely, we show that a unique and global solution exists for initial data in the Sobolev space with s>4(γ−2)/(3γ−4), which also scatters in both time directions. This improves the result in [M. Chae, S. Hong, J. Kim, C.W. Yang, Scattering theory below energy for a class of Hartree type equations, Comm. Partial Differential Equations 33 (2008) 321–348], where the global well-posedness was established for any s>max(1/2,4(γ−2)/(3γ−4)). The new ingredients in our proof are that we make use of an interaction Morawetz estimate for the smoothed out solution Iu, instead of an interaction Morawetz estimate for the solution u, and that we make careful analysis of the monotonicity property of the multiplier m(ξ)ξ^p. As a byproduct of our proof, we obtain that the H^s norm of the solution obeys the uniform-in-time bounds.     

Hilbert's Tenth Problem for function fields of varieties over number fields and p-adic fields

Let k be a subfield of a p-adic field of odd residue characteristic, and let be the function field of a variety of dimension n1 over k. Then Hilbert's Tenth Problem for is undecidable. In particular, Hilbert's Tenth Problem for function fields of varieties over number fields of dimension 1 is undecidable.     

An iterative approximation procedure for the distribution of the maximum of a random walk

Let I(F) be the distribution function (d.f.) of the maximum of a random walk whose i.i.d. increments have the common d.f. F and a negative mean. We derive a recursive sequence of embedded random walks whose underlying d.f.'s F_k converge to the d.f. of the first ladder variable and satisfy FF₁F₂ on [0,∞) and I(F)=I(F₁)=I(F₂)=. Using these random walks we obtain improved upper bounds for the difference of I(F) and the d.f. of the maximum of the random walk after finitely many steps.     

disjoint cycles containing specified independent vertices

Let k1 be an integer and G be a graph of order n3k satisfying the condition that σ₂(G)n+k-1. Let v₁,…,v_k be k independent vertices of G, and suppose that G has k vertex-disjoint triangles C₁,…,C_k with v_iV(C_i) for all 1ik.Then G has k vertex-disjoint cycles such that

(i) for all 1ik.

(ii) , and

(iii) At least k-1 of the k cycles are triangles.

The condition of degree sum σ₂(G)n+k-1 is sharp.

Arithmetic progressions consisting of unlike powers

In this paper we present some new results about unlike powers in arithmetic progression. We prove among other things that for given k 4 and L 3 there are only finitely many arithmetic progressions of the form with x_i , gcd(x₀, x_l) = 1 and 2 l_i L for i = 0, 1, …, k − 1. Furthermore, we show that, for L = 3, the progression (1, 1,…, 1) is the only such progression up to sign. Our proofs involve some well-known theorems of Faltings [9], Darmon and Granville [6] as well as Chabauty's method applied to superelliptic curves.     

Sharp bounds for the first non-zero Stekloff eigenvalues

Let (M,,) be an n(2)-dimensional compact Riemannian manifold with boundary and non-negative Ricci curvature. Consider the following two Stekloff eigenvalue problems

where Δ is the Laplacian operator on M and ν denotes the outward unit normal on ∂M. The first non-zero eigenvalues of the above problems will be denoted by p₁ and q₁, respectively. In the present paper, we prove that if the principle curvatures of the second fundamental form of ∂M are bounded below by a positive constant c, then with equality holding if and only if Ω is isometric to an n-dimensional Euclidean ball of radius , here λ₁ denotes the first non-zero eigenvalue of the Laplacian of ∂M. We also show that if the mean curvature of ∂M is bounded below by a positive constant c then q₁nc with equality holding if and only if M is isometric to an n-dimensional Euclidean ball of radius . Finally, we show that q₁A/V and that if the equality holds and if there is a point x₀∂M such that the mean curvature of ∂M at x₀ is no less than A/{nV}, then M is isometric to an n-dimensional Euclidean ball, being A and V the area of ∂M and the volume of M, respectively.     

Turán type reverse Markov inequalities for compact convex sets

For a compact convex set the well-known general Markov inequality holds asserting that a polynomial p of degree n must have p^′c(K)n²p. On the other hand for polynomials in general, p^′ can be arbitrarily small as compared to p.The situation changes when we assume that the polynomials in question have all their zeroes in the convex set K. This was first investigated by Turán, who showed the lower bounds p^′(n/2)p for the unit disk D and for the unit interval I[-1,1]. Although partial results provided general lower estimates of order , as well as certain classes of domains with lower bounds of order n, it was not clear what order of magnitude the general convex domains may admit here.Here we show that for all bounded and convex domains K with nonempty interior and polynomials p with all their zeroes lying in K p^′c(K)np holds true, while p^′C(K)np occurs for any K. Actually, we determine c(K) and C(K) within a factor of absolute numerical constant.