Related papers: Fast Computation of Secondary Invariants
We prove for the first time that, if a linear inverse problem exhibits a group symmetry structure, gradient-based optimizers can be designed to exploit this structure for faster convergence rates. This theoretical finding demonstrates the…
We reformulate the analysis of singularities of Feynman integrals in a way that can be practically applied to perturbative computations in the Standard Model in dimensional regularization. After highlighting issues in the textbook treatment…
This paper extends classical results in the invariant theory of finite groups and finite group schemes to the actions of finite Hopf algebras on commutative rings.
I adapt a recently introduced method for integrating over the unitary group (S. Aubert and C.S. Lam, J.Math.Phys. 44, 6112-6131 (2003)) to the orthogonal group. I derive explicit formulas for a number of one, two and three-vector integrals,…
Our main purpose is to give multiple examples for using the available implementations for computing the normalization of an affine ring, computing the minimial generators of the normalization as an algebra over the original ring and…
We present a practical and powerful new framework for both unconstrained and constrained submodular function optimization based on discrete semidifferentials (sub- and super-differentials). The resulting algorithms, which repeatedly compute…
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widening operators for enforcing convergence within a finite number…
It this note we investigate the structure of the group of \sigma-unitary units in some noncommutative modular group algebras KG, where \sigma is a non-classical ring involution of KG.
We introduce a unified method for study of 2-dimensional invariant subspaces of matrices and their corresponding super-eigenvalues. As a novel application to non-commutative algebra, we present a connection between the eigenvalues of…
In the paper we find effective formulas for the invariant functions, appearing in the theory of several complex variables, of the elementary Reinhardt domains. This gives us the first example of a large family of domains for which the…
The Singer algebraic transfer is a fundamental homomorphism in algebraic topology, providing a bridge between the homology of classifying spaces and the cohomology of the Steenrod algebra $\mathcal{A}$, which forms the $E_2$-term of the…
In this article we study the structure of $\Gamma$-invariant spaces of $L^2(\bf R)$. Here $\bf R$ is a second countable LCA group. The invariance is with respect to the action of $\Gamma$, a non commutative group in the form of a semidirect…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
The long standing problem of the relations among the scalar invariants of the Riemann tensor is computationally solved for all 6x10^23 objects with up to 12 derivatives of the metric. This covers cases ranging from products of up to 6…
We define the notion of an invariant function on a cluster ensemble with respect to an action of the cluster modular group on its associated function fields. We realize many examples of previously studied functions as elements of this type…
We focus here on a class of fourth-order parabolic equations that can be written as a system of second-order equations by introducing an auxiliary variable. We design a novel second-order fully discrete mixed finite element method to…
The coefficient algebra of a finite-dimensional Lie algebra on a finite-dimensional representation is defined as the subalgebra generated by all coefficients of the corresponding characteristic polynomial. We explore connections between…
Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…
In this study, a novel feature coding method that exploits invariance for transformations represented by a finite group of orthogonal matrices is proposed. We prove that the group-invariant feature vector contains sufficient discriminative…
We introduce a method to design a computationally efficient $G$-invariant neural network that approximates functions invariant to the action of a given permutation subgroup $G \leq S_n$ of the symmetric group on input data. The key element…