Related papers: Roman and Vatican Crossover Designs

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…

We develop a new method for constructing "good" designs for computer experiments. The method derives its power from its basic structure that builds large designs using small designs. We specialize the method for the construction of…

A classical question in combinatorics is the following:\ given a partial Latin square $P$, when can we complete $P$ to a Latin square $L$? In this paper, we investigate the class of \textbf{$\epsilon$-dense partial Latin squares}:\ partial…

This article studies the benefits of using spatially randomized experimental designs which partition the experimental area into distinct, non-overlapping units with treatments assigned randomly. Such designs offer improved policy evaluation…

Gy\'{a}rf\'{a}s and S\'{a}rk\"{o}zy conjectured that every $n\times n$ Latin square has a `cycle-free' partial transversal of size $n-2$. We confirm this conjecture in a strong sense for almost all Latin squares, by showing that as $n…

Quantitative assessment of the uncertainties tainting the results of computer simulations is nowadays a major topic of interest in both industrial and scientific communities. One of the key issues in such studies is to get information about…

We show that the sets of $d$-dimensional Latin hypercubes over a non-empty set $X$, with $d$ running over the positive integers, determine an operad which is isomorphic to a sub-operad of the endomorphism operad of $X$. We generalise this…

The main thrust of the article is to provide interesting example, useful for students of using bitwise operations in the programming languages C ++ and Java. As an example, we describe an algorithm for obtaining a Latin square of arbitrary…

Orthogonal array based space-filling designs (Owen [Statist. Sinica 2 (1992a) 439-452]; Tang [J. Amer. Statist. Assoc. 88 (1993) 1392-1397]) have become popular in computer experiments, numerical integration, stochastic optimization and…

The d-dimensional Catalan numbers form a well-known sequence of numbers which count balanced bracket expressions over an alphabet of size d. In this paper, we introduce and study what we call d-dimensional prime Catalan numbers, a sequence…

An intercalate in a Latin square is a $2\times2$ Latin subsquare. Let $N$ be the number of intercalates in a uniformly random $n\times n$ Latin square. We prove that asymptotically almost surely…

Given an integer partition $P = (h_1h_2\dots h_k)$ of $n$, a realization of $P$ is a latin square with disjoint subsquares of orders $h_1,h_2,\dots,h_k$. Most known results restrict either $k$ or the number of different integers in $P$.…

Roman domination is one of few examples where the related extension problem is polynomial-time solvable even if the original decision problem is NP-complete. This is interesting, as it allows to establish polynomial-delay enumeration…

Sliced Sudoku-based space-filling designs and, more generally, quasi-sliced orthogonal array-based space-filling designs are useful experimental designs in several contexts, including computer experiments with categorical in addition to…

A partial Latin square of order $n$ can be represented by a $3$-dimensional chess-board of size $n\times n\times n$ with at most $n^2$ non-attacking rooks. Based on this representation, we apply a uniform method to prove the M. Hall's,…

We consider all compatible topologies of an arbitrary finite-dimensional vector space over a non-trivial valuation field whose metric completion is a locally compact space. We construct the canonical lattice isomorphism between the lattice…

We prove the existence of quadratic relations between periods of meromorphic flat bundles on complex manifolds with poles along a divisor with normal crossings under the assumption of "goodness". In dimension one, for which goodness is…

Cut and project sets are obtained by projecting an irrational slice through a lattice to a lower dimensional subspace. Under standard conditions, the resulting pattern has no translational periods even though it retains some regularity of…

Computer simulations serve as powerful tools for scientists and engineers to gain insights into complex systems. Less costly than physical experiments, computer experiments sometimes involve large number of trials. Conventional design…

It has been argued for many years that models used to analyze data from crossover designs are not appropriate when simple carryover effects are assumed. Furthermore, a statistical model that could estimate complex carry-over effects in…