Hamiltonicity in balancedk-partite graphs

One of the earliest results about hamiltonian graphs was given by Dirac. He showed that if a graphG has orderp and minimum degree at least thenG is hamiltonian. Moon and Moser showed that a balanced bipartite graph (the two partite sets have the same order)G has orderp and minimum degree more than thenG is hamiltonian. In this paper, their idea is generalized tok-partite graphs and the following result is obtained: LetG be a balancedk-partite graph with orderp = kn. If the minimum degree

On super vertex-graceful unicyclic graphs

A graph G with p vertices and q edges, vertex set V(G) and edge set E(G), is said to be super vertex-graceful (in short SVG), if there exists a function pair (f, f ⁺) where f is a bijection from V(G) onto P, f ⁺ is a bijection from E(G) onto Q, f ⁺((u, v)) = f(u) + f(v) for any (u, v) ∈ E(G),

Remainder estimates for the approximation numbers of weighted Hardy operators acting onL 2

We consider the weighted Hardy integral operatorT:L ²(a, b) →L ²(a, b), −∞≤a<b≤∞, defined by . In [EEH1] and [EEH2], under certain conditions onu andv, upper and lower estimates and asymptotic results were obtained for the approximation numbersa _n(T) ofT. In this paper, we show that under suitable conditions onu andv, where ∥w∥_p=(∫ _a ^b |w(t)|^p dt)^1/p. Research supported by NSERC, grant A4021. Research supported by grant No. 201/98/P017 of the Grant Agency of the Czech Republic.     

Error bounds for the solution of nonlinear two-point boundary value problems by Galerkin's method

Letu be the solution of the differential equationLu(x)=f(x, u(x)) forx(0,1) (with appropriate boundary conditions), whereL is an elliptic differential operator. Letû be the Galerkin approximation tou with polynomial spline trial functions. We obtain error bounds of the form , where 0jm andmk2m+q,p=2 orp=,h is the mesh size andq is a non negative integer depending on the splines being used.This research was supported in part by the Office of Naval Research under Contract N00014-69-A0200-1017.     

Коэффициенты рядов Ф урье и класс Липшица

We generalize and sharpen certain results concerning Fourier series from the Lipschitz class. In particular, for sinnx we prove the following: Let ¦b_n¦n^–2L(n) where L(x) is a continuous and slowly oscillating function. Then

Eine Bemerkung über diophantische Approximationen vone a,a≠0 rational

The following theorem is proved, based on an irrationality measure fore ^a (a∈0, rational) ofP. Bundschuh: Letp, q, u, v∈0 be rational integers withq≥1,v≥1,a=u/v, 0<δ≤2. If $$\begin{gathered} q > \exp \{ u^2 ((ea)^2 /8) (1 + u^2 (a e/2)^2 ) + |u|^{8/\delta } e^{2/\delta } + (4/\delta )\log \upsilon + \hfill \\ + (2/\delta )\log 12 + |a| + \log (3 + 20|a|e^{|a|} )) + \log ((3/2)e^{|a|} ) + e/2\} , \hfill \\ then |e^a - p/q| > q^{ - (2 + \delta )} . \hfill \\ \end{gathered} $$      

On Rounding Error Sums Related to the Circle Problem

For a large real parameter t and 0 a b we consider sums where is the rounding error function, i.e. (z) = z - [z] - 1/2. We generalize Huxley's well known estimate by showing that holds uniformly in 0 a b . Fruther, we investigate an analogous question related to the divisor problem and show that the inequality , which (due to Huxley) holds uniformly in 0 a b , and which is in general not true for 1 a b t, is true uniformly in 0 a b .     

Non-contractible edges in a 3-connected graph

An edgee in a 3-connected graphG is contractible if the contraction ofe inG results in a 3-connected graph; otherwisee is non-contractible. In this paper, we prove that the number of non-contractible edges in a 3-connected graph of orderp≥5 is at most $$3p - \left[ {\frac{3}{2}(\sqrt {24p + 25} - 5} \right],$$ and show that this upper bound is the best possible for infinitely many values ofp.     

Inclusion-exclusion inequalities

Ifμ is a positive measure, andA ₂, ...,A _n are measurable sets, the sequencesS ₀, ...,S _n andP _[0], ...,P _[n] are related by the inclusion-exclusion equalities. Inequalities among theS _i are based on the obviousP _[k]≧0. Letting =the average average measure of the intersection ofk of the setsA _i , it is shown that (−1) ^k Δ ^k M _i ≧0 fori+k≦n. The casek=1 yields Fréchet’s inequalities, andk=2 yields Gumbel’s and K. L. Chung’s inequalities. Generalizations are given involvingk-th order divided differences. Using convexity arguments, it is shown that forS ₀=1, whenS ₁≧N−1, and for 1≦k<N≦n andv=0, 1, .... Asymptotic results asn → ∞ are obtained. In particular it is shown that for fixedN, for all sequencesM ₀, ...,M _n of sufficiently large length if and only if for 0<t<1.     

On a Problem of P. Gallagher

Let p be an odd prime. For each integer a with x < a x + u and (a,p) = 1, we define by a 1 (mod p) and 1 p - 1. Let r(p,u,x) be the number of integers with x < a x + u and (a,p) = 1 for which a and are of opposite parity, and let E(n,u,x) = r(n,u,x) - 1/2 1, where denotes summation over all a such that (a,p) = 1. The main purpose of this paper is to prove that for any positive integer 1 u we have the asymptotic formula

Eigenvalues of the adjacency matrix of tetrahedral graphs

A tetrahedral graph is defined to be a graphG, whose vertices are identified with the unordered triplets onn symbols, such that vertices are adjacent if and only if the corresponding triplets have two symbols in common. Ifn ₂ (x) denotes the number of verticesy, which are at distance 2 fromx andA(G) denotes the adjacency matrix ofG, thenG has the following properties: P₁) the number of vertices is . P₂)G is connected and regular. P₃)n ₂ (x) = 3/2(n–3)(n–4) for allx inG. P₄) the distinct eigenvalues ofA(G) are –3, 2n–9,n–7, 3(n–3). We show that, ifn > 16, then any graphG (with no loops and multiple edges) having the properties P₁)–P₄) must be a tetrahedral graph. An alternative characterization of tetrahedral graphs has been given by the authors in [1].This research was supported by the National Science Foundation Grant No. GP-5790, and the Army Research Office (Durham) Grant No. DA-ARO-D-31-12-G910. (Institute of Statistics Mimeo Series No. 571, March 1968.)     

The range of two-parameter random walk in space

Summary Let {X _ij; i>0, j>0} be a double sequence of i.i.d. random variables taking values in the d-dimensional integer lattice E _d . Also let . Then the range of random walk {S _mn: m>0, n>0} up to time (m, n), denoted by R _mn , is the cardinality of the set {S _pq: 0m, n). In this paper a sufficient condition in terms of the characteristic function of X ₁₁ is given so that a.s. as either (m, n) or m(n) tends to infinity.     

The strongp-variation of martingales and orthogonal series

Let 1p< and letx=(x _n)n0 be a sequence of scalars. The strongp-variation ofx, denoted byW _p (x), is defined as

On Galois isomorphisms between ideals in extensions of local fields

LetL/K be a totally ramified, finite abelian extension of local fields, let and be the valuation rings, and letG be the Galois group. We consider the powers of the maximal ideal of as modules over the group ring . We show that, ifG has orderp ^m (withp the residue field characteristic), ifG is not cyclic (or ifG has orderp), and if a certain mild hypothesis on the ramification ofL/K holds, then and are isomorphic iffr≡r′ modp ^m . We also give a generalisation of this result to certain extensions not ofp-power degree, and show that, in the casep=2, the hypotheses thatG is abelian and not cyclic can be removed.     

Reconstructing graphs as subsumed graphs of hypergraphs,and some self-complementary triple systems

LetV be a set ofn elements. The set of allk-subsets ofV is denoted . Ak-hypergraph G consists of avertex-set V(G) and anedgeset , wherek≥2. IfG is a 3-hypergraph, then the set of edges containing a given vertexvεV(G) define a graphG _v . The graphs {G _v νvεV(G)} aresubsumed byG. Each subsumed graphG _v is a graph with vertex-setV(G) − v. They can form the set of vertex-deleted subgraphs of a graphH, that is, eachG _v ≽H −v, whereV(H)=V(G). In this case,G is a hypergraphic reconstruction ofH. We show that certain families of self-complementary graphsH can be reconstructed in this way by a hypergraphG, and thatG can be extended to a hypergraphG ^*, all of whose subsumed graphs are isomorphic toH, whereG andG ^* are self-complementary hypergraphs. In particular, the Paley graphs can be reconstructed in this way. This work was supported by an operating grant from the Natural Sciences and Engineering Research Council of Canada.     

On theq-log-concavity of Gaussian binomial coefficients

We give a combinatorial proof that is a polynomial inq with nonnegative coefficients for nonnegative integersa, b, k, l withab andlk. In particular, fora=b=n andl=k, this implies theq-log-concavity of the Gaussian binomial coefficients , which was conjectured byButler (Proc. Amer. Math. Soc. 101 (1987), 771–775).     

On computing the number of subgroups of a finite Abelian group

We consider the numberN _A (r) of subgroups of orderp ^r ofA, whereA is a finite Abelianp-group of type =₁,₂,..., _l ()), i.e. the direct sum of cyclic groups of order ⁱⁱ. Formulas for computingN _A (r) are well known. Here we derive a recurrence relation forN _A (r), which enables us to prove a conjecture of P. E. Dyubyuk about congruences betweenN _A (r) and the Gaussian binomial coefficient .     

Variational Inclusion Systems in $\mathbb{R}^N$

The authors study the existence of nontrivial solutions to p-Laplacian variational inclusion systems

Paley Type Inequalities for Several Parameter Vilenkin Systems

The aim of this paper is to prove Paley type inequalities for two-parameter Vilenkin system. Our main result is the following estimate:

Solutions of minimal period for a semilinear wave equation

In questo lavoro si considera il problema