Linear Ramsey numbers of sparse graphs

The Ramsey number R(G₁,G₂) of two graphs G₁ and G₂ is the least integer p so that either a graph G of order p contains a copy of G₁ or its complement G^c contains a copy of G₂. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Preservativity logic: An analogue of interpretability logic for constructive theories

In this paper we study the modal behavior of Σ‐preservativity, an extension of provability which is equivalent to interpretability for classical superarithmetical theories. We explain the connection between the principles of this logic and some well‐known properties of HA, like the disjunction property and its admissible rules. We show that the intuitionistic modal logic given by the preservativity principles of HA known so far, is complete with respect to a certain class of frames.     

Robust Output Tracking Control of an Uncertain Linear System via a Modified Optimal Linear-Quadratic Method

This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness.     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003     

一个素变数丢番图不等式

本文证明了如果1相似文献   

ON MATRIX UNITARILY INVARIANT NORM CONDITION NUMBER

1.IntroductionSince1984,severalchinesemathematicianshaveobtailledmanyresultsboutmatrixoperatornormcondition.umbe.[ll'12'18].Twokindsmatrixconditionnllmbers[9]are:(1)IfAECoxsisnonsingular,thellunlberK.(A)~IIAll.llA--'if.iscalledtheor--normconditionnumberof…     

Number albedo measurements from stratified layers of iron,concrete and aluminium

A layer of stratified combination composed of selected radiation shielding materials acquires better shielding property. Albedo is used in such measurements as an integral measure ofγ-ray scattering. The stratified slabs of alternating heterogeneous layers have been found to have a virtual homogeneous property with a definite effective atomic number. The angular distribution of back-scattered photons as well as the total number albedo values for iron, aluminium and concrete in stratified combination for 662 keV and 1250 keV photons are reported.     

Uniform random number generation

In typical stochastic simulations, randomness is produced by generating a sequence of independent uniform variates (usually real-valued between 0 and 1, or integer-valued in some interval) and transforming them in an appropriate way. In this paper, we examine practical ways of generating (deterministic approximations to) such uniform variates on a computer. We compare them in terms of ease of implementation, efficiency, theoretical support, and statistical robustness. We look in particular at several classes of generators, such as linear congruential, multiple recursive, digital multistep, Tausworthe, lagged-Fibonacci, generalized feedback shift register, matrix, linear congruential over fields of formal series, and combined generators, and show how all of them can be analyzed in terms of their lattice structure. We also mention other classes of generators, like non-linear generators, discuss other kinds of theoretical and empirical statistical tests, and give a bibliographic survey of recent papers on the subject.     

反超图的笛卡儿积的上色数

讨论反超图的笛卡儿积的着色理论 ,求出了满足一定条件的反超图的笛卡儿积的上色数 .     

n元等比级数

定义了n元等比数列、n元等比级数,给出了它们的通项公式及前n项和.并解决了多元等比级数的敛散性问题,求出了多元等比级数的和.指出了多元等比数列及多元等比级数在特殊情况下与一元等比数列及一元等比级数的一致性.