相关论文: The Hurwitz Equivalence Problem is Undecidable

We show that it is impossible to algorithmically decide if the l^2-cohomology of the universal cover of a finite CW complex is trivial, even if we only consider complexes whose fundamental group is equal to the elementary amenable group…

Recent work by Atserias and Dawar (J. Log. Comp 2019) and Tucker-Foltz (LMCS 2024) has established undefinability results in fixed-point logic with counting (FPC) corresponding to many classical complexity results from the hardness of…

In our article in MCU'2013 we state the the Domino problem is undecidable for all Baumslag-Solitar groups $BS(m,n)$, and claim that the proof is a direct adaptation of the construction of a weakly aperiodic subshift of finite type for…

For any nonconstant f,g in C(x) such that the numerator H(x,y) of f(x)-g(y) is irreducible, we compute the genus of the normalization of the curve H(x,y)=0. We also prove an analogous formula in arbitrary characteristic when f and g have no…

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the satisfiability problem for this logic is undecidable in…

We build a variant of Collatz Conjecture for polynomials over $\mathbb{F}_2$ and we prove that it is solved. By the way, we give several examples.

In this paper, we aim to provide an accessible survey to various formulae for calculating single Hurwitz numbers. Single Hurwitz numbers count certain classes of meromorphic functions on complex algebraic curves and have a rich geometric…

We prove that one cannot algorithmically decide whether a finitely presented $\mathbb{Z}$-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the…

We prove a homological stabilization theorem for Hurwitz spaces: moduli spaces of branched covers of the complex projective line. This has the following arithmetic consequence: let l>2 be prime and A a finite abelian l-group. Then there…

We show that the Hurwitz scheme $\mathcal{H}_{g,d}$ parametrizing $d$-sheeted simply branched covers of the projective line by smooth curves of genus $g$, up to isomorphism, is unirational for $(g,d)=(10,8)$ and $(13,7)$. The unirationality…

We show that the spectral gap problem is undecidable. Specifically, we construct families of translationally-invariant, nearest-neighbour Hamiltonians on a 2D square lattice of d-level quantum systems (d constant), for which determining…

We extend a holomorphic projection argument of our earlier work to prove a novel divisibility result for non-holomorphic congruences of Hurwitz class numbers. This result allows us to establish Ramanujan-type congruences for Hurwitz class…

Given any matrix B in SL(2,Z), we will describe an algorithm that provides at least one elliptic fibration over the disk, relatively minimal and Lefschetz, within each topological equivalence class, whose total monodromy is the conjugacy…

We show that the first cohomology group of the Hurwitz space of fully-marked admissible covers $H^1(\overline{\mathcal{H}}_{\underline{d},\underline{g}}(\underline{\mu}))$ vanishes for covers of degree $ d = 3$ and deduce the same result…

Let $G_2(q)$ be the Chevalley group of type $G_2$ defined over a finite field with q=p^n elements, where p is a prime number and $n$ is a positive integer. In this paper, we determine when the restriction of an absolutely irreducible…

$ $We study solutions of difference equations in the rings of sequences and, more generally, solutions of equations with a monoid action in the ring of sequences indexed by the monoid. This framework includes, for example, difference…

We study the complexity of the classification problem for Cartan subalgebras in von Neumann algebras. We construct a large family of II$_1$ factors whose Cartan subalgebras up to unitary conjugacy are not classifiable by countable…

Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…

Altenbernd, Thomas and W\"ohrle have considered acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with usual acceptance conditions, such as the B\"uchi and Muller ones [1]. It was proved…

We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…