首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
The Dodd–Jensen Covering Lemma states that “if there is no inner model with a measurable cardinal, then for any uncountable set of ordinals X, there is a ${Y\in K}$ such that ${X\subseteq Y}$ and |X| = |Y|”. Assuming ZF+AD alone, we establish the following analog: If there is no inner model with an ${\mathbb {R}}$ –complete measurable cardinal, then the real core model ${K(\mathbb {R})}$ is a “very good approximation” to the universe of sets V; that is, ${K(\mathbb {R})}$ and V have exactly the same sets of reals and for any set of ordinals X with ${|{X}|\ge\Theta}$ , there is a ${Y\in K(\mathbb {R})}$ such that ${X\subseteq Y}$ and |X| = |Y|. Here ${\mathbb {R}}$ is the set of reals and ${\Theta}$ is the supremum of the ordinals which are the surjective image of ${\mathbb {R}}$ .  相似文献   

2.
We consider a generalized model of repeated quantum interactions, where a system ${\mathcal{H}}$ is interacting in a random way with a sequence of independent quantum systems ${\mathcal{K}_n, n \geq 1}$ . Two types of randomness are studied in detail. One is provided by considering Haar-distributed unitaries to describe each interaction between ${\mathcal{H}}$ and ${\mathcal{K}_n}$ . The other involves random quantum states describing each copy ${\mathcal{K}_n}$ . In the limit of a large number of interactions, we present convergence results for the asymptotic state of ${\mathcal{H}}$ . This is achieved by studying spectral properties of (random) quantum channels which guarantee the existence of unique invariant states. Finally this allows to introduce a new physically motivated ensemble of random density matrices called the asymptotic induced ensemble.  相似文献   

3.
The partition function of the random energy model at inverse temperature $\beta $ is a sum of random exponentials $ \mathcal{Z }_N(\beta )=\sum _{k=1}^N \exp (\beta \sqrt{n} X_k)$ , where $X_1,X_2,\ldots $ are independent real standard normal random variables (=random energies), and $n=\log N$ . We study the large N limit of the partition function viewed as an analytic function of the complex variable $\beta $ . We identify the asymptotic structure of complex zeros of the partition function confirming and extending predictions made in the theoretical physics literature. We prove limit theorems for the random partition function at complex $\beta $ , both on the logarithmic scale and on the level of limiting distributions. Our results cover also the case of the sums of independent identically distributed random exponentials with any given correlations between the real and imaginary parts of the random exponent.  相似文献   

4.
We introduce the operator $\gamma_{\mu}^{*}$ given by a hereditary class and a generalized topology?μ, and investigate its properties. With the help of? $\gamma_{\mu}^{*}$ , we define $\gamma_{\mu}^{*}$ -semi-open sets which are generalized open sets on generalized topologies and study the relation between such sets and some generalized open sets (e.g. μ-semi-open sets, μ-β-open sets) on generalized topologies.  相似文献   

5.
It is known that the box dimension of any Martin-Löf random closed set of ${\{0,1\}^\mathbb{N}}$ is ${\log_2(\frac{4}{3})}$ . Barmpalias et al. [J Logic Comput 17(6):1041–1062, 2007] gave one method of producing such random closed sets and then computed the box dimension, and posed several questions regarding other methods of construction. We outline a method using random recursive constructions for computing the Hausdorff dimension of almost every random closed set of ${\{0,1\}^\mathbb{N}}$ , and propose a general method for random closed sets in other spaces. We further find both the appropriate dimensional Hausdorff measure and the exact Hausdorff dimension for such random closed sets.  相似文献   

6.
Motivated by the availability of continuous event sequences that trace the social behavior in a population e.g. email, we believe that mutually exciting Hawkes processes provide a realistic and informative model for these sequences. For complex mutually exciting processes, the numerical optimization used for univariate self exciting processes may not provide stable estimates. Furthermore, convergence can be exceedingly slow, making estimation computationally expensive and multiple random restarts doubly so. We derive an expectation maximization algorithm for maximum likelihood estimation mutually exciting processes that is faster, more robust, and less biased than estimation based on numerical optimization. For an exponentially decaying excitement function, each EM step can be computed in a single $O(N)$ pass through the data, for $N$ observations, without requiring the entire dataset to be in memory. More generally, exact inference is $\Theta (N^{2})$ , but we identify some simple $\Theta (N)$ approximation strategies that seem to provide good estimates while reducing the computational cost.  相似文献   

7.
We use certain strong Q-reducibilities, and their corresponding strong positive reducibilities, to characterize the hyperimmune sets and the hyperhyperimmune sets: if A is any infinite set then A is hyperimmune (respectively, hyperhyperimmune) if and only if for every infinite subset B of A, one has ${\overline{K}\not\le_{\rm ss} B}$ (respectively, ${\overline{K}\not\le_{\overline{\rm s}} B}$ ): here ${\le_{\overline{\rm s}}}$ is the finite-branch version of s-reducibility, ??ss is the computably bounded version of ${\le_{\overline{\rm s}}}$ , and ${\overline{K}}$ is the complement of the halting set. Restriction to ${\Sigma^0_2}$ sets provides a similar characterization of the ${\Sigma^0_2}$ hyperhyperimmune sets in terms of s-reducibility. We also show that no ${A \geq_{\overline{\rm s}}\overline{K}}$ is hyperhyperimmune. As a consequence, ${\deg_{\rm s}(\overline{K})}$ is hyperhyperimmune-free, showing that the hyperhyperimmune s-degrees are not upwards closed.  相似文献   

8.
We introduce the concept of numéraire s of convex sets in ${L^0_{+}}$ , the nonnegative orthant of the topological vector space L 0 of all random variables built over a probability space. A necessary and sufficient condition for an element of a convex set ${\mathcal{C} \subseteq L^0_{+}}$ to be a numéraire of ${\mathcal{C}}$ is given, inspired from ideas in financial mathematics.  相似文献   

9.
In this paper, we investigate the structure of reachable sets for general contact sub-Lorentzian metrics on $ {\mathbb{R}^3} $ . In some particular cases, the presented method leads to explicit formulas for functions describing reachable sets. We also compute the image under exponential mapping and prove that the sub-Lorentzian distance is continuous for the mentioned structures. All presented results concerning reachable sets can be directly applied to generic control affine systems in $ {\mathbb{R}^3} $ with a scalar input u and constraints |u|??????.  相似文献   

10.
Let $U \subset L_o ([0,1],\mathcal{M},m)$ be a set of Lebesgue measurable functions. Suppose also that two seminormed spaces of real number sequences are given: $\mathcal{A}$ and $\mathcal{B}$ . We study $\left( {\mathcal{A},\mathcal{B}} \right)$ -sets U defined by the classes $\mathcal{A}$ and $\mathcal{B}$ as follows: $\forall a = (a_n ) \in \mathcal{A}, \forall (f_n (t)) \in u^\mathbb{N} $ (or for sequences similar to $(f_n (t))$ ) $\exists E = E(a) \subset [0,1], mE = 1$ such that $\{ a_n f_n (t)\} 1_E (t)\} \in \mathcal{B}, t \in [0,1]$ . We consider three versions of the definition of $\left( {\mathcal{A},\mathcal{B}} \right)$ -sets, one of which is based on functions independent in the probability sense. The case ${\mathcal{B}}=l_\infty$ is studied in detail. It is shown that $({\mathcal{A}},l_\infty)$ -independent sets are sets bounded or order bounded in some well-known function spaces (L p , L p,q , etc.) constructed with respect to the Lebesgue measure. A characterization of such sets in terms of seminormed spaces of number sequences is given. The (l 1,c °)- and $(\mathcal{A},l_1 )$ -sets were studied by E. M. Nikishin.  相似文献   

11.
12.
Consider the complete convex geometric graph on $2m$ 2 m vertices, CGG $(2m)$ ( 2 m ) , i.e., the set of all boundary edges and diagonals of a planar convex $2m$ 2 m -gon P. In (Keller and Perles, Israel J Math 187:465–484, 2012), the smallest sets of edges that meet all the simple perfect matchings (SPMs) in CGG $(2m)$ ( 2 m ) (called “blockers”) are characterized, and it is shown that all these sets are caterpillar graphs with a special structure, and that their total number is $m \cdot 2^{m-1}$ m · 2 m ? 1 . In this paper we characterize the co-blockers for SPMs in CGG $(2m)$ ( 2 m ) , that is, the smallest sets of edges that meet all the blockers. We show that the co-blockers are exactly those perfect matchings M in CGG $(2m)$ ( 2 m ) where all edges are of odd order, and two edges of M that emanate from two adjacent vertices of P never cross. In particular, while the number of SPMs and the number of blockers grow exponentially with m, the number of co-blockers grows super-exponentially.  相似文献   

13.
We analyze the structure of strongly dominating sets of reals introduced in Goldstern et al. (Proc Am Math Soc 123(5):1573–1581, 1995). We prove that for every ${\kappa < \mathfrak{b}}$ κ < b a ${\kappa}$ κ -Suslin set ${A\subseteq{}^\omega\omega}$ A ? ω ω is strongly dominating if and only if A has a Laver perfect subset. We also investigate the structure of the class l of Baire sets for the Laver category base and compare the σ-ideal of sets which are not strongly dominating with the Laver ideal l 0.  相似文献   

14.
David Eppstein 《Order》2014,31(1):81-99
We generalize the $\frac{1}{3}$ $\frac{2}{3}$ conjecture from partially ordered sets to antimatroids: we conjecture that any antimatroid has a pair of elements x,y such that x has probability between $\frac{1}{3}$ and $\frac{2}{3}$ of appearing earlier than y in a uniformly random basic word of the antimatroid. We prove the conjecture for antimatroids of convex dimension two (the antimatroid-theoretic analogue of partial orders of width two), for antimatroids of height two, for antimatroids with an independent element, and for the perfect elimination antimatroids and node search antimatroids of several classes of graphs. A computer search shows that the conjecture is true for all antimatroids with at most six elements.  相似文献   

15.
Suppose that \({{(P, Q) \in {\mathbb{N}_{2}^\mathbb{N}} \times {\mathbb{N}_{2}^\mathbb{N}}}}\) and x = E 0.E 1 E 2 · · · is the P-Cantor series expansion of \({x \in \mathbb{R}}\) . We define $$\psi_{P,Q}(x) := {\sum_{n=1}^{\infty}} \frac{{\rm min}(E_n, q_{n}-1)}{q_1 \cdots q_n}.$$ The functions \({\psi_{P,Q}}\) are used to construct many pathological examples of normal numbers. These constructions are used to give the complete containment relation between the sets of Q-normal, Q-ratio normal, and Q-distribution normal numbers and their pairwise intersections for fully divergent Q that are infinite in limit. We analyze the Hölder continuity of \({\psi_{P,Q}}\) restricted to some judiciously chosen fractals. This allows us to compute the Hausdorff dimension of some sets of numbers defined through restrictions on their Cantor series expansions. In particular, the main theorem of a paper by Y. Wang et al. [29] is improved. Properties of the functions \({\psi_{P,Q}}\) are also analyzed. Multifractal analysis is given for a large class of these functions and continuity is fully characterized. We also study the behavior of \({\psi_{P,Q}}\) on both rational and irrational points, monotonicity, and bounded variation. For different classes of ergodic shift invariant Borel probability measures \({\mu_1}\) and \({\mu_2}\) on \({{\mathbb{N}_2^\mathbb{N}}}\) , we study which of these properties \({\psi_{P,Q}}\) satisfies for \({\mu_1 \times \mu_2}\) -almost every (P,Q) \({{\in {\mathbb{N}_{2}^{\mathbb{N}}} \times {\mathbb{N}_{2}^{\mathbb{N}}}}}\) . Related classes of random fractals are also studied.  相似文献   

16.
In this note we investigate the sharpness of Bruen’s bound on the size of a t-fold blocking set in \(AG(n,q)\) with respect to the hyperplanes. We give a construction for t-fold blocking sets meeting Bruen’s bound with \(t=q-n+2\) . This construction is used further to find the minimal size of a t-fold affine blocking set with \(t=q-n+1\) . We prove that for blocking sets in the geometries \(AG(n,2)\) the difference between the size of an optimal t-fold blocking set and tn exceeds any given number. In particular, we deviate infinitely from Bruen’s bound as n goes to infinity. We conclude with a construction that gives t-fold blocking sets with \(t=q-n+3\) whose size is close to the lower bounds known so far.  相似文献   

17.
The paper is a contribution to intuitionistic reverse mathematics. We introduce a formal system called Basic Intuitionistic Mathematics BIM, and then search for statements that are, over BIM, equivalent to Brouwer’s Fan Theorem or to its positive denial, Kleene’s Alternative to the Fan Theorem. The Fan Theorem is true under the intended intuitionistic interpretation and Kleene’s Alternative is true in the model of BIM consisting of the Turing-computable functions. The task of finding equivalents of Kleene’s Alternative is, intuitionistically, a nontrivial extension of the task of finding equivalents of the Fan Theorem, although there is a certain symmetry in the arguments that we shall try to make transparent. We introduce closed-and-separable subsets of Baire space \({\mathcal{N}}\) and of the set \({\mathcal{R}}\) of the real numbers. Such sets may be compact and also positively noncompact. The Fan Theorem is the statement that Cantor space \({\mathcal{C}}\) , or, equivalently, the unit interval [0, 1], is compact and Kleene’s Alternative is the statement that \({\mathcal{C}}\) , or, equivalently, [0, 1], is positively noncompact. The class of the compact closed-and-separable sets and also the class of the closed-and-separable sets that are positively noncompact are characterized in many different ways and a host of equivalents of both the Fan Theorem and Kleene’s Alternative is found.  相似文献   

18.
We present the formulation and the numerical analysis of the Brinkman problem derived in Allaire (Arch Rational Mech Anal 113(3): 209–259,1990. doi:10.1007/BF00375065, Arch Rational Mech Anal 113(3): 261–298, 1990. doi:10.1007/BF00375066) with a lognormal random permeability. Specifically, the permeability is assumed to be a lognormal random field taking values in the symmetric matrices of size $d\times d$ , where $d$ denotes the spatial dimension of the physical domain $D$ . We prove that the solutions admit bounded moments of any finite order with respect to the random input’s Gaussian measure. We present a Mixed Finite Element discretization in the physical domain $D$ , which is uniformly stable with respect to the realization of the lognormal permeability field. Based on the error analysis of this mixed finite element method (MFEM), we develop a multi-level Monte Carlo (MLMC) discretization of the stochastic Brinkman problem and prove that the MLMC-MFEM allows the estimation of the statistical mean field with the same asymptotical accuracy versus work as the MFEM for a single instance of the stochastic Brinkman problem. The robustness of the MFEM implies in particular that the present analysis also covers the Darcy diffusion limit. Numerical experiments confirm the theoretical results.  相似文献   

19.
We consider a closed semi-algebraic set ${X \subset \mathbb{R}^n}$ and a C 2 semi-algebraic function ${f : \mathbb{R}^n \rightarrow\mathbb{R}}$ such that ${f_{\vert X}}$ has a finite number of critical points. We relate the topology of X to the topology of the sets ${X \cap \{ f * \alpha \}}$ , where ${* \in \{\le,=,\ge \}}$ and ${\alpha \in \mathbb{R}}$ , and the indices of the critical points of ${f_{\vert X}}$ and ${-f_{\vert X}}$ . We also relate the topology of X to the topology of the links at infinity of the sets ${X \cap \{ f * \alpha\}}$ and the indices of these critical points. We give applications when ${X=\mathbb{R}^n}$ and when f is a generic linear function.  相似文献   

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号