Related papers: Infinite combinatorics plain and simple
The main aim of the paper is to study in greater detail absolutely homogeneous structures (that is, objects with the property that each partial isomorphism extends to a global automorphism), with special emphasis on metric spaces and…
In this paper we describe an approach to construct large extendable collections of vectors in predefined spaces of given dimensions. These collections are useful for neural network latent space configuration and training. For classification…
We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorialoptimization. We show how invariance of hyperfiniteness of graphings under local isomorphism…
In this paper, we prove the number of countable models of a countable supersimple theory is either 1 or infinite. This result is an extension of Lachlan's theorem on a superstable theory.
In this article we propose a general method of obtaining infinite sums of products with functions that count patterns in numbers.
Based on the fact that projective monomial curves in the plane are complete intersections, we give an effective inductive method for creating infinitely many monomial curves in the projective $n$-space that are set theoretic complete…
We present a method to simplify expressions in the context of an equational theory. The basic ideas and concepts of the method have been presented previously elsewhere but here we tackle the difficult task of making it efficient in…
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…
Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
In this paper, we consider counting and projected model counting of extensions in abstract argumentation for various semantics. When asking for projected counts we are interested in counting the number of extensions of a given argumentation…
We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates…
Probabilistic inferences distill knowledge from graphs to aid human make important decisions. Due to the inherent uncertainty in the model and the complexity of the knowledge, it is desirable to help the end-users understand the inference…
We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…
Infinitesimal contraction analysis, wherein global asymptotic convergence results are obtained from local dynamical properties, has proven to be a powerful tool for applications in biological, mechanical, and transportation systems. Thus…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
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…
This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is…
We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…