Related papers: Semigroup intersection problems in the Heisenberg …
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…
A unitary representation of a, possibly infinite dimensional, Lie group G is called semi-bounded if the corresponding operators id\pi(x) from the derived representations are uniformly bounded from above on some non-empty open subset of the…
We classify the finite primitive permutation groups which have a cyclic subgroup with two orbits. This extends classical topics in permutation group theory, and has arithmetic consequences. By a theorem of C. L. Siegel, affine algebraic…
A graph $G$ with vertex set $\{v_1,v_2,\ldots,v_n\}$ is an intersection graph of segments if there are segments $s_1,\ldots,s_n$ in the plane such that $s_i$ and $s_j$ have a common point if and only if $\{v_i,v_j\}$ is an edge of~$G$. In…
We study the relationship between the loop problem of a semigroup, and that of a Rees matrix construction (with or without zero) over the semigroup. This allows us to characterize exactly those completely zero-simple semigroups for which…
In this paper we consider an initial-boundary value problem related to some network dynamics where the underlying graph has unbounded edges. We show that there exists a C0-semigroup for this problem using a general result from the…
Isometries are ubiquitous in nature; isometries of discrete (quantized) objects---abstracted as the group of isometries of $\mathbb{Z}^n$ denoted by $\mathsf{ISO}(\mathbb{Z}^n)$---are important concepts in the computational world. In this…
We introduce the \emph{intersection orbital graph} $\Gamma(G_1, G_2; \Omega)$ associated with two permutation groups $G_1, G_2 \leq \mathrm{Sym}(\Omega)$ on a finite set $\Omega$.
In this paper we achieve a first concrete step towards a better understanding of the so-called Bernstein problem in higher dimensional Heisenberg groups. Indeed, in the sub-Riemannian Heisenberg group $\mathbb{H}^n$, with $n\geq 2$, we show…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the…
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…
We study the Maximum Bipartite Subgraph (MBS) problem, which is defined as follows. Given a set $S$ of $n$ geometric objects in the plane, we want to compute a maximum-size subset $S'\subseteq S$ such that the intersection graph of the…
In this work we investigate tensor completions of groups by associative rings, which were introduced by R.Lyndon and G.Baumslag in 1960s. The main result states that there exists an algorithm that decides if a given finite system of…
The membership problem for an algebraic structure asks whether a given element is contained in some substructure, which is usually given by generators. In this work we study the membership problem, as well as the conjugacy problem, for…
Triangles of groups have been introduced by Gersten and Stallings. They are, roughly speaking, a generalisation of the amalgamated free product of two groups and occur in the framework of Corson diagrams. First, we prove an intersection…
A semi-algebraic set is a subset of $\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same…
We study the action of a nilpotent group G with finite generating set S on its horofunction boundary. We show that there is one finite orbit associated to each facet of the polytope obtained by projecting S into the infinite component of…
Let $G$ be a finite group acting on a vector space $V = \mathbb{F}_p^n$ over a prime field. Given finite sets $S \subset G$ and $E \subset V$, we study the restricted orbit union $S(E) = \bigcup_{g\in S} g(E)$ and establish quantitative…
We study the design of robust subexponential algorithms for classical connectivity problems on intersection graphs of similarly sized fat objects in $\mathbb{R}^d$. In this setting, each vertex corresponds to a geometric object, and two…
The inhabitation problem for intersection types in the lambda-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable…