Related papers: Post's correspondence problem for hyperbolic and v…
We consider the possibility problem of determining if a document is a possible world of a probabilistic document, in the setting of probabilistic XML. This basic question is a special case of query answering or tree automata evaluation, but…
The CSP dichotomy conjecture has been recently established, but a number of other dichotomy questions remain open, including the dichotomy classification of list homomorphism problems for signed graphs. Signed graphs arise naturally in many…
The complexity of graph homomorphism problems has been the subject of intense study. It is a long standing open problem to give a (decidable) complexity dichotomy theorem for the partition function of directed graph homomorphisms. In this…
In the standard model QCD Lagrangian, a term of CP violating gluon density is theoretically expected to have a physical coefficient $\bar{\theta}$ of the order of unity. However, the upper bound on the electric dipole moment of neutron…
We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…
The power word problem for a group $G$ asks whether an expression $u_1^{x_1} \cdots u_n^{x_n}$, where the $u_i$ are words over a finite set of generators of $G$ and the $x_i$ binary encoded integers, is equal to the identity of $G$. It is a…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
There are considered differential substitutions of the form $v=P(x,u,u_{x})$ for which there exists a differential operator $H=\sum^{k}_{i=0} \alpha_{i} D^{i}_{x}$ such that the differential substitution maps the equation…
Let $\mathbb{R}_{+}^{n+1}$ \ be the half-space model of the hyperbolic space $\mathbb{H}^{n+1}.$ It is proved that if $\Gamma\subset\left\{ x_{n+1}=0\right\} \subset\partial_{\infty}\mathbb{H}^{n+1}$ is a bounded $C^{0}$ Euclidean graph…
The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…
The local Hamiltonian problem is famously complete for the class QMA, the quantum analogue of NP. The complexity of its semi-classical version, in which the terms of the Hamiltonian are required to commute (the CLH problem), has attracted…
This work settles the Eichler-Shimura congruence relation of Blasius and Rogawski for certain 5-dimensional Hodge-type Shimura varieties, that were not tractable by previously known methods. In a more general context we introduce a…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
We study bounds on nilpotence in H*(BG), the mod p cohomology of the classifying space of a compact Lie group G. Part of this is a report of our previous work on this problem, updated to reflect the consequences of Peter Symonds recent…
The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…
Let P be a finite metacyclic 2-group and F a fusion system on P. We prove that F is nilpotent unless P has maximal class or P is homocyclic, i.e. P is a direct product of two isomorphic cyclic groups. As a consequence we obtain the…
For any (Hausdorff) compact group $G$ with the normalized Haar measure ${\mathbf m}_G$, denote by ${\rm cp}(G)$ the probability ${\mathbf m}_{G\times G}(\{(x,y)\in G\times G \;|\; xy=yx\})$ of commuting a randomly chosen pair of elements of…
For a fixed digraph $\mathbb H$, the $\mathbb H$-coloring problem is the problem of deciding whether a given input digraph $\mathbb G$ admits a homomorphism to $\mathbb H$. The CSP dichotomy conjecture of Feder and Vardi is equivalent to…
We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph $(G,\sigma)$, equipped with lists $L(v) \subseteq V(H), v \in…
Communication complexity problems (CCPs) are tasks in which separated parties attempt to compute a function whose inputs are distributed among the parties. Their communication is limited so that not all inputs can be sent. We show that…