Related papers: On computing the closures of solvable permutation …

Permutation patterns and pattern avoidance have been intensively studied in combinatorics and computer science, going back at least to the seminal work of Knuth on stack-sorting (1968). Perhaps the most natural algorithmic question in this…

The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…

Using the fact that the algebra M(3,C) of 3 x 3 complex matrices can be taken as a reduced quantum plane, we build a differential calculus Omega(S) on the quantum space S defined by the algebra C^\infty(M) \otimes M(3,C), where M is a…

In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…

In this note, we describe a procedure to construct generalized complex structures with an arbitrarily large number of type change loci on products of the circle with a connected sum of closed 3-manifolds. The loci need not be isotopic.

A Kirkman Triple System $\Gamma$ is called $m$-pyramidal if there exists a subgroup $G$ of the automorphism group of $\Gamma$ that fixes $m$ points and acts regularly on the other points. Such group $G$ admits a unique conjugacy class $C$…

We show that for an $n$-component, $n$-bridge link and a positive integer $m$, the following is true: If the longitudes of $L$ lie in the $(m+2)$-th term of the lower central series of the link group then all the finite type invariants of…

Let $M$ be a set. A set-theoretical solution of the pentagon equation on $M$ is a map $s:M\times M\longrightarrow M\times M$ such that \begin{equation*} s_{23}\, s_{13}\, s_{12}=s_{12}\, s_{23}, \end{equation*} where $s_{12}=s\times id_M$,…

We give a complete classification of modular categories of dimension $p^3m$ where $p$ is prime and $m$ is a square-free integer. When $p$ is odd, all such categories are pointed. For $p=2$ one encounters modular categories with the same…

We complete the classification (started by Bray and the second author) of all closed 3-manifolds with Yamabe invariant greater than that of $\RP^3$, by showing that such manifolds are either $S^3$ or finite connected sums $# m(S^2 \times…

We have proved in [Topology, 45 1 (2006)] that fundamental groups of oriented geometrizable 3-manifolds have a solvable conjugacy problem. We now consider the case of groups of non-oriented geometrizable 3-manifolds in order to conclude…

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

We prove that in a semi-bounded o-minimal expansion of an ordered group every non-empty open definable set is a finite union of open cells.

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…

In this paper we introduce the notion of $n$-permutation numerical semigroup. While there are just three $2$-permutation numerical semigroups, there are infinitely many $n$-permutation numerical semigroups if $n > 2$. We construct $16$…

We present a closed-form solution for n-th term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in…

We give a 3/2-approximation algorithm for stable matchings that runs in $O(m)$ time. The previously best known algorithm by McDermid has the same approximation ratio but runs in $O(n^{3/2}m)$ time, where $n$ denotes the number of people and…

Given two closed oriented manifolds $M,N$ of the same dimension, we denote the set of degrees of maps from $M$ to $N$ by $D(M,N)$. The set $D(M,N)$ always contains zero. We show the following (non-)realisability results: (i) There exists an…

We construct a resolution of irreducible complex representations of the symmetric group $S_n$ by restrictions of representations of $GL_n(\mathbb{C})$ (where $S_n$ is the subgroup of permutation matrices). This categorifies a recent result…

Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…