相关论文: Axiomatisability and hardness for universal Horn c…

We study the action of the mapping class group on the real homology of finite covers of a topological surface. We use the homological representation of the mapping class to construct a faithful infinite-dimensional representation of the…

Finitely generated (non-abelian) free metabelian pro-p groups, and wreath products of f.g. free abelian pro-p groups, are all finitely axiomatizable in the class of all profinite groups.

We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…

We show that the essentially algebraic theory of generalized algebraic theories, regarded as a category with finite limits, has a universal exponentiable arrow in the sense that any exponentiable arrow in any category with finite limits is…

Let S be an orientable surface of finite type. Using Pho-On's infinite unicorn paths, we prove the hyperfiniteness of orbit equivalence relations induced by the actions of the mapping class group of S on the Gromov boundaries of the arc…

For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…

For a fixed graph $H$ and for arbitrarily large host graphs $G$, the number of homomorphisms from $H$ to $G$ and the number of subgraphs isomorphic to $H$ contained in $G$ have been extensively studied in extremal graph theory and graph…

We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.

Gromov asked whether an asymptotic cone of a finitely generated group was always simply connected or had uncountable fundamental group. We prove that Gromov's dichotomy holds for asympotic cones with cut points, as well as, HNN extensions…

Let G be a noncocompact irreducible arithmetic group over a global function field K of characteristic p, and let H be a finite-index, residually p-finite subgroup of G. We show that the cohomology of H in the dimension of its associated…

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

This paper investigates the class of k-universal finite graphs, a local analog of the class of universal graphs, which arises naturally in the study of finite variable logics. The main results of the paper, which are due to Shelah,…

We study the problem HomsTo$H$ of counting, modulo 2, the homomorphisms from an input graph to a fixed undirected graph $H$. A characteristic feature of modular counting is that cancellations make wider classes of instances tractable than…

The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L^omega_{infty, omega} formula with counting quantifiers defines a linear…

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…

A survey of problems, conjectures, and theorems about quasi-isometric classification and rigidity for finitely generated solvable groups.

An infinite structure has the finite length property (over a given field) if, for each of its finite powers, chains of equivariant subspaces in the corresponding free vector space are bounded in length. Prior work showed that the countable…

In the present paper we prove lemmata on strong contractibility in asymptotic cones and metric ultraproducts which we apply to both the case of finitely generated word norms and the case of conjugation invariant norms. We recover…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this "fractal" property contributes to the spectacular properties of the homomorphism…