相关论文: The simultaneous conjugacy problem in groups of pi…

Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph…

We consider continuous linear programs over a continuous finite time horizon $T$, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions, where we search for optimal solutions in the space…

Finding unambiguous diagrammatic representations for first-order logical formulas and relational queries with arbitrarily nested disjunctions has been a surprisingly long-standing unsolved problem. We refer to this problem as the…

We study Clustered Planarity with Linear Saturators, which is the problem of augmenting an $n$-vertex planar graph whose vertices are partitioned into independent sets (called clusters) with paths - one for each cluster - that connect all…

Comparing and recognizing metrics can be extraordinarily difficult because of the group of diffeomorphisms. Two metrics, that could even be the same, could look completely different in different coordinates. This is the gauge problem. The…

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…

In this paper we give a unitary approach for the simultaneous study of the convergence of discrete and integral operators described by means of a family of linear continuous functionals acting on functions defined on locally compact…

We study existence, uniqueness, and distributional aspects of generalized solutions to the Cauchy problem for first-order symmetric (or Hermitian) hyperbolic systems of partial differential equations with Colombeau generalized functions as…

Baumslag-Solitar groups were introduced in 1962 by Baumslag and Solitar as examples for finitely presented non-Hopfian two-generator groups. Since then, they served as examples for a wide range of purposes. As Baumslag-Solitar groups are…

We show that the conjugacy problem in a wreath product $A \wr B$ is uniform-$\mathsf{TC}^0$-Turing-reducible to the conjugacy problem in the factors $A$ and $B$ and the power problem in $B$. If $B$ is torsion free, the power problem for $B$…

It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form…

Let $PL_0(I)$ represent the group of orientation-preserving piecewise-linear homeomorphisms of the unit interval which admit finitely many breaks in slope, under the operation of composition. We find a non-solvable group $W$ and show that…

We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to…

We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is metrically subregular or that the inverse of the monotone…

A new presentation of the $n$-string braid group $B_n$ is studied. Using it, a new solution to the word problem in $B_n$ is obtained which retains most of the desirable features of the Garside-Thurston solution, and at the same time makes…

We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well known cycling and…

Lattice regularizations are pivotal in the non-perturbative quantization of gauge field theories. Wilson's proposal to employ group-valued link fields simplifies the regularization of gauge fields in principal fiber bundles, preserving…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

In this short note, we show two NP-completeness results regarding the \emph{simultaneous representation problem}, introduced by Lubiw and Jampani. The simultaneous representation problem for a given class of intersection graphs asks if some…