Related papers: On reaping number having countable cofinality

Following Blass, we call a real a ``needed'' for a binary relation R on the reals if in every R-adequate set we find an element from which a is Turing computable. We show that every real needed for Cof(N) is hyperarithmetic. Replacing…

It is shown that if a compact metric space $(X, d)$ is bi-H\"older equivalent to an ultrametric space, then the logarithmic ratio $R(X,d)$ is finite. Conversely, if the logarithmic ratio $R(X,d)$ is finite and ${\A}^*_p (X) \ne \emptyset$…

We obtain upper bounds on the number of irreducible and extended irreducible Goppa codes over $GF(p)$ of length $q$ and $q+1$, respectively defined by polynomials of degree $r$, where $q=p^t$ and $r\geq 3$ is a positive integer.

The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…

We can generalize the definition of {\it splitting number } $s(\kappa )$ for $\kappa$ uncountable regular: $s(\kappa )=min\{ |\Cal S|:\Cal S\subset \Cal P(\kappa ) \forall a\in \kappa ^\kappa \exists b\in \Cal S |a\cap b|=|a\setminus…

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

For any smooth irreducible projective curve $X$, the gonality sequence $\{d_r \;| \; r \in \mathbb N \}$ is a strictly increasing sequence of positive integer invariants of $X$. In most known cases $d_{r+1}$ is not much bigger than $d_r$.…

The set of integer number lists with finite length, and the set of binary trees with integer labels are both countably infinite. Many inductively defined types also have countably many elements. In this paper, we formalize the syntax of…

Let $p$ be a fixed prime number, and $N$ be a large integer. The 'Inverse Conjecture for the Gowers norm' states that if the "$d$-th Gowers norm" of a function $f:\F_p^N \to \F_p$ is non-negligible, that is larger than a constant…

We give an upper bound for the dealternating number of a closed 3-braid. As applications, we determine the dealternating numbers, the alternation numbers and the Turaev genera of some closed positive 3-braids. We also show that there exist…

There exists a set $A$ of positive integers such that the number of representations of a large positive integer $m$ as a sum of two elements of $A$ grows with a lower bound of order $\log m$, but for which there is no subset $D$ of $A$…

For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…

We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.

We prove that a sumset of a TE subset of (\N) (these sets can be viewed as "aperiodic" sets) with a set of positive upper density intersects a set of values of any polynomial with integer coefficients., i.e. for any (A \subset \N ) a TE…

This paper introduces a new simplified version of the countable branching recurrence of Computability Logic, proves its equivalence to the old one, and shows that the basic logic induced by it is a proper superset of the basic logic induced…

We establish that there is an algebraic number $\xi\approx 2.30522$ such that while there are uncountably many growth rates of permutation classes arbitrarily close to $\xi,$ there are only countably many less than $\xi$. Central to the…

For $p\geq 1$ one can define a generalization of the unknotting number $tu_p$ called the $p$th untwisting number which counts the number of null-homologous twists on at most $2p$ strands required to convert the knot to the unknot. We show…

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

We prove that the degree $r(2p-3)$ cohomology of any finite group of Lie type over $\mathbb{F}_{p^r}$, with coefficients in characteristic $p$, is nonzero as long as its Coxeter number is at most $p$. We do this by providing a simple…

We prove two ZFC theorems about cardinal invariants above the continuum which are in sharp contrast to well-known facts about these same invariants at the continuum. It is shown that for an uncountable regular cardinal $\kappa$,…