Related papers: A characterization of the algebraic degree in semi…
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the input-output behavior of an experiment? How many of the…
Constructions are given of Noetherian maximal orders that are finitely presented algebras over a field K, defined by monomial relations. In order to do this, it is shown that the underlying homogeneous information determines the algebraic…
Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…
We present a formalization, in the theorem prover Lean, of the classification of solvable Lie algebras of dimension at most three over arbitrary fields. Lie algebras are algebraic objects which encode infinitesimal symmetries, and as such…
The Hilbert function, its generating function and the Hilbert polynomial of a graded ring R have been extensively studied since the famous paper of Hilbert: Ueber die Theorie der algebraischen Formen [Hil90]. In particular, the coefficients…
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
We give a supersymmetric generalization of the sine algebra and the quantum algebra $U_{t}(sl(2))$. Making use of the $q$-pseudo-differential operators graded with a fermionic algebra, we obtain a supersymmetric extension of sine algebra.…
The article presents an algebra to represent two dimensional patterns using reciprocals of polynomials. Such a representation will be useful in neural network training and it provides a method of training patterns that is much more…
The notion of the weighted degree of a polynomial is a basic tool in Affine Algebraic Geometry. In this paper, we study the properties of the weighted multidegrees of polynomial automorphisms by a new approach which focuses on stable…
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…
Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…
The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an…
We introduce the notion of P-polynomial coherent configurations and show that they can have at most two fibres. We then introduce a class of two-fibre coherent configurations which have two distinguished bases for the coherent algebra,…
The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…
In this paper, we introduce and study differential graded (DG for short) polynomial algebras. In brief, a DG polynomial algebra $\mathcal{A}$ is a connected cochain DG algebra such that its underlying graded algebra $\mathcal{A}^{\#}$ is a…
A characterization of the general linear equation in standard form admitting a maximal symmetry algebra is obtained in terms of a simple set of conditions relating the coefficients of the equation. As a consequence, it is shown that in its…
This paper presents a fast and effective computer algebraic method for analyzing and verifying non-linear integer arithmetic circuits using a novel algebraic spectral model. It introduces a concept of algebraic spectrum, a numerical form of…
The aim of this work is to study the dual and the algebraic dual of an evaluation code using standard monomials and indicator functions. We show that the dual of an evaluation code is the evaluation code of the algebraic dual. We develop an…
This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…