首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
For positive integers s and k1,k2,…,ks, the van der Waerden number w(k1,k2,…,ks;s) is the minimum integer n such that for every s-coloring of set {1,2,…,n}, with colors 1,2,…,s, there is a ki-term arithmetic progression of color i for some i. We give an asymptotic lower bound for w(k,m;2) for fixed m. We include a table of values of w(k,3;2) that are very close to this lower bound for m=3. We also give a lower bound for w(k,k,…,k;s) that slightly improves previously-known bounds. Upper bounds for w(k,4;2) and w(4,4,…,4;s) are also provided.  相似文献   

2.
3.
The van der Waerden permanent problem was solved using mainly algebraic methods. A much simpler analytic proof is given using a new concept in optimization theory which may be of importance in the general theory of mathematical programming.  相似文献   

4.
We demonstrate that Martin's axiom for -centered notions of forcing implies the existence of a van der Waerden space that is not a Hindman space. Our proof is an adaptation of the one given by M. Kojman and S. Shelah that such a space exists if one assumes the continuum hypothesis to be true.

  相似文献   


5.
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.

  相似文献   


6.
There are several notions of largeness that make sense in any semigroup, and others such as the various kinds of density that make sense in sufficiently well-behaved semigroups including and . It was recently shown that sets in which are multiplicatively large must contain arbitrarily large geoarithmetic progressions, that is, sets of the form , as well as sets of the form . Consequently, given a finite partition of , one cell must contain such configurations. In the partition case we show that we can get substantially stronger conclusions. We establish some combined additive and multiplicative Ramsey theoretic consequences of known algebraic results in the semigroups and , derive some new algebraic results, and derive consequences of them involving geoarithmetic progressions. For example, we show that given any finite partition of there must be, for each , sets of the form together with , the arithmetic progression , and the geometric progression in one cell of the partition. More generally, we show that, if is a commutative semigroup and a partition regular family of finite subsets of , then for any finite partition of and any , there exist and such that is contained in a cell of the partition. Also, we show that for certain partition regular families and of subsets of , given any finite partition of some cell contains structures of the form for some .

  相似文献   


7.
Van der Corput's lemma gives an upper bound for one-dimensional oscillatory integrals that depends only on a lower bound for some derivative of the phase, not on any upper bound of any sort. We establish generalizations to higher dimensions, in which the only hypothesis is that a partial derivative of the phase is assumed bounded below by a positive constant. Analogous upper bounds for measures of sublevel sets are also obtained. The analysis, particularly for the sublevel set estimates, has a more combinatorial flavour than in the one-dimensional case.

  相似文献   


8.
Given a graph L, in this article we investigate the anti‐Ramsey number χS(n,e,L), defined to be the minimum number of colors needed to edge‐color some graph G(n,e) with n vertices and e edges so that in every copy of L in G all edges have different colors. We call such a copy of L totally multicolored (TMC). In 7 among many other interesting results and problems, Burr, Erd?s, Graham, and T. Sós asked the following question: Let L be a connected bipartite graph which is not a star. Is it true then that In this article, we prove a slightly weaker statement, namely we show that the statement is true if L is a connected bipartite graph, which is not a complete bipartite graph. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 147–156, 2006  相似文献   

9.
We discuss the effectiveness of integer programming for solving large instances of the independent set problem. Typical LP formulations, even strengthened by clique inequalities, yield poor bounds for this problem. We show that a strong bound can be obtained by the use of the so-called rank inequalities, which generalize the clique inequalities. For some problems the clique inequalities imply the rank inequalities, and then a strong bound is guaranteed already by the simpler formulation.  相似文献   

10.
In this article, nonlinear free vibration of embedded double-walled carbon nanotubes (DWCNTs) duo to the nonlinear interlayer van der Waals (vdW) force is studied based on the nonlocal Euler-Bernoulli beam theory. The interlayer vdW force is modeled as a nonlinear function of inner and outer tubes deflections considering the variation of the interlayer distance along the circumference of DWCNTs. The harmonic balance method is applied to analyze the relationship between the deflection amplitudes and the frequencies of in-phase and out-of-phase free vibrations for DWCNTs. Finally, the influences of the nonlocal parameter, surrounding elastic medium, nanotube length, end condition and vibrational mode on the nonlinear free vibration properties of DWCNTs are discussed in detail.  相似文献   

11.
In this paper, the dynamics of a system of two van der Pol equations with a finite delay are investigated. We show that there exist the stability switches and a sequence of Hopf bifurcations occur at the zero equilibrium when the delay varies. Using the theory of normal form and the center manifold theorem, the explicit expression for determining the direction of the Hopf bifurcations and the stability of the bifurcating periodic solutions are derived.  相似文献   

12.
《Indagationes Mathematicae》2022,33(6):1312-1325
The Central Sets Theorem was introduced by H. Furstenberg and then afterwards several mathematicians have provided various versions and extensions of this theorem. All of these theorems deal with central sets, and its origin from the algebra of Stone–?ech compactification of arbitrary semigroup, say βS. It can be proved that every closed subsemigroup of βS is generated by a filter. We will show that, under some restrictions, one can derive the Central Sets Theorem for any closed subsemigroup of βS. We will derive this theorem using the corresponding filter and its algebra. Later we will also deal with how the notions of largeness along filters are preserved under some well behaved homomorphisms and give some consequences.  相似文献   

13.
In this paper, network of stochastic van der Pol oscillators with time-varying delayed coupling is considered. By using graph theory and Lyapunov functional method, the asymptotic boundedness in pth moment of the network is investigated. Moreover, by constructing an appropriate Lyapunov function, sufficient principle in the form of coefficients of network which ensures the asymptotic boundedness is established. Finally, a numerical example is given to show the effectiveness of the proposed criteria.  相似文献   

14.
This is a collection of open problems which touch on Neil Hindman's mathematics and were collected in conjunction with the Conference on Ramsey Theory and Topological Algebra in his honor.  相似文献   

15.
This paper presents three generalizations of the van der Pol equation (VDPE) using newly proposed three new generalized K-, A- and B-operators. These operators allow kernel to be arbitrary. As a result, these operators provide a greater generalization of the VDPE than the fractional integral and differential operators do. Like the original VDPE, the generalized van der Pol equations (GVDPEs) are also nonlinear equations, and in most cases, they can not be solved analytically. Numerical algorithms are presented and used to solve the GVDPEs. Results for several examples are presented to demonstrate the effectiveness of the numerical algorithms, and to examine the behavior of the GVDPEs and the limit cycles associated with them. Although the numerical algorithms have been used to solve the GVDPEs only, they can also be used to solve many other generalized oscillators and generalized differential equations. This will be considered in the future.  相似文献   

16.
We compute the sharp thresholds on g at which g-large and g-regressive Ramsey numbers cease to be primitive recursive and become Ackermannian.We also identify the threshold below which g-regressive colorings have usual Ramsey numbers, that is, admit homogeneous, rather than just min-homogeneous sets.  相似文献   

17.
In this paper, we analyzed stochastic chaos and Hopf bifurcation of stochastic Bonhoeffer–van der Pol (SBVP for short) system with bounded random parameter of an arch-like probability density function. The modifier ‘stochastic’ here implies dependent on some random parameter. In order to study the dynamical behavior of the SBVP system, Chebyshev polynomial approximation is applied to transform the SBVP system into its equivalent deterministic system, whose response can be readily obtained by conventional numerical methods. Thus, we can further explore the nonlinear phenomena in SBVP system. Stochastic chaos and Hopf bifurcation analyzed here are by and large similar to those in the deterministic mean-parameter Bonhoeffer–van der Pol system (DM–BVP for short) but there are also some featuring differences between them shown by numerical results. For example, in the SBVP system the parameter interval matching chaotic responses diffuses into a wider one, which further grows wider with increasing of intensity of the random variable. The shapes of limit cycles in the SBVP system are some different from that in the DM–BVP system, and the sizes of limit cycles become smaller with the increasing of intensity of the random variable. And some biological explanations are given.  相似文献   

18.
The Hahn–Banach Theorem for partially ordered totally convex modules [3] and a necessary and sufficient condition for the existence of an extension of a morphism from a submodule C 0 of a partially ordered totally convex module C (with the ordered unit ball of the reals as codomain) to C, are proved. Moreover, the categories of partially ordered positively convex and superconvex modules are introduced and for both categories the Hahn–Banach Theorem is proved.  相似文献   

19.
20.
It is proved that the density theorem of Arrow, Barankin, and Blackwell holds in a topological vector space equipped with a weakly closed convex cone to admit strictly positive continuous linear functionals. Moreover, several local versions of the Arrow, Barankin, and Blackwell theorem are given.  相似文献   

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

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