Related papers: Normal Bases using 1-dimensional Algebraic Groups
In this thesis we explore natural procedures through which topological structure can be constructed from specific semigroups. We will do this in two ways: 1) we equip the semigroup object itself with a topological structure, and 2) we find…
We develop a rewriting theory suitable for diagrammatic algebras and lay down the foundations of a systematic study of their higher structures. In this paper, we focus on the question of finding bases. As an application, we give the first…
In this paper, we describe actions of standard generators on certain bases of simple modules for semisimple cyclotomic Hecke-Clifford superalgebras. As applications, we explicitly construct a complete set of primitive idempotents and…
We present an explicit basis for orders of arbitrary level N>1 in definite rational quaternion algebras. These orders have applications to computations of spaces of elliptic and quaternionic modular forms.
We study the structure of a family of algebras which encodes a generalization of the Pieri Rule for the complex orthogonal group. In particular, we show that each of these algebras has a standard monomial basis and has a flat deformation to…
An analytical method for getting new complex Hadamard matrices by using mutually unbiased bases and a nonlinear doubling formula is provided. The method is illustrated with the n=4 case that leads to a rich family of eight-dimensional…
We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…
Mutually unbiased bases (MUB) have many applications in quantum information processing and quantum cryptography. Several complex MUB's in $\mathbb{C}^d$ for some dimension $d$ and with larger size have been constructed. On the other hand,…
Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois…
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
We consider the simplest gauge theories given by one- and two- matrix integrals and concentrate on their stringy and geometric properties. We remind general integrable structure behind the matrix integrals and turn to the geometric…
This thesis studies arithmetic of linear algebraic groups. It involves studying the properties of linear algebraic groups defined over global fields, local fields and finite fields, or more generally the study of the linear algebraic groups…
I provide methods of constructing elliptic and hyperelliptic curves over global fields with interesting rational points over the given fields or over large field extensions. I also provide a elliptic curves defined over any given number…
We use group theoretic methods to obtain the extended Lie point symmetries of the equations of motion for a charged particle in the field of a monopole. Cases with certain model magnetic fields and potentials are also studied. Our analysis…
In this paper, using group actions, we introduce a new method for constructing partial geometric designs (sometimes referred to as $1\frac{1}{2}$-designs). Using this new method, we construct several infinite families of partial geometric…
The purpose of this note is twofold. First, we survey results on the construction of large class groups of number fields by specialization of finite covers of curves. Then we give examples of applications of these techniques.
We give an entirely new approach to the problem of mutually unbiased bases (MUBs), based on a Fourier analytic technique in additive combinatorics. The method provides a short and elegant generalization of the fact that there are at most…
One can develop the basic structure theory of linear algebraic groups (the root system, Bruhat decomposition, etc.) in a way that bypasses several major steps in the standard development, including the self-normalizing property of Borel…
We use a labelled deduction system based on the concept of computational paths (sequences of rewrites) as equalities between two terms of the same type. We also define a term rewriting system that is used to make computations between these…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…