On the jordan form of the tensor product over fields of prime characteristic

Let A, B denote the companion matrices of the polynomials x^m,xⁿ over a field F of prime order p and let λ,μ be non-zero elements of an extension field K of F. The Jordan form of the tensor product (λI + A)⊗(μI + B) of invertible Jordan matrices over K is determined via an equivalent study of the nilpotent tranformation S of m × n matrices X over F where(X)S = A ^TX + XB. Using module-theoretic concepts a Jordan basis for S is specified recursively in terms of the representations of m and n in the scale of p, and reduction formulae for the elementary divisors of S are established.     

Extremal patterns of distinct entries in vectors in the range of a matrix

For an m × n matrix A over a field F we consider the following quantities: μ(A), the maximum multiplicity of a field element as a component of a nonzero vector in the range of A, and δ(A), the minimum number of distinct entries in a nonzero vector in the range of A. In terms of ramk(A), we describe the set of possible values of μand δ and discuss the possible relations between them. We also develop a general affine geometric structure in which the sets of values of μ and δ may be characterized linear algebraically.     

Extremal properties of strong quadrature weights and maximal mass results for truncated strong moment problems

A bisequence of complex numbers {μ_n}_−∞^∞ determines a strong moment functional satisfying L[xⁿ] = μ_n. If is positive-definite on a bounded interval (a,b) R{0}, then has an integral representation , n=0, ±1, ±2,…, and quadrature rules {w_ni,x_ni} exist such that μ_k = ∑_i=i^n_ns_ni^kw_ni. This paper is concerned with establishing certain extremal properties of the weights w_ni and using these properties to obtain maximal mass results satisfied by distributions ψ(x) representing when only a finite bisequence of moments {μ_k}_k=−nⁿ⁻¹ is given.     

A class of infinitely divisible variance functions with an application to the polynomial case

Let be a natural exponential family on ??? with variance function (V, Ω). Here, Ω is the mean domain of and V is its variance expressed in terms of the mean μ ε Ω. In this note we prove the following result. Consider an open interval Ω = (0, b), 0 < b ∞, and a positive real analytic function V on Ω. If V² is absolutely monotone on [0, b) and V has the form μt(μ), where 1 and t is real analytic in a neighborhood of zero, then there exits an infinitely divisible natural exponential family with variance function (V, Ω). We illustrate this result with several examples of general nature.     

Polynomials in a matrix

Let A be a matrixp(x) a polynomial. Put B=p(A). It is shown that necessary and sufficient conditions for A to be a polynomial in B are (i) if λ is any eigenvalue of A, and if some elementary divisor of A corresponding to λ is nonlinear, thenp^'(λ)≠0;and (ii) if λ,μ are distinct eigenvalues of A, then p(λ)p(μ) are also distinct. Here all computations are over some algebraically closed field.     

The equivariant Euler characteristic

We describe an equivariant version of the Euler characteristic in order to extend to the equivariant case classical results relating the Euler characteristic to vector field (Reinhart) bordism of smooth manifolds and controllable cut-and-paste equivalence. We show that the nonequivariant results continue to hold for an arbitrary finite ambient group G, both in the oriented and unoriented cases, and thereby extend work on this subject begun by several authors. We use a new definition of equivariant orientation in terms of a categorical notion of ‘groupoid representations’.     

Graph eigenspaces of small codimension

For a given positive integer t there are only finitely many graphs with an eigenvalue μ{−1,0} such that the eigenspace of μ has codimension t. The graphs for which t5 are identified.     

The reflection length of a transformation in the unitary group over a finite field

Let U be the unitary group over a finite field K where [K]≠3 and char K≠2. Every transformation π in U with detπ = ±1 is a product of reflections. We determine the length t of every such transformation π i.e. for each π we find reflections σ_i in U such that π=σ₁ σ_t and so that no factorization of π into fewer than t reflections exists.     

On the weak Freese-Nation property of complete Boolean algebras

The following results are proved:

(a) In a model obtained by adding ₂ Cohen reals, there is always a c.c.c. complete Boolean algebra without the weak Freese-Nation property. (b) Modulo the consistency strength of a supercompact cardinal, the existence of a c.c.c. complete Boolean algebra without the weak Freese-Nation property is consistent with GCH. (c) If a weak form of □_μ and cof([μ]^₀,)=μ⁺ hold for each μ>cf(μ)=ω, then the weak Freese-Nation property of is equivalent to the weak Freese-Nation property of any of or for uncountable κ. (d) Modulo the consistency of (_ω+1,_ω)(₁,₀), it is consistent with GCH that does not have the weak Freese-Nation property and hence the assertion in (c) does not hold, and also that adding _ω Cohen reals destroys the weak Freese-Nation property of .

These results solve all of the problems except Problem 1 in S. Fuchino, L. Soukup, Fundament. Math. 154 (1997) 159–176, and some other problems posed by Geschke.     

No-hole L(2,1)-colorings

An L(2,1)-coloring of a graph G is a coloring of G's vertices with integers in {0,1,…,k} so that adjacent vertices’ colors differ by at least two and colors of distance-two vertices differ. We refer to an L(2,1)-coloring as a coloring. The span λ(G) of G is the smallest k for which G has a coloring, a span coloring is a coloring whose greatest color is λ(G), and the hole index ρ(G) of G is the minimum number of colors in {0,1,…,λ(G)} not used in a span coloring. We say that G is full-colorable if ρ(G)=0. More generally, a coloring of G is a no-hole coloring if it uses all colors between 0 and its maximum color. Both colorings and no-hole colorings were motivated by channel assignment problems. We define the no-hole span μ(G) of G as ∞ if G has no no-hole coloring; otherwise μ(G) is the minimum k for which G has a no-hole coloring using colors in {0,1,…,k}.

Let n denote the number of vertices of G, and let Δ be the maximum degree of vertices of G. Prior work shows that all non-star trees with Δ3 are full-colorable, all graphs G with n=λ(G)+1 are full-colorable, μ(G)λ(G)+ρ(G) if G is not full-colorable and nλ(G)+2, and G has a no-hole coloring if and only if nλ(G)+1. We prove two extremal results for colorings. First, for every m1 there is a G with ρ(G)=m and μ(G)=λ(G)+m. Second, for every m2 there is a connected G with λ(G)=2m, n=λ(G)+2 and ρ(G)=m.     

Multifractal analysis of the occupation measures of a kind of stochastic processes

Let {X(t), 0t1} be a stochastic process whose range is a random Cantor-like set depending on an -sequence (0<<1) and μ is the occupation measure of X(t). In this paper we examine the multifractal structure of μ and obtain the fractal dimensions of the sets of points of where the local dimension of μ is different from . It is interesting to notice that the final results of this paper are identical to those for the occupation measure of a stable subordinator with index , yet the stochastic process under consideration in this work is not even a Markov process.     

On the investigation of oscillations of quasilinear systems with almost-periodic coefficients : PMM vol.43, no. 6, 1979, pp. 980–991

A method is developed for investigating the oscillations of systems with almost-periodic coefficients, based on Kamenkov's ideas [1] on the construction of stationary solutions of systems with periodic coefficients and on the separation of motions. In contrast to [1] it is assumed that under the vanishing of a small parameter μ the system's characteristic equation has, besides n pairs of pure imaginary roots, m zero roots and h roots with negative real parts. Non-resonance and resonance cases are considered. Conditions are obtained for the existence of stationary solutions with respect to terms of first order in the small parameter. An example is presented.     

Reconstruction of infinite locally finite connected graphs

Let G be an infinite locally finite connected graph. We study the reconstructibility of G in relation to the structure of its end set . We prove that an infinite locally finite connected graph G is reconstructible if there exists a finite family (Ω_i)_0i (n2) of pairwise finitely separable subsets of such that, for all x,y,x′,y′V(G) and every isomorphism f of G−{x,y} onto G−{x′,y′} there is a permutation π of {0,…,n−1} such that for 0i<n. From this theorem we deduce, as particular consequences, that G is reconstructible if it satisfies one of the following properties: (i) G contains no end-respecting subdivision of the dyadic tree and has at least two ends of maximal order; (ii) the set of thick ends or the one of thin ends of G is finite and of cardinality greater than one. We also prove that if almost all vertices of G are cutvertices, then G is reconstructible if it contains a free end or if it has at least a vertex which is not a cutvertex.     

Shelah's pcf theory and its applications

This is a survey paper giving a self-contained account of Shelah's theory of the pcf function pcf(a)={cf(Πa/D, <_D):D is an ultrafilter on a}, where a is a set of regular cardinals such that |a|a). We also give several applications of the theory to cardinal arithmetic, the existence of Jonsson algebras, and partition calculus.     

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.     

A combinatorial decomposition of acyclic simplicial complexes

It is proved that if Δ is a finite acyclic simplicial complex, then there is a subcomplex Δ′ Δ and a bijection η: Δ′ → Δ − Δ′ such that F η(F) and |η(F)−F|=1 for all F Δ′. This improves an earlier result of Kalai. An immediate corollary is a characterization (first due to Kalai) of the f-vector of an acyclic simplicial complex. Several generalizations, some proved and some conjectured, are discussed.     

Analytic solutions of an iterative functional differential equation

This paper is concerned with a functional differential equation x^′(z)=1/x(az+bx(z)), where a, b are two complex numbers. By constructing a convergent power series solution y(z) of a auxiliary equation of the form b²y^′(z)=(y(μ²z)−ay(μz))(μy^′(μz)−ay^′(z)), analytic solutions of the form for the original differential equation are obtained.     

On the Lagrangian form of the variational equations of Lagrangian dynamical systems

An extremal principle for obtaining the variational equations of a Lagrangian system is reviewed and formalized. Formalization is accomplished by relating the new Lagrangian function γ needed in such scheme to a prolongation of the original Lagrangian L. This formalization may be regarded as a necessary step before using the approach for stablishing nonintegrability of dynamical systems, or before applying it to analyse chaos-producing perturbations of integrable Lagrangian systems. The configuration manifold in which γ is defined is the double tangent bundle T(TQ) of the original configuration manifold Q modulo a flip mapping in such manifold. Our main result establishes that both the Euler–Lagrange equations and the corresponding variational equations of the original system can be viewed as the Lagrangian vector field associated with the composition of the first prolongation of the original Lagrangian with a flip mapping. Some applications of the approach to chaos and integrability issues are discussed.     

Coupling and harmonic functions in the case of continuous time Markov processes

Consider two transient Markov processes (X^v_t)_tεR·, (X^μ_t)_tεR· with the same transition semigroup and initial distributions v and μ. The probability spaces supporting the processes each are also assumed to support an exponentially distributed random variable independent of the process.

We show that there exist (randomized) stopping times S for (X^v_t), T for (X^μ_t) with common final distribution, L(X^v_S|S < ∞) = L(X^μ_T|T < ∞), and the property that for t < S, resp. t < T, the processes move in disjoint portions of the state space. For such a coupling (S, T) it is shown

where denotes the bounded harmonic functions of the Markov transition semigroup. Extensions, consequences and applications of this result are discussed.     

On the λY calculus

The λY calculus is the simply typed λ calculus augmented with the fixed point operators. We show three results about λY: (a) the word problem is undecidable, (b) weak normalisability is decidable, and (c) higher type fixed point operators are not definable from fixed point operators at smaller types.