English
Related papers

Related papers: Knapsack problem for nilpotent groups

200 papers

The main goal of the paper is to present a general model theoretic framework to understand a result of Shalev on probabilistically finite nilpotent groups. We prove that a suitable group where the equation $[x_1,\ldots,x_k]=1$ holds on a…

Logic · Mathematics 2022-04-26 Daniel Palacín

It is shown that, for any pair of cardinals with infinite sum, there exist a group and an equation over this group such that the first cardinal is the number of solutions to this equation and the second cardinal is the number of…

Group Theory · Mathematics 2007-05-23 Anton A. Klyachko , Anton V. Trofimov

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

Group Theory · Mathematics 2022-02-11 Dominik Bernhardt , Tim Boykett , Alice Devillers , Johannes Flake , S. P. Glasby

The problem whether a given permutation group contains a permutation with a given cycle type is studied. This problem is known to be NP-complete. In this paper it is shown that the problem can be solved in logspace for a cyclic permutation…

Group Theory · Mathematics 2025-03-05 Markus Lohrey , Andreas Rosowski

We show that the problem of deciding for a given finite relation algebra A whether the network satisfaction problem for A can be solved by the k-consistency procedure, for some natural number k, is undecidable. For the important class of…

Logic · Mathematics 2025-10-07 Manuel Bodirsky , Simon Knäuer

We exhibit an extension of the category of class two nilpotent groups. It has the same objects but, unlike the latter, its morphisms are closed under pointwise addition of maps. At the same time the class of its morphisms is much smaller…

Group Theory · Mathematics 2007-05-23 Mamuka Jibladze , Teimuraz Pirashvili

We study a notion of indecomposability in differential algebraic groups which is inspired by both model theory and differential algebra. After establishing some basic definitions and results, we prove an indecomposability theorem for…

Logic · Mathematics 2014-10-24 James Freitag

We consider the capability of $p$ groups of class two and odd prime exponent. We use linear algebra and counting arguments to establish a number of new results. In particular, we settle the 4-generator case, and prove a sufficient condition…

Group Theory · Mathematics 2007-05-23 Arturo Magidin

Let $K$ be a multiquadratic extension of $\mathbb{Q}$ and let $\text{Cl}^{+}(K)$ be its narrow class group. Recently, the authors \cite{KP} gave a bound for $|\text{Cl}^{+}(K)[2]|$ only in terms of the degree of $K$ and the number of…

Number Theory · Mathematics 2021-03-09 Peter Koymans , Carlo Pagano

Let K be a set of infinite cardinals such that the cardinality of K is the first strong limit cardinal greater than uncountably many strong limit cardinals. We construct a family of pairwise non-embeddable groups which contains 2^k groups…

Group Theory · Mathematics 2026-01-08 Gerald Kuba

We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…

Computational Geometry · Computer Science 2013-02-12 Martin Cadek , Marek Krcal , Jiri Matousek , Lukas Vokrinek , Uli Wagner

Let $H, K$ be subgroups of the permutation group $G$ of degree $n$ with $K\trianglelefteq G$ and $\sigma$ be a partition of the set of all different prime divisors of $|G/K|$. We prove that in polynomial time (in $n$) one can check $G/K$…

Group Theory · Mathematics 2024-06-11 Viachaslau I. Murashka

We introduce a model of random f.g., torsion-free, $2$-step nilpotent groups (in short, $\tau_2$-groups). To do so, we show that these are precisely the groups that admit a presentation of the form $ \label{tau2pres_0}\langle A, C \mid…

Group Theory · Mathematics 2016-12-09 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

The knapsack problem (KP) is a very famous NP-hard problem in combinatorial optimization. Also its generalization to multiple dimensions named d-dimensional knapsack problem (d-KP) and to multiple knapsacks named multiple knapsack problem…

Computational Complexity · Computer Science 2016-11-24 Carolin Albrecht , Frank Gurski , Jochen Rethmann , Eda Yilmaz

A long-standing conjecture asserts that every finite non-abelian $p$-group has a non-inner automorphism of order $p$. In this paper, we settle the conjecture for a finite $p$-group ($p >2$) of nilpotency class $n$ with certain conditions.

Group Theory · Mathematics 2024-03-01 Sandeep Singh , Hemant Kalra , Rohit Garg

Goldmann and Russell (2002) initiated the study of the complexity of the equation satisfiability problem in finite groups by showing that it is in P for nilpotent groups while it is NP-complete for non-solvable groups. Since then, several…

Computational Complexity · Computer Science 2020-10-27 Armin Weiß

We consider ordered tuples in finite groups generating nilpotent subgroups. Given an integer $q$ we consider the poset of nilpotent subgroups of class less than $q$ and its corresponding coset poset. These posets give rise to a family of…

Group Theory · Mathematics 2014-02-26 Enrique Torres-Giese

We study finite groups $G$ with the property that for any subgroup $M$ maximal in $G$ whose order is divisible by all the prime divisors of $|G|$, $M$ is supersolvable. We show that any nonabelian simple group can occur as a composition…

Group Theory · Mathematics 2020-11-24 Alexander Moretó

A variant of the classical knapsack problem is considered in which each item is associated with an integer weight and a qualitative level. We define a dominance relation over the feasible subsets of the given item set and show that this…

Data Structures and Algorithms · Computer Science 2020-02-13 Luca E. Schäfer , Tobias Dietz , Maria Barbati , José Rui Figueira , Salvatore Greco , Stefan Ruzika

It is shown that the compositum $ \mathbb Q^{(2)}$ of all degree 2 extensions of $\mathbb Q$ has undecidable theory.

Logic · Mathematics 2020-11-03 Carlos Martinez-Ranero , Javier Utreras , Carlos R. Videla