On a generalization of distance sets

A subset X in the d-dimensional Euclidean space is called a k-distance set if there are exactly k distinct distances between two distinct points in X and a subset X is called a locally k-distance set if for any point x in X, there are at most k distinct distances between x and other points in X.Delsarte, Goethals, and Seidel gave the Fisher type upper bound for the cardinalities of k-distance sets on a sphere in 1977. In the same way, we are able to give the same bound for locally k-distance sets on a sphere. In the first part of this paper, we prove that if X is a locally k-distance set attaining the Fisher type upper bound, then determining a weight function w, (X,w) is a tight weighted spherical 2k-design. This result implies that locally k-distance sets attaining the Fisher type upper bound are k-distance sets. In the second part, we give a new absolute bound for the cardinalities of k-distance sets on a sphere. This upper bound is useful for k-distance sets for which the linear programming bound is not applicable. In the third part, we discuss about locally two-distance sets in Euclidean spaces. We give an upper bound for the cardinalities of locally two-distance sets in Euclidean spaces. Moreover, we prove that the existence of a spherical two-distance set in (d−1)-space which attains the Fisher type upper bound is equivalent to the existence of a locally two-distance set but not a two-distance set in d-space with more than d(d+1)/2 points. We also classify optimal (largest possible) locally two-distance sets for dimensions less than eight. In addition, we determine the maximum cardinalities of locally two-distance sets on a sphere for dimensions less than forty.     

ON THE ERROR BOUND IN SLEPIANWOLF THEOREM

In this paper,we discuss the problem of estimation of the probability of error inSlepian-Wolf Theorem.We give both an upper bound and a lower bound of the error exponentof the best code C(R_x,R_y).For a main part of the achievable rates,we have determined theerror exponent completely,for the others,our estimation is accurate.     

On a Sturm-Liouville problem

In this paper we give a lower bound for the first eigenvalue of an ordinary differential operator which represents the radial part of the Laplace operator restricted to a spherical cap of a sphere, possibly of fractional dimension. The results are obtained by purely analytical methods.Research supported by CONICIT.     

Estimates of the rate of convergence of a dynamic reconstruction algorithm under incomplete information about the phase state

In this paper, we study a dynamic reconstruction algorithm which reconstructs the unknown unbounded input and all unobservable phase coordinates from the results of measurements of part of the coordinates. An upper and a lower bound for the accuracy of the reconstruction is obtained. We determine the class of inputs for which the upper bound is uniform. We give a condition for optimally matching the algorithm parameters, ensuring the highest order of the upper bound and equating the orders of the upper and lower bounds. Thus, we establish the sharpness of the upper bound.     

On the fundamental groups of manifolds with integral curvature bounds

In this paper, we give an upper bound on the growth of π₁(M) for a class of manifolds with integral Ricci curvature bounds. This generalizes the main theorem of [8] to the case where the negative part of Ricci curvature is small in an averaged L¹- sense.Received: 19 July 2004     

Bounds for norms of the matrix inverse and the smallest singular value

In the first part, we obtain two easily calculable lower bounds for ‖A^-1‖, where ‖·‖ is an arbitrary matrix norm, in the case when A is an M-matrix, using first row sums and then column sums. Using those results, we obtain the characterization of M-matrices whose inverses are stochastic matrices. With different approach, we give another easily calculable lower bounds for ‖A^-1‖_∞ and ‖A^-1‖₁ in the case when A is an M-matrix. In the second part, using the results from the first part, we obtain our main result, an easily calculable upper bound for ‖A^-1‖₁ in the case when A is an SDD matrix, thus improving the known bound. All mentioned norm bounds can be used for bounding the smallest singular value of a matrix.     

Length minimizing geodesics and the length spectrum of Riemannian two-step nilmanifolds

In the first part of this article, we prove an explicit lower bound on the distance to the cut point of an arbitrary geodesic in a simply connected two-step nilpotent Lie group G with a lieft invariant metric. As a result, we obtaine a lower bound on the injectivity radius of a simply connected two-step nilpotent Lie group with a left invariant metric. We use this lower bound to determine the form of certain length minimizing geodesics from the identity to elements in the center of G. We also give an example of a two-step nilpotent Lie group G such that along most geodesics in this group, the cut point and the first conjugate point do not coincide. In the second part of this article, we examine the relation between the Laplace spectrum and the length spectrum on nilmanifolds by showing that a method developed by Gordon and Wilson for constructing families of isospectral two-step nilmanifolds necessarily yields manifolds with the same length spectrum. As a consequence, all known methods for constructing families of isospectral two-step nilmanifolds necessarily yield manifolds with the same length spectrum. In memory of Robert Brooks     

Global Complexity Bound Analysis of the Levenberg–Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem

We investigate a global complexity bound of the Levenberg–Marquardt Method (LMM) for nonsmooth equations. The global complexity bound is an upper bound to the number of iterations required to get an approximate solution that satisfies a certain condition. We give sufficient conditions under which the bound of the LMM for nonsmooth equations is the same as smooth cases. We also show that it can be reduced under some regularity assumption. Furthermore, by applying these results to nonsmooth equations equivalent to the nonlinear complementarity problem (NCP), we get global complexity bounds for the NCP. In particular, we give a reasonable bound when the mapping involved in the NCP is a uniformly P-function.     

Upper and Lower Bounds for the Stanley Depth of Certain Classes of Monomial Ideals and Their Residue Class Rings

We give an upper bound for the Stanley depth of the edge ideal of a complete k-partite hypergraph and as an application we give an upper bound for the Stanley depth of a monomial ideal in a polynomial ring S. We also give a lower and an upper bound for the cyclic module S/I associated to the complete k-partite hypergraph.     

Covering numbers for Chevalley groups

LetG be a quasisimple Chevalley group. We give an upper bound for the covering number cn(G) which is linear in the rank ofG, i.e. we give a constantd such that for every noncentral conjugacy classC ofG we haveC ^rd =G, wherer=rankG. Research supported in part by NSERC Canada Grant A7251. Research supported in part by the Hermann Minkowski-Minerva Center for Geometry at Tel Aviv University.     

Equality conditions for lower bounds on the smallest singular value of a bidiagonal matrix

Several lower bounds have been proposed for the smallest singular value of a square matrix, such as Johnson’s bound, Brauer-type bound, Li’s bound and Ostrowski-type bound. In this paper, we focus on a bidiagonal matrix and investigate the equality conditions for these bounds. We show that the former three bounds give strict lower bounds if all the bidiagonal elements are non-zero. For the Ostrowski-type bound, we present an easily verifiable necessary and sufficient condition for the equality to hold.     

Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator

In this paper we revisit the modular inversion hidden number problem (MIHNP) and the inversive congruential generator (ICG) and consider how to attack them more efficiently. We consider systems of modular polynomial equations of the form \(a_{ij}+b_{ij}x_i+c_{ij}x_j+x_ix_j=0~(\mathrm {mod}~p)\) and show the relation between solving such equations and attacking MIHNP and ICG. We present three heuristic strategies using Coppersmith’s lattice-based root-finding technique for solving the above modular equations. In the first strategy, we use the polynomial number of samples and get the same asymptotic bound on attacking ICG proposed in PKC 2012, which is the best result so far. However, exponential number of samples is required in the work of PKC 2012. In the second strategy, a part of polynomials chosen for the involved lattice are linear combinations of some polynomials and this enables us to achieve a larger upper bound for the desired root. Corresponding to the analysis of MIHNP we give an explicit lattice construction of the second attack method proposed by Boneh, Halevi and Howgrave-Graham in Asiacrypt 2001. We provide better bound than that in the work of PKC 2012 for attacking ICG. Moreover, we propose the third strategy in order to give a further improvement in the involved lattice construction in the sense of requiring fewer samples.     

How to Solve Nonlinear Equations When a Third Order Method is Not Applicable

In this paper, we use a one-parametric family of second-order iterations to solve a nonlinear operator equation in a Banach space. A Kantorovich-type convergence theorem is proved, so that the first Fréchet derivative of the operator satisfies a Lipschitz condition. We also give an explicit error bound.Supported in part by the University of La Rioja (grants: API-98/A25 and API-98/B12)and DGES (grant: PB96-0120-C03-02).     

New bounds for the chromatic number of graphs

In this article we first give an upper bound for the chromatic number of a graph in terms of its degrees. This bound generalizes and modifies the bound given in 11 . Next, we obtain an upper bound of the order of magnitude for the coloring number of a graph with small K_2,t (as subgraph), where n is the order of the graph. Finally, we give some bounds for chromatic number in terms of girth and book size. These bounds improve the best known bound, in terms of order and girth, for the chromatic number of a graph when its girth is an even integer. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:110–122, 2008     

Extreme values of the stationary distribution of random walks on directed graphs

We examine the stationary distribution of random walks on directed graphs. In particular, we focus on the principal ratio, which is the ratio of maximum to minimum values of vertices in the stationary distribution. We give an upper bound for this ratio over all strongly connected graphs on n vertices. We characterize all graphs achieving the upper bound and we give explicit constructions for these extremal graphs. Additionally, we show that under certain conditions, the principal ratio is tightly bounded. We also provide counterexamples to show the principal ratio cannot be tightly bounded under weaker conditions.     

Quaternionic Killing Spinors

In [17] we proved a lower bound for the spectrum of the Dirac operator on quaternionic Kähler manifolds. In the present article we study the limiting case, i.e. manifolds where the lower bound is attained as an eigenvalue. We give an equivalent formulation in terms of a quaternionic Killing equation and show that the only symmetric quaternionic Kähler manifolds with smallest possible eigenvalue are the quaternionic projective spaces.     

Normal forms, stability and splitting of invariant manifolds I. Gevrey Hamiltonians

In this paper, we give a new construction of resonant normal forms with a small remainder for near-integrable Hamiltonians at a quasi-periodic frequency. The construction is based on the special case of a periodic frequency, a Diophantine result concerning the approximation of a vector by independent periodic vectors and a technique of composition of periodic averaging. It enables us to deal with non-analytic Hamiltonians, and in this first part we will focus on Gevrey Hamiltonians and derive normal forms with an exponentially small remainder. This extends a result which was known for analytic Hamiltonians, and only in the periodic case for Gevrey Hamiltonians. As applications, we obtain an exponentially large upper bound on the stability time for the evolution of the action variables and an exponentially small upper bound on the splitting of invariant manifolds for hyperbolic tori, generalizing corresponding results for analytic Hamiltonians.     

On automorphisms of Enriques surfaces and their entropy

Consider an arbitrary automorphism of an Enriques surface with its lift to the covering K3 surface. We prove a bound of the order of the lift acting on the anti‐invariant cohomology sublattice of the Enriques involution. We use it to obtain some mod 2 constraint on the original automorphism. As an application, we give a necessary condition for Salem numbers to be dynamical degrees on Enriques surfaces and obtain a new lower bound on the minimal value. In the Appendix, we give a complete list of Salem numbers that potentially could be the minimal dynamical degree on Enriques surfaces and for which the existence of geometric automorphisms is unknown.     

On the Mordell–Weil rank of a surface fibration

Abstract

In this article, we give a new upper bound for the Mordell–Weil rank of a surface fibration and we prove an analog result in positive characteristic.     

Global attractor and its dimension estimates for the generalized dissipative KdV equation onR

In this paper we prove the existence of global attractor for the generalized dissipative KdV equation onR, and give an upper bound for its hausdorff and fractal dimensions.