Related papers: A faster method to construct extraspecial normalis…

We prove that $d(G) \log |G| = O(n^2 \log q)$ for irreducible subgroups $G$ of GL$(n,q)$, and estimate the associated constants. The result is motivated by attempts to bound the complexity of computing the automorphism groups of various…

We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work…

We show that given generators for subgroups $G$ and $H$ of $\mathrm{S}_n$, if $G$ is primitive then generators for $\mathrm{N}_H(G)$ may be computed in quasipolynomial time, namely $2^{O(\log^3 n)}$. The previous best known bound was simply…

Our purpose is to determine the complete set of mutually orthogonal squares of order $d$, which are not necessary Latin. In this article, we introduce the concept of supersquare of order $d$, which is defined with the help of its generating…

We introduce a new kind of non-relativistic ${\cal N}{=}\,8$ supersymmetric mechanics, associated with worldline realizations of the supergroup $SU(2|2)$ treated as a deformation of flat ${\cal N}{=}\,8$, $d{=}1$ supersymmetry. Various…

Maximizing the sum of two generalized Rayleigh quotients (SRQ) can be reformulated as a one-dimensional optimization problem, where the function value evaluations are reduced to solving semi-definite programming (SDP) subproblems. In this…

We determine all maximal subgroups of the almost simple groups with socle $T=\PSL(2,q)$, that is, of all groups $G$ such that $\PSL(2,q)\leqslant G\leqslant\PGammaL(2,q)$, with $q\geq 4$.

Two approaches to renormalization-group improvement are examined: the substitution of the solutions of running couplings, masses and fields into perturbatively computed quantities is compared with the systematic sum of all the leading log…

In this work the exceptional field theory formulation of supergravity with SL(5) gauge group is considered. This group appears as a U-duality group of $D=7$ maximal supergravity. In the formalism presented the hidden global duality group is…

Let $(p_n)_n$ be either the $q$-Meixner or the $q$-Laguerre polynomials. We form a new sequence of polynomials $(q_n)_n$ by considering a linear combination of two consecutive $p_n$: $q_n=p_n+\beta_np_{n-1}$, $\beta_n\in \RR$. Using the…

For $1<p\le q<\infty$ and $n\in\{3\cdot 2^{k},2^{k}\}$ with $k\ge 1$, we prove that the Poisson-like semigroup $(P_t)_{t\in \mathbb{R}_+}$ on $\mathbb{Z}_n$, associated with the word length $\psi_n(k)=\min(k,n-k)$, is hypercontractive from…

In this paper, we utilize our previous results on mod p monodromy of cyclic coverings of the projective line to realize a large series of groups of the form PSL(n, q) and PSU(n, q) as Galois groups over Q. We achieve for the first time a…

The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…

Let $\G$ be a limit group, $S\subset\G$ a subgroup, and $N$ the normaliser of $S$. If $H_1(S,\mathbb Q)$ has finite $\Q$-dimension, then $S$ is finitely generated and either $N/S$ is finite or $N$ is abelian. This result has applications to…

We revisit the Subset Sum problem over the finite cyclic group $\mathbb{Z}_m$ for some given integer $m$. A series of recent works has provided near-optimal algorithms for this problem under the Strong Exponential Time Hypothesis. Koiliaris…

We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation…

Using the renormalisation group (RG) we study two dimensional electromagnetic coulomb gas and extended Sine-Gordon theories invariant under the modular group SL(2,Z). The flow diagram is established from the scaling equations, and we derive…

High-performance numerical quantum compilers rely on classical optimization, but are limited by slow numerical evaluations and a design that makes extending them with new instructions a difficult, error-prone task for domain experts. This…

Using Dyson--Schwinger equations within an approach developed by Broadhurst and Kreimer and the renormalization group, we show how high loop order of the renormalization group coefficients can be efficiently computed in a supersymmetric…

(Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution is a formalism of restricted quantum operations, named…