Related papers: Principalization algorithm via class group structu…

(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…

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

In $1801$, Gauss found an explicit description, in the language of binary quadratic forms, for the $2$-torsion of the narrow class group and dual narrow class group of a quadratic number field. This is now known as Gauss's genus theory. In…

Probabilistic graphical models play a crucial role in machine learning and have wide applications in various fields. One pivotal subset is undirected graphical models, also known as Markov random fields. In this work, we investigate the…

In this work, we show that given a finite p-group G, a number field K having a trivial p-class group Cl K , and a finite set of primes S of K, there exists a finite extension F/K such that the S-split p-Hilbert class field tower L S p (F )…

Generating primes is a fundamental problem in modern cryptography. Deterministic primality tests work well for special integers such as Mersenne or Proth primes, but these forms are quite restrictive. In this paper, we give a direct method…

Trialitarian triples are triples of central simple algebras of degree 8 with orthogonal involution that provide a convenient structure for the representation of trialitarian algebraic groups as automorphism groups. This paper explicitly…

The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…

We study the time complexity of induced subgraph isomorphism problems where the pattern graph is fixed. The earliest known example of an improvement over trivial algorithms is by Itai and Rodeh (1978) who sped up triangle detection in…

We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes…

In this paper we use the Galois module structure for the classical parameterizing spaces for elementary p-abelian extensions of a field K to give necessary and sufficient conditions for the solvability of any embedding problem which is an…

We study the characterisation of efficient and non-efficient families of Grover's algorithms according to the majorization principle. We develop a geometrical interpretation based on the parameters that appears on these algorithms. Using…

Let $K$ be one of the complex classical groups ${\rm O}_k$, ${\rm GL}_k$, or ${\rm Sp}_{2k}$. Let $M \subseteq K$ be the block diagonal embedding ${\rm O}_{k_1} \times \cdots \times {\rm O}_{k_r}$ or ${\rm GL}_{k_1} \times \cdots \times…

Cohen and Lenstra have given a heuristic which, for a fixed odd prime $p$, leads to many interesting predictions about the distribution of $p$-class groups of imaginary quadratic fields. We extend the Cohen-Lenstra heuristic to a…

For an infinite family of monogenic trinomials $P(X) = X^3\pm 3rbX-b$ in $\mathbb{Z}\lbrack X\rbrack$, arithmetical invariants of the cubic number field $L = \mathbb{Q}(\theta)$, generated by a zero $\theta$ of $P(X)$, and of its Galois…

A group $G$ has cube-free order if no prime to the third power divides $|G|$. We describe an algorithm that given two cube-free groups $G$ and $H$ of known order, decides whether $G\cong H$, and, if so, constructs an isomorphism $G\to H$.…

By applying interpretable machine learning methods such as decision trees, we study how simple models can classify the Galois groups of Galois extensions over $\mathbb{Q}$ of degrees 4, 6, 8, 9, and 10, using Dedekind zeta coefficients. Our…

This paper presents geometrical foundation for a systematic treatment of three main (elliptic, parabolic and hyperbolic) types of analytic function theories based on the representation theory of SL(2,R) group. We describe here geometries of…

Let F be a number field and p be a prime. In the Successive Approximation Theorem, we prove that, for each positive integer n, finitely many candidates for the Galois group G(p,n,F) of the n-th stage F(p,n) of the p-class tower…

The thirty years old programme of Griffiths and Harris of understanding higher-dimensional analogues of Poncelet-type problems and synthetic approach to higher genera addition theorems has been settled and completed in this paper. Starting…