A COLORFUL DETERMINANTAL IDENTITY, A CONJECTURE OF ROTA, AND LATIN SQUARES

@inproceedings{Onn1997ACD,
  title={A COLORFUL DETERMINANTAL IDENTITY, A CONJECTURE OF ROTA, AND LATIN SQUARES},
  author={Shmuel Onn},
  year={1997}
}
the polynomial x2 + x + d is prime for all integers x with 0 < x < d 2. One final comment: If D is an almost Euclidean subring of a number field, Theorem 2 tells us that we may use the absolute value of the norm as a near Euclidean function. Suppose that D is actually Euclidean. Will the absolute value of the norm serve as a Euclidean function? It is interesting to note that Hardy and Wright [4, p. 212] define a Euclidean domain not in the usual way but explicitly using the norm as the… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

A Weak Version of Rota's Bases Conjecture for Odd Dimensions

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Determinants, choices and combinatorics

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

Tverberg type theorems for matroids

VIEW 1 EXCERPT
CITES BACKGROUND

HOW NOT TO PROVE THE ALON-TARSI

VIEW 2 EXCERPTS
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-7 OF 7 REFERENCES

Colourful Linear Programming

VIEW 1 EXCERPT

An exchange property of matroid

  • Wendy Chan
  • Computer Science, Mathematics
  • Discret. Math.
  • 1995
VIEW 1 EXCERPT

On Even and Odd Latin Squares

VIEW 1 EXCERPT

Rota , On the relations of various conjectures on Latin squares and straightening coefficients

  • C. G.
  • J . Combin . Theory Ser . B
  • 1995

The List Chromatic Index of a Bipartite Multigraph

  • Fred Galvin
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. B
  • 1995
VIEW 1 EXCERPT

Colorings and orientations of graphs