Skip to content

Research at St Andrews

Bounds on the number of small Latin subsquares

Research output: Contribution to journalArticlepeer-review

Author(s)

Joshua Browning, Peter Jephson Cameron, Ian Wanless

School/Research organisations

Abstract

Let ζ(n, m) be the largest number of order m subsquares
achieved by any Latin square of order n. We show that
ζ(n, m) = Θ(n3 ) if m
∈ {2, 3, 5}
and ζ(n, m) = Θ(n4 ) if
m
∈ {4, 6, 9, 10}. In particular,
1
8
n3 + O(n2 ) . ζ(n, 2) .
1
4
n3 + O(n2 ) and
1
27
n3 + O(n5/2
) . ζ(n, 3) .
1
18
n3 + O(n2 )
for all n. We find an explicit bound on ζ(n, 2d ) of the form
Θ(nd+2
) and which is achieved only by the elementary abelian
2-groups.
For a fixed Latin square L let
ζ∗ (n, L) be the largest number
of subsquares isotopic to L achieved by any Latin square
of order n. When L is a cyclic Latin square we show that
ζ∗ (n, L) = Θ(n3 ). For a large class of Latin squares L we
show that
ζ∗ (n, L) = O(n3 ). For any Latin square L we give
an in the interval (0, 1) such that
ζ∗ (n, L) . Ω(n2+
). We
believe that this bound is achieved for certain squares L.

Close

Details

Original languageEnglish
Pages (from-to)41-56
JournalJournal of Combinatorial Theory, Series A
Volume124
DOIs
Publication statusPublished - May 2014

    Research areas

  • Latin square, Subsquare, Intercalate, Number of subgroups, Dihedral group, Chein loop

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Recent developments on the power graph of finite groups - a survey

    Kumar, A., Selvaganesh, L., Cameron, P. J. & Chelvam, T. T., 26 Jul 2021, (E-pub ahead of print) In: AKCE International Journal of Graphs and Combinatorics. Latest Articles, 31 p.

    Research output: Contribution to journalArticlepeer-review

  2. The geometry of diagonal groups

    Bailey, R. A., Cameron, P. J., Praeger, C. E. & Schneider, C., 7 Jul 2021, (E-pub ahead of print) In: Transactions of the American Mathematical Society. Early View

    Research output: Contribution to journalArticlepeer-review

  3. Diagonal groups and arcs over groups

    Bailey, R. A., Cameron, P. J., Kinyon, M. & Praeger, C., 4 Jul 2021, (E-pub ahead of print) In: Designs, Codes and Cryptography. 11 p.

    Research output: Contribution to journalArticlepeer-review

  4. Forbidden subgraphs of power graphs

    Manna, P., Cameron, P. J. & Mehatari, R., 2 Jul 2021, In: Electronic Journal of Combinatorics. 28, 3, 14 p., P3.4.

    Research output: Contribution to journalArticlepeer-review

  5. Graphs defined on groups

    Cameron, P. J., 15 Apr 2021, (E-pub ahead of print) In: International Journal of Group Theory. In Press

    Research output: Contribution to journalArticlepeer-review

Related by journal

  1. Lifting tropical self intersections

    Len, Y. & Satriano, M., Feb 2020, In: Journal of Combinatorial Theory, Series A. 170, 21 p., 105138.

    Research output: Contribution to journalArticlepeer-review

  2. Enumeration of idempotents in diagram semigroups and algebras

    Dolinka, I., East, J., Evangelou, A., FitzGerald, D., Ham, N., Hyde, J. & Loughlin, N., Apr 2015, In: Journal of Combinatorial Theory, Series A. 131, p. 119-152 34 p.

    Research output: Contribution to journalArticlepeer-review

  3. Combinatorial representations

    Cameron, P. J., Gadouleau, M. & Riis, S., 2013, In: Journal of Combinatorial Theory, Series A. 120, 3, p. 671-682

    Research output: Contribution to journalArticlepeer-review

  4. Substitution-closed pattern classes

    Atkinson, M. D., Ruskuc, N. & Smith, R., Feb 2011, In: Journal of Combinatorial Theory, Series A. 118, 2, p. 317-340

    Research output: Contribution to journalArticlepeer-review

ID: 99163752

Top