Related papers: A Kronecker algorithm for locally closed sets over…

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…

Let $A$ be a finite-dimensional algebra over an algebraically closed field $\Bbbk$. For any finite-dimensional $A$-module $M$ we give a general formula that computes the indecomposable decomposition of $M$ without decomposing it, for which…

We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the…

We introduce a novel random integration algorithm that boasts both high convergence order and polynomial tractability for functions characterized by sparse frequencies or rapidly decaying Fourier coefficients. Specifically, for integration…

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…

Let $V$ be a complete discrete valuation ring with residue field $k$ of positive characteristic and with fraction field $K$ of characteristic 0. We clarify the analysis behind the Monsky--Washnitzer completion of a commutative $V$-algebra…

Let $\mathrm{R}$ be a real closed field, and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We describe an algorithm that given as input a polynomial $P \in \mathrm{D} [ X_{1},\ldots,X_{k} ]$, and a finite set, $\mathcal{A}= \{ p_{1},…

Let k be a field of characteristic zero, K an algebraic function field over k, and V a k-valuation ring of K. Zariski's theorem of local uniformization shows that there exist algebraic regular local rings R_i with quotient field K which are…

A stationary value based algorithm (SVA) is provided to solve the nearest Kronecker product decomposition (KPD) problem of vector form hypermatrices. Using the algorithm successively, the finite sum KPD is also solved. Then the permutation…

In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…

We study sum of squares (SOS) relaxations to optimize polynomial functions over a set $V\cap R^n$, where $V$ is a complex algebraic variety. We propose a new methodology that, rather than relying on some algebraic description, represents…

Let $V$ be a finite dimensional vector space over a field $\mathrm{k}$ of characteristic $0$. Let $A$ be a linear mapping of $V$ into itself. This paper gives a normal form for $A$, which gives a better description of the structure of $A$…

Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…

This paper investigates the Jordan--Kronecker invariant of finite dimensional complex Lie algebras. We present an explicit algorithm for determining the type of a given Lie algebra from its Jordan--Kronecker invariant. The algorithm is…

Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…

We present a new family of zero-field Ising models over $N$ binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components and subsets of at most three vertices into a tree. The polynomial-time algorithm of…

This is a foundation for algebraic geometry, developed internal to the Zariski topos, building on the work of Kock and Blechschmidt. The Zariski topos consists of sheaves on the site opposite to the category of finitely presented algebras…

A rational positive-definite quadratic form is perfect if it can be reconstructed from the knowledge of its minimal nonzero value m and the finite set of integral vectors v such that f(v) = m. This concept was introduced by Voronoi and…

We present an adaptation of Voronoi theory for imaginary quadratic number fields of class number greater than 1. This includes a characterisation of extreme Hermitian forms which is analogous to the classic characterisation of extreme…