English
Related papers

Related papers: Addendum to "Tilings problems on Baumslag-Solitar …

200 papers

We provide new computations in bounded cohomology: A group is boundedly acyclic if its bounded cohomology with trivial real coefficients is zero in all positive degrees. We show that there exists a continuum of finitely generated…

Group Theory · Mathematics 2022-10-24 Francesco Fournier-Facio , Clara Loeh , Marco Moraschini

We analyze the spectrum of the bosonic and superstring on the orbifold of the space-time by a boost, leading to the cosmological singularity. We show that the modular invariance leads to the spectrum where the twisted sector tachyon,…

High Energy Physics - Theory · Physics 2009-11-07 Nikita A. Nekrasov

Recently, Bruinier and Ono found an algebraic formula for the partition function in terms of traces of singular moduli of a certain non-holomorphic modular function. In this paper we prove that the rational polynomial having these singuar…

Number Theory · Mathematics 2020-07-02 Michael H. Mertens , Larry Rolen

The aim of this paper is threefold: a) Finding new direct and inverse results in the additive number theory concerning Minkowski sums of dilates. b) Finding a connection between the above results and some direct and inverse problems in the…

Number Theory · Mathematics 2013-03-15 G. A. Freiman , M. Herzog , P. Longobardi , M. Maj , Y. V. Stanchescu

In this short expository note, we give a detailed proof of Markov's theorem on the unsolvability of the homeomorphism problem and of the existence of unrecognizable manifolds in all dimensions larger than 3.

Geometric Topology · Mathematics 2026-03-26 Stefan Friedl , Tobias Hirsch , Marc Kegel

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

Group Theory · Mathematics 2022-05-02 Laura Ciobanu , Albert Garreta

We present an alternative approach to the result of Guentner, Higson, and Weinberger concerning the Baum-Connes conjecture for finitely generated subgroups of SL(2,C). Using finite-dimensional methods, we show that the Baum-Connes assembly…

Group Theory · Mathematics 2007-12-24 Dmitry Matsnev

A typical kind of question in mathematical logic is that for the necessity of a certain axiom: Given a proof of some statement $\phi$ in some axiomatic system $T$, one looks for minimal subsystems of $T$ that allow deriving $\phi$. In…

Logic · Mathematics 2014-08-25 Merlin Carl

Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston's height function approach to a nearly…

Combinatorics · Mathematics 2016-11-07 Igor Pak , Adam Sheffer , Martin Tassy

We show that the Diophantine problem(decidability of equations) is undecidable in free associative algebras over any field and in the group algebras over any field of a wide variety of torsion free groups, including toral relatively…

Logic · Mathematics 2016-06-28 Olga Kharlampovich , Alexei Myasnikov

The Monniaux Problem in abstract interpretation asks, roughly speaking, whether the following question is decidable: given a program $P$, a safety (\emph{e.g.}, non-reachability) specification $\varphi$, and an abstract domain of invariants…

Logic in Computer Science · Computer Science 2020-11-19 Nathanaël Fijalkow , Engel Lefaucheux , Pierre Ohlmann , Joël Ouaknine , Amaury Pouly , James Worrell

We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time…

Group Theory · Mathematics 2015-08-12 Alexei Myasnikov , Andrey Nikolaev , Alexander Ushakov

The outlines of a "Galois theory" for bimeromorphic geometry is here developed, via the study of model-theoretic definable binding groups in the theory CCM of compact complex spaces. As an application, a structure theorem about principal…

Logic · Mathematics 2025-12-15 Rahim Moosa , Anand Pillay

In a recent paper, it was shown that the problem of existence of a continuous map $X \to Y$ extending a given map $A \to Y$ defined on a subspace $A \subseteq X$ is undecidable, even for $Y$ an even-dimensional sphere. In the present paper,…

Algebraic Topology · Mathematics 2014-01-17 Lukáš Vokřínek

In this paper, we introduce several notions of "dimension" of a finite group, involving sizes of generating sets and certain configurations of maximal subgroups. We focus on the inequality $m(G) \leq \mathrm{MaxDim}(G)$, giving a family of…

Group Theory · Mathematics 2015-02-03 Ravi Fernando

For each Baumslag-Solitar group BS(m,n) (m,n nonzero integers), a totally disconnected, locally compact group, G_{m,n}, is constructed so that BS(m,n) is identified with a dense subgroup of G_{m,n}. The scale function on G_{m,n}, a…

Group Theory · Mathematics 2013-05-28 Murray Elder , George Willis

The automorphism group of a regular locally finite tree is shown to admit irreducible Banach representations that are not admissible. The dense subspace of smooth vectors contains no algebraically irreducible component.

Group Theory · Mathematics 2026-03-18 Nicolas Monod

Consider an automorphism group of a finite-dimensional algebra. S. Halperin conjectured that the unity component of this group is solvable if the algebra is a complete intersection. The solvability criterion recently obtained by M. Schulze…

Algebraic Geometry · Mathematics 2025-03-06 Alexander Perepechko

The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…

Logic in Computer Science · Computer Science 2017-03-06 Matthias Horbach , Marco Voigt , Christoph Weidenbach

We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$. We prove that the following are equivalent over the weak…

Logic in Computer Science · Computer Science 2023-06-22 Leszek Kołodziejczyk , Henryk Michalewski , Cécilia Pradic , Michał Skrzypczak
‹ Prev 1 8 9 10 Next ›