Cliques, minors and apex graphs

In this paper, we proved the following result: Let G be a (k+2)-connected, non-(k−3)-apex graph where k≥2. If G contains three k-cliques, say L₁, L₂, L₃, such that |L_i∩L_j|≤k−2(1≤i<j≤3), then G contains a K_k+2 as a minor. Note that a graph G is t-apex if G−X is planar for some subset X⊆V(G) of order at most t.This theorem generalizes some earlier results by Robertson, Seymour and Thomas [N. Robertson, P.D. Seymour, R. Thomas, Hadwiger conjecture for K₆-free graphs, Combinatorica 13 (1993) 279-361.], Kawarabayashi and Toft [K. Kawarabayashi, B. Toft, Any 7-chromatic graph has K₇ or K_4,4 as a minor, Combinatorica 25 (2005) 327-353] and Kawarabayashi, Luo, Niu and Zhang [K. Kawarabayashi, R. Luo, J. Niu, C.-Q. Zhang, On structure of k-connected graphs without K_k-minor, Europ. J. Combinatorics 26 (2005) 293-308].     

On the reciprocal sum of a sum-free sequence

Let A = {1≤a1相似文献   

Limiting process for integral functionals of a wiener process on a cylinder

We prove that integral functionals, whose integrands are bounded functions of a Wiener process on a cylinder, weakly converge to the processw ₁(τ(t)), τ(t) = β₁ t + (β₂ − β₁)mes {s:w ₂(s)≥0,s<t}, wherew ₁(t andw ₂(t) are independent one-dimensional Wiener processes, β₁ and β₂ are nonrandom values, and β₂≥β₁≥0. Kiev University, Kiev. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 6, pp. 765–768, June, 1994.     

Adaptive policies for time-varying stochastic systems under discounted criterion

We consider a class of time-varying stochastic control systems, with Borel state and action spaces, and possibly unbounded costs. The processes evolve according to a discrete-time equation x _{n + 1}=G _n (x _n , a _n , ξ_n), n=0, 1, … , where the ξ_n are i.i.d. ℜ^k-valued random vectors whose common density is unknown, and the G _n are given functions converging, in a restricted way, to some function G _∞ as n→∞. Assuming observability of ξ_n, we construct an adaptive policy which is asymptotically discounted cost optimal for the limiting control system x _n+1=G _∞ (x _n , a _n , ξ_n).     

Two finiteness theorems for periodic tilings of d-dimensional euclidean space

Consider the d -dimensional euclidean space E ^d . Two main results are presented: First, for any N∈ N, the number of types of periodic equivariant tilings that have precisely N orbits of (2,4,6, . . . ) -flags with respect to the symmetry group Γ , is finite. Second, for any N∈ N, the number of types of convex, periodic equivariant tilings that have precisely N orbits of tiles with respect to the symmetry group Γ , is finite. The former result (and some generalizations) is proved combinatorially, using Delaney symbols, whereas the proof of the latter result is based on both geometric arguments and Delaney symbols. <lsiheader> <onlinepub>7 August, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>20n2p143.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>no <sectionname> </lsiheader> Received September 5, 1996, and in revised form January 6, 1997.     

The Characterization for a Graphic Sequence to have a Realization Containing K 1,1,s

A graphic sequence π?=?(d ₁, d ₂, . . . , d _n ) is said to be potentially K _1,1,s -graphic if there is a realization of π containing K _1,1,s as a subgraph, where K _1,1,s is the 1?× 1?× s complete 3-partite graph. In this paper, a simple characterization of potentially K _1,1,s -graphic sequences for s?≥ 2 and n?≥ 3s?+?1 is obtained. This characterization implies Lai’s conjecture on σ(K _1,1,s , n), which was confirmed by J.H. Yin, J.S. Li and W.Y. Li, and the values of σ(K _2,s , n) for s?≥ 4 and n?≥ 3s?+?1, where K _2,s is the 2?× s complete bipartite graph.     

The solvability of a boundary-value periodic problem

In the space of functions B _a³⁺={g(x, t)=−g(−x, t)=g(x+2π, t)=−g(x, t+T₃/2)=g(x, −t)}, we establish that if the condition aT ₃ (2s−1)=4πk, (4πk, a (2s−1))=1, k ∈ ℤ, s ∈ ℕ, is satisfied, then the linear problem u _u −a ² u _xx =g(x, t), u(0, t)=u(π, t)=0, u(x, t+T ₃ )=u(x, t), ℝ², is always consistent. To prove this statement, we construct an exact solution in the form of an integral operator. Ternopol’ Pedagogical Institute, Ternopol’. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 49, No. 2, pp. 302–308, Feburary, 1997 Ternopol’ Pedagogical Institute, Ternopol’. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 49, No. 2, pp. 302–308, Feburary, 1997     

On linear widths of classesH ω

We obtain new results related to the estimation of the linear widths λ _N and λ ^N in the spacesC andL _p for the classesH ^ω (in particular, forH ^α, 0<α<1). Institute of Mathematics, Ukrainian Academy of Sciences, Kiev. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 48, No. 9, pp. 1255–1264, September, 1996.     

Kp,q-factorization of complete bipartite graphs

Let K _m,nbe a complete bipartite graph with two partite sets having m and n vertices, respectively. A K _p,q-factorization of K _m,n is a set of edge-disjoint K _p,q-factors of K _m,n which partition the set of edges of K _m,n. When p = 1 and q is a prime number, Wang, in his paper “On K _1,k -factorizations of a complete bipartite graph” (Discrete Math, 1994, 126: 359—364), investigated the K _1,q -factorization of K _m,nand gave a sufficient condition for such a factorization to exist. In the paper “K _1,k -factorizations of complete bipartite graphs” (Discrete Math, 2002, 259: 301—306), Du and Wang extended Wang’s result to the case that q is any positive integer. In this paper, we give a sufficient condition for K _m,n to have a K _p,q-factorization. As a special case, it is shown that the Martin’s BAC conjecture is true when p : q = k : (k+ 1) for any positive integer k.     

On calculation of moments of ladder heights

Let X,X ₁,X ₂, … be independent identically distributed random variables, F(x) = P{X < x}, S ₀ = 0, and S _n =Σ _i=1 ⁿ X _i . We consider the random variables, ladder heights Z ₊ and Z ₋ that are respectively the first positive sum and the first negative sum in the random walk {S _n }, n = 0, 1, 2, …. We calculate the first three (four in the case EX = 0) moments of random variables Z ₊ and Z ₋ in the qualitatively different cases EX > 0, EX < 0, and EX = 0. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 46, No. 2, pp. 159–179, April–June, 2006.     

Differential-geometric structures on generalized Reidemeister and Bol three-webs

In this paper, we present the main results of the study of multidimensional three-websW(p, q, r) obtained by the method of external forms and moving Cartan frame. The method was developed by the Russian mathematicians S. P. Finikov, G. F. Laptev, and A. M. Vasiliev, while fundamentals of differential-geometric (p, q, r)-webs theory were described by M. A. Akivis and V. V. Goldberg. Investigation of (p, q, r)-webs, including algebraic and geometric theory aspects, has been continued in our papers, in particular, we found the structure equations of a three-web W(p, q, r), where p = λl, q = λm, and r = λ(l + m − 1). For such webs, we define the notion of a generalized Reidemeister configuration and proved that a three-web W(λl, λm, λ(l + m − 1)), on which all sufficiently small generalized Reidemeister configurations are closed, is generated by a λ-dimensional Lie group G. The structure equations of the web are connected with the Maurer–Cartan equations of the group G. We define generalized Reidemeister and Bol configurations for three-webs W(p, q, q). It is proved that a web W(p, q, q) on which generalized Reidemeister or Bol configurations are closed is generated, respectively, by the action of a local smooth q-parametric Lie group or a Bol quasigroup on a smooth p-dimensional manifold. For such webs, the structure equations are found and their differential-geometric properties are studied.     

Construction of Some Optimal Ternary Linear Codes and the Uniqueness of [294, 6, 195; 3]-Codes Meeting the Griesmer Bound

Let n_q(k, d) denote the smallest value of n for which there exists an [n, k, d; q]-code. It is known (cf. (J. Combin. Inform. Syst. Sci.18, 1993, 161–191)) that (1) n₃(6, 195) {294, 295}, n₃(6, 194) {293, 294}, n₃(6, 193) {292, 293}, n₃(6, 192) {290, 291}, n₃(6, 191) {289, 290}, n₃(6, 165) {250, 251} and (2) there is a one-to-one correspondence between the set of all nonequivalent [294, 6, 195; 3]-codes meeting the Griesmer bound and the set of all {v₂ + 2v₃ + v₄, v₁ + 2v₂ + v₃; 5, 3}-minihypers, where v_i = (3ⁱ − 1)/(3 − 1) for any integer i ≥ 0. The purpose of this paper is to show that (1) n₃(6, 195) = 294, n₃(6, 194) = 293, n₃(6, 193) = 292, n₃(6, 192) = 290, n₃(6, 191) = 289, n₃(6, 165) = 250 and (2) a [294, 6, 195; 3]-code is unique up to equivalence using a characterization of the corresponding {v₂ + 2v₃ + v₄, v₁ + 2v₂ + v₃; 5, 3}-minihypers.     

On the Degree of Approximation by Manifolds of Finite Pseudo-Dimension

The pseudo-dimension of a real-valued function class is an extension of the VC dimension for set-indicator function classes. A class of finite pseudo-dimension possesses a useful statistical smoothness property. In [10] we introduced a nonlinear approximation width = which measures the worst-case approximation error over all functions by the best manifold of pseudo-dimension n . In this paper we obtain tight upper and lower bounds on ρ _n (W ^r,d _p , L _q ) , both being a constant factor of n ^-r/d , for a Sobolev class W ^r,d _p , . As this is also the estimate of the classical Alexandrov nonlinear n -width, our result proves that approximation of W ^r,d _p by the family of manifolds of pseudo-dimension n is as powerful as approximation by the family of all nonlinear manifolds with continuous selection operators. March 12, 1997. Dates revised: August 26, 1997, October 24, 1997, March 16, 1998, June 15, 1998. Date accepted: June 25, 1998.     

Blow-up rates of radially symmetric large solutions

This paper adapts a technical device going back to [J. López-Gómez, Optimal uniqueness theorems and exact blow-up rates of large solutions, J. Differential Equations 224 (2006) 385-439] to ascertain the blow-up rate of the (unique) radially symmetric large solution given through the main theorem of [J. López-Gómez, Uniqueness of radially symmetric large solutions, Discrete Contin. Dyn. Syst., Supplement dedicated to the 6th AIMS Conference, Poitiers, France, 2007, pp. 677-686]. The requested underlying estimates are based upon the main theorem of [S. Cano-Casanova, J. López-Gómez, Existence, uniqueness and blow-up rate of large solutions for a canonical class of one-dimensional problems on the half-line, J. Differential Equations 244 (2008) 3180-3203]. Precisely, we show that if Ω is a ball, or an annulus, f∈C[0,∞) is positive and non-decreasing, V∈C[0,∞)∩C²(0,∞) satisfies V(0)=0, V^′(u)>0, V^″(u)?0, for every u>0, and V(u)∼Hup−1 as u↑∞, for some H>0 and p>1, then, for each λ?0,

−Δu=λu−f(dist(x,∂Ω))V(u)u     

The ring of an outer von Neumann frame in modular lattices

We prove the following theorem. Let (a ₁, . . . , a _m , c ₁₂, . . . , c _1m ) be a spanning von Neumann m-frame of a modular lattice L, and let (u ₁, . . . , u _n , v ₁₂, . . . , v _1n ) be a spanning von Neumann n-frame of the interval [0, a ₁]. Assume that either m ≥ 4, or L is Arguesian and m ≥ 3. Let R* denote the coordinate ring of (a ₁, . . . , a _m , c ₁₂, . . . , c _1m ). If n ≥ 2, then there is a ring S* such that R* is isomorphic to the ring of all n × n matrices over S*. If n ≥ 4 or L is Arguesian and n ≥ 3, then we can choose S* as the coordinate ring of (u ₁, . . . , u _n , v ₁₂, . . . , v _1n ).     

An extremal set theoretical characterization of some steiner systems

Letn, k, t be integers,n>k>t≧0, and letm(n, k, t) denote the maximum number of sets, in a family ofk-subsets of ann-set, no two of which intersect in exactlyt elements. The problem of determiningm(n, k, t) was raised by Erdős in 1975. In the present paper we prove that ifk≦2t+1 andk−t is a prime, thenm(n, k, t)≦( _t ⁿ )( _k ^2k-t-1 )/( _t ^2k-t-1 ). Moreover, equality holds if and only if an (n, 2k−t−1,t)-Steiner system exists. The proof uses a linear algebraic approach.     

A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets

Let F denote a family of pairwise disjoint convex sets in the plane. F is said to be in convex position if none of its members is contained in the convex hull of the union of the others. For any fixed k≥ 3 , we estimate P _k (n) , the maximum size of a family F with the property that any k members of F are in convex position, but no n are. In particular, for k=3 , we improve the triply exponential upper bound of T. Bisztriczky and G. Fejes Tóth by showing that P ₃ (n) < 16 ⁿ . <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p437.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received March 27, 1997, and in revised form July 10, 1997.     

The intersection problem for m-cycle systems

Let I_m(v) denote the set of integers k for which a pair of m-cycle systems of K_v, exist, on the same vertex set, having k common cycles. Let J_m(v) = {0, 1, 2,…, t_v ?2, t_v} where t_v = v(v ? 1)/2m. In this article, if 2mn + x is an admissible order of an m-cycle system, we investigate when I_m(2mn + x) = J_m(2mn + x), for both m even and m odd. Results include J^m(2mn + 1) = I^m(2mn + 1) for all n > 1 if m is even, and for all n > 2 if n is odd. Moreover, the intersection problem for even cycle systems is completely solved for an equivalence class x (mod 2m) once it is solved for the smallest in that equivalence class and for K_2m+1. For odd cycle systems, results are similar, although generally the two smallest values in each equivalence class need to be solved. We also completely solve the intersection problem for m = 4, 6, 7, 8, and 9. (The cased m = 5 was done by C-M. K. Fu in 1987.) © 1993 John Wiley & Sons, Inc.     

Méthode de mesure de la chaleur spécifique par température croissante ou décroissante

Résumé L'obtention des valeurs expérimentales de l'entropie, à l'équilibre, à partir des grandeurs thermiques, est rendue compliquée pour un supraconducteur se trouvant dans une phase mélangée, mixte ou intermédiaire, par le comportement irréversible observé en général dans les échantillons réels. Il est possible de réduire, voire supprimer l'incertitude dans l'interprétation des résultats si l'on détermine les variations d'entropie non seulement pour des températures et champs magnétiques croissants, mais également pour des températures et champs décroissants. On décrit une méthode de mesure de la chaleur spécifique, valable pourT<10°K, inspirée de la méthode d'impulsion d'une part, en ce sens qu'elle a l'avantage de travailler sur des états de quasi équilibre en température du système, et de la méthode de refroidissement continu d'autre part, puisqu'elle utilise une perte thermique permettant la mesure par température décroissante. Le modèle théorique correspondant au dispositif expérimental est traité complètement du point de vue mathématique. Les erreurs systématiques propres à la méthode peuvent être réduites à moins de 0.5% et des variations de température de quelques millidegrés peuvent être encore mesurées avec une précision de l'ordre du pourcent. Le procédé convient donc bien à l'étude détaillée des transitions de phase supraconductrices.

---

Summary It is difficult to obtain equilibrium values of entropy from measured thermal quantities, for superconductors in a mixed phase, because of irreversible behavior generally observed in real samples. It is possible to reduce, even suppress, the uncertainty arising from interpretation of results, if entropy variations are determined not only for increasing magnetic field and temperature, but also for decreasing field and temperature. A method to measure the specific heat is described, which is valid forT<10°K. As in the case of the heat burst method, the advantage is that the determination occurs from quasi-equilibrium states in temperature of the system. In addition, a heat leak allows us also to make measurements with decreasing temperature, as in the cooling curve method. The theoretical model corresponding to the experimental arrangement is thoroughly analysed from a mathematical point of view. Systematic errors, arising from the method itself, may be reduced to less than 0,5% and temperature variations of a few milli-degrees can still be measured with a precision of the order of 1%. This procedure is then well adapted to the detailed study of superconducting phase transitions.

     

General local convergence theory for a class of iterative processes and its applications to Newton’s method

General local convergence theorems with order of convergence r≥1$r\ge 1$ are provided for iterative processes of the type _xn+1=T_xn$x_{n+1}=T{x}_n$, where T:D⊂X→X$T:D\subset X\to X$ is an iteration function in a metric space X$X$. The new local convergence theory is applied to Newton iteration for simple zeros of nonlinear operators in Banach spaces as well as to Schröder iteration for multiple zeros of polynomials and analytic functions. The theory is also applied to establish a general theorem for the uniqueness ball of nonlinear equations in Banach spaces. The new results extend and improve some results of [K. Do?ev, Über Newtonsche Iterationen, C. R. Acad. Bulg. Sci. 36 (1962) 695–701; J.F. Traub, H. Wo?niakowski, Convergence and complexity of Newton iteration for operator equations, J. Assoc. Comput. Mach. 26 (1979) 250–258; S. Smale, Newton’s method estimates from data at one point, in: R.E. Ewing, K.E. Gross, C.F. Martin (Eds.), The Merging of Disciplines: New Direction in Pure, Applied, and Computational Mathematics, Springer, New York, 1986, pp. 185–196; P. Tilli, Convergence conditions of some methods for the simultaneous computation of polynomial zeros, Calcolo 35 (1998) 3–15; X.H. Wang, Convergence of Newton’s method and uniqueness of the solution of equations in Banach space, IMA J. Numer. Anal. 20 (2000) 123–134; I.K. Argyros, J.M. Gutiérrez, A unified approach for enlarging the radius of convergence for Newton’s method and applications, Nonlinear Funct. Anal. Appl. 10 (2005) 555–563; M. Giusti, G. Lecerf, B. Salvy, J.-C. Yakoubsohn, Location and approximation of clusters of zeros of analytic functions, Found. Comput. Math. 5 (3) (2005) 257–311], and others.