Related papers: Knapsack and subset sum problems in nilpotent, pol…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…
In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup of square matrices of size $k \times k$ with non-negative…
We study the Cauchy problem for NLS with a class of $H^s$-super-critical data \begin{align} & {\rm i}u_t +\Delta u+ \lambda |u|^{2\kappa} u =0, \quad u(0)=u_0 \label{NLSabstract} \end{align} and show that \eqref{NLSabstract} is globally…
The multiple knapsack problem with grouped items aims to maximize rewards by assigning groups of items among multiple knapsacks, considering knapsack capacities. Either all items in a group are assigned or none at all. We propose algorithms…
It is proved that any countable topological group in which the filter of neighborhoods of the identity element is not rapid contains a discrete set with precisely one nonisolated point. This gives a negative answer to Protasov's question on…
In our previous work, we proposed the logic obtained from full non-associative Lambek calculus by adding a sort of linear-logical modality. We call this logic non-associative non-commutative intuitionistic linear logic ($\mathbf{NACILL}$,…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
We study decidability and complexity questions related to a continuous analogue of the Skolem-Pisot problem concerning the zeros and nonnegativity of a linear recurrent sequence. In particular, we show that the continuous version of the…
We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…
We show that all amenable, minimal actions of a large class of nonamenable countable groups on compact metric spaces have dynamical comparison. This class includes all nonamenable hyperbolic groups, many HNN-extensions, nonamenable…
We study finitely generated nilpotent groups $G$ given by full rank finite presentations $\langle A \mid R\rangle$ in the variety $\mathcal{N}_c$ of nilpotent groups of class at most $c$, where $c \geq 2$. We prove that if the deficiency…
We prove that the rank problem is decidable in the class of torsion-free word-hyperbolic Kleinian groups. We also show that every group in this class has only finitely many Nielsen equivalence classes of generating sets of a given…
We show that the rational Novikov conjecture for a group $\Gamma$ of finite homological type follows from the mod 2 acyclicity of the Higson compactifcation of an E$\Gamma$. We then show that for groups of finite asymptotic dimension the…
We study the class of densely related groups. These are finitely generated (or more generally, compactly generated locally compact) groups satisfying a strong negation of being finitely presented, in the sense that new relations appear at…
Benchmark instances for the unbounded knapsack problem are typically generated according to specific criteria within a given constant range $R$, and these instances can be referred to as the unbounded knapsack problem with bounded…
We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…
We consider chance-constrained binary knapsack problems, where the weights of items are independent random variables with the means and standard deviations known. The chance constraint can be reformulated as a second-order cone constraint…
A group $G$ is called hereditarily non-topologizable if, for every $H\le G$, no quotient of $H$ admits a non-discrete Hausdorff topology. We construct first examples of infinite hereditarily non-topologizable groups. This allows us to prove…
We develop the Pl\"unnecke-Ruzsa and Balog-Szemer\'edi-Gowers theory of sum set estimates in the non-commutative setting, with discrete, continuous, and metric entropy formulations of these estimates. We also develop a Freiman-type inverse…