Related papers: Combinatorial Properties of Finite Models
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
We establish a categorical framework relating two canonical model constructions in first-order logic: the Henkin construction and compactness-based constructions via ultraproducts or saturation. By introducing a globally fixed set of Henkin…
Gaussian elimination answers any question about a finitely presented vector space. However, a "uniform family" of such presentations--given as generic relations among an unspecified number of generators--is susceptible to elimination only…
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},\ldots , a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}\cdots a_{n} =a_{\sigma (1)} a_{\sigma (2)} \cdots a_{\sigma (n)}$, where…
We introduce the notion of echeloned spaces - an order-theoretic abstraction of metric spaces. The first step is to characterize metrizable echeloned spaces. It turns out that morphisms between metrizable echeloned spaces are uniformly…
Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…
We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…
We demonstrate under appropriate finiteness conditions that a coarse embedding induces an inequality of homological Dehn functions. Applications of the main results include a characterization of what finitely presentable groups may admit a…
Urysohn constructed a separable complete universal metric space homogeneous for all finite subspaces, which is today called the Urysohn universal metric space. Some authors have recently investigated an ultrametric analogue of this space.…
This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
We consider and characterize classes of finite and countably categorical structures and their theories preserved under $E$-operators and $P$-operators. We describe $e$-spectra and families of finite cardinalities for structures belonging to…
Given a finite relational language $\calL$, a hereditary $\calL$-property is a class of finite $\calL$-structures which is closed under isomorphism and model theoretic substructure. This notion encompasses many objects of study in extremal…
We show that there are uncountably many countable lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many…
Every transformation monoid comes equipped with a canonical topology-the topology of pointwise convergence. For some structures, the topology of the endomorphism monoid can be reconstructed from its underlying abstract monoid. This…