Regularity Index of Fat Points in the Projective Plane

In this paper we determine a new upper bound for the regularity index of fat points of P², without requiring any geometric condition on the points. This bound is intermediate between Segre′s bound, that holds for points in the general position, and the more general bound, that is attained when the points are collinear: in fact, both of these bounds can be recovered as particular cases. Furthermore, our bound cannot, in general, be sharpened: in fact, it is attained if there are either many collinear points or collinear points with high multiplicities.     

On the number of bound states for Schrödinger operators with operator-valued potentials

Cwikel's bound is extended to an operator-valued setting. One application of this result is a semi-classical bound for the number of negative bound states for Schrödinger operators with operator-valued potentials. We recover Cwikel's bound for the Lieb-Thirring constantL _0,3 which is far worse than the best available by Lieb (for scalar potentials). However, it leads to a uniform bound (in the dimensiond≥3) for the quotientL _0,d/L^cl _0,d is the so-called classical constant. This gives some improvement in large dimensions.     

The characterization of binary constant weight codes meeting the bound of Fu and Shen

Fu and Shen gave an upper bound on binary constant weight codes. In this paper, we present a new proof for the bound of Fu and Shen and characterize binary constant weight codes meeting this bound. It is shown that binary constant weight codes meet the bound of Fu and Shen if and only if they are generated from certain symmetric designs and quasi-symmetric designs in combinatorial design theory. In particular, it turns out that the existence of binary codes with even length meeting the Grey–Rankin bound is equivalent to the existence of certain binary constant weight codes meeting the bound of Fu and Shen. Furthermore, some examples are listed to illustrate these results. Finally, we obtain a new upper bound on binary constant weight codes which improves on the bound of Fu and Shen in certain case. This research is supported in part by the DSTA research grant R-394-000-025-422 and the National Natural Science Foundation of China under the Grant 60402031, and the NSFC-GDSF joint fund under the Grant U0675001     

Upper bounds on the length of the shortest closed geodesic on simply connected manifolds

The subject of this paper is upper bounds on the length of the shortest closed geodesic on simply connected manifolds with non-trivial second homology group. We will give three estimates. The first estimate will explicitly depend on volume and the upper bound for the sectional curvature; the second estimate will depend on diameter, a positive lower bound for the volume, and on the (possibly negative) lower bound on sectional curvature; the third estimate will depend on diameter, on a (possibly negative) lower bound for the sectional curvature and on a lower bound for the simply-connectedness radius. The technique that we develop in order to obtain the last result will also enable us to estimate the homotopy distance between any two closed curves on compact simply connected manifolds of sectional curvature bounded from below and diameter bounded from above. More precisely, let c be a constant such that any metric ball of radius is simply connected. There exists a homotopy connecting any two closed curves such that the length of the trajectory of the points during this homotopy has an upper bound in terms of the lower bound of the curvature, the upper bound of diameter and c. Received November 10, 1997; in final form June 23, 1998     

A simpler characterization of a spectral lower bound on the clique number

Given a simple, undirected graph G, Budinich (Discret Appl Math 127:535–543, 2003) proposed a lower bound on the clique number of G by combining the quadratic programming formulation of the clique number due to Motzkin and Straus (Can J Math 17:533–540, 1965) with the spectral decomposition of the adjacency matrix of G. This lower bound improves the previously known spectral lower bounds on the clique number that rely on the Motzkin–Straus formulation. In this paper, we give a simpler, alternative characterization of this lower bound. For regular graphs, this simpler characterization allows us to obtain a simple, closed-form expression of this lower bound as a function of the positive eigenvalues of the adjacency matrix. Our computational results shed light on the quality of this lower bound in comparison with the other spectral lower bounds on the clique number.     

Estimation of optimal backward perturbation bounds for the linear least squares problem

In this paper a method of estimating the optimal backward perturbation bound for the linear least squares problem is presented. In contrast with the optimal bound, which requires a singular value decomposition, this method is better suited for practical use on large problems since it requiresO(mn) operations. The method presented involves the computation of a strict lower bound for the spectral norm and a strict upper bound for the Frobenius norm which gives a gap in which the optimal bounds for the spectral and the Frobenius norm must be. Numerical tests are performed showing that this method produces an efficient estimate of the optimal backward perturbation bound.     

The Supremum of Chi-Square Processes

We describe a lower bound for the critical value of the supremum of a Chi-Square process. This bound can be approximated using an RQMC simulation. We compare numerically this bound with the upper bound given by Davies, only suitable for a regular Chi-Square process. In a second part, we focus on a non regular Chi-Square process: the Ornstein–Uhlenbeck Chi-Square process. Recently, Rabier et al. (2009) have shown that this process has an application in genetics: it is the limiting process of the likelihood ratio test process related to the test of a gene on an interval representing a chromosome. Using results from Delong (Commun Stat Theory Method A10(20):2197–2213, 1981), we propose a theoretical formula for the supremum of such a process and we compare it in particular with our simulated lower bound.     

Maximal class numbers of CM number fields

Fix a totally real number field F of degree at least 2. Under the assumptions of the generalized Riemann hypothesis and Artin's conjecture on the entirety of Artin L-functions, we derive an upper bound (in terms of the discriminant) on the class number of any CM number field with maximal real subfield F. This bound is a refinement of a bound established by Duke in 2001. Under the same hypotheses, we go on to prove that there exist infinitely many CM-extensions of F whose class numbers essentially meet this improved bound and whose Galois groups are as large as possible.     

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.     

Predicting a cyclic Poisson process

We construct and investigate a (1−α)-upper prediction bound for a future observation of a cyclic Poisson process using past data. A normal based confidence interval for our upper prediction bound is established. A comparison of the new prediction bound with a simpler nonparametric prediction bound is also given.     

Asymptotic stability of ground states in 2D nonlinear Schrödinger equation including subcritical cases

We consider a class of nonlinear Schrödinger equations in two space dimensions with an attractive potential. The nonlinearity is local but rather general encompassing for the first time both subcritical and supercritical (in L²) nonlinearities. We study the asymptotic stability of the nonlinear bound states, i.e. periodic in time localized in space solutions. Our result shows that all solutions with small initial data, converge to a nonlinear bound state. Therefore, the nonlinear bound states are asymptotically stable. The proof hinges on dispersive estimates that we obtain for the time-dependent, Hamiltonian, linearized dynamics around a carefully chosen one-parameter family of bound states that “shadows” the nonlinear evolution of the system. Due to the generality of the methods we develop we expect them to extend to the case of perturbations of large bound states and to other nonlinear dispersive wave type equations.     

A Compactness Theorem for Complete Ricci Shrinkers

We prove precompactness in an orbifold Cheeger–Gromov sense of complete gradient Ricci shrinkers with a lower bound on their entropy and a local integral Riemann bound. We do not need any pointwise curvature assumptions, volume or diameter bounds. In dimension four, under a technical assumption, we can replace the local integral Riemann bound by an upper bound for the Euler characteristic. The proof relies on a Gauss–Bonnet with cutoff argument.     

Maximal amplitudes of hyperelliptic solutions of the derivative nonlinear Schrödinger equation

A simple formula is proven for an upper bound for amplitudes of hyperelliptic (finite-gap or N-phase) solutions of the derivative nonlinear Schrödinger equation. The upper bound is sharp, viz, it is attained for some initial conditions. The method used to prove the upper bound is the same method, with necessary modifications, used to prove the corresponding bound for solutions of the focusing NLS equation (Wright OC, III. Sharp upper bound for amplitudes of hyperelliptic solutions of the focusing nonlinear Schrödinger equation. Nonlinearity. 2019;32:1929-1966).     

Asymptotic stability of ground states in 3D nonlinear Schrödinger equation including subcritical cases

We consider a class of nonlinear Schrödinger equation in three space dimensions with an attractive potential. The nonlinearity is local but rather general encompassing for the first time both subcritical and supercritical (in L²) nonlinearities. We study the asymptotic stability of the nonlinear bound states, i.e. periodic in time localized in space solutions. Our result shows that all solutions with small initial data, converge to a nonlinear bound state. Therefore, the nonlinear bound states are asymptotically stable. The proof hinges on dispersive estimates that we obtain for the time dependent, Hamiltonian, linearized dynamics around a careful chosen one parameter family of bound states that “shadows” the nonlinear evolution of the system. Due to the generality of the methods we develop we expect them to extend to the case of perturbations of large bound states and to other nonlinear dispersive wave type equations.     

On the geometry of subsets of positive reach

We prove that sets of positive reach in Riemannian manifolds and more generally, almost convex subsets in spaces with an upper curvature bound have an upper curvature bound with respect to the inner metric.Mathematics Subject Classification (2000): 53C20     

Optimal use of the translation method and relaxations of variational problems

The translation method has been used with great success in bounding the effective moduli of composite materials. We consider here the analogous method for bounding the relaxations of variational problems. We optimize the bound over the set of all available translations. Our method is to cast this in the form of a minmax problem. Using techniques of nonsmooth analysis, we are able to identify the optimal translation bound, meanwhile proving the existence of at least one optimal combination rank-one convex quadratic and null-Lagrangian translation. The optimal translation bound proves to be a better general lower bound on relaxations of variational problems than is the polyconvexification in three dimensions. In two dimensions, we discuss the negative result that the optimal translation bound is exactly the polyconvexification. Several examples of optimal applications of translation bounds to non-convex nonlinear variational problems are given.     

On the Trace of Algebraic Integers of Small Height

We give an upper bound for the modulus of the first non–zero trace among natural powers of an algebraic integer of small house. An upper bound for this power is obtained for the Pisot and Salem numbers. Although the house of these numbers is not at all small, similar bounds for the first non–zero trace are also established. Finally, we give an upper bound for the trace of an algebraic number with the Mahler measure bounded above by the square root of the degree.     

Upper bounds for the number of orbital topological types of planar polynomial vector fields modulo limit cycles

The purpose of this paper is to find an upper bound for the number of orbital topological types of nth-degree polynomial fields in the plane. An obstacle to obtaining such a bound is related to the unsolved second part of the Hilbert 16th problem. This obstacle is avoided by introducing the notion of equivalence modulo limit cycles. Earlier, the author obtained a lower bound of the form $2^{cn^2 } $ . In the present paper, an upper bound of the same form but with a different constant is found. Moreover, for each planar polynomial vector field with finitely many singular points, a marked planar graph is constructed that represents a complete orbital topological invariant of this field.     

An elementary bound for the number of points of a hypersurface over a finite field (Summary)

This short note is a summary of our paper with the same title [M. Homma and S. J. Kim, An elementary bound for the number of points of a hypersurface over a finite field, preprint 2012]. We establish an upper bound for the number of points of a hypersurface without a linear component over a finite field, which is analogous to the Sziklai bound for a plane curve.