Related papers: Polynomial identities for ternary intermolecular r…
Investigation of partial multiplace functions by algebraic methods plays an important role in modern mathematics were we consider various operations on sets of functions, which are naturally defined. The basic operation for $n$-place…
We derive formulas for $(i)$ the number of toroidal $n\times n$ binary arrays, allowing rotation of rows and/or columns as well as matrix transposition, and $(ii)$ the number of toroidal $n\times n$ binary arrays, allowing rotation and/or…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
The N=1 superspace generalization of the 3-brane action in 6 dimensions with partially broken N=2 supersymmetry can be constructed using N=1 chiral, complex linear, or real linear superfields. The physical scalars of these multiplets give…
In this paper, we propose a trigonometric-interpolation approach for solutions of second order nonlinear ODEs with mixed boundary conditions. The method interpolates secondary derivative $y''$ of a target solution $y$ by a trigonometric…
Let $\mathbb{F}$ be a field of characteristic $p$, and let $UT_n(\mathbb{F})$ be the algebra of $n \times n$ upper triangular matrices over $\mathbb{F}$ with an involution of the first kind. In this paper we describe: the set of all…
We describe two general mechanisms for producing pairing bijections (bijective functions defined from N x N to N). The first mechanism, using n-adic valuations results in parameterized algorithms generating a countable family of distinct…
A proof-of-concept framework for identifying molecules of unknown elemental composition and structure using experimental rotational data and probabilistic deep learning is presented. Using a minimal set of input data determined…
In this paper we consider the algebra of upper triangular matrices UT$_n(F)$, endowed with a $\mathbb{Z}_2$-grading (superalgebra) and equipped with a superinvolution. These structures naturally arise in the context of Lie and Jordan…
We observe structure in the sequences of quotients and remainders of the Euclidean algorithm with two families of inputs. Analyzing the remainders, we obtain new algorithms for computing modular inverses and representating prime numbers by…
Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…
We consider the algebra of invariants of binary forms of degree 10 with complex coefficients, construct a system of parameters with degrees 2, 4, 6, 6, 8, 9, 10, 14 and find the 106 basic invariants.
For an associative algebra $A$ over a field of characteristic zero, let $P_n(A)$ and $P_n^z(A)$ denote the spaces of multilinear polynomials of degree $n$ modulo the polynomial identities and the central polynomials of $A$, respectively. We…
In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced…
We determine the multiplicity of the irreducible representation V(n) of the simple Lie algebra sl(2,C) as a direct summand of its fourth exterior power $\Lambda^4 V(n)$. The multiplicity is 1 (resp. 2) if and only if n = 4, 6 (resp. n = 8,…
We use computer algebra to determine the Lie invariants of degree <= 12 in the free Lie algebra on two generators corresponding to the natural representation of the simple 3-dimensional Lie algebra sl(2,C). We then consider the free Lie…
A New Trinomial Recombination Tree Algorithm and Its Applications
We construct six unitary trace invariants for 2 by 2 quaternionic matrices which separate the unitary similarity classes of such matrices, and show that this set is minimal. We prove two quaternionic versions of a well known…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…