Related papers: Conditional algorithmic Mordell

Given a prime $p$, a number field $\K$ and a finite set of places $S$ of $\K$, let $\K_S$ be the maximal pro-$p$ extension of $\K$ unramified outside $S$. Using the Golod-Shafarevich criterion one can often show that $\K_S/\K$ is infinite.…

Questions related to Brauer-Manin obstructions to the Hasse principle and weak approximation for homogeneous spaces of tori over a number field are well-studied, generally using arithmetic duality theorems, starting with works of Sansuc and…

Let $k_0$ be a number field, $K$ be a finite extension of $k_0(\!(x_1,...,x_n)\!)$ and let $R$ be the integral closure of $k_0[[x_1,...,x_n]]$ in $K$. Consider a group of multiplicative type $G$ defined over $K$. We study the…

Let $T$ be a theory which is t-minimal, meaning that with respect to some definable topology, a unary definable set $D \subseteq M$ has non-empty interior iff it is infinite. If $K$ is a definable field in $T$, then $K$ is finite or "large"…

Let $G:= (C^*)^k\times SL_2(C)$ act linearly on a vector space or its projectivisation. We obtain an effective criterion to detect whether a number of orbits in an orbit-closure is finite or not.

This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…

Let $G$ be a unimodular locally compact group. We define a property of irreducible unitary $G$-representations $V$ which we call c-temperedness, and which for the trivial $V$ boils down to F{\o}lner's condition (equivalent to the trivial…

The periodic tiling conjecture (PTC) asserts, for a finitely generated Abelian group $G$ and a finite subset $F$ of $G$, that if there is a set $A$ that solves the tiling equation $\mathbb{1}_F * \mathbb{1}_A = 1$, there is also a periodic…

Let $K$ be a complete algebraically closed non-archimedean valued field of characteristic zero, and let $X$ be a finite type scheme over $K$. We say $X$ is $K$-analytically Borel hyperbolic if, for every finite type reduced scheme $S$ over…

The benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect) encodings of Turing Machines to demonstrate their ability to…

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

Let $p$ be a fixed prime number, and $q$ a power of $p$. For any curve over $\mathbb{F}_q$ and any local system on it, we have a number field generated by the traces of Frobenii at closed points, known as the trace field. We show that as we…

Let $p$ be a prime. Tate and Voloch proved that a point of finite order in the algebraic torus cannot be $p$-adically too close to a fixed subvariety without lying on it. The current work is motivated by the analogy between torsion points…

The present paper presents and proves a proposition concerning the time complexity of finite languages. It is shown herein, that for any finite language (a language for which the set of words composing it is finite) there is a Turing…

Conditions on the Koszul complex of a noetherian local ring $R$ guarantee that $\mathrm{Tor}^{R}_{i}(M,N)$ is non-zero for infinitely many $i$, when $M$ and $N$ are finitely generated $R$-modules of infinite projective dimension. These…

Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…

The Cherednik-Orr conjecture expresses the $t\to\infty$ limit of the nonsymmetric Macdonald polynomials in terms of the PBW twisted characters of the affine level one Demazure modules. We prove this conjecture in several special cases.

It is shown that the toy Turing Tumble, suitably extended with an infinitely long game board and unlimited supply of pieces, is Turing-Complete. This is achieved via direct simulation of a Turing machine. Unlike previously informally…

We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We first consider groups which have normal form language in the…

We associate a bivariant theory to any suitable oriented Borel-Moore homology theory on the category of algebraic schemes or the category of algebraic G-schemes. Applying this to the theory of algebraic cobordism yields operational…