Related papers: Sofic profile and computability of Cremona groups
Surface groups are determined among limit groups by their profinite completions. As a corollary, the set of surface words in a free group is closed in the profinite topology.
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…
We study groups and rings definable in d-minimal expansions of ordered fields. We generalize to such objects some known results from o-minimality. In particular, we prove that we can endow a definable group with a definable topology making…
This paper contains a new proof of the classification of elements of prime order in the Cremona group Bir(P^2), up to conjugation. In addition, we give explicit geometric constructions of these Cremona transformations, and provide a…
The Cremona group of birational transformations of $\mathbb{P}^2_\mathbb{C}$ acts on the space $\mathbb{F}(2)$ of holomorphic foliations on the complex projective plane. Since this action is not compatible with the natural graduation of…
The plane Cremona group over the finite field $\mathbb{F}_2$ is generated by three infinite families and finitely many birational maps with small base orbits. One family preserves the pencil of lines through a point, the other two preserve…
In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. The purpose of this paper is to survey the basic results of…
In this article we will describe a finitely presented subgroup of Monod's group of piecewise projective homeomorphisms of R. This in particular provides a new example of a finitely presented group which is nonamenable and yet does not…
Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
We construct invariants of birational maps with values in the Kontsevich--Tschinkel group and in the truncated Grothendieck groups of varieties. These invariants are morphisms of groupoids and are well-suited to investigating the structure…
Two birational subvarieties of P^n are called Cremona equivalent if there is a Cremona modification of P^n mapping one to the other. If the codimension of the varieties is at least 2 then they are always Cremona Equivalent. For divisors the…
We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…
We classify closed curves isomorphic to the affine line in the complement of a smooth rational projective plane conic Q. Over a field of characteristic zero, we show that up to the action of the subgroup of the Cremona group of the plane…
We establish that, under certain closure assumptions on a pseudovariety of semigroups, the corresponding relatively free profinite semigroups freely generated by a non-singleton finite set act faithfully on their minimum ideals. As…
We exhibit infinitely many natural numbers $n$ for which there exists at least one insolvable group of order $n$, and yet the holomorph of any solvable group of order $n$ has no insolvable regular subgroup. We also solve Problem 19.90 (d)…
Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…
Answering some queries of Weiss, we prove that the free product and amenable extensions of sofic groups are sofic as well, and give an example of a finitely generated sofic group that is not residually amenable.
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
We show that the action of Cremona transformations on the real points of quadrics exhibits the full complexity of the diffeomorphisms of the sphere, the torus, and of all non-orientable surfaces. The main result says that if X is rational,…