Related papers: Finding All Solutions of Equations in Free Groups …
The subject logic in computer science should entail proof theoretic applications. So the question arises whether open problems in computational complexity can be solved by advanced proof theoretic techniques. In particular, consider the…
In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…
We construct group codes over two letters (i.e., bases of subgroups of a two-generated free group) with special properties. Such group codes can be used for reducing algorithmic problems over large alphabets to algorithmic problems over a…
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…
We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse…
Inspired by Brown's collapsing method (or discrete Morse theory) to obtain a free resolution of $\bbZ$ over the monoid ring $\bbZ M$, we apply algebraic discrete Morse theory to compute the homology groups of Lawvere theories, which is…
We present an algorithmic approach to the conjugacy problems in monoids and semigroups, using rewriting systems. There is a class of monoids and semigroups that satisfy the condition that the transposi- tion problem and the left and right…
We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse…
In this paper, we study the existence of random periodic solutions for semilinear SPDEs on a bounded domain with a smooth boundary. We identify them as the solutions of coupled forward-backward infinite horizon stochastic integral equations…
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…
For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…
We present a PSPACE algorithm that decides satisfiability of the graded modal logic Gr(K_R)---a natural extension of propositional modal logic K_R by counting expressions---which plays an important role in the area of knowledge…
An involution on a finite set is a bijection such as I(I(e))=e for all the element of the set. A fixed-point free involution on a finite set is an involution such as I(e)=e for none element of the set. In this article, the fixed-point free…
We study the problem of deciding whether some PSPACE-complete problems have models of bounded size. Contrary to problems in NP, models of PSPACE-complete problems may be exponentially large. However, such models may take polynomial space in…
We give a solution to the inverse problem (given a function, find a corresponding group) for large classes of speed, entropy, isoperimetric profile, return probability and $L_p$-compression functions of finitely generated groups of…
Inverse problems are ubiquitous in science and engineering. Many of these are naturally formulated as a PDE-constrained optimization problem. These non-linear, large-scale, constrained optimization problems know many challenges, of which…
Polynomial optimization encompasses a broad class of problems in which both the objective function and constraints are polynomial functions of the decision variables. In recent years, a substantial body of research has focused on…
Many natural optimization problems derived from $\sf NP$ admit bilevel and multilevel extensions in which decisions are made sequentially by multiple players with conflicting objectives, as in interdiction, adversarial selection, and…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…
Combining the the results of A.R. Meyer and L.J. Stockmeyer "The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space", and K.S. Booth "Isomorphism testing for graphs, semigroups, and finite automata are…