The number of non-isomorphic models in quasi-varieties of semigroups

Define \( n_K (\lambda )\) tobe eitherω, or the number of non-isomorphic algebras in \(K\) ] having cardinality λ, whichever cardinal is larger. It is proved here that if \(K\) ] is a quasi-variety (universal Horn class) of semigroups, then \(n_K\) is one of four functions. Each of these functions satisfies: \(n_K (\omega ) = \omega\) or \(n_K (\omega ) = 2^\omega\) . If \(n_K (\lambda )< 2^\lambda\) for some infinite λ then \(K\) ] is a residually finitevariety.     

On the number of -equivalent non-isomorphic models

We prove that if is consistent then is consistent with the following statement: There is for every a model of cardinality which is -equivalent to exactly non-isomorphic models of cardinality . In order to get this result we introduce ladder systems and colourings different from the ``standard' counterparts, and prove the following purely combinatorial result: For each prime number and positive integer it is consistent with that there is a ``good' ladder system having exactly pairwise nonequivalent colourings.

     

On the number of non-isomorphic subgraphs

Let $\mathcal{K}$ be the family of graphs on ω₁ without cliques or independent subsets of sizew ₁. We prove that

1. it is consistent with CH that everyGε $\mathcal{K}$ has 2^ω many pairwise non-isomorphic subgraphs,
2. the following proposition holds in L: (*)there is a Gε $\mathcal{K}$ such that for each partition (A, B) of ω₁ either G?G[A] orG?G[B],
3. the failure of (*) is consistent with ZFC.

     

On the number of non-isomorphic matroids

Let f(n) denote the number of non-isomorphic matroids on an n-element set. In 1969, Welsh conjectured that, for all non-negative integers m and n, f(m+n)f(m)f(n). In this paper, we prove this conjecture.     

The theory of sharp first-order univalence criteria

A condition of the formf′ (D) ⊂R is calleda first-order univalence criterion if all functions for which it holds are univalent inD. By means of a careful analysis of the behavior of the corresponding extremal functions, we establish fundamental principles for a coherent theory of sharp criteria of this kind. In particular, we examine the relationship between three different concepts of sharpness and show how large classes of first-order univalence criteria which are sharp in a strong sense may be described in terms of the univalence properties of families of analytic functions depending on a finite number of parameters. This research was supported in part by the Chilean government through FONDECYT grant No. 0809-91.     

On an extremal problem in number theory

We define h(n) to be the largest function of n such that from any set of n nonzero integers, one can always extract a subset of h(n) integers with the property that any two sums formed from its elements are equal only if they have equal number of summands. A result of Erdös implies that $\text{h(n) ? n}{}^{\mathrm{<mtext>1</mtext><mtext>3</mtext>}}$, and it is the aim of the present paper to obtain the refinement $\text{h(n) ? n}{}^{\mathrm{<mtext>1</mtext><mtext>3</mtext>}}\text{(}\text{log}\text{n)}{}^{\mathrm{<mtext>1</mtext><mtext>3</mtext>}}$.     

An application of number theory to ergodic theory and the construction of uniquely ergodic models

Using a combinatorial result of N. Hindman one can extend Jewett’s method for proving that a weakly mixing measure preserving transformation has a uniquely ergodic model to the general ergodic case. We sketch a proof of this reviewing the main steps in Jewett’s argument. To the memory of Shlomo Horowitz The research of this author was supported by the National Science Foundation (USA).     

The covering number in learning theory

The covering number of a ball of a reproducing kernel Hilbert space as a subset of the continuous function space plays an important role in Learning Theory. We give estimates for this covering number by means of the regularity of the Mercer kernel K. For convolution type kernels K(x,t)=k(x−t) on [0,1]ⁿ, we provide estimates depending on the decay of k̂, the Fourier transform of k. In particular, when k̂ decays exponentially, our estimate for this covering number is better than all the previous results and covers many important Mercer kernels. A counter example is presented to show that the eigenfunctions of the Hilbert–Schmidt operator Lm_K associated with a Mercer kernel K may not be uniformly bounded. Hence some previous methods used for estimating the covering number in Learning Theory are not valid. We also provide an example of a Mercer kernel to show that L_K^1/2 may not be generated by a Mercer kernel.     

On the number of pairwise non-isomorphic minimal blocking sets in PG(2, q)

In this paper we examine whether the number of pairwise non-isomorphic minimal blocking sets in PG(2, q) of a certain size is larger than polynomial. Our main result is that there are more than polynomial pairwise non-isomorphic minimal blocking sets for any size in the intervals [2q−1, 3q−4] for q odd and for q square. We can also prove a similar result for certain values of the intervals and .      

Equipartition of interval partitions and an application to number theory

We give wider application and simpler proofs of results describing the rate at which the digits of one number-theoretic expansion determine those of another. The proofs are based on general measure-theoretic covering arguments and not on the dynamics of specific maps.