Categories of algebraic sets

The category of algebraic sets is defined in a straightforward way for any algebraic theory . It is a concrete, complete and cocomplete category dually equivalent to a full reflective subcategory of the category of -algebras. For the algebraic theory of commutative algebras over a field K, we get the algebraic sets over K.     

On graphical partitions

An integer partition {₁,₂,..., _v } is said to be graphical if there exists a graph with degree sequence _i . We give some results corcerning the problem of deciding whether or not almost all partitions of even integer are non-graphical. We also give asymptotic estimates for the number of partitions with given rank.     

A survey of pseudo (v,k, λ)-designs

This work is an attempt to give a complete survey of all known results about pseudo (v, k, )-designs. In doing this, the author hopes to bring more attention to his conjecture given in Section 6; an affirmative answer to this conjecture would settle completely the existence and construction problem for a pseudo (v, k, )-design in terms of the existence of an appropriate (v, k, )-design.     

Some Krasnosel'skii numbers for finitely starlike sets in the plane

Let S be a subset of the plane. In case (int cl S) S = , then S is finitely starlike if and only if every 4 points of S see via S a common point. In case (int cl S) S has at most countably many components, each a singleton set, then S is finitely starlike if and only if every 5 points of S see via S a common point. Each of the numbers 4 and 5 is best possible. Examples show that these results fail without suitable restrictions on (int cl S) S. Moreover, a final example shows that if a general Krasnosel'skii number . exists to characterize finitely starlike sets in the plane, then > 9.     

A sandwich theorem and Hyers—Ulam stability of affine functions

It is shown that two real functionsf andg, defined on a real intervalI, satisfy the inequalitiesf(x + (1 – )y) g(x) + (1 – )g(y) andg(x + (1 – )y) f(x) + (1 – )f(y) for allx, y I and [0, 1], iff there exists an affine functionh: I such thatf h g. As a consequence we obtain a stability result of Hyers—Ulam type for affine functions.     

Parabolische Kollineationen,die eine ebene konvexe Menge invariant lassen

Collineations ₁, ₂ of PG(2, ) leaving invariant a compact convex setK ² are called parabolic if |K Fix _i|=1. Conditions are stated under which the existence of ₁, ₂ imply that K is an ellipse.

Herrn Helmut R. Salzmann zum 65. Geburtstag gewidmet     

On the dimensions of automorphism groups of eight-dimensional ternary fields,II

LetT be an eight-dimensional, connected, locally compact ternary field and let denote a connected closed Lie subgroup of its automorphism group which is taken with the compact-open topology. It is proved that if the ternary fixed fieldF of is connected, then is either isomorphic to one of the compact Lie groupsG ₂ or SU₃, or the (covering) dimension of is at most 7.     

A conditional dilatation equation

Summary The following theorem holds true. Theorem. Let X be a normed real vector space of dimension 3 and let k > 0 be a fixed real number. Suppose that f: X X and g: X × X are functions satisfying x – y = k f(x) – f(y) = g(x, y)(x – y) for all x, y X. Then there exist elements and t X such that f(x) = x + t for all x X and such that g(x, y) = for all x, y X with x – y = k.     

Regressions and monotone chains II: The poset of integer intervals

A regressive function (also called a regression or contractive mapping) on a partial order P is a function mapping P to itself such that (x)x. A monotone k-chain for is a k-chain on which is order-preserving; i.e., a chain x ₁<...ksuch that (x ₁)...(x_k). Let P _nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P _nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x ^t(x,j–1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) < f(K) <t( + _k, k) , where _k 0 as k. Alternatively, the largest k such that every regression on P _nis guaranteed to have a monotone k-chain lies between lg^*(n) and lg^*(n)–2, inclusive, where lg^*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element.     

On the singular graph and the Weyr characteristic of anM-matrix

LetA be anM-matrix in standard lower block triangular form, with diagonal blocksA _ii irreducible. LetS be the set of indices such that the diagonal blockA is singular. We define the singular graph ofA to be the setS with partial order defined by > if there exists a chain of non-zero blocksA _i, A_ij, , A_l.Let ₁ be the set of maximal elements ofS, and define thep-th level _p ,p = 2, 3, , inductively as the set of maximal elements ofS \( _{1 p-1}). Denote by _p the number of elements in _p . The Weyr characteristic (associated with 0) ofA is defined to be (A) = ( ₁, ₂,, _h ), where ₁ + + _p = dim KerA ^p ,p = 1, 2, , and _h > 0, _h+1 = 0.Using a special type of basis, called anS-basis, for the generalized eigenspaceE(A) of 0 ofA, we associate a matrixD withA. We show that(A) = ( ₁, , _h) if and only if certain submatricesD _p,p+1 ,p = 1, , h – 1, ofD have full column rank. This condition is also necessary and sufficient forE(A) to have a basis consisting of non-negative vectors, which is a Jordan basis for –A. We also consider a given finite partially ordered setS, and we find a necessary and sufficient condition that allM-matricesA with singular graphS have(A) = ( ₁, , _h). This condition is satisfied ifS is a rooted forest.The work of the second-named author was partly supported by the National Science Foundation, under grant MPS-08618 A02.     

The cross-section body, plane sections of convex bodies and approximation of convex bodies, I

For a convex body K ^d we investigate three associated bodies, its intersection body IK (for 0int K), cross-section body CK, and projection body IIK, which satisfy IKCKIIK. Conversely we prove CKconst₁(d)I(K–x) for some xint K, and IIKconst₂ (d)CK, for certain constants, the first constant being sharp. We estimate the maximal k-volume of sections of 1/2(K+(-K)) with k-planes parallel to a fixed k-plane by the analogous quantity for K; our inequality is, if only k is fixed, sharp. For L ^d a convex body, we take n random segments in L, and consider their Minkowski average D. We prove that, for V(L) fixed, the supremum of V(D) (with also nN arbitrary) is minimal for L an ellipsoid. This result implies the Petty projection inequality about max V((IIM)*), for M ^d a convex body, with V(M) fixed. We compare the volumes of projections of convex bodies and the volumes of the projections of their sections, and, dually, the volumes of sections of convex bodies and the volumes of sections of their circumscribed cylinders. For fixed n, the pth moments of V(D) (1p<) also are minimized, for V(L) fixed, by the ellipsoids. For k=2, the supremum (nN arbitrary) and the pth moment (n fixed) of V(D) are maximized for example by triangles, and, for L centrally symmetric, for example by parallelograms. Last we discuss some examples for cross-section bodies.Research (partially) supported by Hungarian National Foundation for Scientific Research, Grant No. 41.     

Twisted derivations and distinct sets of lines that cover the same pairs of points

A partial projective plane of ordern consists of lines andn ² +n + 1 points such that every line hasn+1 points and distinct lines meet in a unique point. Suppose that two essentially different partial projective planes and of ordern, n a perfect square, that are defined on the same set of points cover the same pairs of points. For sufficiently largen we show that this implies that and have at leastn(n+1) lines. This bound is sharp and there exist essentially two different types of examples meeting the bound.As an application, we can show that derived planes provide an example for a pair of projective planes of square order with as much structure as possible in common, that is, as many lines as possible in common. Furthermore, we present a new method (twisted derivations) to obtain planes from one another by replacing the same number of lines as in a derivation.     

Approximation under an arc length constraint

Let f C[a, b]. LetP be a subset ofC[a, b], L b – a be a given real number. We say thatp P is a best approximation tof fromP, with arc length constraintL, ifA[p] _b ^a [1 + (p(x)) ²]dx L andp – f q – f for allq P withA[q] L. represents an arbitrary norm onC[a, b]. The constraintA[p] L might be interpreted physically as a materials constraint.In this paper we consider the questions of existence, uniqueness and characterization of constrained best approximations. In addition a bound, independent of degree, is found for the arc length of a best unconstrained Chebyshev polynomial approximation.The work of L. L. Keener is supported by the National Research Council of Canada Grant A8755.     

Weight functions on the Kneser graph and the solution of an intersection problem of Sali

LetX, Y be finite sets and suppose thatF is a collection of pairs of sets (F, G),FX,GY satisfying |FF|s, |GG|t and |FF|+|GG|s+t+1 for all (F, G),F, GF. Extending a result of Sali, we determine the maximum ofF.     

‘Outside’ as a primitive notion in constructive projective geometry

In intuitionistic (or constructive) geometry there are positive counterparts, apart and outside, of the relations = and incident. In this paper it is shown that the relation outside suffices to define incident, apart and equality. The equivalence of the new system with Heyting's system is shown and as a simple corollary one obtains duality for intuitionistic projective geometry.     

Convergence of simultaneous Padé approximants to two dilogarithms

. .     

Reconstructing polygons from x-rays

We present strategies for interactively reconstructing polygons from carefully chosen x-ray probes, generalizing previous results for convex polygons to a significantly larger class of objects. In particular, we show that n+h+2 parallel x-ray probes are sufficient to determine an n-gon P with h vertices on its convex hull, provided no three vertices of P are collinear. If given an upper bound n on the number of vertices of P, then 2n+2 parallel probes or 3n origin probes suffice. Further, we show that lg n–2 probes are necessary. Finally, we present verification strategies for arbitrary polygons. Interactive probing strategies have the potential to minimize radiation exposure in medical imaging.     

On flag-transitive affine planes of orderq 3

Let be a translation plane of orderq ³,q an odd prime power, whose kern GF(q). Letl be the line at infinity of . LetG be a solvable collineation group of in the linear translation complement, which acts transitively onl , and letH be a maximal normal cyclic subgroup ofG. Then the restriction ofH onl acts semiregularly onl and {1, 2, 3, 6}, where is the restriction ofG onl (ifq –1(mod 3), then {1, 2}). Ifq {3, 5} and {1, 2}, then is determined completely, using a computer.     

Some tilings of the plane whose singular points are uncountable and unbounded

Let I be a tiling of the plane such that for every tile T of I there correspond a tile T of I (not necessarily unique) and an integer k(T, T) (depending on T and T), k(T, T)>2, such that T meets T in k(T, T) connected components. Tiles T and T satisfying this condition are called associated tiles in I. Various properties concerning I and its singular points are obtained. First, it is not possible that every tile in I have a unique associated tile. In fact, there exist infinite families of tiles {F} {F _n:n1} such that F is the unique associated tile for every F _n. Next, if x is a singular point of I, then every neighborhood of x contains uncountably many singular points of I. Finally, the set of singular points of I is unbounded.     

Harmonic analysis on tori

We consider measurable subsets {ofR}ⁿ with 0<m()<, and we assume that has a spectral set . (In the special case when is also assumed open, may be obtained as the joint spectrum of a family of commuting self-adjoint operators {H _k: 1kn} in L ² () such that each H _k is an extension of i(/x _k) on C _c (), k=1, ..., n.)It is known that is a fundamental domain for a lattice if is itself a lattice. In this paper, we consider a class of examples where is not assumed to be a lattice. Instead is assumed to have a certain inhomogeneous form, and we prove a necessary and sufficient condition for to be a fundamental domain for some lattice in {ofR}ⁿ. We are thus able to decide the question, fundamental domain or not, by considering only properties of the spectrum . Our criterion is obtained as a corollary to a theorem concerning partitions of sets which have a spectrum of inhomogeneous form.Work supported in part by the NSF.Work supported in part by the NSRC, Denmark.