Related papers: Fast Computation of Secondary Invariants
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
Quantum nonrelativistic systems with $2\times2$ matrix potentials are investigated. Physically, they simulate charged or neutral fermions with non-trivial dipole momenta, interacting with an external electric field. Assuming rotationally…
We stress the potential usefulness of renormalization group invariants. Especially particular combinations thereof could for instance be used as probes into patterns of supersymmetry breaking in the MSSM at inaccessibly high energies. We…
Let $\mathcal{A}=(A_{1},...,A_{n},...)$ be a finite or infinite sequence of $2\times2$ matrices with entries in an integral domain. We show that, except for a very special case, $\mathcal{A}$ is (simultaneously) triangularizable if and only…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We solve the problem of effectively computing the $a$-invariant of ladder determinantal rings. In the case of a one-sided ladder, we provide a compact formula, while, for a large family of two-sided ladders, we provide an algorithmic…
The inverse problem of the calculus of variations consists in determining if the solutions of a given system of second order differential equations correspond with the solutions of the Euler-Lagrange equations for some regular Lagrangian.…
In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…
In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…
We report on the computation of invariants, covariants, and contravariants of cubic surfaces. All algorithms are implemented in the computer algebra system magma.
In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-order Reed-Muller codes successfully. In this paper we study…
The aim of this paper is to clear up the problem of the connection between the 3D geometric moments invariants and the invariant theory, considering a problem of describing of the 3D geometric moments invariants as a problem of the…
We show how to use extended word series in the reduction of continuous and discrete dynamical systems to normal form and in the computation of formal invariants of motion in Hamiltonian systems. The manipulations required involve complex…
We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its…
In this paper we study invariant rings arising in the study of finite dimensional algebraic structures. The rings we encounter are graded rings of the form $K[U]^{\Gamma}$ where $\Gamma$ is a product of general linear groups over a field…
We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…
Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…
In this paper we present a mathematical formulation for the omega invariant of a numerical semigroup for each of its minimal generators. The model consists of solving a problem of optimizing a linear function over the efficient set of a…
We give a definition of the Yagita invariant at a prime p of an arbitrary group G, and compute the invariant for each prime for the general linear groups over any integrally closed subring of the complex numbers. We also compute the…
The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…