A precise probabilistic repair and algebraic criteria for interval cell spectra
Statement
Question 38. With respect to some distribution is the set of tables whose range of cell entries are intervals dense among all tables?
Joseph Landsberg Ilias Kotsireas
Challenge problem in Gr¨ obner bases of polynomial ideals.
The system of polynomial equations given in 3 different formats at http://www.cargo.wlu.ca/hi/had7.cocoa http://www.cargo.wlu.ca/hi/had7.maple http://www.cargo.wlu.ca/hi/had7.reduce has 41 equations in the 27 variables a1,..., a27.Prove that this system of polynomial equations, does not have any solutions. This would constitute an algebraic proof of the combinatorial result of L. D. Baumert:
there are no Hadamard matrices of order 28 with one circulant core.9
Moreover, it is of interest to write down the effective Nullstellensatz for this ideal, i.e. write down explicitly a linear combination of (some of) the generators of the ideal, which is equal to 1. Similar algebraic proofs could then be devised for Hadamard matrices with one circulant core of bigger order. Reference: Ilias Kotsireas, Christos Koukouvinos, Jennifer Seberry, Hadamard ideals and Hadamard matrices with one circulant core. Submitted, November 2003. Ideas that were suggested during the workshop:
• (Bernd Sturmfels) Devise some kind of incremental process to write down the effective Nullstellensatz. e.g. break the system into pieces, write the effective Nullstellensatz for each piece separately and then combine the results to obtain the effective Null-stellensatz for the whole system;
• (Beth Arnold) Use CoCoA and her own mod p Gr¨ obner implementation, to see if the Gr¨ obner basis can be computed.
• (Nick Eriksson) Use 4ti2, to see if the Grobner basis can be computed.
Design efficient heuristics in binary trees.
Given sets of binary vectors in a set of binary trees with given depths, design efficient heuristics to predict the positions of the analogous vectors in binary trees of bigger depth. The adjective "analogous" can take on various meanings. In our context, it designates solu-tions of the associated polynomial system. Ideas that were suggested during the workshop: (Persi Diaconis) first of all obtain graphical visualizations and then analyze the data with DFT and other transforms. Work in progress.
Indicator function approach for Hadamard Equivalence.
Check data sets of Hadamard matrices of big orders to identify the inequivalent Hadamard matrices. Ideas that were suggested during the workshop: (Maria Piera Rogantin) A JSPI paper by Fontana-Pistone-Rogantin contains a description of the indicator function approach to check Hadamard equivalence. In general, one needs to compute the indicator function which has exponentially many monomials. However, this approach is especially efficient for Hadamard matrices with some structure, e.g. with one circulant core. The main reason for this is that the exponentially many monomials fall naturally in a few categories and we only need to check equality of the coefficients of one representative from these categories. Work in progress.
First Open Problem Session
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.