相关论文: A general formula for the algebraic degree in semi…
We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
We present a generalization of the notion of an algebra norm relevant to real finite-dimensional unital associative algebras. Among other things, this leads to a novel set of algebra isomorphism invariants, some of which are computationally…
For any $n$-ary associative algebra we construct a $\Z_{n-1}$ graded algebra, which is a universal object containing the $n$-ary algebra as a subspace of elements of degree 1. Similar construction is carried out for semigroups.
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
The article presents some aspects on the use of computer in teaching general relativity for undergraduate students with some experience in computer manipulation. The article presents some simple algebraic programming (in REDUCE+EXCALC…
We carry out the complete group classification of the class of (1+1)-dimensional linear Schr\"odinger equations with complex-valued potentials. After introducing the notion of uniformly semi-normalized classes of differential equations, we…
One of the main applications of semidefinite programming lies in linear systems and control theory. Many problems in this subject, certainly the textbook classics, have matrices as variables, and the formulas naturally contain…
In this paper, we study the solving degrees for affine semi-regular sequences and their homogenized sequences. Some of our results are considered to give mathematically rigorous proofs of the correctness of methods for computing Gr\"{o}bner…
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…
We introduce the Morse parametric qualification condition for bilevel programming. Generic semi-algebraic functions are Morse parametric in a piecewise sense. Thus, bilevel programs with a Morse parametric lower level constitute a relevant…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
We are concerned with the arithmetic of solutions to ordinary or partial nonlinear differential equations which are algebraic in the indeterminates and their derivatives. We call these solutions D-algebraic functions, and their equations…
For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…
We first introduce the class of quasi-algebraically stable meromorphic maps of $\P^k.$ This class is strictly larger than that of algebraically stable meromorphic self-maps of $\P^k.$ Then we prove that all maps in the new class enjoy a…
For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…
We study some elementary properties of the quantum enveloping algebra associated to a parabolic subalgebra $\mathfrak{p}$ of a semisimple Lie algebra $\mathfrak{g}$. In particular we prove an explicit formula for the degree of this algebra,…
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
Statistics and Optimization are foundational to modern Machine Learning. Here, we propose an alternative foundation based on Abstract Algebra, with mathematics that facilitates the analysis of learning. In this approach, the goal of the…