Related papers: Strongly incompressible curves

For a reductive group $G$ over a finite field $k$, and a smooth projective curve $X/k$, we give a motivic counting formula for the number of absolutely indecomposable $G$-bundles on $X$. We prove that the counting can be expressed via the…

Let $E$ be a $\mathbb Q$-curve without complex multiplication. We address the problem of deciding whether $E$ is geometrically isomorphic to a strongly modular $\mathbb Q$-curve. We show that the question has a positive answer if and only…

A Beauville surface (of unmixed type) is a complex algebraic surface which is the quotient of the product of two curves of genus at least 2 by a finite group G acting freely on the product, where G preserves the two curves and their…

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

Let $K=k(C)$ be the function field of a smooth projective curve $C$ over an infinite field $k$, let $X$ be a projective variety over $k$. We prove two results. First, we show with some conditions that a $K$-morphism $\phi: X_K \to X_K$ of…

L\"uroth's theorem describes the dominant maps from rational curves over a field. In this note we study those dominant rational maps from cartesian powers $X^{\Psi}$ of geometrically irreducible varieties $X$ over a field $k$ for infinite…

We prove that for every smooth projective integral curve $X$ of genus at least $2$ over $\mathbb C$, there exists $x \in X(\mathbb C)$ such that no connected finite \'etale cover of $X-\{x\}$ admits a nonconstant morphism to $\mathbb G_m$.…

A graph polynomial $P$ is weakly distinguishing if for almost all finite graphs $G$ there is a finite graph $H$ that is not isomorphic to $G$ with $P(G)=P(H)$. It is weakly distinguishing on a graph property $\mathcal{C}$ if for almost all…

This work can be thought as a contribution to the model theory of group extensions. We study the groups G which are interpretable in the disjoint union of two structures (seen as a two-sorted structure). We show that if one of the two…

In this note, we prove that if G is a countable group that contains a nonabelian free subgroup then every pair of nontrivial Bernoulli shifts over G are weakly isomorphic.

A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory…

In this paper we complete the study of the Lan-Sheng-Zuo conjecture proposed in arXiv:1210.8280 for the curve case. Precisely, we prove that every semistable Higgs bundle is strongly semistable for curves of genus $g\leq 1$, and over any…

If a smooth, geometrically rational surface over a finite field is not rational over that field, then over some finite extension of that field the Brauer group of the surface is nonzero. In particular such a surface is not stably rational.…

Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…

Let K be a field and G a finite group. The question of 'admissibility' of G over K was originally posed by Schacher, who gave partial results in the case K = Q. In this paper, we give necessary conditions for admissibility of a finite group…

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…

If $G$ is an abelian group, we say $S\subset G$ is a set of recurrence if for every probability measure preserving $G$-system $(X,\mu,T)$ and every $D\subset X$ having $\mu(D)>0$, there is a $g\in S$ such that $\mu(D\cap T^{g}D)>0$. We say…

A set of vertices $X$ of a graph $G$ is a strong edge geodetic set if to any pair of vertices from $X$ we can assign one (or zero) shortest path between them such that every edge of $G$ is contained in at least one on these paths. The…

Given a set B of finite rooted graphs and a radius r as an input, we prove that it is undecidable to determine whether there exists a sequence (G_i) of finite bounded degree graphs such that the rooted r-radius neighbourhood of a random…