Related papers: Exponential Genus Problems in one-relator products…

We consider the three finite free convolutions for polynomials studied in a recent paper by Marcus, Spielman, and Srivastava. Each can be described either by direct explicit formulae or in terms of operations on randomly rotated matrices.…

We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…

We design new deterministic and randomized algorithms for computational problems in free solvable groups. In particular, we prove that the word problem and the power problem can be solved in quasi-linear time and the conjugacy problem can…

Some new decidability results for multiplicative matrix equations over algebraic number fields are established. In particular, special instances of the so-called knapsack problem are considered. The proofs are based on effective methods for…

We introduce Exponential Family Discriminant Analysis (EFDA), a unified generative framework that extends classical Linear Discriminant Analysis (LDA) beyond the Gaussian setting to any member of the exponential family. Under the assumption…

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…

Suppose a group $G$ is quasi-isometric to a free product of a finite set $S$ of finitely generated abelian groups; let $S'$ denote the set of ranks of the free abelian parts of the groups in $S$. Then $G$ is commensurable with the free…

In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves…

We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…

In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in…

We describe the endomorphisms of the direct product of two free groups of finite rank and obtain conditions for which the subgroup of fixed points is finitely generated and we do the same for periodic points. We also describe the…

We study the Diophantine problem, i.e. the decision problem of solving systems of equations, for some families of one-relator groups, and provide some background for why this problem is of interest. The method used is primarily the…

The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…

The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…

The starting point of this work is that the class of evolution algebras over a fixed field is closed under tensor product. This arises questions about the inheritance of properties from the tensor product to the factors and conversely. For…

We derive upper and lower bounds on the determinant of an exponential matrix. They can be transformed into corresponding bounds for the determinant of a univariate Gaussian matrix.

We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also…

We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…

In this paper we prove that the Diophantine problem in iterated restricted wreath products $G$ of arbitrary non-trivial free abelian groups $A_1,\ldots, A_k$, $k>1$ of finite ranks is undecidable, i.e., there is no algorithm that given a…

Large complexity classes, like the exponential time hierarchy, received little attention in terms of finding complete problems. In this work a generalization of propositional logic is investigated which fills this gap with the introduction…