Related papers: Strict Superstablity and Decidability of Certain G…

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…

We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…

In this note we study a family of graphs of groups over arbitrary base graphs where all vertex groups are isomorphic to a fixed countable sofic group $G$, and all edge groups $H<G$ are such that the embeddings of $H$ into $G$ are identical…

We consider an evolving preferential attachment random graph model where at discrete times a new node is attached to an old node, selected with probability proportional to a superlinear function of its degree. For such schemes, it is known…

The Farrell-Jones Fibered Isomorphism Conjecture for the stable topological pseudoisotopy theory has been proved for several classes of groups. For example for discrete subgroups of Lie groups, virtually poly-infinite cyclic groups, Artin…

We prove, that every connected graph with $s$ vertices of degree 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${2\over 5}t +{1\over 5}s+\alpha$ leaves, where $\alpha \ge {8\over 5}$. Moreover, $\alpha \ge 2$ for…

Consider a group G and a family $\mathcal{A}$ of subgroups of G. We say that vertex finiteness holds for splittings of G over $\mathcal{A}$ if, up to isomorphism, there are only finitely many possibilities for vertex stabilizers of minimal…

We show that an infinite residually finite boundedly generated group has an infinite chain of finite index subgroups with ranks uniformly bounded, and give (sublinear) upper bounds on the ranks of arbitrary finite index subgroups of…

A theorem of Elekes and Szab\'{o} recognizes algebraic groups among certain complex algebraic varieties with maximal size intersections with finite grids. We establish a generalization to relations of any arity and dimension, definable in:…

We prove a version of Hrushovski's socle lemma for rigid groups in an arbitrary simple theory.

We consider a regular $n$-ary tree of height $h$, for which every vertex except the root is labelled with an independent and identically distributed continuous random variable. Taking motivation from a question in evolutionary biology, we…

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

We construct a hierarchy of supersymmetric string theories by showing that the general N-extended superstrings may be viewed as a special class of the (N+1)-extended superstrings. As a side result, we find a twisted (N+2) superconformal…

We show that the absolute Galois group acts faithfully on the set of Hubbard trees. Hubbard trees are finite planar trees, equipped with self-maps, which classify postcritically finite polynomials as holomorphic dynamical systems on the…

T.C. Burness and S.D. Scott \cite{3} classified finite groups $G$ such that the number of prime order subgroups of $G$ is greater than $|G|/2-1$. In this note, we study finite groups $G$ whose subgroup graph contains a vertex of degree…

We prove that it is consistent that $\aleph_\omega$ is strong limit, $2^{\aleph_\omega}$ is large and the universality number for graphs on $\aleph_{\omega+1}$ is small. The proof uses Prikry forcing with interleaved collapsing.

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…

We prove a homological stability theorem for families of discrete groups (e.g. mapping class groups, automorphism groups of free groups, braid groups) with coefficients in a sequence of irreducible algebraic representations of arithmetic…

We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimension is beyond a computable bound, the Markov bases consist…