Related papers: An algorithm for the principal ideal problem in in…
Computing the permanent of a non-negative matrix is a computationally challenging, \#P-complete problem with wide-ranging applications. We introduce a novel permanental analogue of Schur's determinant formula, leveraging a newly defined…
We relate proper isometry classes of maximal lattices in a totally definite quaternary quadratic space (V,q) with trivial discriminant to certain equivalence classes of ideals in the quaternion algebra representing the Clifford invariant of…
It is well known that the ring of polynomial invariants of a reductive group is finitely generated. However, it is difficult to give strong upper bounds on the degrees of the generators, especially over fields of positive characteristic. In…
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
Let $(R,\mathfrak{m})$ be a local Noetherian ring with residue field $k$. While much is known about the generating sets of reductions of ideals of $R$ if $k$ is infinite, the case in which $k$ is finite is less well understood. We…
Quaternion optimization has attracted significant interest due to its broad applications, including color face recognition, video compression, and signal processing. Despite the growing literature on quadratic and matrix quaternion…
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
We analyse the complexity of the computation of the class group structure, regulator, and a system of fundamental units of a certain class of number fields. Our approach differs from Buchmann's, who proved a complexity bound of L(1/2,O(1))…
The intention of this note is two-fold. First, we study integer optimization problems in standard form defined by $A \in\mathbb{Z}^{m\times{}n}$ and present an algorithm to solve such problems in polynomial-time provided that both the…
The transversal hypergraph problem is the task of enumerating the minimal hitting sets of a hypergraph. It is a long-standing open question whether this can be done in output-polynomial time. For hypergraphs whose solutions have bounded…
We describe an algorithm for the sequential sampling of entries in multiway contingency tables with given constraints. The algorithm can be used for computations in exact conditional inference. To justify the algorithm, a theory relates…
In this paper we expand on some results exposed in a previous one, in which we introduced the concept of inessential and strongly inessential generators in a standard basis of a saturated homogeneous ideal. The appearance of strongly…
Given a polygon $H$ in the plane, the art gallery problem calls for fining the smallest set of points in $H$ from which every other point in $H$ is seen. We give a deterministic algorithm that, given any polygon $H$ with $h$ holes, $n$…
In this paper we construct a combinatorial algorithm of resolution of singularities for binomial ideals, over a field of arbitrary characteristic. This algorithm is applied to any binomial ideal. This means ideals generated by binomial…
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
Quaternion symmetry is ubiquitous in the physical sciences. As such, much work has been afforded over the years to the development of efficient schemes to exploit this symmetry using real and complex linear algebra. Recent years have also…
We derive a stochastic gradient algorithm for semidefinite optimization using randomization techniques. The algorithm uses subsampling to reduce the computational cost of each iteration and the subsampling ratio explicitly controls…
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 an algorithm which, in the context of nonlinear regression on vector-valued explanatory variables, chooses those combinations of vector components that provide best prediction. The algorithm devotes particular attention to…
We develop several techniques for the study of the radical ideal $I$ defining the diagonal locus of $(\C^2)^n$. Using these techniques, we give combinatorial construction of generators for $I$ of certain bi-degrees.