ebooksgratis.com

See also ebooksgratis.com: no banners, no cookies, totally FREE.

CLASSICISTRANIERI HOME PAGE - YOUTUBE CHANNEL
Privacy Policy Cookie Policy Terms and Conditions
Graeco-Latin square - Wikipedia, the free encyclopedia

Graeco-Latin square

From Wikipedia, the free encyclopedia

A Graeco-Latin square or Euler square of order n over two sets S and T, each consisting of n symbols, is an n×n arrangement of cells, each cell containing an ordered pair (s,t), where s ∈ S and a t ∈ T, such that

  • every row and every column contains exactly one s ∈ S and exactly one t ∈ T, and
  • no two cells contain the same ordered pair of symbols.

This concept was introduced by Leonhard Euler, who took the two sets to be S = {ABC, …}, the first n upper-case letters from the Latin alphabet, and T = {α , β, γ, …}, the first n lower-case letters from the Greek alphabet—hence the name Graeco-Latin square. Several examples are given below.

Image:GraecoLatinSquare-Order3.png Image:GraecoLatinSquare-Order5.png
Order 3 Order 4 Order 5

The arrangement of the Latin characters alone and of the Greek characters alone each forms a Latin square. A Graeco-Latin square can therefore be decomposed into two "orthogonal" Latin squares. Orthogonality here means that every pair (st) from the Cartesian product S×T occurs exactly once.

Graeco-Latin squares have applications in the design of experiments, and can be used in the construction of magic squares.

[edit] History

In the 1780s Euler demonstrated methods for constructing Graeco-Latin squares where n is odd or a multiple of 4. Observing that no order-2 square exists and unable to construct an order-6 square (see thirty-six officers problem), he conjectured that none exist for any oddly even number n ≡ 2 (mod 4). Indeed, the non-existence of order-6 squares was definitely confirmed in 1901 by Gaston Tarry through exhaustive enumeration of all possible arrangements of symbols. However, Euler's conjecture resisted solution for a very long time. In 1959, R.C. Bose and S. S. Shrikhande found some counterexamples; then Parker found a counterexample of order 10. In 1960, Parker, Bose, and Shrikhande showed Euler's conjecture to be false for all n ≥ 10. Thus, Graeco-Latin squares exist for all orders n ≥ 3 except n = 6.

The French writer Georges Perec used the 10×10 square for the structure of constraints underlying his 1978 novel Life: A User's Manual.

[edit] External links

Languages


aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - bcl - be - be_x_old - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - co - cr - crh - cs - csb - cu - cv - cy - da - de - diq - dsb - dv - dz - ee - el - eml - en - eo - es - et - eu - ext - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gan - gd - gl - glk - gn - got - gu - gv - ha - hak - haw - he - hi - hif - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kaa - kab - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mdf - mg - mh - mi - mk - ml - mn - mo - mr - mt - mus - my - myv - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - quality - rm - rmy - rn - ro - roa_rup - roa_tara - ru - rw - sa - sah - sc - scn - sco - sd - se - sg - sh - si - simple - sk - sl - sm - sn - so - sr - srn - ss - st - stq - su - sv - sw - szl - ta - te - tet - tg - th - ti - tk - tl - tlh - tn - to - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu -