On dominant operators

This paper is devoted to the study of dominant operators with an emphasis on their spectral properties. In particular the equation (T–)f() x (T a dominant or hyponormal operator on the Hilbert space ,x andf a function from the open setU to ) is investigated in an effort to discover necessary and/or sufficient conditions for the analyticity off.Supported in part by the National Science Foundation.     

Resolvable Mendelsohn designs with block size 4

Summary Letv andK be positive integers. A (v, k, 1)-Mendelsohn design (briefly (v, k, 1)-MD) is a pair (X,B) whereX is av-set (ofpoints) andB is a collection of cyclically orderedk-subsets ofX (calledblocks) such that every ordered pair of points ofX are consecutive in exactly one block ofB. A necessary condition for the existence of a (v, k, 1)-MD isv(v–1) 0 (modk). If the blocks of a (v, k, 1)-MD can be partitioned into parallel classes each containingv/k blocks wherev ) (modk) or (v – 1)/k blocks wherev 1 (modk), then the design is calledresolvable and denoted briefly by (v, k, 1)-RMD. It is known that a (v, 3,1)-RMD exists if and only ifv 0 or 1 (mod 3) andv 6. In this paper, it is shown that the necessary condition for the existence of a (v, 4, 1)-RMD, namelyv 0 or 1 (mod 4), is also sufficient, except forv = 4 and possibly exceptingv = 12. These constructions are equivalent to a resolvable decomposition of the complete symmetric directed graphK _v ^* onv vertices into 4-circuits.Research supported by the Natural Sciences and Engineering Research Council of Canada under Grant A-5320.     

Construction of orthogonal starters and corollaries

A method is proposed for constructing a system of (v–1)/2 pairwise disjoint orthogonal starters of order v for v6k+17 (mod 12)pn²+n+1/t such that the number 3 is one of the primitive roots of the Galois field of prime order p (k is prime, k 2, and n and t are positive integers). The starters occurring in this system satisfy certain additional conditions. The construction of a series of combinatorial structures, including some not previously known, is a consequence of this result.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 44, No. 5, pp. 654–662, May, 1992.     

ExplicitN-polynomials of 2-power degree over finite fields,I

For an odd prime powerq the infinite field GF(q ² )= _n0 GF (q ²ⁿ ) is explicitly presented by a sequence (f _n)₁ ofN-polynomials. This means that, for a suitably chosen initial polynomialf ₁, the defining polynomialsf _nGF(q)[x] of degrees2 ⁿ are constructed by iteration of the transformation of variablexx+1/x and have linearly independent roots over GF(q). In addition, the sequences are trace-compatible in the sense that the relative traces map the corresponding roots onto each other. In this first paper the caseq1 (mod 4) is considered and the caseq3 (mod 4) will be dealt with in a second paper. This specific construction solves a problem raised by A. Scheerhorn in [11].     

Boolean Functions with Five Controllable Cryptographic Properties

The strict avalanche criterion (SAC) was introduced by Webster and Tavares [10] in a study of cryptographic design criteria. This is an indicator for local property. In order to improve the global analysis of cryptographically strong functions, Zhang and Zheng [11] introduced the global avalanche characteristics (GAC). The sum-of-squares indicator related to the GAC is defined as _f = _{v f} ²(v), where _f (v)=x (–1) ^f (x)f(x v). In this paper, we give a few methods to construct Boolean functions controlling five good cryptographic properties, namely balancedness, good local and GAC, high nonlinearity and high algebraic degree. We improve upon the results of Stanica [8] and Zhang and Zheng [11].     

On the entropic regularization method for solving min-max problems with applications

Consider a min-max problem in the form of min _xX max_1im {f _i (x)}. It is well-known that the non-differentiability of the max functionF(x) max_1im {f _i (x)} presents difficulty in finding an optimal solution. An entropic regularization procedure provides a smooth approximationF _p(x) that uniformly converges toF(x) overX with a difference bounded by ln(m)/p, forp > 0. In this way, withp being sufficiently large, minimizing the smooth functionF _p(x) overX provides a very accurate solution to the min-max problem. The same procedure can be applied to solve systems of inequalities, linear programming problems, and constrained min-max problems.This research work was supported in part by the 1995 NCSC-Cray Research Grant and the National Textile Center Research Grant S95-2.     

P 3-factorization of complete multipartite graphs

In this paper, it is shown that a necessary and sufficient condition for the existence of aP ₃-factorization ofK _m ⁿ is (i)mn 0(mod 3) and (ii) (m – 1)n 0(mod 4).     

Cohomological invariants and R-triviality of adjoint classical groups

Using a cohomological obstruction, we construct examples of absolutely simple adjoint classical groups of type ²A_n with n3mod4, C_n or ¹D_n with n0mod4, which are not R-trivial hence not stably rational.Mathematics Subject Classification (2000): 11E57, 20G15in final form: 13 June 2003     

Taking pth Roots Modulo Polynomials over Finite Fields

In this contribution we show how to find y(x) in the polynomial equation y(x) ^p t(x) mod f(x), where t(x), y(x) and f(x) are polynomials over the field GF(p ^m). The solution of such equations are thought for in many cases, e.g., for p = 2 it is a step in the so-called Patterson Algorithm for decoding binary Goppa codes.     

C k -factorization of complete bipartite graphs

In this paper, it is shown that a necessary and sufficient condition for the existence of aC _k-factorization ofK _m,n is (i)m = n 0 (mod 2), (ii)k 0 (mod 2),k 4 and (iii) 2n 0 (modk) with precisely one exception, namely m =n = k = 6.     

The addition formula for theta functions

Summary In this paper we solve the functional equationx(u + v)(u – v) = f ₁(u)g₁(v) + f₂(u)g₂(v) under the assumption thatx, , f ₁, f₂, g₁, g₂ are complex-valued functions onR ⁿ ,n N arbitrary, and 0 and 0 are continuous. Our main result shows that, apart from degeneracy and some obvious modifications, theta functions of one complex variable are the only continuous solutions of this functional equation.     

A class of self-orthogonal 2-sequencings

Let 2K _ndenote the complete multigraph on n vertices in which each edge has multiplicity two. If 2K _ncan be partitioned into Hamiltonian paths such that any two distinct paths have exactly one edge in common, write 2K _n P _n. This paper considerably expands the set of known positive integers n such that 2K _n P _n. The solutions found have application to other similar problems. The basic idea is to consider an algebraic formulation of the problem in terms of 2-sequencings (terraces) with additional properties. Construction of these 2-sequencings gives a special type of solution for which very few examples have been known. The constructions detailed here hold eventually for certain classes of prime powers. For example, it is shown that there is a positive integer N such that if N < p ⁿ 5 (mod 8) and 3 is not a fourth power residue of GF[p ⁿ], then the additive group of GF[p ⁿ] has a 2-sequencing of the required type—a self-orthogonal 2-sequencing. Some of the solutions admit a 2-coloring which is important for applications. The method of construction appears to be much better than the theoretical bounds that are obtained. The general bounds are found by means of a character sum argument.     

Existence of 1-Rotational <Emphasis Type="Italic">k</Emphasis>-Cycle Systems of the Complete Graph

We explicitly solve the existence problem for 1-rotational k-cycle systems of the complete graph K_v with v1 or k (mod 2k). For v1 (mod 2k) we have existence if and only if k is an odd composite number. For any odd k and vk (mod 2k), (except k3 and v15, 21 (mod 24)) a 1-rotational k-cycle system of K_v exists.Final version received: June 18, 2003     

Non-symmetric 2-designs modulo 2

Necessary conditions are obtained for the existence of a 2 – (v, k, ) design, for which the block intersection sizess ₁,s ₂, ...,s _n satisfys ₁ s ₂ ... s _n s (mod 2 ^e ), wheree is odd. These conditions are obtained by combining restrictions on the Smith Normal Form of the incidence matrix of the design with some well known properties of self-orthogonal binary codes with all weights divisible by 4.Research done at AT&T Bell Laboratories.     

Formulas for best extrapolation

We considern-point Lagrange-Hermite extrapolation forf(x), x>1, based uponf(x _i ),i=1(1)n, –1x _i 1, including non-distinct pointsx _i in confluent formulas involving derivatives. The problem is to find the pointsx _i that minimize the factor in the remainderP _n (x)f ⁽ⁿ⁾()/n, –1<<x subject to the condition|P _n (x)|M, –1x1,2^–n+1M2 ⁿ . The solution is significant only when a single set of pointsx _i suffices for everyx>1. The problem is here completely solved forn=1(1)4. Forn>4 it may be conjectured that there is a single minimal , 0 rn, whererr(M) is a non-decreasing function ofM, P _n (–1)=(–1) ⁿ M, and for 0rn–2, thej-th extremumP _n (x _{e, j} )=(–1) ^n–j M,j=1(1)n–r–1 (except forM=M _r ,r=1(1)n–1, whenj=1(1)n–r).     

Solution of one problem of nonlinear adsorption kinetics by the method of lines

The method of lines is constructed and proved for numerical solution of a nonlinear initial-boundary-value problem of parabolic type describing the adsorption of a substance from an aqueous solution of bounded volume by a spherical adsorbent. The method is developed under natural assumptions on the smoothness of the solution of the original problem. The rate of convergence of the method depends on the smoothness of the initial function and is of order O(h) if v₀(x) 0, O(h^1/2) if v₀(x) C¹[0, 1], and 0(|v ₀(x)|W ₂ ¹ (O,h)).Translated from Vychislitel'naya i Prikladnaya Matematika, No. 63, pp. 24–30, 1987.     

Eine Anzahlformel von Zahlen modulon

n. The minimum length of sequences (x _i ) of integers contained in exactlyk residue classes modn is determined with respect tox ₁+...+x _n 0 modn.     

A relation between Chung's and Strassen's laws of the iterated logarithm

Summary Let W(t) be a standard Wiener process and let f(x) be a function from the compact class in Strassen's law of the iterated logarithm. We investigate the lim inf behavior of the variable sup ¦W(xT)(2T loglog T)^–1/2–f(x)¦, 0x1 suitably normalized as T.This extends Chung's result valid for f(x)0, stating that lim inf.[ sup ¦(2T loglogT)^–1/2 W(xT)¦(loglog T)^–1]=/4 a.s. T 0x1     

A Strongly Semismooth Integral Function and Its Application

As shown by an example, the integral function f : ⁿ , defined by f(x) = _a ^b[B(x, t)]₊ g(t) dt, may not be a strongly semismooth function, even if g(t) 1 and B is a quadratic polynomial with respect to t and infinitely many times smooth with respect to x. We show that f is a strongly semismooth function if g is continuous and B is affine with respect to t and strongly semismooth with respect to x, i.e., B(x, t) = u(x)t + v(x), where u and v are two strongly semismooth functions in ⁿ . We also show that f is not a piecewise smooth function if u and v are two linearly independent linear functions, g is continuous and g 0 in [a, b], and n 2. We apply the first result to the edge convex minimum norm network interpolation problem, which is a two-dimensional interpolation problem.     

Matrix summability and a generalized Gibbs phenomenon

Letf be a real-valued function sequence {f _k } that converges to on a deleted neighborhoodD of . If there is a subsequence {f _k(j) } and a number sequencex such that lim _j x _j = and either lim _j f _k(j) (x _j )>lim sup _x (x) or lim _j f _k(j) (x _j ) x (x), thenf is said to display theGibbs phenomenon at . IfA is a (real) summability matrix, thenAf is a function sequence given by(Af) _n (x)= _k=0 a _n,k f _k (x). IfAf displays the Gibbs phenomenon wheneverf does, thenA is said to beGP-preserving. By replacingf _k (x) withf _k (x _j )F _k,j , the Gibbs phenomenon is viewed as a property of the matrixF, andGP-preserving matrices are determined by properties of the matrix productAF. The general results give explicit conditions on the entries {a _n,k } that are necessary and/or sufficient forA to beGP-preserving. For example: if(x)0 thenF displaysGP iff lim _k,j F _k,j 0, and ifA isGP-preserving then lim _n,k A _n,k 0. IfA is a triangular matrix that is stronger than convergence, thenA is notGP-preserving. The general results are used to study the preservation of the Gibbs phenomenon by matrix methods of Nörlund, Hausdorff, and others.