Related papers: Computing Arakelov class groups
Amongst the most remarkable successes of quantum computation are Shor's efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential…
The purpose of this paper is to lay the foundations for the theory of higher rank b-divisorial algebras of Shokurov type. We develop techniques to deal with such objects and propose two natural conjectures regarding Shokurov algebras and…
We consider compact and connected Abelian group $G$ with a linearly ordered dual. Based on the description of the structure of compact Hankel operators over $G$, generalizations of the classical Kronecker, Hartman, Peller and…
We construct and study cluster algebra structures in rings of invariants of the special linear group action on collections of three-dimensional vectors, covectors, and matrices. The construction uses Kuperberg's calculus of webs on marked…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
In a previous joint article with F. Abu Salem, we gave efficient algorithms for Jacobian group arithmetic of "typical" divisor classes on C_{3,4} curves, improving on similar results by other authors. At that time, we could only state that…
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…
A group-category is an additively semisimple category with a monoidal product structure in which the simple objects are invertible. For example in the category of representations of a group, 1-dimensional representations are the invertible…
This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a…
We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP
In this paper we investigate some properties of ideals in group algebras of finite groups over fields. First, we highlight an important link between their dimension, their minimal Hamming distance and the group order. This is a generalized…
This paper presents some algorithms in linear algebraic groups. These algorithms solve the word problem and compute the spinor norm for orthogonal groups. This gives us an algorithmic definition of the spinor norm. We compute the double…
Let X be the flag variety of the symplectic group. We propose a theory of combinatorially explicit Schubert polynomials which represent the Schubert classes in the Borel presentation of the cohomology ring of X. We use these polynomials to…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
We study how to detect groups in a complex network each of which consists of component nodes sharing a similar connection pattern. Based on the mixture models and the exploratory analysis set up by Newman and Leicht (Newman and Leicht 2007…
When considering the unit group of $\mathcal{O}_F G$ ($\mathcal{O}_F$ the ring of integers of an abelian number field $F$ and a finite group $G$) certain components in the Wedderburn decomposition of $FG$ cause problems for known generic…
We present improvements to the index-calculus algorithm for the computation of the ideal class group and regulator of a real quadratic field. Our improvements consist of applying the double large prime strategy, an improved structured…
We study relatively minimal subgroups in topological groups. We find, in particular, some natural relatively minimal subgroups in unipotent groups which are defined over "good" rings. By "good" rings we mean archimedean absolute valued (not…
It is well known that quantum computers can efficiently find a hidden subgroup $H$ of a finite Abelian group $G$. This implies that after only a polynomial (in $\log |G|$) number of calls to the oracle function, the states corresponding to…
The purpose of this article is to initiate Arakelov theory in a noncommutative setting. More precisely, we are concerned with Arakelov theory of noncommutative arithmetic curves. Our first main result is an arithmetic Riemann-Roch formula…