Related papers: Fast Computation of Secondary Invariants
Author presents a study of certain category of the integrals, which might look quite difficult to compute, but in fact are easily computable, because they do not depend on the parameter in the integrand. As simple and elementary the…
Image processing problems in general, and in particular in the field of single-particle cryo-electron microscopy, often require considering images up to their rotations and translations. Such problems were tackled successfully when…
We use the gluing construction introduced by Jia Huang to explore the rings of invariants for a range of modular representations. We construct generating sets for the rings of invariants of the maximal parabolic subgroups of a finite…
Growing out of the initial connections between subfactors and knot theory that gave rise to the Jones polynomial, Jones' axiomatization of the standard invariant of an extremal finite index $II_1$ subfactor as a spherical $C^*$-planar…
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile algorithms, has recently been introduced. Previous research…
Let $K$ be a field, $\Gamma $ a finite group of field automorphisms of $K$, $F$ the $\Gamma $-fixed field in $K$ and $G\leq $GL$_v(K)$ a finite matrix group. Then the action of $\Gamma $ defines a grading on the symmetric algebra of the…
Motivated by applications in computational anatomy, we consider a second-order problem in the calculus of variations on object manifolds that are acted upon by Lie groups of smooth invertible transformations. This problem leads to solution…
In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of…
Modular composition is the problem of computing the composition of two univariate polynomials modulo a third one. For a long time, the fastest algebraic algorithm for this problem was that of Brent and Kung (1978). Recently, we improved…
For any arbitrary algebraic curve, we define an infinite sequence of invariants. We study their properties, in particular their variation under a variation of the curve, and their modular properties. We also study their limits when the…
In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…
Unknown unitary inversion is a fundamental primitive in quantum computing and physics. Although recent work has demonstrated that quantum algorithms can invert arbitrary unknown unitaries without accessing their classical descriptions,…
This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this…
We develop an invariant deformation theory, in a form accessible to practice, for affine schemes $W$ equipped with an action of a reductive algebraic group $G$. Given the defining equations of a $G$-invariant subscheme $X \subset W$, we…
We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also…
We consider a variant of online convex optimization in which both the instances (input vectors) and the comparator (weight vector) are unconstrained. We exploit a natural scale invariance symmetry in our unconstrained setting: the…
We give a precise, computable formula for comparing $\lambda$-invariants between modular forms in the anticyclotomic indefinite setting where the Selmer groups have positive rank. This is an improvement of Hatley-Lei \cite{HL19, HL21} where…
A direct and systematic algorithm is proposed to find one-dimensional optimal system for the group invariant solutions, which is attributed to the classification of its corresponding one-dimensional Lie algebra. Since the method is based on…
A new purely algebraic algorithm is presented for computation of invariants (generalized Casimir operators) of Lie algebras. It uses the Cartan's method of moving frames and the knowledge of the group of inner automorphisms of each Lie…
Runge's method is a tool to figure out integral points on curves effectively in terms of height. This method has been generalised to varieties of any dimension, unfortunately its conditions of application are often too restrictive. In this…