Results 1  10
of
480
Minwise Independent Permutations
 Journal of Computer and System Sciences
, 1998
"... We define and study the notion of minwise independent families of permutations. We say that F ⊆ Sn is minwise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have Pr(min{π(X)} = π(x)) = 1 X . In other words we require that all the elements of any fixed set ..."
Abstract

Cited by 198 (11 self)
 Add to MetaCart
We define and study the notion of minwise independent families of permutations. We say that F ⊆ Sn is minwise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have Pr(min{π(X)} = π(x)) = 1 X . In other words we require that all the elements of any fixed set X have an equal chance to become the minimum element of the image of X under π. Our research was motivated by the fact that such a family (under some relaxations) is essential to the algorithm used in practice by the AltaVista web index software to detect and filter nearduplicate documents. However, in the course of our investigation we have discovered interesting and challenging theoretical questions related to this concept – we present the solutions to some of them and we list the rest as open problems.
Correlation function of Schur process with application to local geometry of a random 3dimensional Young Diagram
, 2001
"... ..."
Generalized Model Sets and Dynamical Systems
 CRM Monograph Series
, 1999
"... It is shown that the dynamical systems approach to the diffraction properties of model sets can be generalized to regular model sets in arbitrary sigmacompact Abelian groups with arbitrary locally compact Abelian groups as internal spaces. It is then shown that these regular model sets possess pure ..."
Abstract

Cited by 60 (0 self)
 Add to MetaCart
It is shown that the dynamical systems approach to the diffraction properties of model sets can be generalized to regular model sets in arbitrary sigmacompact Abelian groups with arbitrary locally compact Abelian groups as internal spaces. It is then shown that these regular model sets possess pure point diffraction spectra.
Computational strategies for the Riemann zeta function
, 2000
"... We provide a compendium of evaluation methods for the Riemann zeta function, presenting formulae ranging from historical attempts to recently found convergent series to curious oddities old and new. We concentrate primarily on practical computational issues, such issues depending on the domain of th ..."
Abstract

Cited by 48 (9 self)
 Add to MetaCart
We provide a compendium of evaluation methods for the Riemann zeta function, presenting formulae ranging from historical attempts to recently found convergent series to curious oddities old and new. We concentrate primarily on practical computational issues, such issues depending on the domain of the argument, the desired speed of computation, and the incidence of what we call “value recycling”.
Classical Limit Of The Quantized Hyperbolic Toral Automorphisms
 COMM. MATH. PHYS
, 1995
"... The canonical quantization of any hyperbolic symplectomorphism A of the 2torus yields a periodic unitary operator on a Ndimensional Hilbert space, N = 1 h . We prove that this quantum system becomes ergodic and mixing at the classical limit (N !1, N prime) which can be interchanged with the tim ..."
Abstract

Cited by 43 (5 self)
 Add to MetaCart
The canonical quantization of any hyperbolic symplectomorphism A of the 2torus yields a periodic unitary operator on a Ndimensional Hilbert space, N = 1 h . We prove that this quantum system becomes ergodic and mixing at the classical limit (N !1, N prime) which can be interchanged with the timeaverage limit. The recovery of the stochastic behaviour out of a periodic one is based on the same mechanism under which the uniform distribution of the classical periodic orbits reproduces the Lebesgue measure: the Wigner functions of the eigenstates, supported on the classical periodic orbits, are indeed proved to become uniformly spread in phase space.
Minwise independent permutations (extended abstract
 In STOC ’98: Proceedings of the thirtieth annual ACM symposium on Theory of computing
, 1998
"... We define and study the notion of minwise independent families of permutations. We say that F⊆Sn is minwise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have Pr ( min{π(X)} = π(x) ) = 1 X . In other words we require that all the elements of any fixed set ..."
Abstract

Cited by 41 (1 self)
 Add to MetaCart
We define and study the notion of minwise independent families of permutations. We say that F⊆Sn is minwise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have Pr ( min{π(X)} = π(x) ) = 1 X . In other words we require that all the elements of any fixed set X have an equal chance to become the minimum element of the image of X under π. Our research was motivated by the fact that such a family (under some relaxations) is essential to the algorithm used in practice by the AltaVista web index software to detect and filter nearduplicate documents. However, in the course of
The Riemann Zeros and Eigenvalue Asymptotics
 SIAM Rev
, 1999
"... Comparison between formulae for the counting functions of the heights t n of the Riemann zeros and of semiclassical quantum eigenvalues En suggests that the t n are eigenvalues of an (unknown) hermitean operator H, obtained by quantizing a classical dynamical system with hamiltonian H cl . Many feat ..."
Abstract

Cited by 40 (5 self)
 Add to MetaCart
Comparison between formulae for the counting functions of the heights t n of the Riemann zeros and of semiclassical quantum eigenvalues En suggests that the t n are eigenvalues of an (unknown) hermitean operator H, obtained by quantizing a classical dynamical system with hamiltonian H cl . Many features of H cl are provided by the analogy; for example, the "Riemann dynamics" should be chaotic and have periodic orbits whose periods are multiples of logarithms of prime numbers. Statistics of the t n have a similar structure to those of the semiclassical En ; in particular, they display randommatrix universality at short range, and nonuniversal behaviour over longer ranges. Very refined features of the statistics of the t n can be computed accurately from formulae with quantum analogues. The RiemannSiegel formula for the zeta function is described in detail. Its interpretation as a relation between long and short periodic orbits gives further insights into the quantum spectral fluctuations. We speculate that the Riemann dynamics is related to the trajectories generated by the classical hamiltonian H cl = XP. Key words. spectral asymptotics, number theory AMS subject classifications. 11M26, 11M06, 35P20, 35Q40, 41A60, 81Q10, 81Q50 PII. S0036144598347497 1.
On some inequalities for the gamma and psi functions
 MATH. COMP
, 1997
"... We present new inequalities for the gamma and psi functions, and we provide new classes of completely monotonic, starshaped, and superadditive functions which are related to Γ and ψ. Euler’s gamma function Γ(x) = ..."
Abstract

Cited by 38 (1 self)
 Add to MetaCart
We present new inequalities for the gamma and psi functions, and we provide new classes of completely monotonic, starshaped, and superadditive functions which are related to Γ and ψ. Euler’s gamma function Γ(x) =
Mellin Transforms And Asymptotics: Digital Sums
, 1993
"... Arithmetic functions related to number representation systems exhibit various periodicity phenomena. For instance, a well known theorem of Delange expresses the total number of ones in the binary representations of the first n integers in terms of a periodic fractal function. We show that such perio ..."
Abstract

Cited by 38 (13 self)
 Add to MetaCart
Arithmetic functions related to number representation systems exhibit various periodicity phenomena. For instance, a well known theorem of Delange expresses the total number of ones in the binary representations of the first n integers in terms of a periodic fractal function. We show that such periodicity phenomena can be analyzed rather systematically using classical tools from analytic number theory, namely the MellinPerron formulae. This approach yields naturally the Fourier series involved in the expansions of a variety of digital sums related to number representation systems.