Related papers: Combinatorial Properties of Finite Models
The theory of finitely supported algebraic structures represents a reformulation of Zermelo-Fraenkel set theory in which every construction is finitely supported according to the action of a group of permutations of some basic elements…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…
The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality…
Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…
We study preservation theorems for modal logics over finite structures with respect to three fundamental semantic relations: embeddings, injective homomorphisms, and homomorphisms. We focus on classes of pointed Kripke models that are…
A hyperplane arrangement is called formal provided all linear dependencies among the defining forms of the hyperplanes are generated by ones corresponding to intersections of codimension two. The significance of this notion stems from the…
Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…
A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of homogeneity:…
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 note we characterize, within the framework of the theory of finite set, those categories of graphs that are {\em algebraic universal} in the sense that every concrete category embeds in them. The proof of the characterization is…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
We give explicit, uniform formulas for the graded characters and total ranks of the Lie algebra homology of finite-dimensional representations in all classical types. In many cases, these compute the Tor groups of finite length modules over…
This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…
In this series we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects like undirected graphs, directed graphs, bidirected graphs, hypergraphs or finitary matroids. In…
Hyperuniformity refers to the suppression of density fluctuations at large scales. Typical for ordered systems, this property also emerges in several disordered physical and biological systems, where it is particularly relevant to…