Related papers: Coding with ladders a well-ordering of the reals

We provide a description of the structure of $\aleph_0$-categorical trees and cycle-free partial orders. First the maximal branches of $\aleph_0$-categorical tree are examined, followed by the configuration of the ramification orders, which…

In this paper, we study the well extension of strict(irreflective) partial well orderings. We first prove that any partially well-ordered structure <A, R> can be extended to a well-ordered one. Then we prove that every linear extension of…

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…

Let $G$ be a planar graph without 4-cycles and 5-cycles and with maximum degree $\Delta\ge 32$. We prove that $\chi_{\ell}(G^2)\le \Delta+3$. For arbitrarily large maximum degree $\Delta$, there exist planar graphs $G_{\Delta}$ of girth 6…

In this article we show that the symbolic Rees algebra of a mixed ladder determinantal ideal is strongly $F$-regular. Furthermore, we prove that the symbolic associated graded algebra of a mixed ladder determinantal ideal is $F$-pure. The…

Let $F$ be a number field with ring of integers $\Oc_F$ and $\Dc$ a division $F$-algebra with a maximal cyclic subfield $K$. We study rings occurring as quotients of a natural $\Oc_F$-order $\Lambda$ in $\Dc$ by two-sided ideals. We reduce…

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

It is well known that the Lorenz system has $Z_2$-symmetry. Using introducted in math.DS/0105147 topological covering-coloring a new representation for the Lorenz system is obtained. Deleting coloring leads to the factorized Lorenz system…

We lay out the foundations of the theory of second-order conformal superintegrable systems. Such systems are essentially Laplace equations on a manifold with an added potential: $(\Delta_n+V({\bf x}))\Psi=0$. Distinct families of…

We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of…

We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from…

In [5], Hjorth proved that for every countable ordinal $\alpha$, there exists a complete $\mathcal{L}_{\omega_1,\omega}$-sentence $\phi_\alpha$ that has models of all cardinalities less than or equal to $\aleph_\alpha$, but no models of…

Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…

This paper investigates the Stirling numbers of the first and second kind associated with a delta series f (t). These numbers provide a robust framework that satisfies the orthogonality and inverse relations, often lacking in recent…

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).

Modulo the existence of large cardinals, there is a model of set theory in which for some set $B$ of regular cardinals, the sequence $\langle \text{pcf}^\alpha(B): \alpha \in \text{Ord} \rangle$ is strictly increasing. The result answers a…