Related papers: Computing in arithmetic groups with Voronoi's algo…
A method to construct in explicit form the generators of the simple roots of an arbitrary finite-dimensional representation of a quantum or standard semisimple algebra is found. The method is based on general results from the global theory…
The review of modern study of algebraic, geometric and differential properties of quaternionic (Q) numbers with their applications. Traditional and "tensor" formulation of Q-units with their possible representations are discussed and groups…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
A geometrical approach to quantum computation is presented, where a non-abelian connection is introduced in order to rewrite the evolution operator of an energy degenerate system as a holonomic unitary. For a simple geometrical model we…
In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…
This paper uses tools in group theory and symbolic computing to give a classification of the representations of finite groups with order lower than 9 that can be derived from the study of local reversible-equivariant vector fields in…
Let $\K$ be a field and $(f_1, \ldots, f_n)\subset \K[X_1, \ldots, X_n]$ be a sequence of quasi-homogeneous polynomials of respective weighted degrees $(d_1, \ldots, d_n)$ w.r.t a system of weights $(w_{1},\dots,w_{n})$. Such systems are…
The virial expansion provides a non-perturbative view into the thermodynamics of quantum many-body systems in dilute regimes. While powerful, the expansion is challenging as calculating its coefficients at each order $n$ requires analyzing…
We introduce a model of computation based on quaternions, which is inspired on the quantum computing model. Pure states are vectors of a suitable linear space over the quaternions. Other aspects of the theory are the same as in quantum…
We find the number of compositions over finite abelian groups under two types of restrictions: (i) each part belongs to a given subset and (ii) small runs of consecutive parts must have given properties. Waring's problem over finite fields…
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
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…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
We present a uniform approach to the construction of the groups of type $\mathrm{E}_6$ over arbitrary fields without using Lie theory. This gives a simple description of the group generators and some of the subgroup structure. In the finite…
We formulate generalizations of Pauli's theorem on the cases of real and complex Clifford algebras of even and odd dimensions. We give analogues of these theorems in matrix formalism. Using these theorems we present an algorithm for…
We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…
The quantum algorithms of Deutsch, Simon and Shor are described in a way which highlights their dependence on the Fourier transform. The general construction of the Fourier transform on an Abelian group is outlined and this provides a…
According to Kirillov's theory, the construction of a unitary irreducible representation of a nilpotent Lie group requires a precise computation of some polarizing subalgebra subordinated to a linear functional in the linear dual of the…
Unsupervised classification called clustering is a process of organizing objects into groups whose members are similar in some way. Clustering of uncertain data objects is a challenge in spatial data bases. In this paper we use Probability…