Related papers: Coloring ordinals by reals

In this article we study some algebraic aspects of multicomplex numbers $\mathbb M_n$. For $n\geq 2$ a canonical representation is defined in terms of the multiplication of $n-1$ idempotent elements. This representation facilitates…

We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…

This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invariant properties. Mechanizing the core process algebra in…

We prove a better coloring theorem for aleph_4 and even aleph_3. This has a general topology consequence.

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…

We characterize pairs of orthogonal countable ordinals. Two ordinals $\alpha$ and $\beta$ are orthogonal if there are two linear orders $A$ and $B$ on the same set $V$ with order types $\alpha$ and $\beta$ respectively such that the only…

We present a progress on local computation algorithms for two coloring of $k$-uniform hypergraphs. We focus on instances that satisfy strengthened assumption of Local Lemma of the form $2^{1-\alpha k} (\Delta+1) e < 1$, where $\Delta$ is…

An analogue over imaginary quadratic fields of a result in algebraic number theory known as Ihara's lemma is established. More precisely, we show that for a prime ideal P of the ring of integers of an imaginary quadratic field F, the kernel…

We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of…

The use of a necessity modality in a typed $\lambda$-calculus can be used to separate it into two regions. These can be thought of as intensional vs. extensional data: data in the first region, the modal one, are available as code, and…

We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant `true' by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform…

In this paper we analyse some questions concerning trees on $\kappa$, both for the countable and the uncountable case, and the connections with Cohen reals. In particular, we provide a proof for one of the implications left open in…

The induction principle for natural numbers expresses that when a property holds for some natural number a and is hereditary, then it holds for all numbers greater than or equal to a. We present a similar principle for real numbers.

We provide simple equational principles for deriving rely-guarantee-style inference rules and refinement laws based on idempotent semirings. We link the algebraic layer with concrete models of programs based on languages and execution…

Komjath studied the list chromatic number of infinite graphs and introduced the notion of restricted list chromatic number. For a graph $X=(V_X,E_X)$ and a cardinal $\kappa$, we say that $X$ is restricted list colorable for $\kappa$ if for…

We prove interior H\"older estimate for the spatial gradients of the viscosity solutions to the singular or degenerate parabolic equation $$ u_t=|\nabla u|^{\kappa}\mbox{div} (|\nabla u|^{p-2}\nabla u), $$ where $p\in (1,\infty)$ and…

Higher-order representations of objects such as programs, proofs, formulas and types have become important to many symbolic computation tasks. Systems that support such representations usually depend on the implementation of an intensional…

We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.

There are two well-known ways of doing arithmetic with ordinal numbers: the "ordinary" addition, multiplication, and exponentiation, which are defined by transfinite iteration; and the "natural" (or Hessenberg) addition and multiplication…