Related papers: A new Algorithm for the Computation of logarithmic…

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…

Let $K$ be an algebraic number field with ring of integers $\Cal{O}_{K}$, $p>2$ be a rational prime and $G$ be the cyclic group of order $p $. Let $\Lambda$ denote the order $\Cal{O}_{K}[G].$ Let $Cl(\Lambda)$ denote the locally free class…

Low-rank approximation of kernels is a fundamental mathematical problem with widespread algorithmic applications. Often the kernel is restricted to an algebraic variety, e.g., in problems involving sparse or low-rank data. We show that…

The authors establish a connection between the Quillen K-theory of certain local fields and the de Rham-Witt complex of their rings of integers with logarithmic poles at the maximal ideal. They consider fields K that are complete discrete…

We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the…

We present a survey of quantum algorithms, primarily for an intended audience of pure mathematicians. We place an emphasis on algorithms involving group theory.

The aim of this paper is to give two new algorithms, which are elimination free, to find polynomial and rational solutions for a given holonomic system associated to a set of linear differential operators in the Weyl algebra D = k<x_1, ...,…

The aim of this paper is to develop a constraint algorithm for singular classical field theories in the framework of $k$-cosymplectic geometry. Since these field theories are singular, we need to introduce the notion of $k$-precosymplectic…

Let $K$ be a number field with ring of integers $\mathcal{O}_K$. We describe and classify finite, flat, and linearly reductive subgroup schemes of $\mathrm{SL}_2$ over $\mathrm{Spec}\:\mathcal{O}_K$. We also establish finiteness results for…

Quantum machine learning is considered one of the current research fields with immense potential. In recent years, Havl\'i\v{c}ek et al. [Nature 567, 209-212 (2019)] have proposed a quantum machine learning algorithm with quantum-enhanced…

We present a new algorithm to compute initial seeds for cluster structures on categories associated with coordinate rings of open Richardson varieties. This allows us to explicitely determine seeds first considered in Leclerc's 2016…

There has been much interest recently in developing fair clustering algorithms that seek to do justice to the representation of groups defined along sensitive attributes such as race and gender. We observe that clustering algorithms could…

For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…

For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…

This is the second part in a series of papers in which we introduce and develop a natural, general tensor category theory for suitable module categories for a vertex (operator) algebra. In this paper (Part II), we develop logarithmic formal…

We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…

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…

We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…

In this paper, we determine the 2-rank of the class group of certain classes of real cyclic quartic number fields. Precisely, we consider the case in which the quadratic subfield is Q(\sqrt{l}) with l=2 or a prime congruent to 1 mod 8.

Kernel methods are powerful tools in machine learning. They have to be computationally efficient. In this paper, we present a novel Geometric-based approach to compute efficiently the string subsequence kernel (SSK). Our main idea is that…