Related papers: Post's correspondence problem for hyperbolic and v…

We consider the isomorphism problem for hypergraphs taking as input two hypergraphs over the same set of vertices $V$ and a permutation group $\Gamma$ over domain $V$, and asking whether there is a permutation $\gamma \in \Gamma$ that…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

The CP violation gives rise to severe restriction of soft breaking terms in supersymmetric standard models. Among them, constraints on the holomorphic soft mass of Higgs doublets (the B parameter) are difficult to satisfy due to the other…

We show the problem of counting homomorphisms from the fundamental group of a homology $3$-sphere $M$ to a finite, non-abelian simple group $G$ is #P-complete, in the case that $G$ is fixed and $M$ is the computational input. Similarly,…

If $G_1$ and $G_2$ are torsion-free hyperbolic groups and $P<G_1\times G_2$ is a finitely generated subdirect product, then the conjugacy problem in $P$ is solvable if and only if there is a uniform algorithm to decide membership of the…

We establish a connection between the generalized conjugacy problem for a $G$-by-$\mathbb{Z}$ group, $GCP(G \rtimes \mathbb{Z})$, and two algorithmic problems for $G$: the generalized Brinkmann's conjugacy problem, $GBrCP(G)$, and the…

A constraint satisfaction problem (CSP) is a problem of computing a homomorphism ${\bf R} \rightarrow {\bf \Gamma}$ between two relational structures. Analyzing its complexity has been a very fruitful research direction, especially for…

We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages. By using linear algebra and a branching analog of the classic Euler theorem, we show that, under an…

We generalize a framework of list colouring results to correspondence colouring. Correspondence colouring is a generalization of list colouring wherein we localize the meaning of the colours available to each vertex. As pointed out by…

Let V be an 2n-dimensional vector space over an algebraically closed field of odd characteristic. Let G = GL(V), and H = Sp(V) the symplectic group contained in G. For a positive integer r > 1, we conisder the variety X = G/H \times…

Let $G$ be a nilpotent Lie group and let $\pi$ be a coherent state representation of $G$. The interplay between the cyclicity of the restriction $\pi|_{\Gamma}$ to a lattice $\Gamma \leq G$ and the completeness of subsystems of coherent…

The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…

The Diophantine problem for a monoid $M$ is the decision problem to decide whether any given system of equations has a solution in $M$. In this note, we give a simple example of a context-free, word-hyperbolic, finitely presented, special…

Representation stability in the sense of Church-Farb is concerned with stable properties of representations of sequences of algebraic structures, in particular of groups. We study this notion on objects arising in toric topology. With a…

We present a structural classification of constraint satisfaction problems (CSP) described by reflexive complete $2$-edge-coloured graphs. In particular, this classification extends the structural dichotomy for graph homomorphism problems…

We prove that, although it is undecidable if a subgroup fixed by an automorphism intersects nontrivially an arbitrary subgroup of $F_n\times F_m$, there is an algorithm that, taking as input a monomorphism and an endomorphism of $F_n\times…

We study the word and conjugacy problems in lacunary hyperbolic groups (briefly, LHG). In particular, we describe a necessary and sufficient condition for decidability of the word problem in LHG. Then, based on the graded small-cancellation…

Counting problems in general and counting graph homomorphisms in particular have numerous applications in combinatorics, computer science, statistical physics, and elsewhere. One of the most well studied problems in this area is…

Let $G$ and $H$ be two simple graphs. A bijection $\phi:V(G)\rightarrow V(H)$ is called an isomorphism between $G$ and $H$ if $(\phi v_i)(\phi v_j)\in E(H)$ $\Leftrightarrow$ $v_i v_j\in E(G)$, $\forall v_i,v_j \in V(G)$. In the case that…

Conditions for CP violation in the scalar potential sector of general N-Higgs-doublet models (NHDMs) are analyzed from a group theoretical perspective. For the simplest two-Higgs-doublet model (2HDM) potential, a minimum set of conditions…