Related papers: Combinatorial background for non-structure
We introduce an approach to the categorification of rings, via the notion of distributive categories with negative objects, and use it to lay down categorical foundations for the study of super, quantum and non-commutative combinatorics.…
The review of modern study of algebraic, geometric and differential properties of quaternionic (Q) numbers with their applications. Traditional and "tensor" formulation of Q-units with their possible representations are discussed and groups…
A long-term research proposal on the algebraic structure, the representations and the possible applications of paraparticle algebras is structured in three modules: The first part stems from an attempt to classify the inequivalent gradings…
It is proved that the numerical semigroups associated to the combinatorial configurations satisfy a family of non-linear symmetric patterns. Also, these numerical semigroups are studied for two particular classes of combinatorial…
In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
It seems that the index theory for non-compact spaces has found its ultimate formulation in realm of coarse spaces and $K$-theory of related operator algebras. Relative and partitioned index theorems may be mentioned as two important and…
Invertibility is important in ring theory because it enables division and facilitates solving equations. Moreover, (nonassociative) rings can be endowed with an extra ''structure'' such as order and topology allowing more richness in the…
The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.
A closed-form formula is derived for the number of occurrences of matches of a multiset of patterns among all ordered (plane-planted) trees with a given number of edges. A pattern looks like a tree, with internal nodes and leaves, but also…
In Chapter 1 we give the basic background and notations. We also give a new characterization of the Conrad property for orderings. In Chapter 2, we use the new characterization of the Conradian property to give a classification of groups…
We introduce a formalism based on a combinatorial notion of cell complex subject to an inclusion-reversing duality operation. Our main goal is to open the way for a functorial definition of field theories in a context where no manifold or…
We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles…
Lifting attempts to speed up probabilistic inference by exploiting symmetries in the model. Exact lifted inference methods, like their propositional counterparts, work by recursively decomposing the model and the problem. In the…
Joyal's theory of combiantorial species provides a rich and elegant framework for enumerating combinatorial structures by translating structural information into algebraic functional equations. We present some classical and folklore results…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…
Non-trivial extensions of the three dimensional Poincar\'e algebra, beyond the supersymmetric one, are explicitly constructed. These algebraic structures are the natural three dimensional generalizations of fractional supersymmetry of order…
We give the first data structure for the problem of maintaining a dynamic set of n elements drawn from a partially ordered universe described by a tree. We define the Line-Leaf Tree, a linear-sized data structure that supports the…
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…