On the (n − 2)-transversals of n convex subsets of the plane

In this paper we consider families of distinct ovals in the plane, with the property that certain subfamilies have stabbing lines (transversals). Our main result says that if any k member of the family can be stabbed by a line avoiding all the other ovals and k is large enough, then the family consists of at most k+1 ovals. For any n4 we show a family of n ovals, whose n–2 element subfamilies have, but the n–1 element subfamilies do not have, transversals.     

The Integral Mean of the Discrepancy of the Sequence (nα)

 For a real number x let be the fractional part of x and for any set M let c _M be the characteristic function of M. For and a positive integer N let

The Integral Mean of the Discrepancy of the Sequence (nα)

 For a real number x let be the fractional part of x and for any set M let c _M be the characteristic function of M. For and a positive integer N let

Presentations of the Schützenberger Product of n Groups

ABSTRACT

In this article, we first consider n × n upper-triangular matrices with entries in a given semiring k. Matrices of this form with invertible diagonal entries form a monoid B _n (k). We show that B _n (k) splits as a semidirect product of the monoid of unitriangular matrices U _n (k) by the group of diagonal matrices. When the semiring is a field, B _n (k) is actually a group and we recover a well-known result from the theory of groups and Lie algebras. Pursuing the analogy with the group case, we show that U _n (k) is the ordered set product of n(n ? 1)/2 commutative monoids (the root subgroups in the group case). Finally, we give two different presentations of the Schützenberger product of n groups G ₁,…, G _n , given a monoid presentation ?A _i  | R _i ? of each group G _i . We also obtain as a special case presentations for the monoid of all n × n unitriangular Boolean matrices.     

On the law of the iterated logarithm for the discrepancy of 〈n k x〉

By a well known result of Philipp (1975), the discrepancy D _N (ω) of the sequence (n _k ω) _k≥1 mod 1 satisfies the law of the iterated logarithm under the Hadamard gap condition n _{k + 1}/n _k ≥ q > 1 (k = 1, 2, …). Recently Berkes, Philipp and Tichy (2006) showed that this result remains valid, under Diophantine conditions on (n _k ), for subexpenentially growing (n _k ), but in general the behavior of (n _k ω) becomes very complicated in the subexponential case. Using a different norming factor depending on the density properties of the sequence (n _k ), in this paper we prove a law of the iterated logarithm for the discrepancy D _N (ω) for subexponentially growing (n _k ) without number theoretic assumptions. C. Aistleitner, Research supported by FWF grant S9603-N13. I. Berkes, Research supported by FWF grant S9603-N13 and OTKA grants K 61052 and K 67961. Authors’ addresses: C. Aistleitner, Institute of Mathematics A, Graz University of Technology, Steyrergasse 30, 8010 Graz, Austria; I. Berkes, Institute of Statistics, Graz University of Technology, Steyrergasse 17/IV, 8010 Graz, Austria     

On the chromatic uniqueness of the graphW(n,n − 2, k)

This paper shows that the graphW(n, n – 2, k) is chromatically unique for any even integern 6 and any integerk 1.     

On the Multiplicative Monoid of n×n Matrices Over Artinian Chain Rings

Let R be an Artinian chain ring with a principal maximal ideal. We investigate properties of matrices over R and give matrix representations of R-submodules of R ⁿ first, then consider Green's relations, Green's relation equivalent classes, Schützenberger groups of 𝒟-classes, principal factors, and group ?-classes of the multiplicative monoid M _n (R) of n × n matrices over R. Furthermore, we show that M _n (R) is an eventually regular semigroup and derive basic numerical information of M _n (R) when R is finite.     

Eigenvalues of the Manifold Sp（n）/U（n）

In this paper, we give the eigenvalues of the manifold Sp(n)/U(n). We prove that an eigenvalue λ _s (f ₂, f ₂, …, f _n ) of the Lie group Sp(n), corresponding to the representation with label (f ₁, f ₂, ..., f _n ), is an eigenvalue of the manifold Sp(n)/U(n), if and only if f ₁, f ₂, …, f _n are all even.     

Pointwise Convergence of the Calderón Reproducing Formula

In this paper, we study the pointwise convergence of the Calderón reproducing formula, which is also known as an inversion formula for wavelet transforms. We show that for every $f\in L_{w}^{p}(\mathbb {R}^{d})$ with an $\mathcal{A}_{p}$ weight w, 1??p<??, the integral is convergent at every Lebesgue point of f, and therefore almost everywhere. Moreover, we prove the convergence without any assumption on the smoothness of wavelet functions.     

On the chromatic numbers of spheres in ℝ n

Let χ(S _r ^n?1 )) be the minimum number of colours needed to colour the points of a sphere S _r ^n?1 of radius $r \geqslant \tfrac{1} {2}$ in ? ⁿ so that any two points at the distance 1 apart receive different colours. In 1981 P. Erd?s conjectured that χ(S _r ^n?1 )→∞ for all $r \geqslant \tfrac{1} {2}$ . This conjecture was proved in 1983 by L. Lovász who showed in [11] that χ(S _r ^n?1 ) ≥ n. In the same paper, Lovász claimed that if $r < \sqrt {\frac{n} {{2n + 2}}}$ , then χ(S _r ^n?1 ) ≤ n+1, and he conjectured that χ(S _r ^n?1 ) grows exponentially, provided $r \geqslant \sqrt {\frac{n} {{2n + 2}}}$ . In this paper, we show that Lovász’ claim is wrong and his conjecture is true: actually we prove that the quantity χ(S _r ^n?1 ) grows exponentially for any $r > \tfrac{1} {2}$ .     

Subgroups of the groupZ n and a generalization of the Gołąb-Schinzel functional equation

Letn be a positive integer and letX be a linear space over a commutative fieldK. In the set = (K\{0}) × X we define a binary operation ·: × by

A basis for the type 〈n〉 hyperidentities of the medial variety of semigroups

Summary The medical varietyMV of semigroups is the variety defined by the medial identityxyzw = xzyw. This variety is known to satisfy the medial hyperidentitiesF(G(x ₁₁ ,, x _1n ),, G(x _n1 ,, x _nn )) = G(F(x ₁₁ ,, x _n1 ),, F(x _1n ,, x _nn )), forn 1. Taylor has observed in [2] thatMV also satisfies some other hyperidentities, which are not consequences of the medial ones. In [4] the author introduced a countably infinite family of binary hyperidentities called transposition hyperidentities, which are natural generalizations of then = 2 medial hyperidentity. It was shown that this family is irredundant, and that no finite basis is possible for theMV hyperidentities with one binary operation symbol.In this paper, we generalize the concept of a transposition hyperidentity, and extend it to cover arbitrary arityn 2. We show that theMV hyperidentities with onen-ary operation symbol have no finite basis, but do have a countably infinite basis consisting of these transposition hyperidentities.Research supported by NSERC of Canada.     

RESEARCH ANNOUNCEMENTS The Lower Bound of the Number of Input Bits to Strong n×n S-boxes

ThesecurityoftheDES-likecrytosystemsdependsheavilyonthestrengthofthesub-stitutionboxes(S-boxes)used.ThedesignofnewS-boxesisthereforeanimportantconcerninthecreationofnewandmoresecurecryptosystems.ThefullsetofdesigucriteriafortheS-boxesoftheDEShasnever...     

The actions ofS n+1 andS n on the cohomology ring of a coxeter arrangement of typeA n−1

Let be the complexified Coxeter arrangement of hyperplanes of typeA _n−1. In this paper we construct anS _n+1 extension of the naturalS _n action on the complex cohomology ring of the complement ofA _n−1. Recurrence formulas connecting characters with respect to theS _n and theS _n+1 action are given.     

A note on the Structure of Turán Densities of Hypergraphs

Let r ≥ 2 be an integer. A real number α ∈ [0, 1) is a jump for r if there exists c > 0 such that no number in (α, α + c) can be the Turán density of a family of r-uniform graphs. A result of Erd?s and Stone implies that every α ∈ [0, 1) is a jump for r = 2. Erd?s asked whether the same is true for r ≥ 3. Frankl and Rödl gave a negative answer by showing an infinite sequence of non-jumps for every r ≥ 3. However, there are still a lot of open questions on determining whether or not a number is a jump for r ≥ 3. In this paper, we first find an infinite sequence of non-jumps for r = 4, then extend one of them to every r ≥ 4. Our approach is based on the techniques developed by Frankl and Rödl.     

On a phenomenon of Turán concerning the summands of partitions

Turán [12] proved that for almost all pairs of partitions of an integer, the proportion of common parts is very high, that is greater than \({\frac{1}{2} - \varepsilon}\) with \({\varepsilon > 0}\) arbitrarily small. In this paper we prove that this surprising phenomenon persists when we look only at the summands in a fixed arithmetic progression.     

Full-rank block LDL ? decomposition and the inverses of n×n block matrices

Full-rank block LDL ^? decomposition of a Hermitian n×n block matrix A is examined, where the iterative procedure evaluating the sub-matrices appearing in L and D is provided. This factorization is used to evaluate the inverse and Moore-Penrose inverse of a Hermitian n×n block matrix. The method for the calculation of the Moore-Penrose inverse of an arbitrary 2×2 block matrix is also provided. Therefore, matrix products A ^? A and AA ^? and the corresponding full-rank block LDL ^? factorizations are observed. Also, a simple explicit formulae calculating the solution vector components of the normal system of equations is stated, where the LDL ^? decomposition of the system matrix is done.