#### Filter Results:

#### Publication Year

1985

2011

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

A general technique for tackling various reconstruction problems is presented and applied to some old and some new instances of such problems.

We derive new conditions for nonexistence of integral zeros of binary Kraw-tchouk polynomials. Upper bounds for the number of integral roots of Kraw-tchouk polynomials are presented.

We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest (u, v)-path is a shortest (u, v)-path amongst (u, v)-paths with length strictly greater than the length of the shortest (u, v)-path. In constrast to the situation in directed graphs, where the problem has been shown to be NP-hard, providing edges of length zero are… (More)

- Author N. Alon, I. Krasikov, Y. Peres
- 2008

Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Each copy of any part of a JSTOR transmission must contain the same copyright notice that… (More)

- I. KRASIKOV
- 2006

For ν > −1/2 and x real we shall establish explicit bounds for the Bessel function Jν (x) which are uniform in x and ν. This work and the recent result of L. J. Landau [7] provide relatively sharp inequalities for all real x.

We derive a new upper bound on the minimum distance d of doubly-even self-dual codes of length n.

A graph G is called bisectable if it is an edge-disjoint union of two isomorphic subgraphs. We show that any tree T with e edges contains a bisectable subgraph with at least e-O(e/log log e) edges. We also show that every forest of size e, each component of which is a star, contains a bisectable subgraph of size at least e-O(log2 e).