Related papers: The Interplay between Additive and Multiplicative …
This paper investigates the combinatorics that gives rise to the Boltzmann probability distribution. Despite being one of the most important distributions in physics and other fields of science, the mathematics of the underlying model of…
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…
We give a general construction of topological groups from combinatorial structures such as trees, towers, gaps, and subadditive functions. We connect topological properties of corresponding groups with combinatorial properties of these…
We describe a framework that unifies the two types of polynomials introduced respectively by Bacher and Mouton and by Rutschmann and Wettstein to analyze the number of triangulations of point sets. Using this insight, we generalize the…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…
A famous theorem of Szemer\'edi asserts that all subsets of the integers with positive upper density will contain arbitrarily long arithmetic progressions. There are many different proofs of this deep theorem, but they are all based on a…
We introduce notions of combinatorial blowups, building sets, and nested sets for arbitrary meet-semilattices. This gives a common abstract framework for the incidence combinatorics occurring in the context of De Concini-Procesi models of…
Plural (or multiple-conclusion) cuts are inferences made by applying a structural rule introduced by Gentzen for his sequent formulation of classical logic. As singular (single-conclusion) cuts yield trees, which underlie ordinary natural…
This study critically analyses the information-theoretic, axiomatic and combinatorial philosophical bases of the entropy and cross-entropy concepts. The combinatorial basis is shown to be the most fundamental (most primitive) of these three…
A new category of algebro-geometric objects is defined. This construction is a vast generalization of existing F1-theories, as it contains the the theory of monoid schemes on the one hand and classical algebraic theory, e.g. Grothendieck…
Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which…
The foundations of mathematics have long been considered settled by the Zermelo-Fraenkel-Choice axioms. But set theory abounds in models with different truths and even classical questions such as the measurability of projective sets can…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
We consider some smooth maps on a bouquet of circles. For these maps we can compute the number of fixed points, the existence of periodic points and an exact formula for topological entropy. We use Lefschetz fixed point theory and actions…
We uncover a combinatorial structure governing the differential equations satisfied by wavefunction coefficients of scalar fields with generic masses in de Sitter space. Using an integral representation of the massive mode functions, we…
Given a semigroup $G$ and a bounded function $f: G \to \mathbb{C}$, a topological Furstenberg system of $f$ is a topological dynamical system $\mathbb{X}=(X, (T_g)_{g \in G})$ that encodes the dynamical behaviour of $f$. We show that…
It is known that in $\mathbb{R}^n,n\geq 2$, a compact set which contains $n-1$ spheres with all radii in $[1/2,1]$ or with all possible centres in $[0,1]^n$ has full Hausdorff dimension. In fact the later set has positive Lebesgue measure.…
Combinatorics studies how discrete objects can be counted, arranged, and combined under specified rules. Motivated by uncertainty in real-world data and decisions, modern set-theoretic formalisms such as fuzzy sets, neutrosophic sets, rough…
This paper presents some finite combinatorics of set systems with applications to model theory, particularly the study of dependent theories. There are two main results. First, we give a way of producing lower bounds on VC_ind-density, and…