共查询到20条相似文献,搜索用时 15 毫秒
1.
程钊 《数学的实践与认识》2013,43(1)
考察了图论中若干重要定理的历史背景,这些定理包括图论基本定理,矩阵-树定理,门格尔定理,霍尔定理,柯尼希定理,塔特定理,彼得森定理,库拉托夫斯基定理,布鲁克斯定理和维津定理. 相似文献
2.
Lorenzo Carlucci 《Archive for Mathematical Logic》2018,57(3-4):381-389
Hirst investigated a natural restriction of Hindman’s Finite Sums Theorem—called Hilbert’s Theorem—and proved it equivalent over \(\mathbf {RCA}_0\) to the Infinite Pigeonhole Principle for all colors. This gave the first example of a natural restriction of Hindman’s Theorem provably much weaker than Hindman’s Theorem itself. We here introduce another natural restriction of Hindman’s Theorem—which we name the Adjacent Hindman’s Theorem with apartness—and prove it to be provable from Ramsey’s Theorem for pairs and strictly stronger than Hirst’s Hilbert’s Theorem. The lower bound is obtained by a direct combinatorial implication from the Adjacent Hindman’s Theorem with apartness to the Increasing Polarized Ramsey’s Theorem for pairs introduced by Dzhafarov and Hirst. In the Adjacent Hindman’s Theorem homogeneity is required only for finite sums of adjacent elements. 相似文献
3.
重新证明文[10]中几个重要结论并修正文[10]中的定理1(11)和定理2.在此基础上,利用这些重新证明过的结论及修正过的定理可以按照文[10]中引理3,定理4,定理6,定理7,定理10的证明过程原样证明文[10]中的相应结果.因而在文[10]中,除性质11是结合BZ一代数的等价性质(见文[15]),定理1(11)及定理2需要进行修正外,其余结论及证明过程均成立. 相似文献
4.
本文研究形如(1.1)的第二特征上界问题,得到了定理1 和定理2,其中定理1 的估计系数与[a,b]无关,定理2 的结果在一定条件下比定理1 好. 相似文献
5.
Olivier Cogis 《Discrete Mathematics》1982,38(1):33-46
We deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of characterizations of Ferrers digraphs (Theorem 1) by investigating the connection between symmetric Ferrers digraphs and threshold graphs. A direct proof of Theorem 3 is easier than the one provided in here, but the purpose of this paper is to view Theorem 1 as an extension of Theorem 3 to the directed case (this extension point of view still holds on an algorithmic ground). 相似文献
6.
混合序列加权和的强收敛性 总被引:29,自引:0,他引:29
本文给出混合序列加权和的强收敛性的一些充分条件,这些结论推广和改进了文[1]定理3,文[2]定理3;文[3]定理4.15以及文[4]定理4. 相似文献
7.
8.
It is shown in this paper that the Theorem of Hahn-Vitali-Saks (Theorem 4) and the Uniform Boundedness Theorem (Theorem 5) hold true for measures with values in a topological group. The proofs given here for these theorems seem to the authors to be more direct than the usual proofs for real valued measures. 相似文献
9.
本文研究了一般半群环的右Artin性的刻划问题,改进了JanOkniski在[3]中的结果,并给出了半群环是右Artin环的刻划.最后进一步指出在一定条件下,R[S1]和R[S1]的链条件是等价的. 相似文献
10.
David J. Fernández-Bretón 《Order》2018,35(1):83-91
We pursue the idea of generalizing Hindman’s Theorem to uncountable cardinalities, by analogy with the way in which Ramsey’s Theorem can be generalized to weakly compact cardinals. But unlike Ramsey’s Theorem, the outcome of this paper is that the natural generalizations of Hindman’s Theorem proposed here tend to fail at all uncountable cardinals. 相似文献
11.
12.
微分中值定理的另类证明与推广 总被引:1,自引:0,他引:1
通常教科书中,微分中值定理的证明建立在罗尔(Rolle)定理之上.本文以实数连续性中的重要定理———区间套定理为依据,给出了拉格朗日微分中值定理的另类证明.此外,还给出了中值定理的若干推广形式. 相似文献
13.
Graph factors 总被引:1,自引:0,他引:1
W. T. Tutte 《Combinatorica》1981,1(1):79-97
This exposition is concerned with the main theorems of graph-factor theory, Hall’s and Ore’s Theorems in the bipartite case,
and in the general case Petersen’s Theorem, the 1-Factor Theorem and thef-Factor Theorem. Some published extensions of these theorems are discussed and are shown to be consequences rather than generalizations
of thef-Factor Theorem. The bipartite case is dealt with in Section 2. For the proper presentation of the general case a preliminary
theory of “G-triples” and “f-barriers” is needed, and this is set out in the next three Sections. Thef-Factor Theorem is then proved by an argument of T. Gallai in a generalized form. Gallai’s original proof derives the 1-Factor
Theorem from Hall’s Theorem. The generalization proceeds analogously from Ore’s Theorem to thef-Factor Theorem. 相似文献
14.
15.
Johnny Henderson Abdelghani Ouahab 《Nonlinear Analysis: Theory, Methods & Applications》2010,72(3-4):2147-2148
We correct an error made in the paper (J. Henderson and A. Ouahab, Fractional Functional Differential Inclusions with Finite Delay [Nonlinear Anal. 70(5) (2009) 2091–2015]), in an application of Theorem 4.1 in the proof of Theorem 4.2. We have revised the statement of Theorem 4.2 so that Theorem 4.1 is now applicable in its proof. 相似文献
16.
Roland Huber 《manuscripta mathematica》1988,61(1):49-62
We give a semialgebraic proof of the topological form of Zariski's Main Theorem. As an application we deduce the Riemann Extension Theorem for isoalgebraic functions from Zariski's Main Theorem. 相似文献
17.
Takahiro Mizuhara 《Mathematische Nachrichten》1994,165(1):231-244
In this note we establish an embedding theorem (Theorem 2.4) for local Hardy spaces in the sense of GOLDBERG [G]. This result is a non-homogeneous version of the theorem of BAERNSTEIN and SAWYER (Theorem BS). Also applying this theorem we establish embedding theorem and Fourier embedding theorem (Theorem 4.2, Theorem 4.3 and Corollary 4.4) for local Hardy spaces. 相似文献
18.
Technical Note Discontinuous Implicit Quasivariational Inequalities in Normed Spaces 总被引:1,自引:0,他引:1
In this paper, we consider an implicit quasivariational inequality without continuity assumptions in normed spaces. The main
result (Theorem 2.1) provides an infinite-dimensional version of Theorem 3.2 in Ref. 1. To achieve such a goal, we employ
Theorem 3.2 in Ref. 1 and the technique of Cubiotti in Ref. 2. In particular, Theorem 3.1 covers a recent result of Cubiotti
(Theorem 3.1 of Ref. 2) as a special case.
Communicated by F. Giannessi
This research was partially supported by the National Science Council of Taiwan, ROC. 相似文献
19.
Joseph R. Mileti 《Transactions of the American Mathematical Society》2008,360(3):1309-1340
Using the tools of computability theory and reverse mathematics, we study the complexity of two partition theorems, the Canonical Ramsey Theorem of Erdös and Rado, and the Regressive Function Theorem of Kanamori and McAloon. Our main aim is to analyze the complexity of the solutions to computable instances of these problems in terms of the Turing degrees and the arithmetical hierarchy. We succeed in giving a sharp characterization for the Canonical Ramsey Theorem for exponent 2 and for the Regressive Function Theorem for all exponents. These results rely heavily on a new, purely inductive, proof of the Canonical Ramsey Theorem. This study also unearths some interesting relationships between these two partition theorems, Ramsey's Theorem, and König's Lemma.
20.
给出了罗尔微分中值定理的三种新的证明方法,其中第二种很简便的方法仅依赖于大家熟知的Heine-Borel有限覆盖定理.由此可见罗尔微分中值定理可以是实数的完备性的直接推论. 相似文献