Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is based on a successive reduction of the highest prime divisor of the multiplicity and uses the prime number theorem to control the length of the subdividing vectors.
['Winfried Bruns', 'Michael von Thaden']
I am writing a research paper on a idea Unimodular triangulations of simplicial cones by short vectors
[{"from": "human", "value": "I am writing a research paper on a idea Unimodular triangulations of simplicial cones by short vectors"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  establish a bound for the length of vectors involved in a unimodular triangulation of simplicial cones. The bound is exponential in the square of the logarithm of the multiplicity, and improves previous bounds significantly. The proof is based on a successive reduction of the highest prime divisor of the multiplicity and uses the prime number theorem to control the length of the subdividing vectors."}]