Related papers: Some simple theories from a Boolean algebra point …
We give a definition of some classes of boolean algebras generalizing free boolean algebras; they satisfy a universal property that certain functions extend to homomorphisms. We give a combinatorial property of generating sets of these…
We show an isomorphism between an algebra which is naturally constructed from the Toeplitz algebra generated by d-shifts, and an ideal of the C * -algebra of the (2d + 1)-dimensional Heisenberg group. This is a particular case of a more…
This paper contributes to the set-theoretic side of understanding Keisler's order. We consider properties of ultrafilters which affect saturation of unstable theories: the lower cofinality $\lcf(\aleph_0, \de)$ of $\aleph_0$ modulo $\de$,…
We show that (with one possible exception) there exist strongly dense free subgroups in any semisimple algebraic group over a large enough field. These are nonabelian free subgroups all of whose subgroups are either cyclic or Zariski dense.…
This article surveys results regarding the Tukey theory of ultrafilters on countable base sets. The driving forces for this investigation are Isbell's Problem and the question of how closely related the Rudin-Keisler and Tukey…
We investigate the K-theory of twisted higher-rank-graph algebras by adapting parts of Elliott's computation of the K-theory of the rotation algebras. We show that each 2-cocycle on a higher-rank graph taking values in an abelian group…
Let \mathcal{F}_k denote the family of 2-edge-colored complete graphs on 2k vertices in which one color forms either a clique of order k or two disjoint cliques of order k. Bollob\'as conjectured that for every \epsilon>0 and positive…
A free semigroupoid algebra is the closure of the algebra generated by a TCK family of a graph in the weak operator topology. We obtain a structure theory for these algebras analogous to that of free semigroup algebra. We clarify the role…
For two graphs $T$ and $H$ with no isolated vertices and for an integer $n$, let $ex(n,T,H)$ denote the maximum possible number of copies of $T$ in an $H$-free graph on $n$ vertices. The study of this function when $T=K_2$ is a single edge…
We develop a theory of higher order structures in compact abelian groups. In the frame of this theory we prove general inverse theorems and regularity lemmas for Gowers's uniformity norms. We put forward an algebraic interpretation of the…
In 2002, D. Fon-Der-Flaass constructed a prolific family of strongly regular graphs. In this paper, we prove that for infinitely many natural numbers $n$, this family contains $n^{\Omega(n^{2/3})}$ strongly regular $n$-vertex graphs $X$…
In the aftermath of the Robertson--Seymour Graph Minor Theorem, Thomas conjectured that the countable graphs are well-quasi-ordered under the minor relation. We prove that this conjecture, when restricted to graphs with no infinite paths…
A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\left\{G(n, cn^{-1})\right\}$ is not complete. This paper proposes and proves what the complete set of…
Bollob\'as and Nikiforov conjectured that for any graph $G \neq K_n$ with $m$ edges \[ \lambda_1^2+\lambda_2^2\le \bigg( 1-\frac{1}{\omega(G)}\bigg)2m\] where $\lambda_1$ and $\lambda_2$ denote the two largest eigenvalues of the adjacency…
The minimum number of observations such that the maximum likelihood estimator in a Gaussian graphical model exists with probability one is called the maximum likelihood threshold of the underlying graph G. The natural algebraic relaxation…
We introduce twisted relative Cuntz-Krieger algebras associated to finitely aligned higher-rank graphs and give a comprehensive treatment of their fundamental structural properties. We establish versions of the usual uniqueness theorems and…
The majority of popular graph kernels is based on the concept of Haussler's $\mathcal{R}$-convolution kernel and defines graph similarities in terms of mutual substructures. In this work, we enrich these similarity measures by considering…
We introduce filtered algebraic $K$-theory of a ring $R$ relative to a sublattice of ideals. This is done in such a way that filtered algebraic $K$-theory of a Leavitt path algebra relative to the graded ideals is parallel to the gauge…
We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…
We classify the ultrahomogeneous complete 3-edge-coloured graphs (3-graphs) with simple theory. This extends Lachlan's result (a corollary of the Effective Classification Theorem for stable structures) classifying the stable homogeneous…