Related papers: Combinatorial background for non-structure
The purpose of this book is to lay out certain aspects of descriptive set theory. After initially establishing notation and generalities we proceed to the following topics: partitions, semirings, rings, $\sigma$-rings, $\delta$-rings,…
Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry…
This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…
This paper is primarily intended as an introduction for the mathematically inclined to some of the rich algebraic combinatorics arising in for instance CFT. It is essentially self-contained, apart from some of the background motivation and…
These notes are concerned with the existence and the basic properties of the set-theoretic universes for nonstandard analysis, compiled by a beginner in the subject. It assumes a basic background in first-order logic, though the necessary…
We develop a framework for nonstandard analysis that gives foundations to the interplay between external and internal iterations of the star map, and we present a few examples to show the strength and flexibility of such a nonstandard…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…
A natural partial order on the set of prime numbers was derived by the author from the internal symmetries of the primary finite fields, independently of Ford a.a., who investigated Pratt trees for primality tests. It leads to a…
In these lectures we review the motivation, principles of and (circumstantial) evidence for the program of unification of the fundamental forces. In an appendix, we review the group theory pertinent to the program.
Associating to each pre-order on the indices 1,...,n the corresponding structural matrix ring, or incidence algebra, embeds the lattice of n-element pre-orders into the lattice of n x n matrix rings. Rings within the order-convex hull of…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
In order to support students in the development of expertise in quantum mechanics, we asked which concepts and structures can act as organizing principles of the non-relativistic theory. The research question has been addressed in a…
A foliation on a manifold M can be informally thought of as a partition of M into injectively immersed submanifolds, called leaves. In this thesis we study foliations whose leaves carry some specific geometric structures. The thesis…
We give an account of the basic combinatorial structure underlying the notion of type dependency. We do so by considering the category of all dependent sequent calculi, and exhibiting it as the category of algebras for a monad on a presheaf…
The interior structure of arbitrary sets of quaternion units is analyzed using general methods of the theory of matrices. It is shown that the units are composed of quadratic combinations of fundamental objects having a dual mathematical…
We introduce the notion of a combinatorial $n$-od cover, for $n \geq 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-like. Using this tool, we generalize a classic example of…
This paper is a companion article to the review paper by the present author devoted to the classification of matter constituents (chemical elements and particles) and published in the first part of the proceedings of The Second Harry Wiener…
The paper focuses on the structure of fundamental sequences of ordinals smaller than $\epsilon_0$. A first result is the construction of a monadic second-order formula identifying a given structure, whereas such a formula cannot exist for…