Related papers: Gr\"obner bases and cocyclic Hadamard matrices
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…
Symbolic computation for systems of differential equations is often computationally expensive. Many practical differential models have a form of polynomial or rational ODE system with specified outputs. A basic symbolic approach to analyze…
Balancedly splittable Hadamard matrices are introduced and studied. A connection is made to the Hadamard diagonalizable strongly regular graphs, maximal equiangular lines set, and unbiased Hadamard matrices. Several construction methods are…
Let $\Gamma$ denote an undirected, connected, regular graph with vertex set $X$, adjacency matrix $A$, and ${d+1}$ distinct eigenvalues. Let ${\mathcal A}={\mathcal A}(\Gamma)$ denote the subalgebra of Mat$_X({\mathbb C})$ generated by $A$.…
Complex Hadamard matrices have received considerable attention in the past few years due to their appearance in quantum information theory. While a complete characterization is currently available only up to order 5 (in \cite{haagerup}),…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…
Two fundamental questions in the theory of Groebner bases are decision ("Is a basis G of a polynomial ideal a Groebner basis?") and transformation ("If it is not, how do we transform it into a Groebner basis?") This paper considers the…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
All generalized Hadamard matrices of order 18 over a group of order 3, H(6,3), are enumerated in two different ways: once, as class regular symmetric (6,3)-nets, or symmetric transversal designs on 54 points and 54 blocks with a group of…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
A motivation to study Gr\"{o}bner theory for fields with valuations comes from tropical geometry, for example, they can be used to compute tropicalization of varieties \citep{maclagan2009introduction}. The computational aspect of this…
Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…
Geometric involutive bases for polynomial systems of equations have their origin in the prolongation and projection methods of the geometers Cartan and Kuranishi for systems of PDE. They are useful for numerical ideal membership testing and…
Let $E$ denote a general complex binary form of order $d$ (seen as a point in $\P^d$), and let $\Omega_E \subseteq \P^d$ denote the closure of its $SL_2$-orbit. In this note, we calculate the equivariant minimal generators of its defining…
Kazhdan-Lusztig ideals, a family of generalized determinantal ideals investigated in [Woo-Yong '08], provide an explicit choice of coordinates and equations encoding a neighbourhood of a torus-fixed point of a Schubert variety on a type A…
We develop a theory of bicrystalline ideals, synthesizing Gr\"obner basis techniques and Kashiwara's crystal theory. This provides a unified algebraic, combinatorial, and computational approach that applies to ideals of interest, old and…
Convolutions or Hadamard products of analytic functions is a well explored area of research and many nice results are available in literature. On the other hand, very little is known in general about the convolutions of univalent harmonic…
We introduce a notion of halfspace for Hadamard manifolds that is natural in the context of convex optimization. For this notion of halfspace, we generalize a classic result of Gr\"unbaum, which itself is a corollary of Helly's theorem.…
We analyze the set of real and complex Hadamard matrices with additional symmetry constrains. In particular, we link the problem of existence of maximally entangled multipartite states of $2k$ subsystems with $d$ levels each to the set of…