相关论文: Primitive normalisers in quasipolynomial time

We give a polynomial-time approximation algorithm for the (not necessarily metric) $k$-Median problem. The algorithm is an $\alpha$-size-approximation algorithm for $\alpha < 1 + 2 \ln(n/k)$. That is, it guarantees a solution having size at…

Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) asks whether $b$ can be generated by $a_1,\ldots,a_k$. If $S$ is a finite group, then there is a folklore…

A number of problems in theoretical physics share a common nucleus of combinatoric nature. It is argued here that Hopf algebraic concepts and techiques can be particularly efficient in dealing with such problems. As a first example, a brief…

The probabilistic description of finite classical systems often leads to linear kinetic equations. A set of physically motivated mathematical requirements is accordingly formulated. We show that it necessarily implies that solutions of such…

For a graph $H$, a graph $G$ is an $H$-graph if it is an intersection graph of connected subgraphs of some subdivision of $H$. $H$-graphs naturally generalize several important graph classes like interval or circular-arc graph. This class…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

We consider two algorithmic problems concerning sub-semigroups of Heisenberg groups and, more generally, two-step nilpotent groups. The first problem is Intersection Emptiness, which asks whether a finite number of given finitely generated…

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

Given a set $Z$ of $n$ positive integers and a target value $t$, the Subset Sum problem asks whether any subset of $Z$ sums to $t$. A textbook pseudopolynomial time algorithm by Bellman from 1957 solves Subset Sum in time $O(nt)$. This has…

Let $G$ be a semisimple Lie group with finite component group, and let $K<G$ be a maximal compact subgroup. We obtain a quantisation commutes with reduction result for actions by $G$ on manifolds of the form $M = G\times_K N$, where $N$ is…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

We show that normalizers and permutational isomorphisms of permutation groups given by generating sets can be computed in time simply exponential in the degree of the groups. The result is obtained by exploiting canonical forms for…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

A nonnegative matrix $A$ is called primitive if $A^k$ is positive for some integer $k>0$. A generalization of this concept to finite sets of matrices is as follows: a set of matrices $\mathcal M = \{A_1, A_2, \ldots, A_m \}$ is primitive if…

Given a submonoid $H$ of $\mathbb N^k$, we give some characterizations of the minimum $r\in \mathbb N^+$ such that $H$ is isomorphic to a submonoid of $\mathbb N^r$. In the context of submonoids of $\mathbb N$, we prove that if two…

A closed subgroup $G\subset_uU_N^+$ is called easy when its associated Tannakian category $C_{kl}=Hom(u^{\otimes k},u^{\otimes l})$ appears from a category of partitions, $C=span(D)$ with $D=(D_{kl})\subset P$, via the standard…

Let $\mathbb{H}_q$ denote the quaternionic Heisenberg group of dimension $(4n+3)$ with $\mathbb{R}^4\times\mathbb{R}^3$ stratification. We identify certain homogeneous norms on the group and show that any two quasi-norms on $\mathbb{H}_q$…

If a finite quasisimple group G with simple quotient S is embedded into a suitable classical group X through the smallest degree of a projective representation of S, then the normalizer of G in X is a maximal subgroup of X, up to two series…

We show the existence of an exact mimicking network of $k^{O(\log k)}$ edges for minimum multicuts over a set of terminals in an undirected graph, where $k$ is the total capacity of the terminals, as well as a method for computing a…