Related papers: Constructions of transitive latin hypercubes

We study the mapping class group of a nontrivial irreducible shift of finite type: the group of flow equivalences of its mapping torus modulo isotopy. This group plays for flow equivalence the role that the automorphism group plays for…

Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a…

We consider $d$-dimensional lattice polytopes $\Delta$ with $h^*$-polynomial $h^*_\Delta=1+h_k^*t^k$ for $1<k<(d+1)/2$ and relate them to some abelian subgroups of $\SL_{d+1}(\C)$ of order $1+h_k^*=p^r$ where $p$ is a prime number. These…

A partial transversal $T$ of a Latin square $L$ is a set of entries of $L$ in which each row, column and symbol is represented at most once. A partial transversal is maximal if it is not contained in a larger partial transversal. Any…

We show that conformal transformations on the generalized Minkowski space $\mathbb{R}^{p,q}$ map hyperboloids and affine hyperplanes into hyperboloids and affine hyperplanes. We also show that this action on hyperboloids and affine…

In a latin square of order $n$, a near transversal is a collection of $n-1$ cells which intersects each row, column, and symbol class at most once. A longstanding conjecture of Brualdi, Ryser, and Stein asserts that every latin square…

The aim of this paper is to explain how, through the work of a number of people, some algebraic structures related to groupoids have yielded algebraic descriptions of homotopy n-types. Further, these descriptions are explicit, and in some…

We identify two seemingly disparate structures: supercharacters, a useful way of doing Fourier analysis on the group of unipotent uppertriangular matrices with coefficients in a finite field, and the ring of symmetric functions in…

We give the first example of a transitive quadratic map whose real and complex geometric pressure functions have a high-order phase transition. In fact, near the phase transition these functions behave as $x \mapsto \exp (- 1 / x^2)$ near…

A group action is said to be highly-transitive if it is $k$-transitive for every $k \ge 1$. The main result of this thesis is the following: Main Theorem: The fundamental group of a closed, orientable surface of genus > 1 admits a…

Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…

We consider discrete nonlinear hyperbolic equations on quad-graphs, in particular on the square lattice. The fields are associated to the vertices and an equation Q(x_1,x_2,x_3,x_4)=0 relates four fields at one quad. Integrability of…

Automorphic loops are loops in which all inner mappings are automorphisms. A large class of automorphic loops is obtained as follows: Let $m$ be a positive even integer, $G$ an abelian group, and $\alpha$ an automorphism of $G$ that…

Suppose that a group $G$ acts transitively on the points of $\mathcal{P}$, a finite non-Desarguesian projective plane. We prove that if $G$ is insoluble then $G/O(G)$ is isomorphic to $SL_2(5)$ or $SL_2(5).2$.

Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of cohesive powers $\Pi _{C}% \mathcal{L}$ for familiar…

A Latin square is an $n$ by $n$ grid filled with $n$ symbols so that each symbol appears exactly once in each row and each column. A transversal in a Latin square is a collection of cells which do not share any row, column, or symbol. This…

Pull-tabbing is an evaluation approach for functional logic computations, based on a graph transformation recently proposed, which avoids making irrevocable non-deterministic choices that would jeopardize the completeness of computations.…

We construct sequencings for many groups that are a semi-direct product of an odd-order abelian group and a cyclic group of odd prime order. It follows from these constructions that there is a group-based complete Latin square of order $n$…

Let $S$ be a set of arbitrary objects, and let $S^d=\{v_1...v_d\colon v_i\in S\}$. A polybox code is a set $V\subset S^d$ with the property that for every two words $v,w\in V$ there is $i\in [d]$ with $v_i'=w_i$, where a permutation…

A Latin square has six conjugate Latin squares obtained by uniformly permuting its (row, column, symbol) triples. We say that a Latin square has conjugate symmetry if at least two of its six conjugates are equal. We enumerate Latin squares…