English
Related papers

Related papers: A report on Tarski's decidability problem

200 papers

This continues recent work in a paper by Corner, Gobel and Goldsmith. A particular question was left open: Is it possible to carry over the results concerning the undecidability of torsion--free Crawley groups to modules over the ring of…

Logic · Mathematics 2007-05-23 Rüdiger Göbel , Saharon Shelah

Ostrogradsky's construction of a Hamiltonian formalism for nondegenerate higher derivative Lagrangians is reviewed. The resulting instability imposes by far the most powerful restriction on fundamental, interacting, continuum Lagrangian…

High Energy Physics - Theory · Physics 2015-08-11 R. P. Woodard

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

Group Theory · Mathematics 2018-07-04 Matteo Cavaleri

The knapsack problem for groups was introduced by Miasnikov, Nikolaev, and Ushakov. It is defined for each finitely generated group $G$ and takes as input group elements $g_1,\ldots,g_n,g\in G$ and asks whether there are $x_1,\ldots,x_n\ge…

Group Theory · Mathematics 2021-01-18 Pascal Bergsträßer , Moses Ganardi , Georg Zetzsche

This is an English translation of the following paper, published several years ago: Nikonorov Yu.G., Nikonorova Yu.V. Generalized Popoviciu's problem (Russian), Tr. Rubtsovsk. Ind. Inst., 7, 229-232 (2000), Zbl. 0958.51021. All inserted…

History and Overview · Mathematics 2018-06-12 Yu. G. Nikonorov , Yu. V. Nikonorova

In an earlier paper, we gave an abstract formulation of a theorem of Sierpi\'nski in uncountable commutative groups. In this paper, we prove a result which generalizes the earlier formulation.

Functional Analysis · Mathematics 2019-09-16 Debashish Sen , Sanjib Basu

We show the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the…

Group Theory · Mathematics 2019-12-02 Arman Darbinyan

Using the theory developed by Olga Kharlampovich, Alexei Miasnikov, and, independently, by Zlil Sela to describe the set of homomorphisms of a f.g. group G into a free group F, we describe the solutions to equations with coefficients from F…

Group Theory · Mathematics 2014-03-27 Nicholas W M Touikan

Sacerdote [Sa] has shown that the non-Abelian free groups satisfy precisely the same universal-existential sentences Th(F$_2$)$\cap \forall \exists $ in a first-order language L$_o$ appropriate for group theory. It is shown that in every…

Group Theory · Mathematics 2009-09-25 Anthony Gaglione , Dennis Spellman

We develop a version of Freiman's theorem for a class of non-abelian groups, which includes finite nilpotent, supersolvable and solvable A-groups. To do this we have to replace the small doubling hypothesis with a stronger relative…

Classical Analysis and ODEs · Mathematics 2012-12-04 Tom Sanders

Tarski's relevance logic is defined and shown to contain many formulas and derived rules of inference. The definition arises from Tarski's work on first-order logic restricted to finitely many variables. It is a relevance logic because it…

Logic · Mathematics 2019-03-05 Roger D. Maddux

Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the Brin-Thompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational…

Group Theory · Mathematics 2018-10-30 James Belk , Collin Bleak

We show that it is undecidable whether a system of linear equations over the Laurent polynomial ring $\mathbb{Z}[X^{\pm}]$ admit solutions where a specified subset of variables take value in the set of monomials $\{X^z \mid z \in…

Symbolic Computation · Computer Science 2024-09-09 Ruiwen Dong

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

Logic · Mathematics 2025-07-14 Jana Maříková

WeintroducethenotionofderivedformalnoncommutativeZariski immersion for differential graded algebra with examples from topology. We il- lustrate the importance of such notion by reformulating the Friedlander-Milnor conjecture in terms of…

Algebraic Topology · Mathematics 2016-03-04 Ilias Amrani

A short reply to Jarzynski's comment cond-mat/0509344 on my paper ``Flaw of Jarzynski's equality when applied to systems with several degrees of freedom'' (cond--mat/0508721) is presented.

Statistical Mechanics · Physics 2007-05-23 D. H. E. Gross

We give upper bounds for triples of subsets of a finite group such that the triples of elements that multiply to 1 form a perfect matching. Our bounds are the first to give exponential savings in powers of an arbitrary finite group.…

Combinatorics · Mathematics 2017-02-06 Will Sawin

The statement ``no nonabelian simple group can be obtained from a nonsimple group by adding one generator and one relator" 1) is equivalent to the Kervaire--Laudenbach conjecture; 2) becomes true under the additional assumption that the…

Group Theory · Mathematics 2016-09-07 Anton A. Klyachko

We survey results related to the important Hossz\'u-Gluskin Theorem on $n$-ary groups adding also several new results and comments. The aim of this paper is to write all such results in uniform and compressive forms. Therefore some proofs…

Group Theory · Mathematics 2008-11-26 Wieslaw A. Dudek , Kazimierz Glazek

We lay the foundations for a model theoretic study of proalgebraic groups. Our axiomatization is based on the tannakian philosophy. Through a tensor analog of skeletal categories we are able to consider neutral tannakian categories with a…

Logic · Mathematics 2019-08-28 Anand Pillay , Michael Wibmer