Related papers: New simple theories from hypergraph sequences

Motivated by bifurcation of branches of homoclinic orbits of dynamical systems, we consider families of first-order equations on the real line and introduce a generalisation of previous index theorems by Pejsachowicz, and by Hu and…

We adapt a proof of Lascar in order to show the simplicity of the group of automorphisms fixing pointwise all non-generic elements for a class of uncountable models of suitable theories, encompassing both strongly minimal theories as well…

Several possible presentations for the homotopy theory of (non-hypercomplete) $\infty$-stacks on a classical site S are discussed. In particular, it is shown that an elegant combinatorial description in terms of diagrams in S exists,…

We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study…

The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…

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…

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

We introduce a new infinite family of regular graphs admitting nested solutions in the edge-isoperimetric problem for all their Cartesian powers. The obtained results include as special cases most of previously known results in this area.

We investigate the rank gradient and growth of torsion in homology in residually finite groups. As a tool, we introduce a new complexity notion for generating sets, using measured groupoids and combinatorial cost. As an application we prove…

We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describe a Galois connection between sets of decidable theories,…

Given a graph $G$, we define a filtration of simplicial complexes associated to $G$, $\mathcal{F}_0(G)\subseteq\mathcal{F}_1(G)\subseteq\cdots\subseteq\mathcal{F}_\infty(G)$ where the first complex is the independence complex and the last…

Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…

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 introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…

Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…

This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…