共查询到20条相似文献,搜索用时 15 毫秒
1.
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. 相似文献
2.
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. 相似文献
3.
4.
We introduce (n+1)-preprojective algebras of algebras of global dimension n. We show that if an algebra is n-representation-finite then its (n+1)-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)-preprojective algebra is (n+1)-Calabi–Yau, and, more precisely, it is the (n+1)-Amiot cluster category of the stable n-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)-cluster tilting object. We show that even if the (n+1)-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}) the results above still hold for the stable category of Cohen–Macaulay modules. 相似文献
5.
A d-arc-dominated digraph is a digraph D of minimum out-degree d such that for every arc (x,y) of D, there exists a vertex u of D of out-degree d such that (u,x) and (u,y) are arcs of D. Henning and Yeo [Vertex disjoint cycles of different length in digraphs, SIAM J. Discrete Math. 26 (2012) 687–694] conjectured that a digraph with minimum out-degree at least four contains two vertex-disjoint cycles of different length. In this paper, we verify this conjecture for 4-arc-dominated digraphs. 相似文献
6.
Let R(G) be the graph obtained from G by adding a new vertex corresponding to each edge of G and by joining each new vertex to the end vertices of the corresponding edge, and Q(G) be the graph obtained from G by inserting a new vertex into every edge of G and by joining by edges those pairs of these new vertices which lie on adjacent edges of G. In this paper, we determine the Laplacian polynomials of R(G) and Q(G) of a regular graph G; on the other hand, we derive formulae and lower bounds of the Kirchhoff index of these graphs. 相似文献
7.
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. 相似文献
8.
In this paper, we study degenerate CR embeddings f of a strictly pseudoconvex hypersurface M⊂Cn+1 into a sphere S in a higher dimensional complex space CN+1. The degeneracy of the mapping f will be characterized in terms of the ranks of the CR second fundamental form and its covariant derivatives. In 2004, the author, together with X. Huang and D. Zaitsev, established a rigidity result for CR embeddings f into spheres in low codimensions. A key step in the proof of this result was to show that degenerate mappings are necessarily contained in a complex plane section of the target sphere (partial rigidity). In the 2004 paper, it was shown that if the total rank d of the second fundamental form and all of its covariant derivatives is <n (here, n is the CR dimension of M), then f(M) is contained in a complex plane of dimension n+d+1. The converse of this statement is also true, as is easy to see. When the total rank d exceeds n, it is no longer true, in general, that f(M) is contained in a complex plane of dimension n+d+1, as can be seen by examples. In this paper, we carry out a systematic study of degenerate CR mappings into spheres. We show that when the ranks of the second fundamental form and its covariant derivatives exceed the CR dimension n, then partial rigidity may still persist, but there is a “defect” k that arises from the ranks exceeding n such that f(M) is only contained in a complex plane of dimension n+d+k+1. Moreover, this defect occurs in general, as is illustrated by examples. 相似文献
9.
We consider a multidimensional diffusion X with drift coefficient b(α,Xt) and diffusion coefficient ?σ(β,Xt). The diffusion sample path is discretely observed at times tk=kΔ for k=1…n on a fixed interval [0,T]. We study minimum contrast estimators derived from the Gaussian process approximating X for small ?. We obtain consistent and asymptotically normal estimators of α for fixed Δ and ?→0 and of (α,β) for Δ→0 and ?→0 without any condition linking ? and Δ. We compare the estimators obtained with various methods and for various magnitudes of Δ and ? based on simulation studies. Finally, we investigate the interest of using such methods in an epidemiological framework. 相似文献
10.
In this paper, the approximation characteristic of a diagonal matrix in probabilistic and average case settings is investigated. And the asymptotic degree of the probabilistic linear (n,δ)-width and p-average linear n-width of diagonal matrix M are determined. 相似文献
11.
Let R be a commutative ring with identity. We will say that an R-module M satisfies the weak Nakayama property, if IM=M, where I is an ideal of R, implies that for any x∈M there exists a∈I such that (a−1)x=0. In this paper, we will study modules satisfying the weak Nakayama property. It is proved that if R is a local ring, then R is a Max ring if and only if J(R), the Jacobson radical of R, is T-nilpotent if and only if every R-module satisfies the weak Nakayama property. 相似文献
12.
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. 相似文献
13.
Berrizbeitia and Olivieri showed in a recent paper that, for any integer r, the notion of ω-prime to base a leads to a primality test for numbers n≡1 mod r, that under the Extended Riemann Hypothesis (ERH) runs in polynomial time. They showed that the complexity of their test is at most the complexity of the Miller primality test (MPT), which is O((logn)4+o(1)). They conjectured that their test is more effective than the MPT if r is large. 相似文献
14.
In this paper, we consider a commonly used compression scheme called run-length encoding. We provide both lower and upper bounds for the problems of comparing two run-length encoded strings. Specifically, we prove the 3sum-hardness for both the wildcard matching problem and the k-mismatch problem with run-length compressed inputs. Given two run-length encoded strings of m and n runs, such a result implies that it is very unlikely to devise an o(mn)-time algorithm for either of them. We then present an inplace algorithm running in O(mnlogm) time for their combined problem, i.e. k-mismatch with wildcards. We further demonstrate that if the aim is to report the positions of all the occurrences, there exists a stronger barrier of Ω(mnlogm)-time, matching the running time of our algorithm. Moreover, our algorithm can be easily generalized to a two-dimensional setting without impairing the time and space complexity. 相似文献
15.
16.
Mustapha Chellali Teresa W. Haynes Stephen T. Hedetniemi Alice McRae 《Discrete Applied Mathematics》2013
A subset S⊆V in a graph G=(V,E) is a [j,k]-set if, for every vertex v∈V?S, j≤|N(v)∩S|≤k for non-negative integers j and k, that is, every vertex v∈V?S is adjacent to at least j but not more than k vertices in S. In this paper, we focus on small j and k, and relate the concept of [j,k]-sets to a host of other concepts in domination theory, including perfect domination, efficient domination, nearly perfect sets, 2-packings, and k-dependent sets. We also determine bounds on the cardinality of minimum [1, 2]-sets, and investigate extremal graphs achieving these bounds. This study has implications for restrained domination as well. Using a result for [1, 3]-sets, we show that, for any grid graph G, the restrained domination number is equal to the domination number of G. 相似文献
17.
Let (X,d) be a metric space endowed with a graph G such that the set V(G) of vertices of G coincides with X. We define the notion of G-Reich type maps and obtain a fixed point theorem for such mappings. This extends and subsumes many recent results which were obtained for other contractive type mappings on ordered metric spaces and for cyclic operators. 相似文献
18.
Let F be either the real number field R or the complex number field C and RPn the real projective space of dimension n. Theorems A and C in Hemmi and Kobayashi (2008) [2] give necessary and sufficient conditions for a given F-vector bundle over RPn to be stably extendible to RPm for every m?n. In this paper, we simplify the theorems and apply them to the tangent bundle of RPn, its complexification, the normal bundle associated to an immersion of RPn in Rn+r(r>0), and its complexification. Our result for the normal bundle is a generalization of Theorem A in Kobayashi et al. (2000) [8] and that for its complexification is a generalization of Theorem 1 in Kobayashi and Yoshida (2003) [5]. 相似文献
19.
20.
Representations are found for a limit law L(Z(k,p)) obtained from an expanding sequence of random forests containing n nodes with p∈(0,1] a probability controlling bond formation. One implies that Z(k,p) is stochastically decreasing as k increases and that norming gives an exponential limit law. Limit theorems are given for the order of component trees. The proofs exploit properties of the gamma function. 相似文献