共查询到20条相似文献,搜索用时 578 毫秒
1.
Let G be an arbitrary finite group and let S and T be two subsets such that |S|≥2, |T|≥2, and |TS|≤|T|+|S|−1≤|G|−2. We show that if |S|≤|G|−4|G|1/2 then either S is a geometric progression or there exists a non-trivial subgroup H such that either |HS|≤|S|+|H|−1 or |SH|≤|S|+|H|−1. This extends to the nonabelian case classical results for abelian groups. When we remove the hypothesis |S|≤|G|−4|G|1/2 we show the existence of counterexamples to the above characterization whose structure is described precisely. 相似文献
2.
Kelly, Kühn and Osthus conjectured that for any ?≥4 and the smallest number k≥3 that does not divide ?, any large enough oriented graph G with δ+(G),δ−(G)≥⌊|V(G)|/k⌋+1 contains a directed cycle of length ?. We prove this conjecture asymptotically for the case when ? is large enough compared to k and k≥7. The case when k≤6 was already settled asymptotically by Kelly, Kühn and Osthus. 相似文献
3.
In 2011, the fundamental gap conjecture for Schrödinger operators was proven. This can be used to estimate the ground state energy of the time-independent Schrödinger equation with a convex potential and relative error ε. Classical deterministic algorithms solving this problem have cost exponential in the number of its degrees of freedom d. We show a quantum algorithm, that is based on a perturbation method, for estimating the ground state energy with relative error ε. The cost of the algorithm is polynomial in d and ε−1, while the number of qubits is polynomial in d and logε−1. In addition, we present an algorithm for preparing a quantum state that overlaps within 1−δ,δ∈(0,1), with the ground state eigenvector of the discretized Hamiltonian. This algorithm also approximates the ground state with relative error ε. The cost of the algorithm is polynomial in d, ε−1 and δ−1, while the number of qubits is polynomial in d, logε−1 and logδ−1. 相似文献
4.
In many applications it has been observed that hybrid-Monte Carlo sequences perform better than Monte Carlo and quasi-Monte Carlo sequences, especially in difficult problems. For a mixed s-dimensional sequence m, whose elements are vectors obtained by concatenating d-dimensional vectors from a low-discrepancy sequence q with (s−d)-dimensional random vectors, probabilistic upper bounds for its star discrepancy have been provided. In a paper of G. Ökten, B. Tuffin and V. Burago [G. Ökten, B. Tuffin, V. Burago, J. Complexity 22 (2006), 435–458] it was shown that for arbitrary ε>0 the difference of the star discrepancies of the first N points of m and q is bounded by ε with probability at least 1−2exp(−ε2N/2) for N sufficiently large. The authors did not study how large N actually has to be and if and how this actually depends on the parameters s and ε. In this note we derive a lower bound for N, which significantly depends on s and ε. Furthermore, we provide a probabilistic bound for the difference of the star discrepancies of the first N points of m and q, which holds without any restrictions on N. In this sense it improves on the bound of Ökten, Tuffin and Burago and is more helpful in practice, especially for small sample sizes N. We compare this bound to other known bounds. 相似文献
5.
Jean-Stéphane Dhersin Fabian Freund Arno Siri-Jégousse Linglong Yuan 《Stochastic Processes and their Applications》2013
In this paper, we consider Beta(2−α,α) (with 1<α<2) and related Λ-coalescents. If T(n) denotes the length of a randomly chosen external branch of the n-coalescent, we prove the convergence of nα−1T(n) when n tends to ∞, and give the limit. To this aim, we give asymptotics for the number σ(n) of collisions which occur in the n-coalescent until the end of the chosen external branch, and for the block counting process associated with the n-coalescent. 相似文献
6.
Consider a graph G with a minimal edge cut F and let G1, G2 be the two (augmented) components of G−F. A long-open question asks under which conditions the crossing number of G is (greater than or) equal to the sum of the crossing numbers of G1 and G2—which would allow us to consider those graphs separately. It is known that crossing number is additive for |F|∈{0,1,2} and that there exist graphs violating this property with |F|≥4. In this paper, we show that crossing number is additive for |F|=3, thus closing the final gap in the question. 相似文献
7.
9.
In 1994 Dias da Silva and Hamidoune solved a long-standing open problem of Erd?s and Heilbronn using the structure of cyclic spaces for derivatives on Grassmannians and the representation theory of symmetric groups. They proved that for any subset A of the p-element group Z/pZ (where p is a prime), at least min{p,m|A|−m2+1} different elements of the group can be written as the sum of m different elements of A. In this note we present an easily accessible simplified version of their proof for the case m=2, and explain how the method can be applied to obtain the corresponding inverse theorem. 相似文献
10.
We derive a Molchan–Golosov-type integral transform which changes fractional Brownian motion of arbitrary Hurst index K into fractional Brownian motion of index H. Integration is carried out over [0,t], t>0. The formula is derived in the time domain. Based on this transform, we construct a prelimit which converges in L2(P)-sense to an analogous, already known Mandelbrot–Van Ness-type integral transform, where integration is over (−∞,t], t>0. 相似文献
11.
Consider a face-to-face parallelohedral tiling of Rd and a (d−k)-dimensional face F of the tiling. We prove that the valence of F (i.e. the number of tiles containing F as a face) is not greater than 2k. If the tiling is affinely equivalent to a Voronoi tiling for some lattice (the so called Voronoi case), this gives a well-known upper bound for the number of vertices of a Delaunay k-cell. Yet we emphasize that such an affine equivalence is not assumed in the proof. 相似文献
12.
By a perturbation method and constructing comparison functions, we reveal how the inhomogeneous term h affects the exact asymptotic behaviour of solutions near the boundary to the problem △u=b(x)g(u)+λh(x), u>0 in Ω, u|∂Ω=∞, where Ω is a bounded domain with smooth boundary in RN, λ>0, g∈C1[0,∞) is increasing on [0,∞), g(0)=0, g′ is regularly varying at infinity with positive index ρ, the weight b, which is non-trivial and non-negative in Ω, may be vanishing on the boundary, and the inhomogeneous term h is non-negative in Ω and may be singular on the boundary. 相似文献
13.
Let FFv be the set of faulty nodes in an n-dimensional folded hypercube FQn with |FFv|≤n−2. In this paper, we show that if n≥3, then every edge of FQn−FFv lies on a fault-free cycle of every even length from 4 to 2n−2|FFv|, and if n≥2 and n is even, then every edge of FQn−FFv lies on a fault-free cycle of every odd length from n+1 to 2n−2|FFv|−1. 相似文献
14.
In this paper we establish the boundedness of the extremal solution u∗ in dimension N=4 of the semilinear elliptic equation −Δu=λf(u), in a general smooth bounded domain Ω⊂RN, with Dirichlet data u|∂Ω=0, where f is a C1 positive, nondecreasing and convex function in [0,∞) such that f(s)/s→∞ as s→∞. 相似文献
15.
The oscillation of solutions of f″+Af=0 is discussed by focusing on four separate situations. In the complex case A is assumed to be either analytic in the unit disc D or entire, while in the real case A is continuous either on (−1,1) or on (0,∞). In all situations A is expected to grow beyond bounds that ensure finite oscillation for all (non-trivial) solutions, and the separation between distinct zeros of solutions is considered. 相似文献
16.
Let us fix a function f(n)=o(nlnn) and real numbers 0≤α<β≤1. We present a polynomial time algorithm which, given a directed graph G with n vertices, decides either that one can add at most βn new edges to G so that G acquires a Hamiltonian circuit or that one cannot add αn or fewer new edges to G so that G acquires at least e−f(n)n! Hamiltonian circuits, or both. 相似文献
17.
We prove that if for a continuous map f on a compact metric space X, the chain recurrent set, R(f) has more than one chain component, then f does not satisfy the asymptotic average shadowing property. We also show that if a continuous map f on a compact metric space X has the asymptotic average shadowing property and if A is an attractor for f, then A is the single attractor for f and we have A=R(f). We also study diffeomorphisms with asymptotic average shadowing property and prove that if M is a compact manifold which is not finite with dimM=2, then the C1 interior of the set of all C1 diffeomorphisms with the asymptotic average shadowing property is characterized by the set of Ω-stable diffeomorphisms. 相似文献
18.
We consider a multidimensional diffusion X with drift coefficient b(Xt,α) and diffusion coefficient εa(Xt,β) where α and β are two unknown parameters, while ε is known. For a high frequency sample of observations of the diffusion at the time points k/n, k=1,…,n, we propose a class of contrast functions and thus obtain estimators of (α,β). The estimators are shown to be consistent and asymptotically normal when n→∞ and ε→0 in such a way that ε−1n−ρ remains bounded for some ρ>0. The main focus is on the construction of explicit contrast functions, but it is noted that the theory covers quadratic martingale estimating functions as a special case. In a simulation study we consider the finite sample behaviour and the applicability to a financial model of an estimator obtained from a simple explicit contrast function. 相似文献
19.
20.
The sum–product conjecture of Erd?s and Szemerédi states that, given a finite set A of positive numbers, one can find asymptotic lower bounds for max{|A+A|,|A⋅A|} of the order of |A|1+δ for every δ<1. In this paper we consider the set of all spectral radii of n×n matrices with entries in A, and find lower bounds for the cardinality of this set. In the case n=2, this cardinality is necessarily larger than max{|A+A|,|A⋅A|}. 相似文献