Induced subgraphs of given sizes

We say (n, e) → (m, f), an (m, f) subgraph is forced, if every n-vertex graph of size e has an m-vertex spanned subgraph with f edges. For example, as Turán proved, (n,e)→(k,(^k₂)) for e> t_{k − 1}(n) and (n,e) (^k₂)), otherwise. We give a number of constructions showing that forced pairs are rare. Using tools of extremal graph theory we also show infinitely many positive cases. Several problems remain open.     

Weak convergence to the multiple Stratonovich integral

We have considered the problem of the weak convergence, as tends to zero, of the multiple integral processes

in the space , where fL²([0,T]ⁿ) is a given function, and {η(t)}_>0 is a family of stochastic processes with absolutely continuous paths that converges weakly to the Brownian motion. In view of the known results when n2 and f(t₁,…,t_n)=1_{t1<t2<<tn}, we cannot expect that these multiple integrals converge to the multiple Itô–Wiener integral of f, because the quadratic variations of the η are null. We have obtained the existence of the limit for any {η}, when f is given by a multimeasure, and under some conditions on {η} when f is a continuous function and when f(t₁,…,t_n)=f₁(t₁)f_n(t_n)1_{t1<t2<<tn}, with f_iL²([0,T]) for any i=1,…,n. In all these cases the limit process is the multiple Stratonovich integral of the function f.     

Degrees in a digraph whose nodes are graphs

By an f-graph we mean an unlabeled graph having no vertex of degree greater than f. Let D(n, f) denote the digraph whose node set is the set of f-graphs of order n and such that there is an arc from the node corresponding to graph H to the node corresponding to the graph K if and only if K is obtainable from H by the addition of a single edge. In earlier work, algorithms were developed which produce exact results about the structure of D(n, f), nevertheless many open problems remain. For example, the computation of the order and size of D(n, f) for a number of values of n and f have been obtained. Formulas for the order and size for f = 2 have also been derived. However, no closed form formulas have been determined for the order and size of D(n, f) for any value of f. Here we focus on questions concerning the degrees of the nodes in D(n,n − 1) and comment on related questions for D(n,f) for 2 f < n − 1.     

An extremal problem concerning matrices of 0's and 1 's

We determine the smallest number f(n,k) such that every (0,1)-matrix of order n what zero main diagonal which has at least f(n,k) 1's contains an irreducible, principal submatrix of order K. We characterize those matrices with f(n,k)-1 l's having no irreducible, principal submatrix of order k     

The game of n-times nim

The following game is considered. The first player can take any number of stones, but not all the stones, from a single pile of stones. After that, each player can take at most n-times as many as the previous one. The player first unable to move loses and his opponent wins. Let f₁,f₂,… be an initial sequence of stones in increasing order, such that the second player has a winning strategy when play begins from a pile of size f_i. It is proved that there exist constants c=c(n) and k₀=k₀(n) such that f_k+1=f_k+f_k−c for all k>k₀, and lim_n→∞ c(n)/(nlogn)=1.     

Split and balanced colorings of complete graphs

An (r, n)-split coloring of a complete graph is an edge coloring with r colors under which the vertex set is partitionable into r parts so that for each i, part i does not contain K_n in color i. This generalizes the notion of split graphs which correspond to (2, 2)-split colorings. The smallest N for which the complete graph K_N has a coloring which is not (r, n)-split is denoted by ƒ_r(n). Balanced (r,n)-colorings are defined as edge r-colorings of KN such that every subset of [N/r] vertices contains a monochromatic K_n in all colors. Then g_r(n) is defined as the smallest N such that K_N has a balanced (r, n)-coloring. The definitions imply that f_r(n) g_r(n). The paper gives estimates and exact values of these functions for various choices of parameters.     

Maps of manifolds into the plane which lift to standard embeddings in codimension two

Let be a smooth map of a closed n-dimensional manifold (n2) into the plane and let be an orthogonal projection. We say that f has the standard lifting property, if every embedding with is standard in a certain sense. In this paper we give some sufficient conditions for a generic smooth map f to have the standard lifting property when M is a closed surface or an n-dimensional homotopy sphere.     

Oscillation criteria for second-order nonlinear differential equations with integrable coefficient

In this paper, we consider the second-order nonlinear differential equation

[a(t)|y′(t)|^σ−1y′(t)|′+q(t)f(y(t))=r(t)

where σ > 0 is a constant, a C(R, (0, ∞)), q C(R, R), f C(R, R), xf(x) > 0, f′(x) ≥ 0 for x ≠ 0. Some new sufficient conditions for the oscillation of all solutions of (*) are obtained. Several examples which dwell upon the importance of our results are also included.     

Intersections of nest algebras in finite dimensions

If are maximal nests on a finite-dimensional Hilbert space H, the dimension of the intersection of the corresponding nest algebras is at least dim H. On the other hand, there are three maximal nests whose nest algebras intersect in the scalar operators. The dimension of the intersection of two nest algebras (corresponding to maximal nests) can be of any integer value from n to n(n+1)/2, where n=dim H. For any two maximal nests there exists a basis {f₁,f₂,…,f_n} of H and a permutation π such that and where M_i=  span{f₁,f₂,…,f_i} and N_i= span{f_π(1),f_π(2),…,f_π(i)}. The intersection of the corresponding nest algebras has minimum dimension, namely dim H, precisely when π(j)=n−j+1,1jn. Those algebras which are upper-triangular matrix incidence algebras, relative to some basis, can be characterised as intersections of certain nest algebras.     

A stability property of the stochastic heat equation

In this paper we consider continuity properties of a stochastic heat equation of the form ∂u(t,x)/∂t = ∂²u(t,x)/∂x² + f(u(t,x))W_x,t. We prove that the solutions of this equation depend continuously on the function f and give some new estimates for this connection.     

Subsets of an interval whose product is a power

We form squares from the product of integers in a short interval [n, n + t_n], where we include n in the product. If p is prime, p|n, and (₂^p) > n, we prove that p is the minimum t_n. If no such prime exists, we prove t_n √5n when n> 32. If n = p(2p − 1) and both p and 2p − 1 are primes, then t_n = 3p> 3 √n/2. For n(n + u) a square > n², we conjecture that a and b exist where n < a < b < n + u and nab is a square (except n = 8 and N = 392). Let g₂(n) be minimal such that a square can be formed as the product of distinct integers from [n, g₂(n)] so that no pair of consecutive integers is omitted. We prove that g₂(n) 3n − 3, and list or conjecture the values of g₂(n) for all n. We describe the generalization to kth powers and conjecture the values for large n.     

Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs

It is known that if f is a multiplicative increasing function on , then either f(n)=0 for all or f(n)=n for some 0. It is very natural to ask if there are similar results in other algebraic systems. In this paper, we first study the multiplicative increasing functions over nonnegative square matrices with respect to tensor product and then restrict our result to multidigraphs and loopless multidigraphs.     

On the Characterization of Maximal Planar Graphs with a Given Signed Cycle Domination Number

Let G =(V, E) be a simple graph. A function f : E → {+1,-1} is called a signed cycle domination function(SCDF) of G if ∑_(e∈E(C))f(e) ≥ 1 for every induced cycle C of G. The signed cycle domination number of G is defined as γ'_(sc)(G) = min{∑_(e∈E)f(e)| f is an SCDF of G}. This paper will characterize all maximal planar graphs G with order n ≥ 6 and γ'_(sc)(G) = n.     

Commutativity preserving linear maps and Lie automorphisms of strictly triangular matrix space

In this paper we classify linear maps preserving commutativity in both directions on the space N(F) of strictly upper triangular (n+1)×(n+1) matrices over a field F. We show that for n3 a linear map on N(F) preserves commutativity in both directions if and only if =^′+f where ^′ is a product of standard maps on N(F) and f is a linear map of N(F) into its center.     

Optimal fault-tolerant routings with small routing tables for k-connected graphs

We study the problem of designing fault-tolerant routings with small routing tables for a k-connected network of n processors in the surviving route graph model. The surviving route graph R(G,ρ)/F for a graph G, a routing ρ and a set of faults F is a directed graph consisting of nonfaulty nodes of G with a directed edge from a node x to a node y iff there are no faults on the route from x to y. The diameter of the surviving route graph could be one of the fault-tolerance measures for the graph G and the routing ρ and it is denoted by D(R(G,ρ)/F). We want to reduce the total number of routes defined in the routing, and the maximum of the number of routes defined for a node (called route degree) as least as possible. In this paper, we show that we can construct a routing λ for every n-node k-connected graph such that n2k², in which the route degree is , the total number of routes is O(k²n) and D(R(G,λ)/F)3 for any fault set F (|F|<k). In particular, in the case that k=2 we can construct a routing λ′ for every biconnected graph in which the route degree is , the total number of routes is O(n) and D(R(G,λ′)/{f})3 for any fault f. We also show that we can construct a routing ρ₁ for every n-node biconnected graph, in which the total number of routes is O(n) and D(R(G,ρ₁)/{f})2 for any fault f, and a routing ρ₂ (using ρ₁) for every n-node biconnected graph, in which the route degree is , the total number of routes is and D(R(G,ρ₂)/{f})2 for any fault f.     

On the degree of the inverse of an automorphism of the affine space

We study the degree of the inverse of an automorphism f of the affine n-space over a -algebra k, in terms of the degree d of f and of other data. For n = 1, we obtain a sharp upper bound for deg (f^{− 1}) in terms of d and of the nilpotency index of the ideal generated by the coefficients of f^′'. For n = 2 and arbitrary d≥ 3, we construct a (triangular) automorphism f of Jacobian one such that deg(f^{− 1}) > d. This answers a question of A. van den Essen (see [3]) and enables us to deduce that some schemes introduced by authors to study the Jacobian conjecture are not reduced. Still for n = 2, we give an upper bound for deg (f^{− 1}) when f is triangular. Finally, in the case d = 2 and any n, we complete a result of G. Meisters and C. Olech and use it to give the sharp bound for the degree of the inverse of a quadratic automorphism, with Jacobian one, of the affine 3-space.     

Factorizations of root-based polynomial compositions

Let denote the finite field of order q=p^r, p a prime and r a positive integer, and let f(x) and g(x) denote monic polynomials in of degrees m and n, respectively. Brawley and Carlitz (Discrete Math. 65 (1987) 115–139) introduce a general notion of root-based polynomial composition which they call the composed product and denote by fg. They prove that fg is irreducible over if and only if f and g are irreducible with gcd(m,n)=1. In this paper, we extend Brawley and Carlitz's work by examining polynomials which are composed products of irreducibles of non-coprime degrees. We give an upper bound on the number of distinct factors of fg, and we determine the possible degrees that the factors of fg can assume. We also determine when the bound on the number of factors of fg is met.     

On oscillation of second order neutral type delay differential equations

Oscillation criteria are obtained by using the so called H-method for the second order neutral type delay differential equations of the form

(r(t)ψ(x(t))z^′(t))^′+q(t)f(x(σ(t)))=0, tt₀,

where z(t)=x(t)+p(t)x(τ(t)), r, p, q, τ, σ, C([t₀,∞),R) and f,ψC(R,R).

The results of the paper contains several results obtained previously as special cases. Furthermore, we are also able to fix an error in a recent paper related to the oscillation of second order nonneutral delay differential equations.     

Embeddings of the base and bundle isomorphisms

Let π_i :E_i→M, i=1,2, be oriented, smooth vector bundles of rank k over a closed, oriented n-manifold with zero sections s_i :M→E_i. Suppose that U is an open neighborhood of s₁(M) in E₁ and F :U→E₂ a smooth embedding so that π₂Fs₁ :M→M is homotopic to a diffeomorphism f. We show that if k>[(n+1)/2]+1 then E₁ and the induced bundle f^*E₂ are isomorphic as oriented bundles provided that f have degree +1; the same conclusion holds if f has degree −1 except in the case where k is even and one of the bundles does not have a nowhere-zero cross-section. For n≡0(4) and [(n+1)/2]+1<kn we give examples of nonisomorphic oriented bundles E₁ and E₂ of rank k over a homotopy n-sphere with total spaces diffeomorphic with orientation preserved, but such that E₁ and f^*E₂ are not isomorphic oriented bundles. We obtain similar results and counterexamples in the more difficult limiting case where k=[(n+1)/2]+1 and M is a homotopy n-sphere.     

Chapter 3:inertia preservers

Let Vdenote either the space of n×n hermitian matrices or the space of n×nreal symmetric matrices, Given nonnegative integers r,s,t such that r+S+t=n, let G( r,s,r) denote the set of all matrices in V with inertia (r,s,t). We consider here linear operators on V which map G(r,s,t) into itself.