相关论文: Ordered structures with no finite monomorphic deco…
This paper summarizes substantive new results derived by a student team (the first three authors) under the direction of the fourth author at the 2005 session of the KSU REU ``Brainstorming and Barnstorming''. The main results are a…
We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…
Let $F=\{H_1,...,H_k\}$ be a family of graphs. A graph $G$ with $m$ edges is called {\em totally $F$-decomposable} if for {\em every} linear combination of the form $\alpha_1 e(H_1) + ... + \alpha_k e(H_k) = m$ where each $\alpha_i$ is a…
We establish a list of characterizations of bounded twin-width for hereditary, totally ordered binary structures. This has several consequences. First, it allows us to show that a (hereditary) class of matrices over a finite alphabet either…
We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…
Let R be a locally finitely generated algebra over a discrete valuation ring V of mixed characteristic. For any of the homological properties, the Direct Summand Theorem, the Monomial Theorem, the Improved New Intersection Theorem, the…
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…
It is shown that a finitely generated branch group has Serre's property (FA) if and only if it does not surject onto the infinite cyclic group or the infinite dihedral group. An example of a finitely generated self-similar branch group…
We define a new family of graph invariants, studying the topology of the moduli space of their geometric realizations in Euclidean spaces, using a limiting procedure reminiscent of Floer homology. Given a labeled graph $G$ on $n$ vertices…
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…
In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class $\mathcal{G}$, we are concerned with the maximum subclass and the minimum superclass of $\mathcal{G}$ that…
Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…
We consider limit probabilities of first order properties in random graphs with a given degree sequence. Under mild conditions on the degree sequence, we show that the closure set of limit probabilities is a finite union of closed…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
The emerging theory of graph limits exhibits an analytic perspective on graphs, showing that many important concepts and tools in graph theory and its applications can be described more naturally (and sometimes proved more easily) in…
Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…
Given a class of graphs $\mathcal{H}$, the problem $\oplus\mathsf{Sub}(\mathcal{H})$ is defined as follows. The input is a graph $H\in \mathcal{H}$ together with an arbitrary graph $G$. The problem is to compute, modulo $2$, the number of…
We show how to use topological ideas, such as compactness, to establish orderability properties of infinite groups. A new application is to provide a left-ordering for the group of PL homeomorphisms of a connected surface with boundary…
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:…
We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees form a copy of the dense linear order…