Related papers: Some notes on extended equation solvability and id…

We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…

All groups are 2-generator. For any prime-power q, Theorem 1 constructs a solvable matrix group over a quotient of a Laurent polynomial ring. This group is closely related to a group of exponent q as shown in Theorems 2 & 3 . Theorem 4 in…

Exponential equations in free groups were studied initially by Lyndon and Schutzenberger and then by Comerford and Edmunds. Comerford and Edmunds showed that the problem of determining whether or not the class of quadratic exponential…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators map this cycle into new cycles containing all the elements of…

Motivated by Popa's seminal work \cite{Po04}, in this paper, we provide a fairly large class of examples of group actions $\Gamma \curvearrowright X$ satisfying the extended Neshveyev-St{\o}rmer rigidity phenomenon \cite{NS03}: whenever…

We introduce the notion of a powerfully solvable group. These are powerful groups possessing an abelian series of a special kind. These groups include in particular the class of powerfully nilpotent groups. We will also see that for a…

We study the problem of whether a given finite algebra with finitely many basic operations contains a cube term; we give both structural and algorithmic results. We show that if such an algebra has a cube term then it has a cube term of…

We study two classes of extension problems, and their interconnections: (i) Extension of positive definite (p.d.) continuous functions defined on subsets in locally compact groups $G$; (ii) In case of Lie groups, representations of the…

Semistability at infinity is an asymptotic property of finitely presented groups that is needed in order to effectively define the fundamental group at infinity for a 1-ended group. It is an open problem whether or not all finitely…

We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an $\omega$-categorical algebra $\mathfrak{A}$. There are $\omega$-categorical groups where this problem is…

In this paper, we prove that the intersection of all non-nilpotent maximal subgroups of a non-solvable group containing the normalizer of some Sylow subgroup is nilpotent, which provides an extension of Shlyk's theorem.

We present new, unified proofs for the cell-like, $\mathbb{Z}/p$-, and $\mathbb{Q}$-resolution theorems. Our arguments employ extensions that are much simpler then those used by our predecessors. The techniques allow us to solve problems…

We establish an equivalence between categories of 'formally nilpotent' Lie algebras and exponential groups in characteristic zero. It extends the equivalences of Mal'cev, Lazard, Quillen and Warfield, and applies to groups under composition…

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

For $G$ a finite group, let $d_2(G)$ denote the proportion of triples $(x, y, z) \in G^3$ such that $[x, y, z] = 1$. We determine the structure of finite groups $G$ such that $d_2(G)$ is bounded away from zero: if $d_2(G) \geq \epsilon >…

We construct uncountably categorical 3-nilpotent groups of exponent p > 3. They are not one-based and do not allow the interpretation of an infinite field. Therefore they are counterexamples to Zilbers Conjecture. First 2-nilpotent new…

In the nineties Immerman and Medina initiated the search for syn- tactic tools to prove NP-completeness. In their work, amongst several results, they conjecture that the NP-completeness of a problem defined by the conjunction of a sentence…

In this paper, we are going to look at the $c$-nilpotent multiplier of a group $G$, ${\cal N}_cM(G)$, as a functor from the category of all groups, ${\cal G}roup$, to the category of all abelian groups, ${\cal A}b$, and focusing on some…

In this paper we study the nilpotency of certain groups of self homotopy equivalences. Our main goal is to extend, to localized homotopy groups and/or homotopy groups with coefficients, the general principle of Dror and Zabrodsky by which a…