Related papers: On the model theory of the Farey graph

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…

In this paper we study the algebraic structure of $\omega$-stable bilinear maps, arbitrary rings and nilpotent groups. We will also provide rather complete structure theorems for the above structures in the finite Morley rank case.

There is an axiomatic treatment of Morley rank in groups, due to Borovik and Poizat. These axioms form the basis of the algebraic treatment of groups of finite Morley rank which is common today. There are, however, ranked structures, i.e.…

Let (M, g) be a compact manifold endowed with a possibly singular Riemannian metric. The metric induces a norm on the homology of M , called the stable norm. We provide explicit computations of the stable norm of flat slit tori using the…

We prove the consistency result from the title. By forcing we construct a model of g=aleph_1, b=cf(Sym(omega))=aleph_2.

We show that, up to minor-equivalence, the Farey graph is the unique minor-minimal graph that is infinitely edge-connected but such that every two vertices can be finitely separated.

We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.

Let X and Y be CW-complexes, U be an abelian group, and f:[X,Y]->U be a map (a homotopy invariant). We say that f has order at most r if the characteristic function of the r'th Cartesian power of the graph of a continuous map a:X->Y…

This work is dedicated to the results were got in the model theory of the regular polygons. We give the characterization of the monoids with axiomatizable and model complete class of regular polygons. We describe the monoids with complete…

The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G) + mu(G) equals its order, then G is a Koenig-Egervary graph. We call G…

Let $X$ be a connected Cayley graph on an abelian group of odd order, such that no two distinct vertices of $X$ have exactly the same neighbours. We show that the direct product $X \times K_2$ (also called the "canonical double cover" of…

We present a new sufficient condition on stability number and toughness of the graph to have an f-factor.

The stability number of a graph G, denoted by alpha(G), is the cardinality of a maximum stable set, and mu(G) is the cardinality of a maximum matching in G. If alpha(G)+mu(G) equals its order, then G is a Konig-Egervary graph. In this paper…

We use a variation on Mason's $\alpha$-function as a pre-dimension function to construct a not one-based $\omega$-stable plane $P$ (i.e. a simple rank $3$ matroid) which does not admit an algebraic representation (in the sense of matroid…

We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…

We prove that if $G=(V,E)$ is an $\omega$-stable (respectively, superstable) graph with $\chi(G)>\aleph_0$ (respectively, $2^{\aleph_0}$) then $G$ contains all the finite subgraphs of the shift graph $\text{Sh}_n(\omega)$ for some $n$. We…

The stability number of a graph G, denoted by alpha(G), is the cardinality of a stable set of maximum size in G. A graph is well-covered if every maximal stable set has the same size. G is a Koenig-Egervary graph if its order equals…

We prove some asymptotic formulae concerning the distribution of the index of Farey fractions of order Q as $Q\to \infty$.

We characterize the values of the stable rank for Leavitt path algebras, by giving concrete criteria in terms of properties of the underlying graph.

The Rayleigh monotonicity is a principle from the theory of electrical networks. Its combinatorial interpretation says for each two edges of a graph G, that the presence of one of them in a random spanning tree of G is negatively correlated…