首页> 外文学位 >Orthogonal sets of latin squares and class-r hypercubes generated by finite algebraic systems.
【24h】

Orthogonal sets of latin squares and class-r hypercubes generated by finite algebraic systems.

机译:由有限代数系统生成的拉丁方和r类超立方体的正交集。

获取原文
获取原文并翻译 | 示例

摘要

Latin squares are combinatorial objects which have applications in some various and slightly surprising settings. A latin square of order n is a square array on n symbols such that each symbol occurs once in each row and column. Two latin squares are called orthogonal when superimposing them gives each of the n 2 ordered pairs of symbols exactly once. It is well known that if q is a prime power, the squares formed from the polynomials ax + y, a ∈ Fq form q - 1 latin squares of order q which are mutually orthogonal (each pair of squares is orthogonal). In this dissertation, we explore four problems relating to latin squares and other objects with similar properties, especially focusing on constructing large mutually orthogonal sets.;We explore the extent to which sets of mutually orthogonal latin squares, hypercubes, and frequency squares can be obtained by polynomials over finite fields. We are able to rescue two classical conjectures of Euler and MacNeish which are false for general latin squares but which are true when out attention is restricted to polynomial-generated squares only.;We also introduce the theory of the finite algebraic structures called uniform cyclic neofields, and explore the construction of sets of latin squares which are "nearly orthogonal." Our main result with be to give a simple construction of large sets of such nearly orthogonal squares for all even orders n where n - 1 is prime.;We then examine a new generalization of latin squares called class-r hypercubes which feature a larger alphabet (n r rather than n symbols). We give solutions to several open problems in this area, most notably the construction of large mutually orthogonal sets for r ≥ 3.;As our last topic, we give some partial progress toward solutions about a long-standing problem on the computability of partially filled latin cubes. Although the immediate extension of the famous Evans' conjecture seems fail for latin cubes of type 1 although it is true for latin squares, we explore what weaker versions of this conjecture can be said to hold.
机译:拉丁方块是组合对象,可以在各种不同且有些令人惊讶的环境中使用。 n阶拉丁方是n个符号上的方阵,因此每个符号在每一行和每一列中出现一次。当两个拉丁方叠加在一起时,它们给n 2个有序符号对中的每一个精确地给出一次,就称为正交。众所周知,如果q是素数,则由多项式ax + y和a∈Fq构成的平方形成q-1个q阶的拉丁平方,它们相互正交(每对平方正交)。本文探讨了与拉丁方和其他具有相似性质的对象有关的四个问题,特别是着重于构造相互正交的大集合。我们探讨了相互正交的拉丁方,超立方体和频率方格的集合的获得程度。通过有限域上的多项式。我们能够挽救Euler和MacNeish的两个经典猜想,这些猜想对于一般的拉丁方而言是错误的,但在仅将注意力集中在多项式生成的方格上时才是正确的。我们还介绍了有限代数结构的理论,即统一循环新域,并探讨“几乎正交”的拉丁方集的构造。我们的主要结果是为所有偶数阶n(其中n-1是素数)提供一个大的近似正交正方形的大集合。 (nr个而不是n个符号)。我们给出了该区域中几个开放问题的解决方案,其中最著名的是r≥3的大的相互正交集的构造;作为最后一个主题,我们对部分填充的可计算性这一长期存在的问题的解决方案给出了部分进展。拉丁方。尽管立即扩展著名的Evans猜想对于1型拉丁方来说是失败的,尽管对于拉丁方来说确实如此,但我们探索了该猜想的较弱版本可以说是什么。

著录项

  • 作者

    Droz, Daniel R.;

  • 作者单位

    The Pennsylvania State University.;

  • 授予单位 The Pennsylvania State University.;
  • 学科 Mathematics.;Theoretical mathematics.
  • 学位 Ph.D.
  • 年度 2016
  • 页码 80 p.
  • 总页数 80
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

  • 入库时间 2022-08-17 11:50:24

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号