Related papers: The order conjecture fails in S

Solving a decades-old problem we show that Keisler's 1967 order on theories has the maximum number of classes. The theories we build are simple unstable with no nontrivial forking, and reflect growth rates of sequences which may be thought…

We show that Kelley-Morse set theory does not prove the class Fodor principle, the assertion that every regressive class function $F:S\to\text{Ord}$ defined on a stationary class $S$ is constant on a stationary subclass. Indeed, it is…

Let K be a number field and let S be a finite set of places of K which contains all the Archimedean places. For any f(z) in K(z) of degree d at least 2 which is not a d-th power in \bar{K}(z), Siegel's theorem implies that the image set…

The Eremenko-Lyubich class consists of transcendental entire functions with bounded singular set and the Speiser class is made up of functions with a finite singular set. In an earlier paper "Models for the Eremenko-Lyubich class" I gave a…

We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…

Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…

There have been many parallel streams of research studying order isomorphisms of some specific sets $G$ of functions from a set $X$ to $\mathbb{R}\cup\{\pm\infty\}$, such as the sets of convex or Lipschitz functions. We develop in this…

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

Solutions that satisfy classically the Burgers equation except, perhaps, on a closed set S of the plane of potential singularities whose Hausdorff 1-measure is zero, $H^1(S) = 0$, are necessarily identically constant. We show this under the…

We introduce a concept of a quasi proximate order which is a generalization of a proximate order and allows us to study efficiently analytic functions whose order and lower order of growth are different. We prove an existence theorem of a…

We provide a counterexample to a conjecture of Hildebrand which states that if $\S$ has positive lower density and is stable i.e. for all $d$, $n$ is in $\mathcal{S}$ if and only if $dn$ is in $\mathcal{S}$ except on a set of density $0$…

Let f be an entire function that has only finitely many critical and asymptotic values. Up to topological equivalence, the function $f$ is determined by combinatorial information, more precisely by an infinite graph known as a…

Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…

We prove a bicategorical analogue of Quillen's Theorem A. As an application, we deduce the well-known result that a pseudofunctor is a biequivalence if and only if it is essentially surjective on objects, essentially full on 1-cells, and…

We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…

Associated to a newform $f(z)$ is a Dirichlet series $L_f(s)$ with functional equation and Euler product. Hecke showed that if the Dirichlet series $F(s)$ has a functional equation of a particular form, then $F(s)=L_f(s)$ for some…

Many results on the convex order in the literature were stated for random variables with finite mean. For instance, a fundamental result in dependence modeling is that the sum of a pair of random random variables is upper bounded in convex…

Let f be a transcendental entire function that omits a complex value a. We show that for every simply connected region D that does not contain a the full preimage of D is disconnected. We conjecture that the same holds if one only assumes…

Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman, Marcone, Montalban et al.) and with…

A sequence $s_1,s_2,\ldots, s_k$ of elements of a group $G$ is called a valid ordering if the partial products $s_1, s_1 s_2, \ldots, s_1\cdots s_k$ are all distinct. A long-standing problem in combinatorial group theory asks whether, for a…