On some algebras diagonalized by M-bases of ℓ2

We study reflexive algebrasA whose invariant lattices LatA are generated by M-bases of ². Examples are given whereA differs from ( being the rank one subalgebra ofA), and where together with the identity I is not strongly dense inA. For M-bases in a special class, we characterize the cases when they are strong, and also when the identity I is the ultraweak limit of a sequence of contractions in . We show that this holds provided that I is approximable by compact operators inA at any two points of ². We show that the spaceA+^* (where is the annihilator of ) is ultraweakly dense in (²), and characterize the M-bases in this class for which the sum is direct. We give a class of automorphisms ofA which are strongly continuous but not spatial.     

Generation of Uniformly Closed Algebras of Functions

For a linear sublattice of C(X), the set of all real continuous functions on the completely regular space X, we denote by A() the smallest uniformly closed and inverse-closed subalgebra of C(X) that contains . In this paper we study different methods to generate A() from . For that, we introduce some families of functions which are defined in terms of suprema or sums of certain countably many functions in . And we prove that A() is the uniform closure of each of these families. We obtain, in particular, a generalization of a known result about the generation of A() when is a uniformly closed linear sublattice of bounded functions.     

Maximal Partial Spreads and Flocks

Denote by a flock of a quadratic cone of PG(3,q) by S() the spread of PG(3,q) associated with and by l the common line of the base reguli. Suppose that there are two lines not transversal to a base regulus which share the same lines of S() Then we prove that is either linear or a Kantor-Knuth semifield flock. Using this property we can extend the result of J3 on derivable flocks proving that, if a set of q + 1 lines of S() defines a derivable net different from a base regulus-net, then is either linear or a Kantor-Knuth semifield flock. Moreover if l is not a component of the derivable net, then is linear.     

Flowchart machines

Let denote a conventional flowchart. Any algorithm can be represented by a flowchart. If action nodes in call then is a recursive flowchart. We show how to decompose arbitrary non-self-modifying programs into structure and atomic parts. We specifically give the synthesis procedure for a controller . can serve as the only sequencer in an execution of . If is recursive then is a pushdown machine, otherwise is a finite state machine. The next-state functionf and the output functiong of represent respectively all of the structure-, i.e. the programmer-oriented-, and all of the atomic-, i.e. the data-oriented-, parts of .f defines the flow or pattern of computations andg the actual transformations or operations on data. Thus we construct and analyze programs by constructing and analyzing their sequencers .     

On spaces of Baire I functions over K-analytic spaces

Suppose that is a relatively countably compact subset of B₁(X), the space of Baire I functions over a K-analytic space X equipped with the pointwise convergence topology. It is proved that (1) the closure of is a strongly countably compact Frechét-Urysohn space; (2) if is ₁ -compact, is a bicompactum; (3) if X is a paracompact space, the closure of is a bicompactum.Translated from Matematicheskie Zametki, Vol. 52, No. 3, pp. 108–116, September, 1992.     

A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality

LetL be a set ofs nonnegative integers and a family of subsets of ann-element setX. Suppose that for any two distinct membersA,B we have¦A B¦ L. Assuming in addition that, is uniform, i.e. each member of has the same cardinality, a celebrated theorem of D. K. Ray-Chaudhuri and R. M. Wilson asserts that ¦¦ P. Frankl and R. M. Wilson proved that without the uniformity assumption, we have.We give a short proof of this latter result.     

An integral representation for decomposable measures of measurable functions

Summary We start with a measurem on a measurable space (,A), decomposable with respect to an Archimedeant-conorm on a real interval [0,M], which generalizes an additive measure. Using the integral introduced by the second author, a Radon-Nikodym type theorem, needed in what follows, is given.The integral naturally leads to a -decomposable measurem on the space of all measurable functions from to [0, 1]. The main result of the present paper is the converse of this, namely that, under natural conditions, any -decomposable measurem on can be represented as an integral of a certain Markov-kernelK. We extend this representation to measures on which have values in a set of distribution functions.These results generalize the work done by the first author in the case of additive measures.     

On the kernel of intersecting families

Let be at-wises-intersecting family, i.e.,|F ₁ ... F _t | s holds for everyt members of. Then there exists a setY such that|F ₁ ... F _t Y| s still holds for everyF ₁,...,F _t . Here exponential lower and upper bounds are proven for the possible sizes ofY. This work was done while the authors visited Bell Communication Research, NJ 07960, and AT&T Bell Laboratories, Murray Hill, NJ 07974, USA, respectively.Research supported in part by Allon Fellowship and by Bat Sheva de Rothschild Foundation.     

Superficie cubiche di\mathbb{A}_\mathbb{C}^3 a curve sottoinsieme intersezione completa

Summary In this paper we classify the algebraic cubic surfaces of the affine space is the complex field, whose algebraic curves are set-theoretic complete intersections of ; in other words surfaces such that every prime ideal of height 1in the coordinate ring [] of is the radical of a principal ideal; if is non singular in codimension 1this means that [] is semifactorial. We give the equations of such surfaces within linear isomorphisms of providing also methods by which one can construct the equations of the surfaces cutting on its curves as set-theoretic complete intersections. Moreover for each of these surfaces we determine the minimum positive number such that every algebraic curve of with multiplicity of intersection , is complete intersection of itself with another surface § 8where the results are summarized). We tackle also the problem of such a classification over algebraically closed fields k different from .

---

---

Lavoro eseguito nell'ambito del G.N.S.A.G.A. del C.N.R.     

On the uniqueness of a local martingale with a given absolute value

Summary D. Gilat has shown that any non-negative submartingale (X, .) is equal in law to the absolute value of a martingale (M, .). This result may be strenthened so that the pairs (X,.) and (¦M¦,.) are synonomous. In this paper the question of uniqueness of M is considered. Conditions on a local martingale (M, .) are found that lead to an explicit formula for the finite-dimensional distributions of M in terms of the Doob-Meyer decomposition of the local martingale X. In many cases of interest the conditions on M are unnecessary. For example, if X is the pth power of an Itô integral it is shown that (M) is unique if p> 1 but not in general if p=1.     

Rate of convergence in the central limit theorem for empirical processes

Let _n and be an empirical process and a generalized Brownian bridge, respectively, indexed by a class of real measurable functions. From the central limit theorem for empirical processes it follows that for allr0. In this paper, assuming the class to be countably determined, under certain conditions we obtain an estimate for some constantC. Vapnik-ervonenkis class and the indicators of lower left orthants provide examples of classes considered here.     

An intersection property for starshaped sets in the plane

Let be a family of compact starshaped sets in the plane. If every three and every two members of have a union which is connected and simply connected, then {F:F in } is simply connected and nonempty. Of course, if every three and every two members of have a starshaped union, the same result holds.Supported in part by NSF grants DMS-8705336, DMS-8908717 and by a Senior Faculty Summer Research Fellowship, Research Council, University of Oklahoma.     

Some best possible bounds concerning the traces of finite sets II

LetX be ann-element set and be a family of its subsets. Consider the family _x = {F – {x} : F } for a givenx X. We write(m, n) (m – k, n – 1), when for all with || m, there exists an elementx ofX such that| _x| m – k. We show that (m, n) (m – 10,n – 1) for allm 5n and (m, n) (m – 13,n – 1) for allm 29n/5.     

A topological obstruction to the geodesibility of a foliation of odd dimension

Let M be a compact Riemannian manifold of dimension n, and let be a smooth foliation on M. A topological obstruction is obtained, similar to results of R. Bott and J. Pasternack, to the existence of a metric on M for which is totally geodesic. In this case, necessarily that portion of the Pontryagin algebra of the subbundle must vanish in degree n if is odd-dimensional. Using the same methods simple proofs of the theorems of Bott and Pasternack are given.     

D λ -cycles in 3-cyclable graphs

Letk and be positive integers, andG a 2-connected graph of ordern with minimum degree and independence number. A cycleC ofG is called aD -cycle if every component ofG – V(C) has order smaller than. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that if k 2, G isk-connected and every connected subgraphH ofG of order has at leastn +k ² + 1/k + 1 – vertices outsideH adjacent to at least one vertex ofH, thenG contains aD -cycle. Here it is conjectured that k-connected can be replaced by k-cyclable, and this is proved fork = 3. As a consequence it is shown that ifn 4 – 6, or ifG is triangle-free andn 8 – 10, thenG contains aD ₃-cycle orG , where denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn 4 – 6 and – 1, thenG is hamiltonian orG . The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are close to claw-free.     

Smoothing the function of the multiple-shooting equation

The multiple-shooting method for the solution of boundary-value problems is a modified Newton method for the solution of an equation(x) = 0, where is a special function which is differentiable in general, but may occasionally have discontinuities at some points which have to be passed during the iteration process. This is the case especially in optimal control problems and it is a severe handicap for the convergence of the Newton method which can be essentially reduced when replacing by a series of smooth functions _i dependent on the iteration process.     

Happy families and completely Ramsey sets

Summary We use games of Kastanas to obtain a new characterization of the classC of all sets that are completely Ramsey with respect to a given happy family . We then combine this with ideas of Plewik to give a uniform proof of various results of Ellentuck, Louveau, Mathias and Milliken concerning the extent ofC . We also study some cardinals that can be associated with the ideal of nowhere -Ramsey sets.Part of this research was done while the author was visiting I.V.I.C. in Caracas in September 1989. The author would like to thank Carlos Di Prisco for his hospitality.     

A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets

Given any family of valid inequalities for the asymmetric traveling salesman polytopeP(G) defined on the complete digraphG, we show that all members of are facet defining if the primitive members of (usually a small subclass) are. Based on this result we then introduce a general procedure for identifying new classes of facet inducing inequalities forP(G) by lifting inequalities that are facet inducing forP(G), whereG is some induced subgraph ofG. Unlike traditional lifting, where the lifted coefficients are calculated one by one and their value depends on the lifting sequence, our lifting procedure replaces nodes ofG with cliques ofG and uses closed form expressions for calculating the coefficients of the new arcs, which are sequence-independent. We also introduce a new class of facet inducing inequalities, the class of SD (source-destination) inequalities, which subsumes as special cases most known families of facet defining inequalities.Research supported by Grant DDM-8901495 of the National Science Foundation and Contract N00014-85-K-0198 of the U.S. Office of Naval Research.Research supported by M.U.R.S.T., Italy.     

A solution to one of Kano's conjectures concerningk-th maximal spanning trees

Let (G) be the collection of all spanning trees of a connected and weighted graphG, andF ₁,F ₂, ...,F _m the partition of (G) such thatF _n the set ofi-th maximal spanning trees ofG. Kano^[1] conjectured that for anyA F ₁ and every integerk, 1km, there existsT F _k such that |T/A|k–1. This paper gives the conjecture a very simple proof, and related results.     

On (k,n)-blocking sets which can be obtained as a union of conics

A family of conics in PG(2,q) is called saturated if any line LPG(2,q) is incident with at least one conic of the family. Then, if <(q+1)/2, the support of is a (k,n)-blocking set. It is shown that in this way one can get blocking sets whose character n is small compared to q; it is also shown that cannot be taken independent of q, but must necessarily increase as q does.