Related papers: Table Based Detection of Degenerate Predicates in …
Normalization of polynomials plays a vital role in the approximate basis computation of vanishing ideals. Coefficient normalization, which normalizes a polynomial with its coefficient norm, is the most common method in computer algebra.…
The free distance of a convolutional code is a reliable indicator of its performance. However its computation is not an easy task. In this paper, we present some algorithms to compute the free distance with good efficiency that work for…
Questions at the intersection of the AdS/CFT correspondence and quantum information theory motivate the study of projectors in sequences of subalgebras of finite-dimensional commutative associative semisimple algebras $\mathcal{A}$,…
A system of polynomial ordinary differential equations (ODEs) is specified via a vector of multivariate polynomials, or vector field, $F$. A safety assertion $\psi\rightarrow[F]\phi$ means that the trajectory of the system will lie in a…
We describe an algorithm for computing the separating common tangents of two simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the polygon such that all of the polygon lies to the same…
In this paper, we discuss characteristic polynomials in (Clifford) geometric algebras ${\mathcal {G}}_{p,q}$ of vector space of dimension $n=p+q$. We present basis-free formulas for all characteristic polynomial coefficients in the cases…
We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem…
Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-polynomial time algorithm was given for estimating zero-free…
We study bihomogeneous systems defining, non-zero dimensional, biprojective varieties for which the projection onto the first group of variables results in a finite set of points. To compute (with) the 0-dimensional projection and the…
As gradient descent method in deep learning causes a series of questions, this paper proposes a novel gradient-free deep learning structure. By adding a new module into traditional Self-Organizing Map and introducing residual into the map,…
A graph is well-covered if all its maximal independent sets have the same cardinality. This well studied concept was introduced by Plummer in 1970 and naturally generalizes to the weighted case. Given a graph $G$, a real-valued vertex…
In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid.…
Tensors are often studied by introducing preorders such as restriction and degeneration: the former describes transformations of the tensors by local linear maps on its tensor factors; the latter describes transformations where the local…
We develop a new method that improves the efficiency of equation-by-equation algorithms for solving polynomial systems. Our method is based on a novel geometric construction, and reduces the total number of homotopy paths that must be…
Lattice-free gradient polyhedra can be used to certify optimality for mixed-integer convex minimization models. We consider how to construct these polyhedra for unconstrained models with two integer variables under the assumption that all…
Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the treewidth. We study the problem of designing efficient dynamic programming…
We present a Hilbert space geometric approach to the problem of characterizing the positive bivariate trigonometric polynomials that can be represented as the square of a two variable polynomial possessing a certain stability requirement,…
The free singularity locus of a noncommutative polynomial f is defined to be the sequence $Z_n(f)=\{X\in M_n^g : \det f(X)=0\}$ of hypersurfaces. The main theorem of this article shows that f is irreducible if and only if $Z_n(f)$ is…
Geometric constraint systems underly popular Computer Aided Design soft- ware. Automated approaches for detecting dependencies in a design are critical for developing robust solvers and providing informative user feedback, and we provide…
Low rank tensor decompositions are a powerful tool for learning generative models, and uniqueness results give them a significant advantage over matrix decomposition methods. However, tensors pose significant algorithmic challenges and…