Determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs

In this paper we consider the problem of determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs. We establish a sharp upper bound, as well as a lower bound that is not in general sharp. We show further that under a certain condition the lower bound is sharp. In that case, we obtain a closed form solution for the possible probabilities of the atomic propositions.The second author is partially supported by ONR grant N00014-92-J-1028 and AFOSR grant 91-0287.     

Antiblocking systems and PD-sets

Since the permutation decoding algorithm is more efficient the smaller the size of the PD-set, it is important for the applications to find small PD-sets. A lower bound on the size of a PD-set is given by Gordon. There are examples for PD-sets, but up to now there is no method known to find PD-sets. The question arises whether the Gordon bound is sharp. To handle this problem we introduce the notion of antiblocking system and we show that there are examples where the Gordon bound is not sharp.     

Morse inequalities for the Koszul complex of multi-persistence

In this paper, we define the homological Morse numbers of a filtered cell complex in terms of relative homology of nested filtration pieces, and derive inequalities relating these numbers to the Betti tables of the multi-parameter persistence modules of the considered filtration. Using the Mayer-Vietoris spectral sequence we first obtain strong and weak Morse inequalities involving the above quantities, and then we improve the weak inequalities achieving a sharp lower bound for homological Morse numbers. Furthermore, we prove a sharp upper bound for homological Morse numbers, expressed again in terms of the Betti tables.     

The height of faces of 3-polytopes

The height of a face in a 3-polytope is the maximum degree of the incident vertices of the face, and the height of a 3-polytope, h, is the minimum height of its faces. A face is pyramidal if it is either a 4-face incident with three 3-vertices, or a 3-face incident with two vertices of degree at most 4. If pyramidal faces are allowed, then h can be arbitrarily large; so we assume the absence of pyramidal faces. In 1940, Lebesgue proved that every quadrangulated 3-polytope has h ≤ 11. In 1995, this bound was lowered by Avgustinovich and Borodin to 10. Recently, we improved it to the sharp bound 8. For plane triangulation without 4-vertices, Borodin (1992), confirming the Kotzig conjecture of 1979, proved that h ≤ 20 which bound is sharp. Later, Borodin (1998) proved that h ≤ 20 for all triangulated 3-polytopes. Recently, we obtained the sharp bound 10 for triangle-free 3-polytopes. In 1996, Horňák and Jendrol’ proved for arbitrarily 3-polytopes that h ≤ 23. In this paper we improve this bound to the sharp bound 20.     

Upper bound and stability of scaled pseudoinverses

Summary. For given matrices and where is positive definite diagonal, a weighed pseudoinverse of is defined by and an oblique projection of is defined by . When is of full column rank, Stewart [3] and O'Leary [2] found sharp upper bound of oblique projections which is independent of , and an upper bound of weighed pseudoinverse by using the bound of . In this paper we discuss the sharp upper bound of over a set of positive diagonal matrices which does not depend on the upper bound of , and the stability of over . Received September 29, 1993 / Revised version received October 31, 1994     

No Dimension-Independent Core-Sets for Containment Under Homothetics

This paper deals with the containment problem under homothetics which has the minimal enclosing ball (MEB) problem as a prominent representative. We connect the problem to results in classic convex geometry and introduce a new series of radii, which we call core-radii. For the MEB problem, these radii have already been considered from a different point of view and sharp inequalities between them are known. In this paper sharp inequalities between core-radii for general containment under homothetics are obtained. Moreover, the presented inequalities are used to derive sharp upper bounds on the size of core-sets for containment under homothetics. In the MEB case, this yields a tight (dimension-independent) bound for the size of such core-sets. In the general case, we show that there are core-sets of size linear in the dimension and that this bound stays sharp even if the container is required to be symmetric.     

The Coexponent of a Finite p-Group

Abstract

In this paper,we present a sharp bound for the nilpotency class of a finite p-group (where p is an odd prime) in terms of its coexponent. As to a powerful p-group,we give the sharp bound for the nilpotency class in terms of its coexponent for arbitrary prime p.     

Inequalities for the capacity of non-contractible annuli on cylinders of constant and variable negative curvature

We give elementary estimates for the capacity of non-contractible annuli on cylinders and provide examples, where these inequalities are sharp. Here the lower bound depends only on the area of the annulus. To obtain this result we use projection of gradients on curves to obtain a lower bound on the capacity, which we call directional capacity. In the case of constant curvature we then apply a symmetrization process that results in an annulus of minimal directional capacity. For this annulus the lower bound on the capacity is sharp. In the case of variable negative curvature we obtain the lower bound by constructing a comparison annulus with the same area but lower directional capacity on a cylinder of constant curvature. The methods developed here have been applied to estimate the energy of harmonic forms on Riemann surfaces in Muetzel (Math Zeitschrift, 2012, arXiv:1202.0782).     

Primitive zero-symmetric sign pattern matrices with the maximum base

In [B. Cheng, B. Liu, The base sets of primitive zero-symmetric sign pattern matrices, Linear Algebra Appl. 428 (2008) 715-731], Cheng and Liu studied the bases of primitive zero-symmetric sign pattern matrices. The sharp upper bound of the bases was obtained. In this paper, we characterize the sign pattern matrices with the sharp bound.     

Eigenvalues of Euclidean wedge domains in higher dimensions

In this paper, we use a weighted isoperimetric inequality to give a lower bound for the first Dirichlet eigenvalue of the Laplacian on a bounded domain inside a Euclidean cone. Our bound is sharp, in that only sectors realize it. This result generalizes a lower bound of Payne and Weinberger in two dimensions.     

On a sharp volume estimate for gradient Ricci solitons with scalar curvature bounded below

In this note, we obtain a sharp volume estimate for complete gradient Ricci solitons with scalar curvature bounded below by a positive constant. Using Chen-Yokota’s argument we obtain a local lower bound estimate of the scalar curvature for the Ricci flow on complete manifolds. Consequently, one has a sharp estimate of the scalar curvature for expanding Ricci solitons; we also provide a direct (elliptic) proof of this sharp estimate. Moreover, if the scalar curvature attains its minimum value at some point, then the manifold is Einstein.     

Estimates of Oscillations of the Hardy Transform

For the Hardy transform of a nonincreasing function we obtain a sharp two-sided estimate of the BLO-norm and sharp inequalities between the BMO- and the BLO-norms of a nonincreasing function. A well-known lower bound for the BMO-norm of the Hardy transform is improved on the basis of these inequalities.     

树图边色数的界

本文研究树图的边色数，确定了其上界与下界，并进而考虑界的精确性。     

Lower bounds for contraction constants of non-zero degree mappings onto the sphere

This paper studies contraction constants of non-zero degree mappings from compact spin Riemannian manifolds onto the standard Riemannian sphere. Assuming uniform lower bound for the scalar curvature, we find a sharp lower bound for the dilation constants in terms of the dimension of the sphere. In the best case, we prove rigidity     

Extensions of the Multiplicity conjecture

The Multiplicity conjecture of Herzog, Huneke, and Srinivasan states an upper bound for the multiplicity of any graded -algebra as well as a lower bound for Cohen-Macaulay algebras. In this note we extend this conjecture in several directions. We discuss when these bounds are sharp, find a sharp lower bound in the case of not necessarily arithmetically Cohen-Macaulay one-dimensional schemes of 3-space, and propose an upper bound for finitely generated graded torsion modules. We establish this bound for torsion modules whose codimension is at most two.

     

Growth of solutions for QG and 2D Euler equations

We study the rate of growth of sharp fronts of the Quasi-geostrophic equation and 2D incompressible Euler equations. The development of sharp fronts are due to a mechanism that piles up level sets very fast. Under a semi-uniform collapse, we obtain a lower bound on the minimum distance between the level sets.

     

Diffusion and mixing in fluid flow via the resolvent estimate

In this paper, we first present a Gearhart-Pr¨uss type theorem with a sharp bound for m-accretive operators. Then we give two applications:(1) we give a simple proof of the result proved by Constantin et al. on relaxation enhancement induced by incompressible flows;(2) we show that shear flows with a class of Weierstrass functions obey logarithmically fast dissipation time-scales.     

最大边数的Cordial图的构造

对于n阶Cordial图G，本给出G的边数的上确界e^*，并给出边数达到e^*的Cordial图的构造。     

An upper bound for the first eigenvalue of a spherical cap

By working with suitable test functions, we obtain an upper bound for the principal eigenvalue of a geodesic ball on a sphere of arbitrary dimension. This bound is sharp in the limiting case when the radius of the ball approaches the diameter of the sphere.This research was supported by ARO Grant 28905-MA.