Related papers: New algorithms for modular inversion and represent…
A new approach to compute Feynman Integrals is presented. It relies on an integral representation of a given Feynman Integral in terms of simpler ones. Using this approach, we present, for the first time, results for a certain family of…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
We develop an algorithm to compute Fourier expansions of vector valued modular for Weil representations. As an application, we compute explicit linear equivalences of special divisors on modular varieties of orthogonal type. We define three…
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…
In these proceedings we discuss a representation for modular forms that is more suitable for their application to the calculation of Feynman integrals in the context of iterated integrals and the differential equation method. In particular,…
In this paper, we consider operator realizations of quadratic algebras generated by second-order superintegrable systems in 2D. At least one such realization is given for each set of St\"ackel equivalent systems for both degenerate and…
The Eulerian numbers form a triangular array with many interesting properties. The numbers arise from various combinatorial and probabilistic interpretations, and have been studied in a variety of mathematical contexts. In this article we…
In recent years, differential equations have become the method of choice to compute multi-loop Feynman integrals. Whenever they can be cast into canonical form, their solution in terms of special functions is straightforward. Recently,…
In this paper, we present a modern version of Gordan's algorithm on binary forms. Symbolic method is reinterpreted in terms of $\mathsf{SL}_2(\mathbb{C})$--equivariant homomorphisms defined upon Cayley operator and polarization operator. A…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
A system of unitary transformations providing two optimal copies of an arbitrary input cubit is obtained. An algorithm based on classical Boolean algebra and allowing one to find any unitary transformation realized by the quantum CNOT…
We consider three algorithms for allocating parliamentary seats by proportional representation. The usual approach to describing such algorithms is to compute a quota of votes that each party uses to "acquire'' representatives. This kind of…
The classical theorems relating integral binary quadratic forms and ideal classes of quadratic orders have been of tremendous importance in mathematics, and many authors have given extensions of these theorems to rings other than the…
We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…
The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…
Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…
The power of Clifford or, geometric, algebra lies in its ability to represent geometric operations in a concise and elegant manner. Clifford algebras provide the natural generalizations of complex, dual numbers and quaternions into…
A new approach to the local and global explanation is proposed. It is based on selecting a convex hull constructed for the finite number of points around an explained instance. The convex hull allows us to consider a dual representation of…