Related papers: Faster Isomorphism for $p$-Groups of Class 2 and E…

Let $G$ be an odd order nilpotent group with class 2 and $e$ denotes the exponent of its commutator subgroup. Let $e=p_1^{r_1}p_2^{r_2}... p_s^{r_s}$, where $p_i$'s are odd primes and $r_i$'s are non-negative integers. Then there are at…

An important subcase of the hidden subgroup problem is equivalent to the shift problem over abelian groups. An efficient solution to the latter problem would serve as a building block of quantum hidden subgroup algorithms over solvable…

We address the problem of testing weak optimality of a given solution of a given interval linear program. The problem was recently wrongly stated to be polynomially solvable. We disprove it. We show that the problem is NP-hard in general.…

Let ${\mathbf P}$ be the class of polynomial-time decision problems and $\mathbf{NP}$ be the class of nondeterministic polynomial time decision problems. We prove the following: Theorem 3. The classes ${\mathbf P}$ and $\mathbf{NP}$ are…

Let V_* be the normalized unitary subgroup of the modular group algebra FG of a finite p-group G over a finite field F with the classical involution *. We investigate the isomorphism problem for the group V_*, that asks when the group V_*…

We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…

As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…

A central question in mathematics and computer science is the question of determining whether a given ideal $I$ is prime, which geometrically corresponds to the zero set of $I$, denoted $Z(I)$, being irreducible. The case of principal…

A Cayley graph over a group G is said to be central if its connection set is a normal subset of G. It is proved that for any two central Cayley graphs over explicitly given almost simple groups of order n, the set of all isomorphisms from…

We consider a zero-error probabilistic group testing problem where individuals are defective independently but not with identical probabilities. We propose a greedy set formation method to build sets of individuals to be tested together. We…

For a permutation $\pi: [K]\rightarrow [K]$, a sequence $f: \{1,2,\cdots, n\}\rightarrow \mathbb R$ contains a $\pi$-pattern of size $K$, if there is a sequence of indices $(i_1, i_2, \cdots, i_K)$ ($i_1<i_2<\cdots<i_K$), satisfying that…

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

We consider the problem of non-adaptive noiseless group testing of $N$ items of which $K$ are defective. We describe four detection algorithms: the COMP algorithm of Chan et al.; two new algorithms, DD and SCOMP, which require stronger…

Pollard's rho method finds a prime factor $p$ of an integer $N$ by searching for a collision in a map of the form $x \mapsto x^{2k} + c$ modulo $N$. This search can be parallelized to multiple machines, which may use distinct parameters $k$…

General concepts and strategies are developed for identifying the isomorphism type of the second p-class group \(G=Gal(F_p^2(K) | K)\), that is the Galois group of the second Hilbert p-class field \(F_p^2(K)\), of a number field K, for a…

Maximizing a non-negative, monontone, submodular function $f$ over $n$ elements under a cardinality constraint $k$ (SMCC) is a well-studied NP-hard problem. It has important applications in, e.g., machine learning and influence…

The $2$-admissibility of a graph is a promising measure to identify real-world networks which have an algorithmically favourable structure. In contrast to other related measures, like the weak/strong $2$-colouring numbers or the maximum…

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

Datalogo is an extension of Datalog that allows for aggregation and recursion over an arbitrary commutative semiring. Like Datalog, Datalogo programs can be evaluated via the natural iterative algorithm until a fixed point is reached.…